TheoremBase

Proof of Mollification of a Lipschitz Convex Function: Smooth Convex Approximations with Bounded Gradients Converging Where the Subgradient is Unique

lemmalem:mollified-convex-gradient-convergence-rn-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
· 6,347 chars · 28 deps · depth 20 Reason: Phase B2b: proof that the mollifications inherit smoothness, convexity and the Lipschitz constant, and that any limit point of their gradients is a subgradient of the limit function, hence the unique one.

Smoothness and convexity of the mollifications are the convolution and mollification theorems, and the Lipschitz constant is inherited because the kernel has unit mass; the gradients are then bounded, and any limit point of them along a null sequence of radii is a subgradient of the limit function, hence equals the unique one.

Proof

Throughout, each result cited is universally quantified over the data appearing in its own statement and is applied to the data named here. For a positive real ε\varepsilon and xRnx\in\mathbb{R}^{n} write hx(w)=ϕ(xw)ρε(w)h_{x}(w)=\phi(x-w)\rho_{\varepsilon}(w), so that ϕε(x)=Rnhxdλn\phi_{\varepsilon}(x)=\int_{\mathbb{R}^{n}}h_{x}\,d\lambda_{n} by Convolution of a Continuous Function with a Compactly Supported Continuous Kernel. By Mollifier Kernel of Radius δ\delta on Rn\mathbb{R}^n the kernel ρε\rho_{\varepsilon} is nonnegative with Rnρεdλn=1\int_{\mathbb{R}^{n}}\rho_{\varepsilon}\,d\lambda_{n}=1. Write ϕ=Rnϕ\partial\phi=\partial_{\mathbb{R}^{n}}\phi and ϕε=Rnϕε\partial\phi_{\varepsilon}=\partial_{\mathbb{R}^{n}}\phi_{\varepsilon}.

Step 1 (Claim 1). Let ε\varepsilon be a positive real number.

Smoothness. The kernel ρε\rho_{\varepsilon} is smooth, so ϕε\phi_{\varepsilon} is smooth on Rn\mathbb{R}^{n} by Convolution with a CkC^k Kernel is of Class CkC^k, and in particular of class C1C^{1}, hence differentiable at every point by A Real-Valued C^1 Function is Differentiable at Every Point, with gradient Dϕε(x)D\phi_{\varepsilon}(x) as fixed in Differential Calculus and Convexity on Euclidean Open Sets: Standing Notation §derivatives.

Convexity. By Semiconvex Function on a Convex Subset of Rn\mathbb{R}^n a function is convex on a convex set exactly when it is semiconvex there with constant 00, since adding 02x2\tfrac{0}{2}\lVert x\rVert^{2} changes nothing. So ϕ\phi is semiconvex on the open convex set Rn\mathbb{R}^{n} with constant 00, and Mollification Preserves Semiconvexity, applied with Ω=Rn\Omega=\mathbb{R}^{n}, the kernel ρε\rho_{\varepsilon} of radius εδ\varepsilon\delta and the constant 00, gives that ϕε\phi_{\varepsilon} is semiconvex with constant 00 on {x:Bˉ(x,εδ)Rn}=Rn\{x:\bar{B}(x,\varepsilon\delta)\subseteq\mathbb{R}^{n}\}=\mathbb{R}^{n}, that is, convex on Rn\mathbb{R}^{n}.

Lipschitz constant. Let x,yRnx,y\in\mathbb{R}^{n}. For every ww one has hx(w)hy(w)=ϕ(xw)ϕ(yw)ρε(w)LdE(x,y)ρε(w)|h_{x}(w)-h_{y}(w)|=|\phi(x-w)-\phi(y-w)|\,\rho_{\varepsilon}(w)\le L\,d_{E}(x,y)\,\rho_{\varepsilon}(w), using ρε0\rho_{\varepsilon}\ge0, claim 4 of Properties of the Absolute Value in an Ordered Field, the Lipschitz hypothesis on ϕ\phi, and dE(xw,yw)=dE(x,y)d_{E}(x-w,y-w)=d_{E}(x,y), which holds by claim 2 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n. Hence, by claims 1 and 2 of Linearity and Monotonicity of the Lebesgue Integral and the unit mass of ρε\rho_{\varepsilon},

ϕε(x)ϕε(y)=Rn(hxhy)dλnLdE(x,y)Rnρεdλn=LdE(x,y),|\phi_{\varepsilon}(x)-\phi_{\varepsilon}(y)|=\Bigl|\int_{\mathbb{R}^{n}}(h_{x}-h_{y})\,d\lambda_{n}\Bigr|\le L\,d_{E}(x,y)\int_{\mathbb{R}^{n}}\rho_{\varepsilon}\,d\lambda_{n}=L\,d_{E}(x,y),

so ϕε\phi_{\varepsilon} is Lipschitz with constant LL.

Bound on the gradient. Fix xRnx\in\mathbb{R}^{n}. Since ϕε\phi_{\varepsilon} is convex on the open convex set Rn\mathbb{R}^{n} and differentiable at xx, claim 4 of Elementary Calculus of the Subdifferential of a Convex Function gives ϕε(x)={Dϕε(x)}\partial\phi_{\varepsilon}(x)=\{D\phi_{\varepsilon}(x)\}. Applying claim 2 of that lemma with y0=xy_{0}=x, r=1r=1 and M=LM=L, which is legitimate because Bˉ(x,2)Rn\bar{B}(x,2)\subseteq\mathbb{R}^{n} and ϕε\phi_{\varepsilon} is Lipschitz with constant LL on all of Rn\mathbb{R}^{n}, gives qL\lVert q\rVert\le L for every qϕε(x)q\in\partial\phi_{\varepsilon}(x). Hence Dϕε(x)L\lVert D\phi_{\varepsilon}(x)\rVert\le L.

Step 2 (Claim 2). Let xx, pp and (εm)mN(\varepsilon_{m})_{m\in\mathbb{N}} be as in claim 2 and put qm=Dϕεm(x)q_{m}=D\phi_{\varepsilon_{m}}(x), so qmL\lVert q_{m}\rVert\le L for every mm by claim 1.

Suppose that (qm)m(q_{m})_{m} does not converge to pp. Then there are a positive real ε\varepsilon and a subsequence (qmi)i(q_{m_{i}})_{i} with εdE(qmi,p)\varepsilon\le d_{E}(q_{m_{i}},p) for every ii. That subsequence is bounded, so Bolzano-Weierstrass Theorem in Euclidean Space gives a further subsequence (qmil)l(q_{m_{i_{l}}})_{l} converging to some qRnq\in\mathbb{R}^{n}, and εdE(q,p)\varepsilon\le d_{E}(q,p) by Order Properties of Limits of Real Sequences applied to the sequence of distances, which converges to dE(q,p)d_{E}(q,p) by Continuity of the Projections and of the Distance Function on a Product Metric Space; in particular qpq\ne p.

Let yRny\in\mathbb{R}^{n}. Since ϕεm\phi_{\varepsilon_{m}} is convex and qmϕεm(x)q_{m}\in\partial\phi_{\varepsilon_{m}}(x) by Step 1,

ϕεm(y)ϕεm(x)+qm(yx)for every mN.()\phi_{\varepsilon_{m}}(y)\ge\phi_{\varepsilon_{m}}(x)+q_{m}\cdot(y-x)\qquad\text{for every }m\in\mathbb{N}. \tag{$*$}

The set K=Bˉ(0Rn,r)K=\bar{B}(0_{\mathbb{R}^{n}},r) with r=max(x,y)r=\max(\lVert x\rVert,\lVert y\rVert) is compact by Heine-Borel Theorem in Rn\mathbb{R}^n and contains xx and yy by claim 1 of Elementary Properties of the Maximum of Two Elements and claim 2 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n. Let η\eta be a positive real number. By claim 2 of Mollification Converges Uniformly on Compact Subsets, applied to ϕ\phi on Ω=Rn\Omega=\mathbb{R}^{n} with the kernel ρ\rho, the compact set KK and η\eta, there is a positive real ε0\varepsilon_{0} such that ϕε(u)ϕ(u)<η|\phi_{\varepsilon'}(u)-\phi(u)|<\eta for every uKu\in K and every positive real ε<ε0\varepsilon'<\varepsilon_{0}; since (εm)m(\varepsilon_{m})_{m} converges to 00, this holds for all large mm. Hence (ϕεm(y))m(\phi_{\varepsilon_{m}}(y))_{m} converges to ϕ(y)\phi(y) and (ϕεm(x))m(\phi_{\varepsilon_{m}}(x))_{m} converges to ϕ(x)\phi(x).

The sequence (qmil(yx))l\bigl(q_{m_{i_{l}}}\cdot(y-x)\bigr)_{l} converges to q(yx)q\cdot(y-x), by Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n together with claim 4 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n and claims 1 and 3 of Arithmetic of Limits of Real Sequences, the map uu(yx)u\mapsto u\cdot(y-x) being a finite sum of scalar multiples of the coordinates. Along the subsequence (mil)l(m_{i_{l}})_{l} the sequences (ϕεm(y))m(\phi_{\varepsilon_{m}}(y))_{m} and (ϕεm(x))m(\phi_{\varepsilon_{m}}(x))_{m} still converge to ϕ(y)\phi(y) and ϕ(x)\phi(x), by A Subsequence of a Convergent Sequence Has the Same Limit. Passing to the limit in ()(*) along that subsequence and using Order Properties of Limits of Real Sequences together with claim 1 of Arithmetic of Limits of Real Sequences,

ϕ(y)ϕ(x)+q(yx).\phi(y)\ge\phi(x)+q\cdot(y-x).

As yRny\in\mathbb{R}^{n} was arbitrary, qϕ(x)={p}q\in\partial\phi(x)=\{p\} by Subdifferential of a Real-Valued Function on a Convex Subset of Rn\mathbb{R}^n §subdifferential, so q=pq=p, contradicting qpq\ne p. Hence (Dϕεm(x))m(D\phi_{\varepsilon_{m}}(x))_{m} converges to pp.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…