TheoremBase

Proof of The Lipschitz Truncation of a Convex Function: a Global Lipschitz Convex Minorant Agreeing with It Where the Slope is Small

lemmalem:lipschitz-truncation-convex-rn-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
· 5,288 chars · 13 deps · depth 11 Reason: Phase B2b: proof that the infimal set is bounded below by the subgradient inequality and Cauchy-Schwarz, with the Lipschitz bound and convexity from the triangle inequality and nearly optimal points at the ends of a segment.

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 uvuv|u\cdot v|\le\lVert u\rVert\lVert v\rVert is Cauchy-Schwarz Inequality for the Euclidean Dot Product, and the homogeneity and triangle inequality of the Euclidean norm are claims 5 and 6 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n; claim 2 of that lemma identifies dE(x,y)d_{E}(x,y) with xy\lVert x-y\rVert. Since q0L\lVert q_{0}\rVert\le L and norms are nonnegative, 0L0\le L. Write ϕL=RnϕL\partial\phi^{L}=\partial_{\mathbb{R}^{n}}\phi^{L}.

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

q0(zx0)=q0(zx)+q0(xx0)q0zx+q0(xx0)Lxz+q0(xx0)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 Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n, 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 zx\lVert z-x\rVert. Adding LxzL\lVert x-z\rVert,

ϕ(z)+Lxzϕ(x0)+q0(xx0),\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 xGx\in G the choice z=xz=x gives ϕL(x)ϕ(x)+Lxx=ϕ(x)\phi^{L}(x)\le\phi(x)+L\lVert x-x\rVert=\phi(x).

Lipschitz. Let x,yRnx,y\in\mathbb{R}^{n} and zGz\in G. By the triangle inequality, xzyz+xy\lVert x-z\rVert\le\lVert y-z\rVert+\lVert x-y\rVert, so ϕL(x)ϕ(z)+Lxz(ϕ(z)+Lyz)+Lxy\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 zGz\in G gives ϕL(x)LxyϕL(y)\phi^{L}(x)-L\lVert x-y\rVert\le\phi^{L}(y), that is ϕL(x)ϕL(y)Lxy\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)LdE(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,vRnu,v\in\mathbb{R}^{n}, let tt be a real number with 0t10\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,zvGz_{u},z_{v}\in G with

ϕ(zu)+LuzuϕL(u)+ε,ϕ(zv)+Lvzvϕ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=(1t)zu+tzvz_{t}=(1-t)z_{u}+tz_{v} lies in GG, which is convex, and ϕ(zt)(1t)ϕ(zu)+tϕ(zv)\phi(z_{t})\le(1-t)\phi(z_{u})+t\phi(z_{v}) by convexity of ϕ\phi. Writing w=(1t)u+tvw=(1-t)u+tv, one has wzt=(1t)(uzu)+t(vzv)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 wzt(1t)uzu+tvzv\lVert w-z_{t}\rVert\le(1-t)\lVert u-z_{u}\rVert+t\lVert v-z_{v}\rVert. Therefore

ϕL(w)ϕ(zt)+Lwzt(1t)(ϕ(zu)+Luzu)+t(ϕ(zv)+Lvzv)(1t)ϕ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 1t1-t and tt. As ε\varepsilon was an arbitrary positive real number, Comparison of Real Numbers with Arbitrary Positive Slack §slack-above gives ϕL(w)(1t)ϕ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 xGx\in G and pGϕ(x)p\in\partial_{G}\phi(x) with pL\lVert p\rVert\le L. For zGz\in G the subgradient inequality and Cauchy-Schwarz give

ϕ(z)+Lxzϕ(x)+p(zx)+Lxzϕ(x)pzx+Lxzϕ(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 pL\lVert p\rVert\le L with the nonnegative factor xz\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 yRny\in\mathbb{R}^{n} and zGz\in G. By Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n, Cauchy-Schwarz and claim 5 of Elementary Arithmetic in an Ordered Field,

p(zx)=p(yx)+p(zy)p(yx)Lzy,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)+Lyzϕ(x)+p(zx)+Lyzϕ(x)+p(yx)=ϕL(x)+p(yx).\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 zGz\in G gives ϕL(y)ϕL(x)+p(yx)\phi^{L}(y)\ge\phi^{L}(x)+p\cdot(y-x) for every yRny\in\mathbb{R}^{n}, that is pϕL(x)p\in\partial\phi^{L}(x).

Step 3 (Claim 3). Let xGx\in G with Gϕ(x)={p}\partial_{G}\phi(x)=\{p\} and pL\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 yGy\in G. Then, using ϕLϕ\phi^{L}\le\phi on GG from claim 1,

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

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

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…