TheoremBase

Proof of Basic Properties of the Legendre-Fenchel Conjugate: the Fenchel-Young Inequality, Convexity, Full Domain under Superlinear Growth, and the Quadratic

lemmalem:legendre-fenchel-conjugate-basic-rn-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
· 3,505 chars · 10 deps · depth 12 Reason: Proof of the basic properties of the Legendre-Fenchel conjugate.

Fenchel-Young is the upper-bound property of the supremum. For convexity, p.x - f(x) is affine in p, so a convex combination of two bounded-above families is bounded above by the same combination of their suprema. Superlinear growth dominates the Cauchy-Schwarz bound, and completing the square gives the quadratic, attained at x = p.

Proof

Each result cited is universally quantified over the data in its own statement. Elementary arithmetic and order facts in R\mathbb{R} and the properties of ∣⋅∣|\cdot| are those put in force by The Real Numbers: Standing Notation and Background §background; upper bounds and least upper bounds are those of The Real Numbers: Standing Notation and Background §bounds. For p∈D(f∗)p\in D(f^{*}), f∗(p)f^{*}(p) is by The Legendre-Fenchel Conjugate of a Real Function on a Subset of Euclidean Space §conjugate the least upper bound of {p⋅x−f(x):x∈C}\{p\cdot x-f(x):x\in C\}, so

p⋅x−f(x)≤f∗(p)(x∈C),andf∗(p)≤c  whenever p⋅x−f(x)≤c for every x∈C.(∗)p\cdot x-f(x)\le f^{*}(p)\quad(x\in C),\qquad\text{and}\qquad f^{*}(p)\le c\ \text{ whenever } p\cdot x-f(x)\le c\text{ for every }x\in C.\tag{$*$}

Sums and scalar multiples of points of Rn\mathbb{R}^{n} are those of that definition and that definition, and the dot product is bilinear and symmetric by Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n.

Claim 1. Adding f(x)f(x) to both sides of the first inequality in (∗*) gives p⋅x≤f(x)+f∗(p)p\cdot x\le f(x)+f^{*}(p).

Claim 2. Let p,q∈D(f∗)p,q\in D(f^{*}), let t∈Rt\in\mathbb{R} with 0≤t≤10\le t\le1, and put r=tp+(1−t)qr=tp+(1-t)q. For x∈Cx\in C, claims 2 and 4 of Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n give r⋅x=t (p⋅x)+(1−t) (q⋅x)r\cdot x=t\,(p\cdot x)+(1-t)\,(q\cdot x), and f(x)=t f(x)+(1−t) f(x)f(x)=t\,f(x)+(1-t)\,f(x), so

r⋅x−f(x)=t(p⋅x−f(x))+(1−t)(q⋅x−f(x))≤t f∗(p)+(1−t) f∗(q),r\cdot x-f(x)=t\bigl(p\cdot x-f(x)\bigr)+(1-t)\bigl(q\cdot x-f(x)\bigr)\le t\,f^{*}(p)+(1-t)\,f^{*}(q),

by (∗*) for pp and for qq, multiplied by the nonnegative numbers tt and 1−t1-t. Hence x↦r⋅x−f(x)x\mapsto r\cdot x-f(x) is bounded above on CC, that is, r∈D(f∗)r\in D(f^{*}) by The Legendre-Fenchel Conjugate of a Real Function on a Subset of Euclidean Space §domain, so D(f∗)D(f^{*}) is convex; and the second part of (∗*) gives f∗(r)≤t f∗(p)+(1−t) f∗(q)f^{*}(r)\le t\,f^{*}(p)+(1-t)\,f^{*}(q), so f∗f^{*} is convex on D(f∗)D(f^{*}).

Claim 3. Let p∈Rnp\in\mathbb{R}^{n} and R=∥p∥+1R=\lVert p\rVert+1, which is positive because 0≤∥p∥0\le\lVert p\rVert by claim 1 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n. For x∈Cx\in C, p⋅x≤∣p⋅x∣≤∥p∥ ∥x∥p\cdot x\le|p\cdot x|\le\lVert p\rVert\,\lVert x\rVert by claim 3 of Properties of the Absolute Value in an Ordered Field and Cauchy-Schwarz Inequality for the Euclidean Dot Product, while −f(x)≤cR−R∥x∥-f(x)\le c_{R}-R\lVert x\rVert by hypothesis; adding,

p⋅x−f(x)≤∥p∥ ∥x∥−(∥p∥+1)∥x∥+cR=cR−∥x∥≤cR.p\cdot x-f(x)\le\lVert p\rVert\,\lVert x\rVert-(\lVert p\rVert+1)\lVert x\rVert+c_{R}=c_{R}-\lVert x\rVert\le c_{R}.

So x↦p⋅x−f(x)x\mapsto p\cdot x-f(x) is bounded above on CC, and p∈D(f∗)p\in D(f^{*}) by The Legendre-Fenchel Conjugate of a Real Function on a Subset of Euclidean Space §domain. As pp was arbitrary, D(f∗)=RnD(f^{*})=\mathbb{R}^{n}.

Claim 4. Let C=RnC=\mathbb{R}^{n}, f(x)=12∥x∥2f(x)=\tfrac12\lVert x\rVert^{2}, and p,x∈Rnp,x\in\mathbb{R}^{n}. By claim 1 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n, ∥y∥2=y⋅y\lVert y\rVert^{2}=y\cdot y for every yy, so claims 1, 3 and 5 of Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n give

∥x−p∥2=(x−p)⋅(x−p)=x⋅x−2 p⋅x+p⋅p=∥x∥2−2 p⋅x+∥p∥2,\lVert x-p\rVert^{2}=(x-p)\cdot(x-p)=x\cdot x-2\,p\cdot x+p\cdot p=\lVert x\rVert^{2}-2\,p\cdot x+\lVert p\rVert^{2},

and therefore

p⋅x−12∥x∥2=12∥p∥2−12∥x−p∥2≤12∥p∥2,p\cdot x-\tfrac12\lVert x\rVert^{2}=\tfrac12\lVert p\rVert^{2}-\tfrac12\lVert x-p\rVert^{2}\le\tfrac12\lVert p\rVert^{2},

since 0≤∥x−p∥20\le\lVert x-p\rVert^{2}, a product of two nonnegative numbers. So p∈D(f∗)p\in D(f^{*}) by The Legendre-Fenchel Conjugate of a Real Function on a Subset of Euclidean Space §domain, whence D(f∗)=RnD(f^{*})=\mathbb{R}^{n}, and f∗(p)≤12∥p∥2f^{*}(p)\le\tfrac12\lVert p\rVert^{2} by (∗*). Taking x=px=p, and using p⋅p=∥p∥2p\cdot p=\lVert p\rVert^{2}, gives p⋅p−12∥p∥2=12∥p∥2p\cdot p-\tfrac12\lVert p\rVert^{2}=\tfrac12\lVert p\rVert^{2}, which is at most f∗(p)f^{*}(p) by (∗*). Hence f∗(p)=12∥p∥2f^{*}(p)=\tfrac12\lVert p\rVert^{2}.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…