TheoremBase

The subgradient inequality at the reference point, combined with Cauchy-Schwarz and the triangle inequality for the norm, bounds the infimal set below; the Lipschitz bound and convexity follow from the triangle inequality and from taking nearly optimal points at the two ends of a segment, and the agreement and subgradient clauses are direct computations with the subgradient inequality.

Proof

Throughout, each result cited is universally quantified over the data appearing in its own statement and is applied to the data named here. The Cauchy-Schwarz inequality ∣u⋅v∣≤∥u∥∥v∥|u\cdot v|\le\lVert u\rVert\lVert v\rVert is The Cauchy-Schwarz Inequality on Rn\mathbb{R}^n, and the homogeneity and triangle inequality of the Euclidean norm are claims 5 and 6 of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square; claim 2 of that lemma identifies dE(x,y)d_{E}(x,y) with ∥x−y∥\lVert x-y\rVert. Since ∥q0∥≤L\lVert q_{0}\rVert\le L and norms are nonnegative, 0≤L0\le L. Write ∂ϕL=∂RnϕL\partial\phi^{L}=\partial_{\mathbb{R}^{n}}\phi^{L}.

Step 1 (Claim 1). Let x∈Rnx\in\mathbb{R}^{n} and let Sx={ϕ(z)+L∥x−z∥:z∈G}S_{x}=\{\phi(z)+L\lVert x-z\rVert:z\in G\}. It is nonempty, GG being nonempty. It is bounded below: for z∈Gz\in G the subgradient inequality at x0x_{0} gives ϕ(z)≥ϕ(x0)+q0⋅(z−x0)\phi(z)\ge\phi(x_{0})+q_{0}\cdot(z-x_{0}), and

q0⋅(z−x0)=q0⋅(z−x)+q0⋅(x−x0)≥−∥q0∥ ∥z−x∥+q0⋅(x−x0)≥−L∥x−z∥+q0⋅(x−x0)q_{0}\cdot(z-x_{0})=q_{0}\cdot(z-x)+q_{0}\cdot(x-x_{0})\ge-\lVert q_{0}\rVert\,\lVert z-x\rVert+q_{0}\cdot(x-x_{0})\ge-L\lVert x-z\rVert+q_{0}\cdot(x-x_{0})

by The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite, Cauchy-Schwarz, claim 3 of Properties of the Absolute Value in an Ordered Field, and claim 5 of Elementary Arithmetic in an Ordered Field applied with the nonnegative factor ∥z−x∥\lVert z-x\rVert. Adding L∥x−z∥L\lVert x-z\rVert,

ϕ(z)+L∥x−z∥≥ϕ(x0)+q0⋅(x−x0),\phi(z)+L\lVert x-z\rVert\ge\phi(x_{0})+q_{0}\cdot(x-x_{0}),

a bound independent of zz. Hence the infimum ϕL(x)\phi^{L}(x) exists in R\mathbb{R}.

For x∈Gx\in G the choice z=xz=x gives ϕL(x)≤ϕ(x)+L∥x−x∥=ϕ(x)\phi^{L}(x)\le\phi(x)+L\lVert x-x\rVert=\phi(x).

Lipschitz. Let x,y∈Rnx,y\in\mathbb{R}^{n} and z∈Gz\in G. By the triangle inequality, ∥x−z∥≤∥y−z∥+∥x−y∥\lVert x-z\rVert\le\lVert y-z\rVert+\lVert x-y\rVert, so ϕL(x)≤ϕ(z)+L∥x−z∥≤(ϕ(z)+L∥y−z∥)+L∥x−y∥\phi^{L}(x)\le\phi(z)+L\lVert x-z\rVert\le\bigl(\phi(z)+L\lVert y-z\rVert\bigr)+L\lVert x-y\rVert by claim 5 of Elementary Arithmetic in an Ordered Field with the nonnegative factor LL. Taking the infimum over z∈Gz\in G gives ϕL(x)−L∥x−y∥≤ϕL(y)\phi^{L}(x)-L\lVert x-y\rVert\le\phi^{L}(y), that is ϕL(x)−ϕL(y)≤L∥x−y∥\phi^{L}(x)-\phi^{L}(y)\le L\lVert x-y\rVert; exchanging xx and yy and using claim 6 of Properties of the Absolute Value in an Ordered Field gives ∣ϕL(x)−ϕL(y)∣≤L dE(x,y)|\phi^{L}(x)-\phi^{L}(y)|\le L\,d_{E}(x,y), so ϕL\phi^{L} is Lipschitz with constant LL.

Convexity. Let u,v∈Rnu,v\in\mathbb{R}^{n}, let tt be a real number with 0≤t≤10\le t\le1, and let ε\varepsilon be a positive real number. By claim 4 of Approximation Property of the Supremum and the Infimum in R\mathbb{R}, applied to SuS_{u} and to SvS_{v}, there are zu,zv∈Gz_{u},z_{v}\in G with

ϕ(zu)+L∥u−zu∥≤ϕL(u)+ε,ϕ(zv)+L∥v−zv∥≤ϕL(v)+ε.\phi(z_{u})+L\lVert u-z_{u}\rVert\le\phi^{L}(u)+\varepsilon,\qquad \phi(z_{v})+L\lVert v-z_{v}\rVert\le\phi^{L}(v)+\varepsilon .

The point zt=(1−t)zu+tzvz_{t}=(1-t)z_{u}+tz_{v} lies in GG, which is convex, and ϕ(zt)≤(1−t)ϕ(zu)+tϕ(zv)\phi(z_{t})\le(1-t)\phi(z_{u})+t\phi(z_{v}) by convexity of ϕ\phi. Writing w=(1−t)u+tvw=(1-t)u+tv, one has w−zt=(1−t)(u−zu)+t(v−zv)w-z_{t}=(1-t)(u-z_{u})+t(v-z_{v}) by Euclidean Space Rn\mathbb{R}^n is a Real Vector Space, so the triangle inequality and homogeneity give ∥w−zt∥≤(1−t)∥u−zu∥+t∥v−zv∥\lVert w-z_{t}\rVert\le(1-t)\lVert u-z_{u}\rVert+t\lVert v-z_{v}\rVert. Therefore

ϕL(w)≤ϕ(zt)+L∥w−zt∥≤(1−t)(ϕ(zu)+L∥u−zu∥)+t(ϕ(zv)+L∥v−zv∥)≤(1−t)ϕL(u)+tϕL(v)+ε,\phi^{L}(w)\le\phi(z_{t})+L\lVert w-z_{t}\rVert\le(1-t)\bigl(\phi(z_{u})+L\lVert u-z_{u}\rVert\bigr)+t\bigl(\phi(z_{v})+L\lVert v-z_{v}\rVert\bigr)\le(1-t)\phi^{L}(u)+t\phi^{L}(v)+\varepsilon ,

using claim 5 of Elementary Arithmetic in an Ordered Field with the nonnegative factors 1−t1-t and tt. As ε\varepsilon was an arbitrary positive real number, Comparison of Real Numbers with Arbitrary Positive Slack (i) gives ϕL(w)≤(1−t)ϕL(u)+tϕL(v)\phi^{L}(w)\le(1-t)\phi^{L}(u)+t\phi^{L}(v), so ϕL\phi^{L} is convex on Rn\mathbb{R}^{n}.

Step 2 (Claim 2). Let x∈Gx\in G and p∈∂Gϕ(x)p\in\partial_{G}\phi(x) with ∥p∥≤L\lVert p\rVert\le L. For z∈Gz\in G the subgradient inequality and Cauchy-Schwarz give

ϕ(z)+L∥x−z∥≥ϕ(x)+p⋅(z−x)+L∥x−z∥≥ϕ(x)−∥p∥∥z−x∥+L∥x−z∥≥ϕ(x),\phi(z)+L\lVert x-z\rVert\ge\phi(x)+p\cdot(z-x)+L\lVert x-z\rVert\ge\phi(x)-\lVert p\rVert\lVert z-x\rVert+L\lVert x-z\rVert\ge\phi(x),

the last step by claim 5 of Elementary Arithmetic in an Ordered Field applied to ∥p∥≤L\lVert p\rVert\le L with the nonnegative factor ∥x−z∥\lVert x-z\rVert. Hence ϕ(x)\phi(x) is a lower bound for SxS_{x} and ϕL(x)≥ϕ(x)\phi^{L}(x)\ge\phi(x); with claim 1 this gives ϕL(x)=ϕ(x)\phi^{L}(x)=\phi(x).

Now let y∈Rny\in\mathbb{R}^{n} and z∈Gz\in G. By The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite, Cauchy-Schwarz and claim 5 of Elementary Arithmetic in an Ordered Field,

p⋅(z−x)=p⋅(y−x)+p⋅(z−y)≥p⋅(y−x)−L∥z−y∥,p\cdot(z-x)=p\cdot(y-x)+p\cdot(z-y)\ge p\cdot(y-x)-L\lVert z-y\rVert ,

so, using the subgradient inequality once more,

ϕ(z)+L∥y−z∥≥ϕ(x)+p⋅(z−x)+L∥y−z∥≥ϕ(x)+p⋅(y−x)=ϕL(x)+p⋅(y−x).\phi(z)+L\lVert y-z\rVert\ge\phi(x)+p\cdot(z-x)+L\lVert y-z\rVert\ge\phi(x)+p\cdot(y-x)=\phi^{L}(x)+p\cdot(y-x).

Taking the infimum over z∈Gz\in G gives ϕL(y)≥ϕL(x)+p⋅(y−x)\phi^{L}(y)\ge\phi^{L}(x)+p\cdot(y-x) for every y∈Rny\in\mathbb{R}^{n}, that is p∈∂ϕL(x)p\in\partial\phi^{L}(x).

Step 3 (Claim 3). Let x∈Gx\in G with ∂Gϕ(x)={p}\partial_{G}\phi(x)=\{p\} and ∥p∥≤L\lVert p\rVert\le L. By claim 2, p∈∂ϕL(x)p\in\partial\phi^{L}(x) and ϕL(x)=ϕ(x)\phi^{L}(x)=\phi(x). Conversely let q∈∂ϕL(x)q\in\partial\phi^{L}(x) and let y∈Gy\in G. Then, using ϕL≤ϕ\phi^{L}\le\phi on GG from claim 1,

ϕ(y)≥ϕL(y)≥ϕL(x)+q⋅(y−x)=ϕ(x)+q⋅(y−x).\phi(y)\ge\phi^{L}(y)\ge\phi^{L}(x)+q\cdot(y-x)=\phi(x)+q\cdot(y-x).

As y∈Gy\in G was arbitrary, q∈∂Gϕ(x)={p}q\in\partial_{G}\phi(x)=\{p\}, so q=pq=p. Hence ∂ϕL(x)={p}\partial\phi^{L}(x)=\{p\}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…