TheoremBase

Splits the quadratic form to convert the global bound into a bound on the sup-convolution wλw^{\lambda} with λ=ε−1+∥A∥\lambda=\varepsilon^{-1}+\lVert A\rVert, applies the semiconvex quadratic-maximum lemma to wλw^{\lambda}, splits the resulting Hessian into blocks using the separation of the sup-convolution, and transfers the resulting test data back from uiλu_i^{\lambda} to uiu_i.

Proof

Throughout, the notation is that of the statement. Put

λ=ε−1+∥A∥,\lambda=\varepsilon^{-1}+\lVert A\rVert ,

which is positive, since ε−1\varepsilon^{-1} is positive and 0≤∥A∥0\le\lVert A\rVert by claim 1 of Properties of the Norm of a Symmetric Real Matrix. Recall B=A+εA2∈S(N)B=A+\varepsilon A^{2}\in\mathcal{S}(N).

Let w:RN→Rw:\mathbb{R}^{N}\to\mathbb{R} be the function determined by

w(ι(ξ,η))=u1(ξ)+u2(η)(ξ∈Rm, η∈Rn),w\bigl(\iota(\xi,\eta)\bigr)=u_{1}(\xi)+u_{2}(\eta)\qquad(\xi\in\mathbb{R}^{m},\ \eta\in\mathbb{R}^{n}),

which is well defined and defined at every point of RN\mathbb{R}^{N} because ι\iota is a bijection. By Concatenation and the Sup-Convolution of a Sum in Separated Variables (ii), applied with the parameter λ\lambda, the number C1+C2C_{1}+C_{2} is an upper bound for the set of values of ww and the sup-convolutions u1λu_{1}^{\lambda}, u2λu_{2}^{\lambda} and wλw^{\lambda} are defined; and by Concatenation and the Sup-Convolution of a Sum in Separated Variables (iii),

wλ(ι(ξ,η))=u1λ(ξ)+u2λ(η)(ξ∈Rm, η∈Rn).w^{\lambda}\bigl(\iota(\xi,\eta)\bigr)=u_{1}^{\lambda}(\xi)+u_{2}^{\lambda}(\eta)\qquad(\xi\in\mathbb{R}^{m},\ \eta\in\mathbb{R}^{n}).

Step 1 (a global quadratic bound for the sup-convolution). Every x∈RNx\in\mathbb{R}^{N} is of the form ι(ξ,η)\iota(\xi,\eta), so the hypothesis of the theorem says exactly that

w(x)≤12 x⋅(Ax)for every x∈RN.w(x)\le\tfrac{1}{2}\,x\cdot(Ax)\qquad\text{for every }x\in\mathbb{R}^{N}.

By A Weighted Young Inequality and the Splitting of a Quadratic Form (iii), applied in dimension NN with the matrix AA and the given positive ε\varepsilon, we have for all x,z∈RNx,z\in\mathbb{R}^{N}

x⋅(Ax)≤z⋅(Bz)+λ ∥x−z∥2.x\cdot(Ax)\le z\cdot(Bz)+\lambda\,\lVert x-z\rVert^{2}.

Multiplying by the positive number 2−12^{-1} preserves this inequality: if the two sides are equal so are their products with 2−12^{-1}, and otherwise the inequality is strict and claim 10 of Elementary Order Arithmetic in an Ordered Field applies. Combining with the previous display,

w(x)−λ2 ∥x−z∥2≤12 z⋅(Bz)for all x,z∈RN.w(x)-\frac{\lambda}{2}\,\lVert x-z\rVert^{2}\le\tfrac{1}{2}\,z\cdot(Bz)\qquad\text{for all }x,z\in\mathbb{R}^{N}.

For fixed zz this says that 12 z⋅(Bz)\tfrac{1}{2}\,z\cdot(Bz) is an upper bound for the set Sλ,w(z)S_{\lambda,w}(z) of Sup-Convolution of a Function on RM\mathbb{R}^M, whose least upper bound is wλ(z)w^{\lambda}(z). Hence

wλ(z)≤12 z⋅(Bz)for every z∈RN.w^{\lambda}(z)\le\tfrac{1}{2}\,z\cdot(Bz)\qquad\text{for every }z\in\mathbb{R}^{N}.

Step 2 (the values at the origins). By Concatenation and the Sup-Convolution of a Sum in Separated Variables (i) we have ι(0Rm,0Rn)=0RN\iota\bigl(0_{\mathbb{R}^{m}},0_{\mathbb{R}^{n}}\bigr)=0_{\mathbb{R}^{N}}, so

w(0RN)=u1(0Rm)+u2(0Rn)=0.w\bigl(0_{\mathbb{R}^{N}}\bigr)=u_{1}\bigl(0_{\mathbb{R}^{m}}\bigr)+u_{2}\bigl(0_{\mathbb{R}^{n}}\bigr)=0 .

By claim 1 of Domination, Monotonicity and Semiconvexity of the Sup-Convolution we have w(0RN)≤wλ(0RN)w(0_{\mathbb{R}^{N}})\le w^{\lambda}(0_{\mathbb{R}^{N}}), that is 0≤wλ(0RN)0\le w^{\lambda}(0_{\mathbb{R}^{N}}). On the other hand Step 1 with z=0RNz=0_{\mathbb{R}^{N}}, together with B 0RN=0RNB\,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 and 0RN⋅0RN=00_{\mathbb{R}^{N}}\cdot 0_{\mathbb{R}^{N}}=0, gives wλ(0RN)≤0w^{\lambda}(0_{\mathbb{R}^{N}})\le0. Hence wλ(0RN)=0w^{\lambda}(0_{\mathbb{R}^{N}})=0.

Applying claim 1 of Domination, Monotonicity and Semiconvexity of the Sup-Convolution to u1u_{1} and to u2u_{2} gives 0=u1(0Rm)≤u1λ(0Rm)0=u_{1}(0_{\mathbb{R}^{m}})\le u_{1}^{\lambda}(0_{\mathbb{R}^{m}}) and 0≤u2λ(0Rn)0\le u_{2}^{\lambda}(0_{\mathbb{R}^{n}}), while the separation identity at ξ=0Rm\xi=0_{\mathbb{R}^{m}}, η=0Rn\eta=0_{\mathbb{R}^{n}} gives

u1λ(0Rm)+u2λ(0Rn)=wλ(0RN)=0.u_{1}^{\lambda}\bigl(0_{\mathbb{R}^{m}}\bigr)+u_{2}^{\lambda}\bigl(0_{\mathbb{R}^{n}}\bigr)=w^{\lambda}\bigl(0_{\mathbb{R}^{N}}\bigr)=0 .

Suppose u1λ(0Rm)≠0u_{1}^{\lambda}(0_{\mathbb{R}^{m}})\ne0. Then 0<u1λ(0Rm)0<u_{1}^{\lambda}(0_{\mathbb{R}^{m}}), the strict order of an ordered field being defined by a≤ba\le b together with a≠ba\ne b. By the last display, u2λ(0Rn)u_{2}^{\lambda}(0_{\mathbb{R}^{n}}) is the additive inverse of u1λ(0Rm)u_{1}^{\lambda}(0_{\mathbb{R}^{m}}), so u2λ(0Rn)<0u_{2}^{\lambda}(0_{\mathbb{R}^{n}})<0 by claim 4 of Elementary Order Arithmetic in an Ordered Field applied to 0<u1λ(0Rm)0<u_{1}^{\lambda}(0_{\mathbb{R}^{m}}), contradicting 0≤u2λ(0Rn)0\le u_{2}^{\lambda}(0_{\mathbb{R}^{n}}). Hence u1λ(0Rm)=0u_{1}^{\lambda}(0_{\mathbb{R}^{m}})=0, and then u2λ(0Rn)=0u_{2}^{\lambda}(0_{\mathbb{R}^{n}})=0 as well.

Step 3 (the semiconvex quadratic-maximum lemma). By claim 3 of Domination, Monotonicity and Semiconvexity of the Sup-Convolution the function wλw^{\lambda} is semiconvex on RN\mathbb{R}^{N} with constant λ\lambda, and by Steps 1 and 2,

wλ(z)−12 z⋅(Bz)≤0=wλ(0RN)for every z∈RN.w^{\lambda}(z)-\tfrac{1}{2}\,z\cdot(Bz)\le 0=w^{\lambda}\bigl(0_{\mathbb{R}^{N}}\bigr)\qquad\text{for every }z\in\mathbb{R}^{N}.

Thus Second-Order Test Data at a Global Quadratic Maximum of a Semiconvex Function (i) applies in dimension NN with the constant λ\lambda, the function wλw^{\lambda} and the matrix BB: there are Z∈S(N)Z\in\mathcal{S}(N) and a sequence (zk)k∈N(z_{k})_{k\in\mathbb{N}} in RN\mathbb{R}^{N} such that wλw^{\lambda} is twice differentiable at every zkz_{k}, the sequences (zk)(z_{k}) and (Dwλ(zk))\bigl(Dw^{\lambda}(z_{k})\bigr) converge to 0RN0_{\mathbb{R}^{N}}, the sequence (D2wλ(zk))\bigl(D^{2}w^{\lambda}(z_{k})\bigr) converges to ZZ in S(N)\mathcal{S}(N), and

−λIN⪯Z⪯B.-\lambda I_{N}\preceq Z\preceq B .

Write Zk=D2wλ(zk)Z_{k}=D^{2}w^{\lambda}(z_{k}).

Step 4 (splitting the data). Since ι\iota is a bijection, for each kk there is a unique pair (ξk,ηk)∈Rm×Rn(\xi_{k},\eta_{k})\in\mathbb{R}^{m}\times\mathbb{R}^{n} with zk=ι(ξk,ηk)z_{k}=\iota(\xi_{k},\eta_{k}), and there is a unique pair (pk1,pk2)(p^{1}_{k},p^{2}_{k}) with ι(pk1,pk2)=Dwλ(zk)\iota(p^{1}_{k},p^{2}_{k})=Dw^{\lambda}(z_{k}). Because ι\iota is surjective, the set {ι(ξ,η):ξ∈Rm, η∈Rn}\{\iota(\xi,\eta):\xi\in\mathbb{R}^{m},\ \eta\in\mathbb{R}^{n}\} is all of RN\mathbb{R}^{N}, and by the separation identity displayed at the start of this proof the function determined on it by u1λu_{1}^{\lambda} and u2λu_{2}^{\lambda} in the sense of Twice Differentiability of a Sum in Separated Variables is exactly wλw^{\lambda}. Applying Twice Differentiability of a Sum in Separated Variables (iii) with U1=RmU_{1}=\mathbb{R}^{m}, U2=RnU_{2}=\mathbb{R}^{n}, v1=u1λv_{1}=u_{1}^{\lambda}, v2=u2λv_{2}=u_{2}^{\lambda} and the point zkz_{k}, we obtain: u1λu_{1}^{\lambda} is twice differentiable at ξk\xi_{k} with first-order coefficient pk1p^{1}_{k} and Hessian Zk11Z_{k}^{11}; u2λu_{2}^{\lambda} is twice differentiable at ηk\eta_{k} with first-order coefficient pk2p^{2}_{k} and Hessian Zk22Z_{k}^{22}; every entry of Zk12Z_{k}^{12} equals 00; and Zk=Zk11⊕Zk22Z_{k}=Z_{k}^{11}\oplus Z_{k}^{22}. Here the blocks are those of Block Diagonal Symmetric Matrices and the Blocks of a Symmetric Matrix (v).

Step 5 (passing to the limit). By Concatenation and the Sup-Convolution of a Sum in Separated Variables (i), from (ι(ξk,ηk))=(zk)\bigl(\iota(\xi_{k},\eta_{k})\bigr)=(z_{k}) converging to 0RN=ι(0Rm,0Rn)0_{\mathbb{R}^{N}}=\iota\bigl(0_{\mathbb{R}^{m}},0_{\mathbb{R}^{n}}\bigr) we get that (ξk)(\xi_{k}) converges to 0Rm0_{\mathbb{R}^{m}} and (ηk)(\eta_{k}) converges to 0Rn0_{\mathbb{R}^{n}}; likewise, from (ι(pk1,pk2))=(Dwλ(zk))\bigl(\iota(p^{1}_{k},p^{2}_{k})\bigr)=\bigl(Dw^{\lambda}(z_{k})\bigr) converging to 0RN0_{\mathbb{R}^{N}} we get that (pk1)(p^{1}_{k}) converges to 0Rm0_{\mathbb{R}^{m}} and (pk2)(p^{2}_{k}) converges to 0Rn0_{\mathbb{R}^{n}}.

Next we show that every entry of Z12Z^{12} equals 00. Let i∈[m]i\in[m] and j∈[n]j\in[n]. By Block Diagonal Symmetric Matrices and the Blocks of a Symmetric Matrix (v) we have (Zk12)ij=(Zk)i,m+j=0(Z_{k}^{12})_{ij}=(Z_{k})_{i,m+j}=0 and (Z12)ij=Zi,m+j(Z^{12})_{ij}=Z_{i,m+j}. The matrix Zk−ZZ_{k}-Z lies in S(N)\mathcal{S}(N) and its entry in row ii and column m+jm+j is (Zk)i,m+j−Zi,m+j=−Zi,m+j(Z_{k})_{i,m+j}-Z_{i,m+j}=-Z_{i,m+j}, so Vector, Entry and Comparison Bounds for the Norm of a Symmetric Real Matrix (iv) gives

∣Zi,m+j∣≤∥Zk−Z∥=dS(N)(Zk,Z)for every k∈N,\bigl|Z_{i,m+j}\bigr|\le\lVert Z_{k}-Z\rVert=d_{\mathcal{S}(N)}(Z_{k},Z)\qquad\text{for every }k\in\mathbb{N},

using claim 2 of Properties of the Absolute Value in an Ordered Field for the sign. If Zi,m+j≠0Z_{i,m+j}\ne0 then ∣Zi,m+j∣\bigl|Z_{i,m+j}\bigr| is positive by claim 1 of Properties of the Absolute Value in an Ordered Field together with claim 6 there applied with c=0c=0; but (Zk)(Z_{k}) converges to ZZ, so there is kk with dS(N)(Zk,Z)<∣Zi,m+j∣d_{\mathcal{S}(N)}(Z_{k},Z)<\bigl|Z_{i,m+j}\bigr|, contradicting the display. Hence Zi,m+j=0Z_{i,m+j}=0, and by Block Diagonal Symmetric Matrices and the Blocks of a Symmetric Matrix (v) we conclude Z=Z11⊕Z22Z=Z^{11}\oplus Z^{22}.

Put X1=Z11∈S(m)X_{1}=Z^{11}\in\mathcal{S}(m) and X2=Z22∈S(n)X_{2}=Z^{22}\in\mathcal{S}(n), so that Z=X1⊕X2Z=X_{1}\oplus X_{2}. Since Zk=Zk11⊕Zk22Z_{k}=Z_{k}^{11}\oplus Z_{k}^{22} converges to X1⊕X2X_{1}\oplus X_{2} in S(N)\mathcal{S}(N), Block Diagonal Symmetric Matrices and the Blocks of a Symmetric Matrix (iii) gives that (Zk11)(Z_{k}^{11}) converges to X1X_{1} in S(m)\mathcal{S}(m) and (Zk22)(Z_{k}^{22}) converges to X2X_{2} in S(n)\mathcal{S}(n).

Finally, (u1λ(ξk))\bigl(u_{1}^{\lambda}(\xi_{k})\bigr) converges to u1λ(0Rm)u_{1}^{\lambda}(0_{\mathbb{R}^{m}}). Indeed Rm\mathbb{R}^{m} is open and convex and u1λu_{1}^{\lambda} is semiconvex on it with the nonnegative constant λ\lambda, by claim 3 of Domination, Monotonicity and Semiconvexity of the Sup-Convolution, so claim 2 of Local Lipschitz Bound and Continuity for a Semiconvex Function on an Open Convex Set, applied with S=U=RmS=U=\mathbb{R}^{m} at the point 0Rm0_{\mathbb{R}^{m}}, provides for each positive ε′∈R\varepsilon'\in\mathbb{R} a positive δ∈R\delta\in\mathbb{R} such that ∥y−0Rm∥<δ\lVert y-0_{\mathbb{R}^{m}}\rVert<\delta implies ∣u1λ(y)−u1λ(0Rm)∣<ε′\bigl|u_{1}^{\lambda}(y)-u_{1}^{\lambda}(0_{\mathbb{R}^{m}})\bigr|<\varepsilon'; choosing KK with dE(ξk,0Rm)<δd_{E}(\xi_{k},0_{\mathbb{R}^{m}})<\delta for k≥Kk\ge K gives the assertion. The same argument gives that (u2λ(ηk))\bigl(u_{2}^{\lambda}(\eta_{k})\bigr) converges to u2λ(0Rn)u_{2}^{\lambda}(0_{\mathbb{R}^{n}}).

Step 6 (test data for the sup-convolutions). For each kk the function u1λu_{1}^{\lambda} is twice differentiable at ξk\xi_{k} with first-order coefficient pk1p^{1}_{k} and Hessian Zk11Z_{k}^{11}, so by Quadratic Test Functions, Limits, Translation and Locality for Approximability by Test Data (ii), applied with U=RmU=\mathbb{R}^{m} and u=u1λu=u_{1}^{\lambda}, the quadruple (ξk,u1λ(ξk),pk1,Zk11)\bigl(\xi_{k},u_{1}^{\lambda}(\xi_{k}),p^{1}_{k},Z_{k}^{11}\bigr) is approximable by test data from above for u1λu_{1}^{\lambda}. By Step 5 the sequences (ξk)(\xi_{k}), (u1λ(ξk))\bigl(u_{1}^{\lambda}(\xi_{k})\bigr), (pk1)(p^{1}_{k}) and (Zk11)(Z_{k}^{11}) converge to 0Rm0_{\mathbb{R}^{m}}, u1λ(0Rm)u_{1}^{\lambda}(0_{\mathbb{R}^{m}}), 0Rm0_{\mathbb{R}^{m}} and X1X_{1} respectively, so Quadratic Test Functions, Limits, Translation and Locality for Approximability by Test Data (iii) shows that

(0Rm, u1λ(0Rm), 0Rm, X1)\bigl(0_{\mathbb{R}^{m}},\,u_{1}^{\lambda}(0_{\mathbb{R}^{m}}),\,0_{\mathbb{R}^{m}},\,X_{1}\bigr)

is approximable by test data from above for u1λu_{1}^{\lambda}. The same argument gives that (0Rn,u2λ(0Rn),0Rn,X2)\bigl(0_{\mathbb{R}^{n}},u_{2}^{\lambda}(0_{\mathbb{R}^{n}}),0_{\mathbb{R}^{n}},X_{2}\bigr) is approximable by test data from above for u2λu_{2}^{\lambda}.

Step 7 (transfer to u1u_{1} and u2u_{2}; proof of claim 1). The hypotheses of Transfer of Approximating Test Data from the Sup-Convolution to the Original Function hold with M=mM=m, with v=u1v=u_{1}, which is upper semicontinuous on Rm\mathbb{R}^{m} and has the upper bound C1C_{1}, with the parameter λ\lambda, whose sup-convolution is u1λu_{1}^{\lambda}, and with η0=0Rm\eta_{0}=0_{\mathbb{R}^{m}}, q0=0Rmq_{0}=0_{\mathbb{R}^{m}} and Y=X1Y=X_{1}, by Step 6. Here

z0=0Rm+λ−1 0Rm=0Rmz_{0}=0_{\mathbb{R}^{m}}+\lambda^{-1}\,0_{\mathbb{R}^{m}}=0_{\mathbb{R}^{m}}

by the vector space identities of Euclidean Space Rn\mathbb{R}^n is a Real Vector Space, so Transfer of Approximating Test Data from the Sup-Convolution to the Original Function (ii) gives that

(0Rm, u1(0Rm), 0Rm, X1)\bigl(0_{\mathbb{R}^{m}},\,u_{1}(0_{\mathbb{R}^{m}}),\,0_{\mathbb{R}^{m}},\,X_{1}\bigr)

is approximable by test data from above for u1u_{1}. The same argument with M=nM=n, v=u2v=u_{2}, C2C_{2} and Y=X2Y=X_{2} gives that (0Rn,u2(0Rn),0Rn,X2)\bigl(0_{\mathbb{R}^{n}},u_{2}(0_{\mathbb{R}^{n}}),0_{\mathbb{R}^{n}},X_{2}\bigr) is approximable by test data from above for u2u_{2}. This is claim 1.

Step 8 (proof of claim 2). By Steps 3 and 5, X1⊕X2=ZX_{1}\oplus X_{2}=Z and

−(ε−1+∥A∥)IN=−λIN⪯Z⪯B=A+εA2,-\bigl(\varepsilon^{-1}+\lVert A\rVert\bigr)I_{N}=-\lambda I_{N}\preceq Z\preceq B=A+\varepsilon A^{2},

which is claim 2.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…