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-2026aSmoothness 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.
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 and write , so that by Convolution of a Continuous Function with a Compactly Supported Continuous Kernel. By Mollifier Kernel of Radius on the kernel is nonnegative with . Write and .
Step 1 (Claim 1). Let be a positive real number.
Smoothness. The kernel is smooth, so is smooth on by Convolution with a Kernel is of Class , and in particular of class , hence differentiable at every point by A Real-Valued C^1 Function is Differentiable at Every Point, with gradient as fixed in Differential Calculus and Convexity on Euclidean Open Sets: Standing Notation §derivatives.
Convexity. By Semiconvex Function on a Convex Subset of a function is convex on a convex set exactly when it is semiconvex there with constant , since adding changes nothing. So is semiconvex on the open convex set with constant , and Mollification Preserves Semiconvexity, applied with , the kernel of radius and the constant , gives that is semiconvex with constant on , that is, convex on .
Lipschitz constant. Let . For every one has , using , claim 4 of Properties of the Absolute Value in an Ordered Field, the Lipschitz hypothesis on , and , which holds by claim 2 of Elementary Properties of the Euclidean Norm on . Hence, by claims 1 and 2 of Linearity and Monotonicity of the Lebesgue Integral and the unit mass of ,
so is Lipschitz with constant .
Bound on the gradient. Fix . Since is convex on the open convex set and differentiable at , claim 4 of Elementary Calculus of the Subdifferential of a Convex Function gives . Applying claim 2 of that lemma with , and , which is legitimate because and is Lipschitz with constant on all of , gives for every . Hence .
Step 2 (Claim 2). Let , and be as in claim 2 and put , so for every by claim 1.
Suppose that does not converge to . Then there are a positive real and a subsequence with for every . That subsequence is bounded, so Bolzano-Weierstrass Theorem in Euclidean Space gives a further subsequence converging to some , and by Order Properties of Limits of Real Sequences applied to the sequence of distances, which converges to by Continuity of the Projections and of the Distance Function on a Product Metric Space; in particular .
Let . Since is convex and by Step 1,
The set with is compact by Heine-Borel Theorem in and contains and by claim 1 of Elementary Properties of the Maximum of Two Elements and claim 2 of Elementary Properties of the Euclidean Norm on . Let be a positive real number. By claim 2 of Mollification Converges Uniformly on Compact Subsets, applied to on with the kernel , the compact set and , there is a positive real such that for every and every positive real ; since converges to , this holds for all large . Hence converges to and converges to .
The sequence converges to , by Bilinearity and Symmetry of the Dot Product on together with claim 4 of Elementary Properties of the Euclidean Norm on and claims 1 and 3 of Arithmetic of Limits of Real Sequences, the map being a finite sum of scalar multiples of the coordinates. Along the subsequence the sequences and still converge to and , 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,
As was arbitrary, by Subdifferential of a Real-Valued Function on a Convex Subset of §subdifferential, so , contradicting . Hence converges to .
Loading…
Prerequisites
f0ff4d04-192a-49e4-860f-3f2a2a33f403