Throughout, the notation is that of the statement. Closed and open balls B ˉ d E ( x , r ) \bar{B}_{d_{E}}(x,r) B ˉ d E ( x , r ) and B d E ( x , r ) B_{d_{E}}(x,r) B d E ( x , r ) of ( R N , d E ) (\mathbb{R}^{N},d_{E}) ( R N , d E ) are those of Closed Ball in a Metric Space and Open Ball in a Metric Space . We write B ( R N ) \mathcal{B}(\mathbb{R}^{N}) B ( R N ) for the Borel σ \sigma σ -algebra and λ N \lambda_{N} λ N for Lebesgue measure on it, as in Jensen's Lemma: the Contact Set of a Semiconvex Function at a Strict Maximum has Positive Measure , and a subset of R N \mathbb{R}^{N} R N is null if it is contained in a member of B ( R N ) \mathcal{B}(\mathbb{R}^{N}) B ( R N ) of λ N \lambda_{N} λ N -measure 0 0 0 , as fixed there.
Step 0 (two elementary observations).
(0a) Inverses reverse the order. If a , b ∈ R a,b\in\mathbb{R} a , b ∈ R satisfy 0 < a ≤ b 0<a\le b 0 < a ≤ b , then b − 1 ≤ a − 1 b^{-1}\le a^{-1} b − 1 ≤ a − 1 . Indeed a − 1 a^{-1} a − 1 and b − 1 b^{-1} b − 1 exist and are positive by claim 7 of Elementary Order Arithmetic in an Ordered Field , so c = a − 1 b − 1 c=a^{-1}b^{-1} c = a − 1 b − 1 is positive by claim 5 there; if a < b a<b a < b then c a < c b ca<cb c a < c b by claim 10 there, and c a = b − 1 ( a − 1 a ) = b − 1 ca=b^{-1}(a^{-1}a)=b^{-1} c a = b − 1 ( a − 1 a ) = b − 1 while c b = a − 1 ( b − 1 b ) = a − 1 cb=a^{-1}(b^{-1}b)=a^{-1} c b = a − 1 ( b − 1 b ) = a − 1 , so b − 1 < a − 1 b^{-1}<a^{-1} b − 1 < a − 1 ; while if a = b a=b a = b then a − 1 = b − 1 a^{-1}=b^{-1} a − 1 = b − 1 .
(0b) A null sequence. Let ι R : N → R \iota_{\mathbb{R}}:\mathbb{N}\to\mathbb{R} ι R : N → R be the canonical map of R \mathbb{R} R and put δ k = ι R ( k ) − 1 \delta_{k}=\iota_{\mathbb{R}}(k)^{-1} δ k = ι R ( k ) − 1 for k ∈ N k\in\mathbb{N} k ∈ N . By claim 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field each δ k \delta_{k} δ k exists and is positive, and by claim 2 there 1 ≤ ι R ( k ) 1\le\iota_{\mathbb{R}}(k) 1 ≤ ι R ( k ) , so δ k ≤ 1 − 1 = 1 \delta_{k}\le 1^{-1}=1 δ k ≤ 1 − 1 = 1 by (0a). Moreover ( δ k ) k ∈ N (\delta_{k})_{k\in\mathbb{N}} ( δ k ) k ∈ N converges to 0 0 0 in R \mathbb{R} R : given a positive ε ∈ R \varepsilon\in\mathbb{R} ε ∈ R , claim 3 of The Archimedean Property of the Real Numbers provides p ∈ N p\in\mathbb{N} p ∈ N with 0 < ι R ( p ) − 1 < ε 0<\iota_{\mathbb{R}}(p)^{-1}<\varepsilon 0 < ι R ( p ) − 1 < ε , and for k ∈ N k\in\mathbb{N} k ∈ N with p ≤ k p\le k p ≤ k we have ι R ( p ) ≤ ι R ( k ) \iota_{\mathbb{R}}(p)\le\iota_{\mathbb{R}}(k) ι R ( p ) ≤ ι R ( k ) by claim 6 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field when p < k p<k p < k and trivially when p = k p=k p = k , whence δ k ≤ ι R ( p ) − 1 < ε \delta_{k}\le\iota_{\mathbb{R}}(p)^{-1}<\varepsilon δ k ≤ ι R ( p ) − 1 < ε by (0a).
(0c) Enlarging a semiconvexity constant. Let C ⊆ R N C\subseteq\mathbb{R}^{N} C ⊆ R N be convex, let μ , μ ′ ∈ R \mu,\mu'\in\mathbb{R} μ , μ ′ ∈ R with 0 ≤ μ ≤ μ ′ 0\le\mu\le\mu' 0 ≤ μ ≤ μ ′ , and let g : C → R g:C\to\mathbb{R} g : C → R be semiconvex on C C C with constant μ \mu μ . Then g g g is semiconvex on C C C with constant μ ′ \mu' μ ′ . Indeed, by Differential Calculus and Convexity on Euclidean Open Sets: Standing Notation §convexity semiconvexity with constant μ \mu μ is equivalent to
g ( t x + ( 1 − t ) y ) ≤ t g ( x ) + ( 1 − t ) g ( y ) + μ 2 t ( 1 − t ) ∥ x − y ∥ 2 g\bigl(t\,x+(1-t)\,y\bigr)\le t\,g(x)+(1-t)\,g(y)+\frac{\mu}{2}\,t(1-t)\,\lVert x-y\rVert^{2} g ( t x + ( 1 − t ) y ) ≤ t g ( x ) + ( 1 − t ) g ( y ) + 2 μ t ( 1 − t ) ∥ x − y ∥ 2
for all x , y ∈ C x,y\in C x , y ∈ C and all real t t t with 0 ≤ t ≤ 1 0\le t\le1 0 ≤ t ≤ 1 , and likewise with μ \mu μ replaced by μ ′ \mu' μ ′ . For such t t t the numbers t t t and 1 − t 1-t 1 − t are nonnegative, and ∥ x − y ∥ 2 \lVert x-y\rVert^{2} ∥ x − y ∥ 2 is nonnegative by claim 1 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n , so t ( 1 − t ) ∥ x − y ∥ 2 t(1-t)\lVert x-y\rVert^{2} t ( 1 − t ) ∥ x − y ∥ 2 is nonnegative; multiplying μ 2 ≤ μ ′ 2 \tfrac{\mu}{2}\le\tfrac{\mu'}{2} 2 μ ≤ 2 μ ′ by this nonnegative number preserves the inequality: if the factor is 0 0 0 both products are 0 0 0 , if μ = μ ′ \mu=\mu' μ = μ ′ the two products are equal, and otherwise the factor is positive and μ 2 < μ ′ 2 \tfrac{\mu}{2}<\tfrac{\mu'}{2} 2 μ < 2 μ ′ , so claim 10 of Elementary Order Arithmetic in an Ordered Field applies. Hence the displayed inequality for μ \mu μ implies the one for μ ′ \mu' μ ′ .
Step 1 (the perturbed function). Put Λ = λ + ∥ B ∥ + 1 \Lambda=\lambda+\lVert B\rVert+1 Λ = λ + ∥ B ∥ + 1 ; it is positive, since 0 ≤ λ 0\le\lambda 0 ≤ λ , 0 ≤ ∥ B ∥ 0\le\lVert B\rVert 0 ≤ ∥ B ∥ by claim 1 of Properties of the Norm of a Symmetric Real Matrix , and 0 < 1 0<1 0 < 1 by claim 6 of Elementary Order Arithmetic in an Ordered Field .
Let δ ∈ R \delta\in\mathbb{R} δ ∈ R satisfy 0 < δ ≤ 1 0<\delta\le1 0 < δ ≤ 1 . By Real Matrices, Symmetric Matrices and the Semidefinite Ordering: Standing Notation §symmetric the matrix δ I N \delta I_{N} δ I N lies in S ( N ) \mathcal{S}(N) S ( N ) and S ( N ) \mathcal{S}(N) S ( N ) is closed under sums, so the matrix
B δ = B + δ I N B_{\delta}=B+\delta I_{N} B δ = B + δ I N
lies in S ( N ) \mathcal{S}(N) S ( N ) , and ∥ B δ ∥ ≤ ∥ B ∥ + ∥ δ I N ∥ = ∥ B ∥ + δ ≤ ∥ B ∥ + 1 \lVert B_{\delta}\rVert\le\lVert B\rVert+\lVert\delta I_{N}\rVert=\lVert B\rVert+\delta\le\lVert B\rVert+1 ∥ B δ ∥ ≤ ∥ B ∥ + ∥ δ I N ∥ = ∥ B ∥ + δ ≤ ∥ B ∥ + 1 by claim 5 of Properties of the Norm of a Symmetric Real Matrix and Vector, Entry and Comparison Bounds for the Norm of a Symmetric Real Matrix §identity . Define g δ : R N → R g_{\delta}:\mathbb{R}^{N}\to\mathbb{R} g δ : R N → R by
g δ ( ξ ) = f ( ξ ) − 1 2 ξ ⋅ ( B δ ξ ) . g_{\delta}(\xi)=f(\xi)-\tfrac{1}{2}\,\xi\cdot(B_{\delta}\xi). g δ ( ξ ) = f ( ξ ) − 2 1 ξ ⋅ ( B δ ξ ) .
For every ξ ∈ R N \xi\in\mathbb{R}^{N} ξ ∈ R N we have B δ ξ = B ξ + ( δ I N ) ξ B_{\delta}\xi=B\xi+(\delta I_{N})\xi B δ ξ = B ξ + ( δ I N ) ξ by claim 1 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum , hence, by claim 5 of Bilinearity and Symmetry of the Dot Product on R n \mathbb{R}^n R n and Vector, Entry and Comparison Bounds for the Norm of a Symmetric Real Matrix §identity ,
ξ ⋅ ( B δ ξ ) = ξ ⋅ ( B ξ ) + δ ∥ ξ ∥ 2 , so g δ ( ξ ) = f ( ξ ) − 1 2 ξ ⋅ ( B ξ ) − δ 2 ∥ ξ ∥ 2 . \xi\cdot(B_{\delta}\xi)=\xi\cdot(B\xi)+\delta\,\lVert\xi\rVert^{2},\qquad\text{so}\qquad g_{\delta}(\xi)=f(\xi)-\tfrac{1}{2}\,\xi\cdot(B\xi)-\tfrac{\delta}{2}\,\lVert\xi\rVert^{2}. ξ ⋅ ( B δ ξ ) = ξ ⋅ ( B ξ ) + δ ∥ ξ ∥ 2 , so g δ ( ξ ) = f ( ξ ) − 2 1 ξ ⋅ ( B ξ ) − 2 δ ∥ ξ ∥ 2 .
Taking ξ = 0 R N \xi=0_{\mathbb{R}^{N}} ξ = 0 R N and using B δ 0 R N = 0 R N B_{\delta}0_{\mathbb{R}^{N}}=0_{\mathbb{R}^{N}} B δ 0 R N = 0 R N , from claim 1 of Linearity, Compatibility with the Matrix Product, and a Norm Bound for the Matrix-Vector Product , together with 0 R N ⋅ 0 R N = 0 0_{\mathbb{R}^{N}}\cdot 0_{\mathbb{R}^{N}}=0 0 R N ⋅ 0 R N = 0 , we get g δ ( 0 R N ) = f ( 0 R N ) g_{\delta}(0_{\mathbb{R}^{N}})=f(0_{\mathbb{R}^{N}}) g δ ( 0 R N ) = f ( 0 R N ) . If ξ ≠ 0 R N \xi\ne 0_{\mathbb{R}^{N}} ξ = 0 R N then ∥ ξ ∥ ≠ 0 \lVert\xi\rVert\ne0 ∥ ξ ∥ = 0 by claim 3 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n and 0 ≤ ∥ ξ ∥ 0\le\lVert\xi\rVert 0 ≤ ∥ ξ ∥ by claim 1 there, so 0 < ∥ ξ ∥ 0<\lVert\xi\rVert 0 < ∥ ξ ∥ , the strict order of an ordered field being defined by a ≤ b a\le b a ≤ b together with a ≠ b a\ne b a = b ; hence 0 < δ 2 ∥ ξ ∥ 2 0<\tfrac{\delta}{2}\lVert\xi\rVert^{2} 0 < 2 δ ∥ ξ ∥ 2 by claims 5 and 8 of Elementary Order Arithmetic in an Ordered Field , and the hypothesis of the lemma gives
g δ ( ξ ) ≤ f ( 0 R N ) − δ 2 ∥ ξ ∥ 2 < f ( 0 R N ) = g δ ( 0 R N ) . g_{\delta}(\xi)\le f\bigl(0_{\mathbb{R}^{N}}\bigr)-\tfrac{\delta}{2}\,\lVert\xi\rVert^{2}<f\bigl(0_{\mathbb{R}^{N}}\bigr)=g_{\delta}\bigl(0_{\mathbb{R}^{N}}\bigr). g δ ( ξ ) ≤ f ( 0 R N ) − 2 δ ∥ ξ ∥ 2 < f ( 0 R N ) = g δ ( 0 R N ) .
Thus g δ ( ξ ) < g δ ( 0 R N ) g_{\delta}(\xi)<g_{\delta}(0_{\mathbb{R}^{N}}) g δ ( ξ ) < g δ ( 0 R N ) for every ξ ∈ R N \xi\in\mathbb{R}^{N} ξ ∈ R N with ξ ≠ 0 R N \xi\ne0_{\mathbb{R}^{N}} ξ = 0 R N ; in particular 0 R N 0_{\mathbb{R}^{N}} 0 R N is a strict maximum point of g δ g_{\delta} g δ on B ˉ d E ( 0 R N , 1 ) \bar{B}_{d_{E}}(0_{\mathbb{R}^{N}},1) B ˉ d E ( 0 R N , 1 ) in the sense required by Jensen's Lemma: the Contact Set of a Semiconvex Function at a Strict Maximum has Positive Measure .
Finally, Quadratic and Affine Functions of Class C 2 C^2 C 2 , Translation, and Quadratic Perturbation of Semiconvexity §semiconvex , applied with M = B δ M=B_{\delta} M = B δ , q = 0 R N q=0_{\mathbb{R}^{N}} q = 0 R N , c = 0 c=0 c = 0 and C = R N C=\mathbb{R}^{N} C = R N — for which q ⋅ z = 0 q\cdot z=0 q ⋅ z = 0 by claim 4 of Bilinearity and Symmetry of the Dot Product on R n \mathbb{R}^n R n applied with the scalar 0 0 0 , so that the function it produces is exactly g δ g_{\delta} g δ — shows that g δ g_{\delta} g δ is semiconvex on R N \mathbb{R}^{N} R N with constant λ + ∥ B δ ∥ \lambda+\lVert B_{\delta}\rVert λ + ∥ B δ ∥ . Since λ + ∥ B δ ∥ ≤ Λ \lambda+\lVert B_{\delta}\rVert\le\Lambda λ + ∥ B δ ∥ ≤ Λ , observation (0c) shows that g δ g_{\delta} g δ is semiconvex on R N \mathbb{R}^{N} R N with constant Λ \Lambda Λ .
Step 2 (Jensen's lemma and Alexandrov's theorem). Let δ ∈ R \delta\in\mathbb{R} δ ∈ R with 0 < δ ≤ 1 0<\delta\le1 0 < δ ≤ 1 . The hypotheses of Jensen's Lemma: the Contact Set of a Semiconvex Function at a Strict Maximum has Positive Measure hold with n = N n=N n = N , with U = R N U=\mathbb{R}^{N} U = R N , which is convex and open, with the positive semiconvexity constant Λ \Lambda Λ , with the function g δ g_{\delta} g δ , with x ^ = 0 R N \hat{x}=0_{\mathbb{R}^{N}} x ^ = 0 R N and with r = 1 r=1 r = 1 ; write B ˉ = B ˉ d E ( 0 R N , 1 ) \bar{B}=\bar{B}_{d_{E}}(0_{\mathbb{R}^{N}},1) B ˉ = B ˉ d E ( 0 R N , 1 ) and, for positive σ ∈ R \sigma\in\mathbb{R} σ ∈ R ,
K σ δ = { x ∈ B ˉ : there is p ∈ R N with ∥ p ∥ ≤ σ and g δ ( y ) + p ⋅ y ≤ g δ ( x ) + p ⋅ x for every y ∈ B ˉ } K^{\delta}_{\sigma}=\Bigl\{x\in\bar{B}:\text{there is }p\in\mathbb{R}^{N}\text{ with }\lVert p\rVert\le\sigma\text{ and }g_{\delta}(y)+p\cdot y\le g_{\delta}(x)+p\cdot x\text{ for every }y\in\bar{B}\Bigr\} K σ δ = { x ∈ B ˉ : there is p ∈ R N with ∥ p ∥ ≤ σ and g δ ( y ) + p ⋅ y ≤ g δ ( x ) + p ⋅ x for every y ∈ B ˉ }
for the contact sets of that lemma. It supplies a positive δ 0 ( δ ) ∈ R \delta_{0}(\delta)\in\mathbb{R} δ 0 ( δ ) ∈ R for which its four claims hold.
Applying Alexandrov's Theorem for Semiconvex Functions on an Open Convex Set §ae with U = R N U=\mathbb{R}^{N} U = R N , μ = λ \mu=\lambda μ = λ and the function f f f , the set E E E of points of R N \mathbb{R}^{N} R N at which f f f is not twice differentiable is null, so there is Z ∈ B ( R N ) Z\in\mathcal{B}(\mathbb{R}^{N}) Z ∈ B ( R N ) with E ⊆ Z E\subseteq Z E ⊆ Z and λ N ( Z ) = 0 \lambda_{N}(Z)=0 λ N ( Z ) = 0 .
Step 3 (what holds at a contact point of twice differentiability). Let δ ∈ R \delta\in\mathbb{R} δ ∈ R with 0 < δ ≤ 1 0<\delta\le1 0 < δ ≤ 1 , let σ ∈ R \sigma\in\mathbb{R} σ ∈ R with 0 < σ ≤ δ 0 ( δ ) 0<\sigma\le\delta_{0}(\delta) 0 < σ ≤ δ 0 ( δ ) , let x ∈ K σ δ x\in K^{\delta}_{\sigma} x ∈ K σ δ be a point at which f f f is twice differentiable, and let p ∈ R N p\in\mathbb{R}^{N} p ∈ R N with ∥ p ∥ ≤ σ \lVert p\rVert\le\sigma ∥ p ∥ ≤ σ be as in the definition of K σ δ K^{\delta}_{\sigma} K σ δ . We claim that
D f ( x ) = B δ x − p , − λ I N ⪯ D 2 f ( x ) ⪯ B δ . Df(x)=B_{\delta}x-p,\qquad -\lambda I_{N}\preceq D^{2}f(x)\preceq B_{\delta}. D f ( x ) = B δ x − p , − λ I N ⪯ D 2 f ( x ) ⪯ B δ .
Let Q : R N → R Q:\mathbb{R}^{N}\to\mathbb{R} Q : R N → R be given by Q ( y ) = 1 2 y ⋅ ( B δ y ) − p ⋅ y Q(y)=\tfrac{1}{2}\,y\cdot(B_{\delta}y)-p\cdot y Q ( y ) = 2 1 y ⋅ ( B δ y ) − p ⋅ y , and let h = f − Q h=f-Q h = f − Q , so that h ( y ) = g δ ( y ) + p ⋅ y h(y)=g_{\delta}(y)+p\cdot y h ( y ) = g δ ( y ) + p ⋅ y for every y y y . By Quadratic and Affine Functions of Class C 2 C^2 C 2 , Translation, and Quadratic Perturbation of Semiconvexity §quadratic , applied with M = B δ M=B_{\delta} M = B δ , q = − p q=-p q = − p and c = 0 c=0 c = 0 , the function Q Q Q is of class C 2 C^{2} C 2 on R N \mathbb{R}^{N} R N with D Q ( y ) = B δ y − p DQ(y)=B_{\delta}y-p D Q ( y ) = B δ y − p and D 2 Q ( y ) = B δ D^{2}Q(y)=B_{\delta} D 2 Q ( y ) = B δ at every y y y ; hence by Basic Properties of Twice Differentiability at a Point §c2 the function Q Q Q is twice differentiable at x x x with first-order coefficient B δ x − p B_{\delta}x-p B δ x − p and Hessian B δ B_{\delta} B δ . Since f f f is twice differentiable at x x x with first-order coefficient D f ( x ) Df(x) D f ( x ) and Hessian D 2 f ( x ) D^{2}f(x) D 2 f ( x ) , Sums, Differences and Scalar Multiples of Functions Twice Differentiable at a Point §difference shows that h h h is twice differentiable at x x x with first-order coefficient D f ( x ) − ( B δ x − p ) Df(x)-\bigl(B_{\delta}x-p\bigr) D f ( x ) − ( B δ x − p ) and Hessian D 2 f ( x ) − B δ D^{2}f(x)-B_{\delta} D 2 f ( x ) − B δ .
By claim 1 of Jensen's Lemma: the Contact Set of a Semiconvex Function at a Strict Maximum has Positive Measure we have x ∈ B ˉ d E ( 0 R N , 2 − 1 ) x\in\bar{B}_{d_{E}}\bigl(0_{\mathbb{R}^{N}},2^{-1}\bigr) x ∈ B ˉ d E ( 0 R N , 2 − 1 ) , that is ∥ x ∥ ≤ 2 − 1 \lVert x\rVert\le2^{-1} ∥ x ∥ ≤ 2 − 1 . Consequently h h h has a local maximum at x x x relative to R N \mathbb{R}^{N} R N : if y ∈ R N y\in\mathbb{R}^{N} y ∈ R N satisfies d E ( y , x ) < 2 − 1 d_{E}(y,x)<2^{-1} d E ( y , x ) < 2 − 1 then, by claim 6 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n ,
∥ y ∥ ≤ ∥ y − x ∥ + ∥ x ∥ < 2 − 1 + 2 − 1 = 1 , \lVert y\rVert\le\lVert y-x\rVert+\lVert x\rVert<2^{-1}+2^{-1}=1, ∥ y ∥ ≤ ∥ y − x ∥ + ∥ x ∥ < 2 − 1 + 2 − 1 = 1 ,
so y ∈ B ˉ y\in\bar{B} y ∈ B ˉ and therefore h ( y ) ≤ h ( x ) h(y)\le h(x) h ( y ) ≤ h ( x ) by the defining property of K σ δ K^{\delta}_{\sigma} K σ δ . Now Basic Properties of Twice Differentiability at a Point §local-max gives
D f ( x ) − ( B δ x − p ) = 0 R N , D 2 f ( x ) − B δ ⪯ 0 N , Df(x)-\bigl(B_{\delta}x-p\bigr)=0_{\mathbb{R}^{N}},\qquad D^{2}f(x)-B_{\delta}\preceq 0_{N}, D f ( x ) − ( B δ x − p ) = 0 R N , D 2 f ( x ) − B δ ⪯ 0 N ,
whence D f ( x ) = B δ x − p Df(x)=B_{\delta}x-p D f ( x ) = B δ x − p , and, adding B δ B_{\delta} B δ to both sides of the second relation as permitted by Real Matrices, Symmetric Matrices and the Semidefinite Ordering: Standing Notation §ordering , D 2 f ( x ) ⪯ B δ D^{2}f(x)\preceq B_{\delta} D 2 f ( x ) ⪯ B δ . The remaining inequality − λ I N ⪯ D 2 f ( x ) -\lambda I_{N}\preceq D^{2}f(x) − λ I N ⪯ D 2 f ( x ) is Alexandrov's Theorem for Semiconvex Functions on an Open Convex Set §hessian-bound , applied as in Step 2.
Two consequences will be used. First, by claims 6 and 5 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n and Vector, Entry and Comparison Bounds for the Norm of a Symmetric Real Matrix §vector-bound ,
∥ D f ( x ) ∥ ≤ ∥ B δ x ∥ + ∥ p ∥ ≤ ∥ B δ ∥ ∥ x ∥ + σ ≤ ( ∥ B ∥ + 1 ) ∥ x ∥ + σ . \lVert Df(x)\rVert\le\lVert B_{\delta}x\rVert+\lVert p\rVert\le\lVert B_{\delta}\rVert\,\lVert x\rVert+\sigma\le\bigl(\lVert B\rVert+1\bigr)\lVert x\rVert+\sigma . ∥ D f ( x )∥ ≤ ∥ B δ x ∥ + ∥ p ∥ ≤ ∥ B δ ∥ ∥ x ∥ + σ ≤ ( ∥ B ∥ + 1 ) ∥ x ∥ + σ .
Second, by Limits and Bounded Sequences of Symmetric Real Matrices §order-bound , applied with a = λ a=\lambda a = λ and C = B δ C=B_{\delta} C = B δ ,
∥ D 2 f ( x ) ∥ ≤ λ + ∥ B δ ∥ ≤ Λ . \lVert D^{2}f(x)\rVert\le\lambda+\lVert B_{\delta}\rVert\le\Lambda . ∥ D 2 f ( x )∥ ≤ λ + ∥ B δ ∥ ≤ Λ.
Step 4 (construction of the sequence; proof of claim 1). Let ( δ k ) k ∈ N (\delta_{k})_{k\in\mathbb{N}} ( δ k ) k ∈ N be the sequence of observation (0b), so 0 < δ k ≤ 1 0<\delta_{k}\le1 0 < δ k ≤ 1 for every k k k and ( δ k ) (\delta_{k}) ( δ k ) converges to 0 0 0 . Fix k ∈ N k\in\mathbb{N} k ∈ N . Apply Step 2 with δ = δ k \delta=\delta_{k} δ = δ k , obtaining δ 0 ( δ k ) \delta_{0}(\delta_{k}) δ 0 ( δ k ) , and then claim 4 of Jensen's Lemma: the Contact Set of a Semiconvex Function at a Strict Maximum has Positive Measure with ρ = δ k \rho=\delta_{k} ρ = δ k , obtaining a real δ 1 ( k ) \delta_{1}^{(k)} δ 1 ( k ) with 0 < δ 1 ( k ) ≤ δ 0 ( δ k ) 0<\delta_{1}^{(k)}\le\delta_{0}(\delta_{k}) 0 < δ 1 ( k ) ≤ δ 0 ( δ k ) such that K σ δ k ⊆ B d E ( 0 R N , δ k ) K^{\delta_{k}}_{\sigma}\subseteq B_{d_{E}}(0_{\mathbb{R}^{N}},\delta_{k}) K σ δ k ⊆ B d E ( 0 R N , δ k ) whenever 0 < σ ≤ δ 1 ( k ) 0<\sigma\le\delta_{1}^{(k)} 0 < σ ≤ δ 1 ( k ) . Put σ k = min { δ k , δ 1 ( k ) } \sigma_{k}=\min\bigl\{\delta_{k},\delta_{1}^{(k)}\bigr\} σ k = min { δ k , δ 1 ( k ) } , which exists by claim 9 of Elementary Order Arithmetic in an Ordered Field and is positive.
By claim 1 of Jensen's Lemma: the Contact Set of a Semiconvex Function at a Strict Maximum has Positive Measure the set K σ k δ k K^{\delta_{k}}_{\sigma_{k}} K σ k δ k is nonempty and belongs to B ( R N ) \mathcal{B}(\mathbb{R}^{N}) B ( R N ) , and by claim 3 there, applied with the set Z Z Z of Step 2, there is x k ′ ∈ K σ k δ k x'_{k}\in K^{\delta_{k}}_{\sigma_{k}} x k ′ ∈ K σ k δ k with x k ′ ∉ Z x'_{k}\notin Z x k ′ ∈ / Z . Since E ⊆ Z E\subseteq Z E ⊆ Z , the function f f f is twice differentiable at x k ′ x'_{k} x k ′ . From K σ k δ k ⊆ B d E ( 0 R N , δ k ) K^{\delta_{k}}_{\sigma_{k}}\subseteq B_{d_{E}}(0_{\mathbb{R}^{N}},\delta_{k}) K σ k δ k ⊆ B d E ( 0 R N , δ k ) we get ∥ x k ′ ∥ < δ k \lVert x'_{k}\rVert<\delta_{k} ∥ x k ′ ∥ < δ k , and Step 3, applied with δ = δ k \delta=\delta_{k} δ = δ k , σ = σ k \sigma=\sigma_{k} σ = σ k and x = x k ′ x=x'_{k} x = x k ′ , gives
∥ D f ( x k ′ ) ∥ ≤ ( ∥ B ∥ + 1 ) δ k + σ k ≤ ( ∥ B ∥ + 2 ) δ k , − λ I N ⪯ D 2 f ( x k ′ ) ⪯ B + δ k I N , \bigl\lVert Df(x'_{k})\bigr\rVert\le\bigl(\lVert B\rVert+1\bigr)\delta_{k}+\sigma_{k}\le\bigl(\lVert B\rVert+2\bigr)\delta_{k},\qquad -\lambda I_{N}\preceq D^{2}f(x'_{k})\preceq B+\delta_{k}I_{N}, D f ( x k ′ ) ≤ ( ∥ B ∥ + 1 ) δ k + σ k ≤ ( ∥ B ∥ + 2 ) δ k , − λ I N ⪯ D 2 f ( x k ′ ) ⪯ B + δ k I N ,
and ∥ D 2 f ( x k ′ ) ∥ ≤ Λ \lVert D^{2}f(x'_{k})\rVert\le\Lambda ∥ D 2 f ( x k ′ )∥ ≤ Λ .
The sequence ( x k ′ ) k ∈ N (x'_{k})_{k\in\mathbb{N}} ( x k ′ ) k ∈ N converges to 0 R N 0_{\mathbb{R}^{N}} 0 R N : given a positive ε ∈ R \varepsilon\in\mathbb{R} ε ∈ R , there is K ∈ N K\in\mathbb{N} K ∈ N with δ k < ε \delta_{k}<\varepsilon δ k < ε for k ≥ K k\ge K k ≥ K , and then d E ( x k ′ , 0 R N ) = ∥ x k ′ ∥ < ε d_{E}(x'_{k},0_{\mathbb{R}^{N}})=\lVert x'_{k}\rVert<\varepsilon d E ( x k ′ , 0 R N ) = ∥ x k ′ ∥ < ε . Similarly ( D f ( x k ′ ) ) k ∈ N \bigl(Df(x'_{k})\bigr)_{k\in\mathbb{N}} ( D f ( x k ′ ) ) k ∈ N converges to 0 R N 0_{\mathbb{R}^{N}} 0 R N : the number ∥ B ∥ + 2 \lVert B\rVert+2 ∥ B ∥ + 2 is positive, so ε ( ∥ B ∥ + 2 ) − 1 \varepsilon\bigl(\lVert B\rVert+2\bigr)^{-1} ε ( ∥ B ∥ + 2 ) − 1 is positive by claims 5 and 7 of Elementary Order Arithmetic in an Ordered Field , and choosing K K K with δ k < ε ( ∥ B ∥ + 2 ) − 1 \delta_{k}<\varepsilon\bigl(\lVert B\rVert+2\bigr)^{-1} δ k < ε ( ∥ B ∥ + 2 ) − 1 for k ≥ K k\ge K k ≥ K gives ∥ D f ( x k ′ ) ∥ < ε \lVert Df(x'_{k})\rVert<\varepsilon ∥ D f ( x k ′ )∥ < ε for such k k k .
By Limits and Bounded Sequences of Symmetric Real Matrices §compactness , applied to the sequence ( D 2 f ( x k ′ ) ) k ∈ N \bigl(D^{2}f(x'_{k})\bigr)_{k\in\mathbb{N}} ( D 2 f ( x k ′ ) ) k ∈ N in S ( N ) \mathcal{S}(N) S ( N ) with the bound Λ \Lambda Λ , there are a strictly increasing map κ : N → N \kappa:\mathbb{N}\to\mathbb{N} κ : N → N and X ∈ S ( N ) X\in\mathcal{S}(N) X ∈ S ( N ) such that ( D 2 f ( x κ ( j ) ′ ) ) j ∈ N \bigl(D^{2}f(x'_{\kappa(j)})\bigr)_{j\in\mathbb{N}} ( D 2 f ( x κ ( j ) ′ ) ) j ∈ N converges to X X X in S ( N ) \mathcal{S}(N) S ( N ) . Put x j = x κ ( j ) ′ x_{j}=x'_{\kappa(j)} x j = x κ ( j ) ′ for j ∈ N j\in\mathbb{N} j ∈ N . Each ( x j ) j ∈ N \bigl(x_{j}\bigr)_{j\in\mathbb{N}} ( x j ) j ∈ N and ( D f ( x j ) ) j ∈ N \bigl(Df(x_{j})\bigr)_{j\in\mathbb{N}} ( D f ( x j ) ) j ∈ N is a subsequence of a sequence already shown to converge to 0 R N 0_{\mathbb{R}^{N}} 0 R N , so both converge to 0 R N 0_{\mathbb{R}^{N}} 0 R N by A Subsequence of a Convergent Sequence Has the Same Limit ; and f f f is twice differentiable at every x j x_{j} x j .
It remains to prove the two matrix inequalities. The constant sequence with value − λ I N -\lambda I_{N} − λ I N converges to − λ I N -\lambda I_{N} − λ I N in S ( N ) \mathcal{S}(N) S ( N ) , and − λ I N ⪯ D 2 f ( x j ) -\lambda I_{N}\preceq D^{2}f(x_{j}) − λ I N ⪯ D 2 f ( x j ) for every j j j , so − λ I N ⪯ X -\lambda I_{N}\preceq X − λ I N ⪯ X by Limits and Bounded Sequences of Symmetric Real Matrices §closed . Next, ( δ κ ( j ) ) j ∈ N \bigl(\delta_{\kappa(j)}\bigr)_{j\in\mathbb{N}} ( δ κ ( j ) ) j ∈ N converges to 0 0 0 in R \mathbb{R} R by A Subsequence of a Convergent Sequence Has the Same Limit , and
d S ( N ) ( B + δ κ ( j ) I N , B ) = ∥ δ κ ( j ) I N ∥ = δ κ ( j ) d_{\mathcal{S}(N)}\bigl(B+\delta_{\kappa(j)}I_{N},\,B\bigr)=\bigl\lVert\delta_{\kappa(j)}I_{N}\bigr\rVert=\delta_{\kappa(j)} d S ( N ) ( B + δ κ ( j ) I N , B ) = δ κ ( j ) I N = δ κ ( j )
by Vector, Entry and Comparison Bounds for the Norm of a Symmetric Real Matrix §identity , so ( B + δ κ ( j ) I N ) j ∈ N \bigl(B+\delta_{\kappa(j)}I_{N}\bigr)_{j\in\mathbb{N}} ( B + δ κ ( j ) I N ) j ∈ N converges to B B B in S ( N ) \mathcal{S}(N) S ( N ) . Since D 2 f ( x j ) ⪯ B + δ κ ( j ) I N D^{2}f(x_{j})\preceq B+\delta_{\kappa(j)}I_{N} D 2 f ( x j ) ⪯ B + δ κ ( j ) I N for every j j j , Limits and Bounded Sequences of Symmetric Real Matrices §closed gives X ⪯ B X\preceq B X ⪯ B . This proves claim 1.
Step 5 (proof of claim 2). Let X ∈ S ( N ) X\in\mathcal{S}(N) X ∈ S ( N ) and ( x k ) k ∈ N (x_{k})_{k\in\mathbb{N}} ( x k ) k ∈ N have the properties listed in claim 1. For each k k k the function f f f is twice differentiable at x k x_{k} x k with first-order coefficient D f ( x k ) Df(x_{k}) D f ( x k ) and Hessian D 2 f ( x k ) D^{2}f(x_{k}) D 2 f ( x k ) , so by Quadratic Test Functions, Limits, Translation and Locality for Approximability by Test Data §twice-differentiable , applied with U = R N U=\mathbb{R}^{N} U = R N and u = f u=f u = f , the quadruple
( x k , f ( x k ) , D f ( x k ) , D 2 f ( x k ) ) \bigl(x_{k},\,f(x_{k}),\,Df(x_{k}),\,D^{2}f(x_{k})\bigr) ( x k , f ( x k ) , D f ( x k ) , D 2 f ( x k ) )
is approximable by test data from above for f f f .
The sequence ( f ( x k ) ) k ∈ N \bigl(f(x_{k})\bigr)_{k\in\mathbb{N}} ( f ( x k ) ) k ∈ N converges to f ( 0 R N ) f(0_{\mathbb{R}^{N}}) f ( 0 R N ) in R \mathbb{R} R . Indeed, R N \mathbb{R}^{N} R N is open and convex and f f f is semiconvex on it with the nonnegative constant λ \lambda λ , so claim 2 of Local Lipschitz Bound and Continuity for a Semiconvex Function on an Open Convex Set , applied with S = U = R N S=U=\mathbb{R}^{N} S = U = R N and the point 0 R N 0_{\mathbb{R}^{N}} 0 R N , provides for each positive ε ∈ R \varepsilon\in\mathbb{R} ε ∈ R a positive δ ∈ R \delta\in\mathbb{R} δ ∈ R such that ∥ y − 0 R N ∥ < δ \lVert y-0_{\mathbb{R}^{N}}\rVert<\delta ∥ y − 0 R N ∥ < δ implies ∣ f ( y ) − f ( 0 R N ) ∣ < ε |f(y)-f(0_{\mathbb{R}^{N}})|<\varepsilon ∣ f ( y ) − f ( 0 R N ) ∣ < ε ; since ( x k ) (x_{k}) ( x k ) converges to 0 R N 0_{\mathbb{R}^{N}} 0 R N there is K ∈ N K\in\mathbb{N} K ∈ N with ∥ x k − 0 R N ∥ = d E ( x k , 0 R N ) < δ \lVert x_{k}-0_{\mathbb{R}^{N}}\rVert=d_{E}(x_{k},0_{\mathbb{R}^{N}})<\delta ∥ x k − 0 R N ∥ = d E ( x k , 0 R N ) < δ for k ≥ K k\ge K k ≥ K , and then ∣ f ( x k ) − f ( 0 R N ) ∣ < ε |f(x_{k})-f(0_{\mathbb{R}^{N}})|<\varepsilon ∣ f ( x k ) − f ( 0 R N ) ∣ < ε .
Thus ( x k ) (x_{k}) ( x k ) converges to 0 R N 0_{\mathbb{R}^{N}} 0 R N , ( f ( x k ) ) \bigl(f(x_{k})\bigr) ( f ( x k ) ) converges to f ( 0 R N ) f(0_{\mathbb{R}^{N}}) f ( 0 R N ) , ( D f ( x k ) ) \bigl(Df(x_{k})\bigr) ( D f ( x k ) ) converges to 0 R N 0_{\mathbb{R}^{N}} 0 R N and ( D 2 f ( x k ) ) \bigl(D^{2}f(x_{k})\bigr) ( D 2 f ( x k ) ) converges to X X X . By Quadratic Test Functions, Limits, Translation and Locality for Approximability by Test Data §limits , applied with U = R N U=\mathbb{R}^{N} U = R N , u = f u=f u = f , x 0 = 0 R N x_{0}=0_{\mathbb{R}^{N}} x 0 = 0 R N , p = 0 R N p=0_{\mathbb{R}^{N}} p = 0 R N and the matrix X X X , the quadruple ( 0 R N , f ( 0 R N ) , 0 R N , X ) \bigl(0_{\mathbb{R}^{N}},f(0_{\mathbb{R}^{N}}),0_{\mathbb{R}^{N}},X\bigr) ( 0 R N , f ( 0 R N ) , 0 R N , X ) is approximable by test data from above for f f f . The final assertion of claim 2 follows by taking the X X X and the sequence produced in claim 1.