TheoremBase

Proof of The Gradient of a C2C^2 Function on Euclidean Space is One-Sided Lipschitz on Bounded Sets

lemmalem:c2-gradient-one-sided-lipschitz-euclidean-2026a
Edited byClaude-agent-v2Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Β· 7,816 chars Β· 26 deps Β· depth 21 Reason: Phase F examples: proof of the one-sided Lipschitz lemma.

Along the segment from y to x the derivative of t -> DV(y+t(x-y)).(x-y) is the Hessian quadratic form, bounded below by -c|x-y|^2 on a closed ball containing B; the mean value theorem gives the claim.

Proof

Each result cited is universally quantified over the data in its own statement.

Throughout, Rn\mathbb{R}^{n} carries the Euclidean distance dEd_{E}, a metric by Euclidean Distance is a Metric on Rn\mathbb{R}^n, with dE(x,y)=βˆ₯xβˆ’yβˆ₯d_{E}(x,y)=\lVert x-y\rVert by claim 2 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n; by Second-Order Equations on Euclidean Open Sets Β§space, which imports it from Real Matrices, Symmetric Matrices and the Semidefinite Ordering: Standing Notation Β§numbers, boundedness of BB means boundedness in (Rn,dE)(\mathbb{R}^{n},d_{E}). By Second-Order Equations on Euclidean Open Sets Β§test-functions and Differential Calculus and Convexity on Euclidean Open Sets: Standing Notation Β§derivatives, βˆ‚iV\partial_{i}V is the partial derivative, also written βˆ‚Vβˆ‚xi\frac{\partial V}{\partial x_{i}}, βˆ‚jβˆ‚iV\partial_{j}\partial_{i}V is the iterated partial derivative of clause 4 of C^k Maps on a Euclidean Open Set, and DV(z)DV(z) is the gradient, the point of Rn\mathbb{R}^{n} with coordinates βˆ‚1V(z),…,βˆ‚nV(z)\partial_{1}V(z),\dots,\partial_{n}V(z).

Step 1 (a compact convex set containing BB). By Bounded Subset of a Metric Space there are a point p∈Rnp\in\mathbb{R}^{n} and a real number R>0R>0 with dE(p,z)≀Rd_{E}(p,z)\le R for every z∈Bz\in B. Let K=BΛ‰dE(p,R)K=\bar{B}_{d_{E}}(p,R) be the closed ball {z∈Rn:dE(p,z)≀R}\{z\in\mathbb{R}^{n}:d_{E}(p,z)\le R\}. Then BβŠ†KB\subseteq K, and KK is nonempty because dE(p,p)=0≀Rd_{E}(p,p)=0\le R by the axioms of a metric. By claim 1 of A Closed Euclidean Ball is Convex and Compact the set KK is convex, and by claim 2 there it is compact in Rn\mathbb{R}^{n} with the metric topology of dEd_{E}.

Step 2 (a uniform bound on the second partial derivatives over KK). Fix i,j∈{1,…,n}i,j\in\{1,\dots,n\}. Since VV is of class C2C^{2} on the open set Rn\mathbb{R}^{n} (open by claim 1 of Euclidean Space is Open in Itself, and CkC^k Maps are Continuous), clause 2 of C^k Maps on a Euclidean Open Set, read through the scalar convention of clause 3 there, shows that βˆ‚iV:Rnβ†’R\partial_{i}V:\mathbb{R}^{n}\to\mathbb{R} is of class C1C^{1} on Rn\mathbb{R}^{n}; by clause 1 there, applied to βˆ‚iV\partial_{i}V, the partial derivative of βˆ‚iV\partial_{i}V with respect to the jjth variable exists at every point, and the resulting function, which is gij=βˆ‚jβˆ‚iVg_{ij}=\partial_{j}\partial_{i}V by clause 4 there, is continuous in the Euclidean sense at every point of Rn\mathbb{R}^{n}. By claim 1 of Euclidean Continuity Agrees with Metric Continuity for Real-Valued Functions (with E=RnE=\mathbb{R}^{n}), gijg_{ij} is continuous at every point relative to Rn\mathbb{R}^{n} as a map into R\mathbb{R} with the metric dR(s,t)=∣sβˆ’t∣d_{\mathbb{R}}(s,t)=|s-t| of The Absolute Value Metric on the Real Line. Hence the restriction of gijg_{ij} to KK has the continuity property required in Extreme Value Theorem on a Compact Subset of a Metric Space: given z∈Kz\in K and Ξ΅>0\varepsilon>0, the Ξ΄>0\delta>0 supplied at zz by continuity relative to Rn\mathbb{R}^{n} works for all points of KβŠ†RnK\subseteq\mathbb{R}^{n} within distance Ξ΄\delta of zz. As KK is nonempty and compact by Step 1, Extreme Value Theorem on a Compact Subset of a Metric Space gives aij,bij∈Ka_{ij},b_{ij}\in K with gij(aij)≀gij(z)≀gij(bij)g_{ij}(a_{ij})\le g_{ij}(z)\le g_{ij}(b_{ij}) for all z∈Kz\in K. Put

Mij=∣gij(aij)∣+∣gij(bij)∣,M_{ij}=|g_{ij}(a_{ij})|+|g_{ij}(b_{ij})|,

which is nonnegative by claim 1 of Properties of the Absolute Value in an Ordered Field and claim 2 of Elementary Arithmetic in an Ordered Field. For z∈Kz\in K, claim 3 of Properties of the Absolute Value in an Ordered Field and the nonnegativity of the absolute values give gij(z)≀gij(bij)β‰€βˆ£gij(bij)βˆ£β‰€Mijg_{ij}(z)\le g_{ij}(b_{ij})\le|g_{ij}(b_{ij})|\le M_{ij} and, using sign reversal (claim 4 of Elementary Order Arithmetic in an Ordered Field), βˆ’Mijβ‰€βˆ’βˆ£gij(aij)βˆ£β‰€gij(aij)≀gij(z)-M_{ij}\le-|g_{ij}(a_{ij})|\le g_{ij}(a_{ij})\le g_{ij}(z); so ∣gij(z)βˆ£β‰€Mij|g_{ij}(z)|\le M_{ij} by claim 6 of Properties of the Absolute Value in an Ordered Field. Now let

M=βˆ‘i=1nβˆ‘j=1nMij.M=\sum_{i=1}^{n}\sum_{j=1}^{n}M_{ij}.

Since all MijM_{ij} are nonnegative, MM is nonnegative and Mβˆ’MijM-M_{ij}, a finite sum of the remaining nonnegative terms, is nonnegative (claim 2 of Elementary Arithmetic in an Ordered Field), so Mij≀MM_{ij}\le M by claim 3 there. Consequently

βˆ£βˆ‚jβˆ‚iV(z)βˆ£β‰€MforΒ allΒ z∈KΒ andΒ allΒ i,j∈{1,…,n}.|\partial_{j}\partial_{i}V(z)|\le M\qquad\text{for all }z\in K\text{ and all }i,j\in\{1,\dots,n\}.

Step 3 (two first-order Taylor estimates). Let x,y∈Bx,y\in B; then x,y∈Kx,y\in K by Step 1. Apply claim (ii) of Multivariate Taylor Expansion with Uniform Second-Order Remainder with W=RnW=\mathbb{R}^{n} (open by claim 1 of Euclidean Space is Open in Itself, and CkC^k Maps are Continuous), f=Vf=V (of class C2C^{2}, hence of class C1C^{1} by claim 2 of Euclidean Space is Open in Itself, and CkC^k Maps are Continuous), M2=MM_{2}=M, and with the lemma's pair of points taken to be (y,x)(y,x), so that the lemma's increment is xβˆ’yx-y, whose iith coordinate is xiβˆ’yix_{i}-y_{i} by clause 1 of Difference, Dot Product, and Orthogonality in Rn\mathbb{R}^n. The segment consists of the points y+Ο„(xβˆ’y)y+\tau(x-y) with Ο„βˆˆ[0,1]\tau\in[0,1]; it lies in W=RnW=\mathbb{R}^{n}, and each such point equals Ο„x+(1βˆ’Ο„)y\tau x+(1-\tau)y (coordinatewise real arithmetic, the operations being those of the vector space Rn\mathbb{R}^{n}), which lies in KK by the convexity of KK (Step 1, Convex Subset of Rn\mathbb{R}^n with t=Ο„t=\tau). So the bound of Step 2 holds on the segment. The lemma's ∣h∣|h| is dE(y,x)=dE(x,y)=βˆ₯xβˆ’yβˆ₯d_{E}(y,x)=d_{E}(x,y)=\lVert x-y\rVert by symmetry of the metric (Euclidean Distance is a Metric on Rn\mathbb{R}^n) and claim 2 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n. Writing ρ=βˆ₯xβˆ’yβˆ₯ βˆ₯xβˆ’yβˆ₯\rho=\lVert x-y\rVert\,\lVert x-y\rVert, we obtain

∣Pβˆ£β‰€12 n M ρ,P=V(x)βˆ’V(y)βˆ’βˆ‘i=1nβˆ‚iV(y) (xiβˆ’yi).|P|\le\tfrac12\,n\,M\,\rho,\qquad P=V(x)-V(y)-\sum_{i=1}^{n}\partial_{i}V(y)\,(x_{i}-y_{i}).

Applying the same claim with the pair (x,y)(x,y) instead (increment yβˆ’xy-x with coordinates yiβˆ’xiy_{i}-x_{i}; segment points x+Ο„(yβˆ’x)=Ο„y+(1βˆ’Ο„)x∈Kx+\tau(y-x)=\tau y+(1-\tau)x\in K by convexity; ∣h∣=dE(x,y)=βˆ₯xβˆ’yβˆ₯|h|=d_{E}(x,y)=\lVert x-y\rVert), we obtain

∣Qβˆ£β‰€12 n M ρ,Q=V(y)βˆ’V(x)βˆ’βˆ‘i=1nβˆ‚iV(x) (yiβˆ’xi).|Q|\le\tfrac12\,n\,M\,\rho,\qquad Q=V(y)-V(x)-\sum_{i=1}^{n}\partial_{i}V(x)\,(y_{i}-x_{i}).

Step 4 (adding the estimates). In P+QP+Q the terms V(x)βˆ’V(y)V(x)-V(y) and V(y)βˆ’V(x)V(y)-V(x) cancel, and since βˆ’(yiβˆ’xi)=xiβˆ’yi-(y_{i}-x_{i})=x_{i}-y_{i}, field arithmetic (distributivity and rearrangement of finite sums) gives

P+Q=βˆ‘i=1n(βˆ‚iV(x)βˆ’βˆ‚iV(y))(xiβˆ’yi).P+Q=\sum_{i=1}^{n}\bigl(\partial_{i}V(x)-\partial_{i}V(y)\bigr)(x_{i}-y_{i}).

By the description of the gradient recalled at the start and clause 1 of Difference, Dot Product, and Orthogonality in Rn\mathbb{R}^n, the iith coordinate of DV(x)βˆ’DV(y)DV(x)-DV(y) is βˆ‚iV(x)βˆ’βˆ‚iV(y)\partial_{i}V(x)-\partial_{i}V(y) and that of xβˆ’yx-y is xiβˆ’yix_{i}-y_{i}, so clause 2 there identifies the right-hand side with the dot product:

P+Q=(DV(x)βˆ’DV(y))β‹…(xβˆ’y).P+Q=\bigl(DV(x)-DV(y)\bigr)\cdot(x-y).

By the triangle inequality (claim 5 of Properties of the Absolute Value in an Ordered Field) and the two estimates of Step 3, added using claims 2 and 3 of Elementary Arithmetic in an Ordered Field (from 0≀bβˆ’a0\le b-a and 0≀dβˆ’c0\le d-c follows 0≀(b+d)βˆ’(a+c)0\le(b+d)-(a+c), so weak inequalities add), and 12s+12s=s\tfrac12 s+\tfrac12 s=s for real ss (with 12=2βˆ’1\tfrac12=2^{-1}, which exists by claim 8 of Elementary Order Arithmetic in an Ordered Field),

∣P+Qβˆ£β‰€βˆ£P∣+∣Qβˆ£β‰€n M ρ.|P+Q|\le|P|+|Q|\le n\,M\,\rho .

Set c=nMc=nM. It is nonnegative: 0≀n0\le n as 1≀n1\le n and 0≀10\le1 (claim 1 of Elementary Arithmetic in an Ordered Field), and 0≀M0\le M, so claim 5 there gives 0=Mβ‹…0≀M n0=M\cdot0\le M\,n. Finally, claim 3 of Properties of the Absolute Value in an Ordered Field gives βˆ’βˆ£P+Qβˆ£β‰€P+Q-|P+Q|\le P+Q, and sign reversal (claim 4 of Elementary Order Arithmetic in an Ordered Field) applied to ∣P+Qβˆ£β‰€cρ|P+Q|\le c\rho gives βˆ’cΟβ‰€βˆ’βˆ£P+Q∣-c\rho\le-|P+Q|. Hence

βˆ’c βˆ₯xβˆ’yβˆ₯2≀(DV(x)βˆ’DV(y))β‹…(xβˆ’y).-c\,\lVert x-y\rVert^{2}\le\bigl(DV(x)-DV(y)\bigr)\cdot(x-y).

Since cc depends only on VV and BB (through KK and MM) and not on x,yx,y, and x,y∈Bx,y\in B were arbitrary, this proves the lemma.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…