TheoremBase

Perturbs ff by a strictly convex quadratic so that the origin becomes a strict maximum, applies Jensen's lemma on the unit ball together with Alexandrov's theorem to find points of twice differentiability in the contact sets, reads off the gradient and Hessian bounds from the second-order condition at a local maximum, and passes to a convergent subsequence of Hessians.

Proof

Throughout, the notation is that of the statement. Closed and open balls BˉdE(x,r)\bar{B}_{d_{E}}(x,r) and BdE(x,r)B_{d_{E}}(x,r) of (RN,dE)(\mathbb{R}^{N},d_{E}) are those of Closed Ball in a Metric Space and Open Ball in a Metric Space. We write B(RN)\mathcal{B}(\mathbb{R}^{N}) for the Borel σ\sigma-algebra and λN\lambda_{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 RN\mathbb{R}^{N} is null if it is contained in a member of B(RN)\mathcal{B}(\mathbb{R}^{N}) of λN\lambda_{N}-measure 00, as fixed there.

Step 0 (two elementary observations).

(0a) Inverses reverse the order. If a,b∈Ra,b\in\mathbb{R} satisfy 0<a≤b0<a\le b, then b−1≤a−1b^{-1}\le a^{-1}. Indeed a−1a^{-1} and b−1b^{-1} exist and are positive by claim 7 of Elementary Order Arithmetic in an Ordered Field, so c=a−1b−1c=a^{-1}b^{-1} is positive by claim 5 there; if a<ba<b then ca<cbca<cb by claim 10 there, and ca=b−1(a−1a)=b−1ca=b^{-1}(a^{-1}a)=b^{-1} while cb=a−1(b−1b)=a−1cb=a^{-1}(b^{-1}b)=a^{-1}, so b−1<a−1b^{-1}<a^{-1}; while if a=ba=b then a−1=b−1a^{-1}=b^{-1}.

(0b) A null sequence. Let ιR:N→R\iota_{\mathbb{R}}:\mathbb{N}\to\mathbb{R} be the canonical map of R\mathbb{R} and put δk=ιR(k)−1\delta_{k}=\iota_{\mathbb{R}}(k)^{-1} for k∈Nk\in\mathbb{N}. By claim 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field each δk\delta_{k} exists and is positive, and by claim 2 there 1≤ιR(k)1\le\iota_{\mathbb{R}}(k), so δk≤1−1=1\delta_{k}\le 1^{-1}=1 by (0a). Moreover (δk)k∈N(\delta_{k})_{k\in\mathbb{N}} converges to 00 in R\mathbb{R}: given a positive ε∈R\varepsilon\in\mathbb{R}, claim 3 of The Archimedean Property of the Real Numbers provides p∈Np\in\mathbb{N} with 0<ιR(p)−1<ε0<\iota_{\mathbb{R}}(p)^{-1}<\varepsilon, and for k∈Nk\in\mathbb{N} with p≤kp\le k we have ιR(p)≤ιR(k)\iota_{\mathbb{R}}(p)\le\iota_{\mathbb{R}}(k) by claim 6 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field when p<kp<k and trivially when p=kp=k, whence δk≤ιR(p)−1<ε\delta_{k}\le\iota_{\mathbb{R}}(p)^{-1}<\varepsilon by (0a).

(0c) Enlarging a semiconvexity constant. Let C⊆RNC\subseteq\mathbb{R}^{N} be convex, let μ,μ′∈R\mu,\mu'\in\mathbb{R} with 0≤μ≤μ′0\le\mu\le\mu', and let g:C→Rg:C\to\mathbb{R} be semiconvex on CC with constant μ\mu. Then gg is semiconvex on CC with constant μ′\mu'. Indeed, by Differential Calculus and Convexity on Euclidean Open Sets: Standing Notation (v) 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∥2g\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}

for all x,y∈Cx,y\in C and all real tt with 0≤t≤10\le t\le1, and likewise with μ\mu replaced by μ′\mu'. For such tt the numbers tt and 1−t1-t are nonnegative, and ∥x−y∥2\lVert x-y\rVert^{2} is nonnegative by claim 1 of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square, so t(1−t)∥x−y∥2t(1-t)\lVert x-y\rVert^{2} is nonnegative; multiplying μ2≤μ′2\tfrac{\mu}{2}\le\tfrac{\mu'}{2} by this nonnegative number preserves the inequality: if the factor is 00 both products are 00, if μ=μ′\mu=\mu' the two products are equal, and otherwise the factor is positive and μ2<μ′2\tfrac{\mu}{2}<\tfrac{\mu'}{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; it is positive, since 0≤λ0\le\lambda, 0≤∥B∥0\le\lVert B\rVert by claim 1 of Properties of the Norm of a Symmetric Real Matrix, and 0<10<1 by claim 6 of Elementary Order Arithmetic in an Ordered Field.

Let δ∈R\delta\in\mathbb{R} satisfy 0<δ≤10<\delta\le1. By Euclidean Space and Real Matrices: Standing Notation (iii) the matrix δIN\delta I_{N} lies in S(N)\mathcal{S}(N) and S(N)\mathcal{S}(N) is closed under sums, so the matrix

Bδ=B+δINB_{\delta}=B+\delta I_{N}

lies in S(N)\mathcal{S}(N), and ∥Bδ∥≤∥B∥+∥δIN∥=∥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 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 (vi). Define gδ:RN→Rg_{\delta}:\mathbb{R}^{N}\to\mathbb{R} by

gδ(ξ)=f(ξ)−12 ξ⋅(Bδξ).g_{\delta}(\xi)=f(\xi)-\tfrac{1}{2}\,\xi\cdot(B_{\delta}\xi).

For every ξ∈RN\xi\in\mathbb{R}^{N} we have Bδξ=Bξ+(δIN)ξB_{\delta}\xi=B\xi+(\delta I_{N})\xi by claim 1 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum, hence, by claim 5 of The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite and Vector, Entry and Comparison Bounds for the Norm of a Symmetric Real Matrix (vi),

ξ⋅(Bδξ)=ξ⋅(Bξ)+δ ∥ξ∥2,sogδ(ξ)=f(ξ)−12 ξ⋅(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}.

Taking ξ=0RN\xi=0_{\mathbb{R}^{N}} and using Bδ0RN=0RNB_{\delta}0_{\mathbb{R}^{N}}=0_{\mathbb{R}^{N}}, from claim 1 of Linearity, Compatibility with the Matrix Product, and a Norm Bound for the Matrix-Vector Product, together with 0RN⋅0RN=00_{\mathbb{R}^{N}}\cdot 0_{\mathbb{R}^{N}}=0, we get gδ(0RN)=f(0RN)g_{\delta}(0_{\mathbb{R}^{N}})=f(0_{\mathbb{R}^{N}}). If ξ≠0RN\xi\ne 0_{\mathbb{R}^{N}} then ∥ξ∥≠0\lVert\xi\rVert\ne0 by claim 3 of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square and 0≤∥ξ∥0\le\lVert\xi\rVert by claim 1 there, so 0<∥ξ∥0<\lVert\xi\rVert, the strict order of an ordered field being defined by a≤ba\le b together with a≠ba\ne b; hence 0<δ2∥ξ∥20<\tfrac{\delta}{2}\lVert\xi\rVert^{2} by claims 5 and 8 of Elementary Order Arithmetic in an Ordered Field, and the hypothesis of the lemma gives

gδ(ξ)≤f(0RN)−δ2 ∥ξ∥2<f(0RN)=gδ(0RN).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).

Thus gδ(ξ)<gδ(0RN)g_{\delta}(\xi)<g_{\delta}(0_{\mathbb{R}^{N}}) for every ξ∈RN\xi\in\mathbb{R}^{N} with ξ≠0RN\xi\ne0_{\mathbb{R}^{N}}; in particular 0RN0_{\mathbb{R}^{N}} is a strict maximum point of gδg_{\delta} on BˉdE(0RN,1)\bar{B}_{d_{E}}(0_{\mathbb{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 C2C^2, Translation, and Quadratic Perturbation of Semiconvexity (iv), applied with M=BδM=B_{\delta}, q=0RNq=0_{\mathbb{R}^{N}}, c=0c=0 and C=RNC=\mathbb{R}^{N} — for which q⋅z=0q\cdot z=0 by claim 4 of The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite applied with the scalar 00, so that the function it produces is exactly gδg_{\delta} — shows that gδg_{\delta} is semiconvex on RN\mathbb{R}^{N} with constant λ+∥Bδ∥\lambda+\lVert B_{\delta}\rVert. Since λ+∥Bδ∥≤Λ\lambda+\lVert B_{\delta}\rVert\le\Lambda, observation (0c) shows that gδg_{\delta} is semiconvex on RN\mathbb{R}^{N} with constant Λ\Lambda.

Step 2 (Jensen's lemma and Alexandrov's theorem). Let δ∈R\delta\in\mathbb{R} with 0<δ≤10<\delta\le1. The hypotheses of Jensen's Lemma: the Contact Set of a Semiconvex Function at a Strict Maximum has Positive Measure hold with n=Nn=N, with U=RNU=\mathbb{R}^{N}, which is convex and open, with the positive semiconvexity constant Λ\Lambda, with the function gδg_{\delta}, with x^=0RN\hat{x}=0_{\mathbb{R}^{N}} and with r=1r=1; write Bˉ=BˉdE(0RN,1)\bar{B}=\bar{B}_{d_{E}}(0_{\mathbb{R}^{N}},1) and, for positive σ∈R\sigma\in\mathbb{R},

Kσδ={x∈Bˉ:there is p∈RN 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\}

for the contact sets of that lemma. It supplies a positive δ0(δ)∈R\delta_{0}(\delta)\in\mathbb{R} for which its four claims hold.

Applying Alexandrov's Theorem for Semiconvex Functions on an Open Convex Set (i) with U=RNU=\mathbb{R}^{N}, μ=λ\mu=\lambda and the function ff, the set EE of points of RN\mathbb{R}^{N} at which ff is not twice differentiable is null, so there is Z∈B(RN)Z\in\mathcal{B}(\mathbb{R}^{N}) with E⊆ZE\subseteq Z and λN(Z)=0\lambda_{N}(Z)=0.

Step 3 (what holds at a contact point of twice differentiability). Let δ∈R\delta\in\mathbb{R} with 0<δ≤10<\delta\le1, let σ∈R\sigma\in\mathbb{R} with 0<σ≤δ0(δ)0<\sigma\le\delta_{0}(\delta), let x∈Kσδx\in K^{\delta}_{\sigma} be a point at which ff is twice differentiable, and let p∈RNp\in\mathbb{R}^{N} with ∥p∥≤σ\lVert p\rVert\le\sigma be as in the definition of KσδK^{\delta}_{\sigma}. We claim that

Df(x)=Bδx−p,−λIN⪯D2f(x)⪯Bδ.Df(x)=B_{\delta}x-p,\qquad -\lambda I_{N}\preceq D^{2}f(x)\preceq B_{\delta}.

Let Q:RN→RQ:\mathbb{R}^{N}\to\mathbb{R} be given by Q(y)=12 y⋅(Bδy)−p⋅yQ(y)=\tfrac{1}{2}\,y\cdot(B_{\delta}y)-p\cdot y, and let h=f−Qh=f-Q, so that h(y)=gδ(y)+p⋅yh(y)=g_{\delta}(y)+p\cdot y for every yy. By Quadratic and Affine Functions of Class C2C^2, Translation, and Quadratic Perturbation of Semiconvexity (i), applied with M=BδM=B_{\delta}, q=−pq=-p and c=0c=0, the function QQ is of class C2C^{2} on RN\mathbb{R}^{N} with DQ(y)=Bδy−pDQ(y)=B_{\delta}y-p and D2Q(y)=BδD^{2}Q(y)=B_{\delta} at every yy; hence by Basic Properties of Twice Differentiability at a Point (ii) the function QQ is twice differentiable at xx with first-order coefficient Bδx−pB_{\delta}x-p and Hessian BδB_{\delta}. Since ff is twice differentiable at xx with first-order coefficient Df(x)Df(x) and Hessian D2f(x)D^{2}f(x), Sums, Differences and Scalar Multiples of Functions Twice Differentiable at a Point (iii) shows that hh is twice differentiable at xx with first-order coefficient Df(x)−(Bδx−p)Df(x)-\bigl(B_{\delta}x-p\bigr) and Hessian D2f(x)−BδD^{2}f(x)-B_{\delta}.

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ˉdE(0RN,2−1)x\in\bar{B}_{d_{E}}\bigl(0_{\mathbb{R}^{N}},2^{-1}\bigr), that is ∥x∥≤2−1\lVert x\rVert\le2^{-1}. Consequently hh has a local maximum at xx relative to RN\mathbb{R}^{N}: if y∈RNy\in\mathbb{R}^{N} satisfies dE(y,x)<2−1d_{E}(y,x)<2^{-1} then, by claim 6 of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square,

∥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,

so y∈Bˉy\in\bar{B} and therefore h(y)≤h(x)h(y)\le h(x) by the defining property of KσδK^{\delta}_{\sigma}. Now Basic Properties of Twice Differentiability at a Point (iii) gives

Df(x)−(Bδx−p)=0RN,D2f(x)−Bδ⪯0N,Df(x)-\bigl(B_{\delta}x-p\bigr)=0_{\mathbb{R}^{N}},\qquad D^{2}f(x)-B_{\delta}\preceq 0_{N},

whence Df(x)=Bδx−pDf(x)=B_{\delta}x-p, and, adding BδB_{\delta} to both sides of the second relation as permitted by Euclidean Space and Real Matrices: Standing Notation (iv), D2f(x)⪯BδD^{2}f(x)\preceq B_{\delta}. The remaining inequality −λIN⪯D2f(x)-\lambda I_{N}\preceq D^{2}f(x) is Alexandrov's Theorem for Semiconvex Functions on an Open Convex Set (ii), applied as in Step 2.

Two consequences will be used. First, by claims 6 and 5 of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square and Vector, Entry and Comparison Bounds for the Norm of a Symmetric Real Matrix (iii),

∥Df(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 .

Second, by Limits and Bounded Sequences of Symmetric Real Matrices (iv), applied with a=λa=\lambda and C=BδC=B_{\delta},

∥D2f(x)∥≤λ+∥Bδ∥≤Λ.\lVert D^{2}f(x)\rVert\le\lambda+\lVert B_{\delta}\rVert\le\Lambda .

Step 4 (construction of the sequence; proof of claim 1). Let (δk)k∈N(\delta_{k})_{k\in\mathbb{N}} be the sequence of observation (0b), so 0<δk≤10<\delta_{k}\le1 for every kk and (δk)(\delta_{k}) converges to 00. Fix k∈Nk\in\mathbb{N}. Apply Step 2 with δ=δk\delta=\delta_{k}, obtaining δ0(δk)\delta_{0}(\delta_{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}, obtaining a real δ1(k)\delta_{1}^{(k)} with 0<δ1(k)≤δ0(δk)0<\delta_{1}^{(k)}\le\delta_{0}(\delta_{k}) such that Kσδk⊆BdE(0RN,δk)K^{\delta_{k}}_{\sigma}\subseteq B_{d_{E}}(0_{\mathbb{R}^{N}},\delta_{k}) whenever 0<σ≤δ1(k)0<\sigma\le\delta_{1}^{(k)}. Put σk=min⁡{δk,δ1(k)}\sigma_{k}=\min\bigl\{\delta_{k},\delta_{1}^{(k)}\bigr\}, 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δkK^{\delta_{k}}_{\sigma_{k}} is nonempty and belongs to B(RN)\mathcal{B}(\mathbb{R}^{N}), and by claim 3 there, applied with the set ZZ of Step 2, there is xk′∈Kσkδkx'_{k}\in K^{\delta_{k}}_{\sigma_{k}} with xk′∉Zx'_{k}\notin Z. Since E⊆ZE\subseteq Z, the function ff is twice differentiable at xk′x'_{k}. From Kσkδk⊆BdE(0RN,δk)K^{\delta_{k}}_{\sigma_{k}}\subseteq B_{d_{E}}(0_{\mathbb{R}^{N}},\delta_{k}) we get ∥xk′∥<δk\lVert x'_{k}\rVert<\delta_{k}, and Step 3, applied with δ=δk\delta=\delta_{k}, σ=σk\sigma=\sigma_{k} and x=xk′x=x'_{k}, gives

∥Df(xk′)∥≤(∥B∥+1)δk+σk≤(∥B∥+2)δk,−λIN⪯D2f(xk′)⪯B+δkIN,\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},

and ∥D2f(xk′)∥≤Λ\lVert D^{2}f(x'_{k})\rVert\le\Lambda.

The sequence (xk′)k∈N(x'_{k})_{k\in\mathbb{N}} converges to 0RN0_{\mathbb{R}^{N}}: given a positive ε∈R\varepsilon\in\mathbb{R}, there is K∈NK\in\mathbb{N} with δk<ε\delta_{k}<\varepsilon for k≥Kk\ge K, and then dE(xk′,0RN)=∥xk′∥<εd_{E}(x'_{k},0_{\mathbb{R}^{N}})=\lVert x'_{k}\rVert<\varepsilon. Similarly (Df(xk′))k∈N\bigl(Df(x'_{k})\bigr)_{k\in\mathbb{N}} converges to 0RN0_{\mathbb{R}^{N}}: the number ∥B∥+2\lVert B\rVert+2 is positive, so ε(∥B∥+2)−1\varepsilon\bigl(\lVert B\rVert+2\bigr)^{-1} is positive by claims 5 and 7 of Elementary Order Arithmetic in an Ordered Field, and choosing KK with δk<ε(∥B∥+2)−1\delta_{k}<\varepsilon\bigl(\lVert B\rVert+2\bigr)^{-1} for k≥Kk\ge K gives ∥Df(xk′)∥<ε\lVert Df(x'_{k})\rVert<\varepsilon for such kk.

By Limits and Bounded Sequences of Symmetric Real Matrices (i), applied to the sequence (D2f(xk′))k∈N\bigl(D^{2}f(x'_{k})\bigr)_{k\in\mathbb{N}} in S(N)\mathcal{S}(N) with the bound Λ\Lambda, there are a strictly increasing map κ:N→N\kappa:\mathbb{N}\to\mathbb{N} and X∈S(N)X\in\mathcal{S}(N) such that (D2f(xκ(j)′))j∈N\bigl(D^{2}f(x'_{\kappa(j)})\bigr)_{j\in\mathbb{N}} converges to XX in S(N)\mathcal{S}(N). Put xj=xκ(j)′x_{j}=x'_{\kappa(j)} for j∈Nj\in\mathbb{N}. Each (xj)j∈N\bigl(x_{j}\bigr)_{j\in\mathbb{N}} and (Df(xj))j∈N\bigl(Df(x_{j})\bigr)_{j\in\mathbb{N}} is a subsequence of a sequence already shown to converge to 0RN0_{\mathbb{R}^{N}}, so both converge to 0RN0_{\mathbb{R}^{N}} by A Subsequence of a Convergent Sequence Has the Same Limit; and ff is twice differentiable at every xjx_{j}.

It remains to prove the two matrix inequalities. The constant sequence with value −λIN-\lambda I_{N} converges to −λIN-\lambda I_{N} in S(N)\mathcal{S}(N), and −λIN⪯D2f(xj)-\lambda I_{N}\preceq D^{2}f(x_{j}) for every jj, so −λIN⪯X-\lambda I_{N}\preceq X by Limits and Bounded Sequences of Symmetric Real Matrices (iii). Next, (δκ(j))j∈N\bigl(\delta_{\kappa(j)}\bigr)_{j\in\mathbb{N}} converges to 00 in R\mathbb{R} by A Subsequence of a Convergent Sequence Has the Same Limit, and

dS(N)(B+δκ(j)IN, B)=∥δκ(j)IN∥=δκ(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)}

by Vector, Entry and Comparison Bounds for the Norm of a Symmetric Real Matrix (vi), so (B+δκ(j)IN)j∈N\bigl(B+\delta_{\kappa(j)}I_{N}\bigr)_{j\in\mathbb{N}} converges to BB in S(N)\mathcal{S}(N). Since D2f(xj)⪯B+δκ(j)IND^{2}f(x_{j})\preceq B+\delta_{\kappa(j)}I_{N} for every jj, Limits and Bounded Sequences of Symmetric Real Matrices (iii) gives X⪯BX\preceq B. This proves claim 1.

Step 5 (proof of claim 2). Let X∈S(N)X\in\mathcal{S}(N) and (xk)k∈N(x_{k})_{k\in\mathbb{N}} have the properties listed in claim 1. For each kk the function ff is twice differentiable at xkx_{k} with first-order coefficient Df(xk)Df(x_{k}) and Hessian D2f(xk)D^{2}f(x_{k}), so by Quadratic Test Functions, Limits, Translation and Locality for Approximability by Test Data (ii), applied with U=RNU=\mathbb{R}^{N} and u=fu=f, the quadruple

(xk, f(xk), Df(xk), D2f(xk))\bigl(x_{k},\,f(x_{k}),\,Df(x_{k}),\,D^{2}f(x_{k})\bigr)

is approximable by test data from above for ff.

The sequence (f(xk))k∈N\bigl(f(x_{k})\bigr)_{k\in\mathbb{N}} converges to f(0RN)f(0_{\mathbb{R}^{N}}) in R\mathbb{R}. Indeed, RN\mathbb{R}^{N} is open and convex and ff 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=RNS=U=\mathbb{R}^{N} and the point 0RN0_{\mathbb{R}^{N}}, provides for each positive ε∈R\varepsilon\in\mathbb{R} a positive δ∈R\delta\in\mathbb{R} such that ∥y−0RN∥<δ\lVert y-0_{\mathbb{R}^{N}}\rVert<\delta implies ∣f(y)−f(0RN)∣<ε|f(y)-f(0_{\mathbb{R}^{N}})|<\varepsilon; since (xk)(x_{k}) converges to 0RN0_{\mathbb{R}^{N}} there is K∈NK\in\mathbb{N} with ∥xk−0RN∥=dE(xk,0RN)<δ\lVert x_{k}-0_{\mathbb{R}^{N}}\rVert=d_{E}(x_{k},0_{\mathbb{R}^{N}})<\delta for k≥Kk\ge K, and then ∣f(xk)−f(0RN)∣<ε|f(x_{k})-f(0_{\mathbb{R}^{N}})|<\varepsilon.

Thus (xk)(x_{k}) converges to 0RN0_{\mathbb{R}^{N}}, (f(xk))\bigl(f(x_{k})\bigr) converges to f(0RN)f(0_{\mathbb{R}^{N}}), (Df(xk))\bigl(Df(x_{k})\bigr) converges to 0RN0_{\mathbb{R}^{N}} and (D2f(xk))\bigl(D^{2}f(x_{k})\bigr) converges to XX. By Quadratic Test Functions, Limits, Translation and Locality for Approximability by Test Data (iii), applied with U=RNU=\mathbb{R}^{N}, u=fu=f, x0=0RNx_{0}=0_{\mathbb{R}^{N}}, p=0RNp=0_{\mathbb{R}^{N}} and the matrix XX, the quadruple (0RN,f(0RN),0RN,X)\bigl(0_{\mathbb{R}^{N}},f(0_{\mathbb{R}^{N}}),0_{\mathbb{R}^{N}},X\bigr) is approximable by test data from above for ff. The final assertion of claim 2 follows by taking the XX and the sequence produced in claim 1.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…