Throughout, the notation is that of the statement. Put
λ = ε − 1 + ∥ A ∥ , \lambda=\varepsilon^{-1}+\lVert A\rVert , λ = ε − 1 + ∥ A ∥ ,
which is positive, since ε − 1 \varepsilon^{-1} ε − 1 is positive and 0 ≤ ∥ A ∥ 0\le\lVert A\rVert 0 ≤ ∥ A ∥ by claim 1 of Properties of the Norm of a Symmetric Real Matrix . Recall B = A + ε A 2 ∈ S ( N ) B=A+\varepsilon A^{2}\in\mathcal{S}(N) B = A + ε A 2 ∈ S ( N ) .
Let w : R N → R w:\mathbb{R}^{N}\to\mathbb{R} w : R N → R be the function determined by
w ( ι ( ξ , η ) ) = u 1 ( ξ ) + u 2 ( η ) ( ξ ∈ R m , η ∈ R n ) , w\bigl(\iota(\xi,\eta)\bigr)=u_{1}(\xi)+u_{2}(\eta)\qquad(\xi\in\mathbb{R}^{m},\ \eta\in\mathbb{R}^{n}), w ( ι ( ξ , η ) ) = u 1 ( ξ ) + u 2 ( η ) ( ξ ∈ R m , η ∈ R n ) ,
which is well defined and defined at every point of R N \mathbb{R}^{N} R N because ι \iota ι is a bijection. By Concatenation and the Sup-Convolution of a Sum in Separated Variables §bounded , applied with the parameter λ \lambda λ , the number C 1 + C 2 C_{1}+C_{2} C 1 + C 2 is an upper bound for the set of values of w w w and the sup-convolutions u 1 λ u_{1}^{\lambda} u 1 λ , u 2 λ u_{2}^{\lambda} u 2 λ and w λ w^{\lambda} w λ are defined; and by Concatenation and the Sup-Convolution of a Sum in Separated Variables §separation ,
w λ ( ι ( ξ , η ) ) = u 1 λ ( ξ ) + u 2 λ ( η ) ( ξ ∈ R m , η ∈ R n ) . 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}). w λ ( ι ( ξ , η ) ) = u 1 λ ( ξ ) + u 2 λ ( η ) ( ξ ∈ R m , η ∈ R n ) .
Step 1 (a global quadratic bound for the sup-convolution). Every x ∈ R N x\in\mathbb{R}^{N} x ∈ R N is of the form ι ( ξ , η ) \iota(\xi,\eta) ι ( ξ , η ) , so the hypothesis of the theorem says exactly that
w ( x ) ≤ 1 2 x ⋅ ( A x ) for every x ∈ R N . w(x)\le\tfrac{1}{2}\,x\cdot(Ax)\qquad\text{for every }x\in\mathbb{R}^{N}. w ( x ) ≤ 2 1 x ⋅ ( A x ) for every x ∈ R N .
By A Weighted Young Inequality and the Splitting of a Quadratic Form §splitting , applied in dimension N N N with the matrix A A A and the given positive ε \varepsilon ε , we have for all x , z ∈ R N x,z\in\mathbb{R}^{N} x , z ∈ R N
x ⋅ ( A x ) ≤ z ⋅ ( B z ) + λ ∥ x − z ∥ 2 . x\cdot(Ax)\le z\cdot(Bz)+\lambda\,\lVert x-z\rVert^{2}. x ⋅ ( A x ) ≤ z ⋅ ( B z ) + λ ∥ x − z ∥ 2 .
Multiplying by the positive number 2 − 1 2^{-1} 2 − 1 preserves this inequality: if the two sides are equal so are their products with 2 − 1 2^{-1} 2 − 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 ≤ 1 2 z ⋅ ( B z ) for all x , z ∈ R N . 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}. w ( x ) − 2 λ ∥ x − z ∥ 2 ≤ 2 1 z ⋅ ( B z ) for all x , z ∈ R N .
For fixed z z z this says that 1 2 z ⋅ ( B z ) \tfrac{1}{2}\,z\cdot(Bz) 2 1 z ⋅ ( B z ) is an upper bound for the set S λ , w ( z ) S_{\lambda,w}(z) S λ , w ( z ) of Sup-Convolution of a Function on R M \mathbb{R}^M R M , whose least upper bound is w λ ( z ) w^{\lambda}(z) w λ ( z ) . Hence
w λ ( z ) ≤ 1 2 z ⋅ ( B z ) for every z ∈ R N . w^{\lambda}(z)\le\tfrac{1}{2}\,z\cdot(Bz)\qquad\text{for every }z\in\mathbb{R}^{N}. w λ ( z ) ≤ 2 1 z ⋅ ( B z ) for every z ∈ R N .
Step 2 (the values at the origins). By Concatenation and the Sup-Convolution of a Sum in Separated Variables §concatenation we have ι ( 0 R m , 0 R n ) = 0 R N \iota\bigl(0_{\mathbb{R}^{m}},0_{\mathbb{R}^{n}}\bigr)=0_{\mathbb{R}^{N}} ι ( 0 R m , 0 R n ) = 0 R N , so
w ( 0 R N ) = u 1 ( 0 R m ) + u 2 ( 0 R n ) = 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 . w ( 0 R N ) = u 1 ( 0 R m ) + u 2 ( 0 R n ) = 0.
By claim 1 of Domination, Monotonicity and Semiconvexity of the Sup-Convolution we have w ( 0 R N ) ≤ w λ ( 0 R N ) w(0_{\mathbb{R}^{N}})\le w^{\lambda}(0_{\mathbb{R}^{N}}) w ( 0 R N ) ≤ w λ ( 0 R N ) , that is 0 ≤ w λ ( 0 R N ) 0\le w^{\lambda}(0_{\mathbb{R}^{N}}) 0 ≤ w λ ( 0 R N ) . On the other hand Step 1 with z = 0 R N z=0_{\mathbb{R}^{N}} z = 0 R N , together with B 0 R N = 0 R N B\,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 and 0 R N ⋅ 0 R N = 0 0_{\mathbb{R}^{N}}\cdot 0_{\mathbb{R}^{N}}=0 0 R N ⋅ 0 R N = 0 , gives w λ ( 0 R N ) ≤ 0 w^{\lambda}(0_{\mathbb{R}^{N}})\le0 w λ ( 0 R N ) ≤ 0 . Hence w λ ( 0 R N ) = 0 w^{\lambda}(0_{\mathbb{R}^{N}})=0 w λ ( 0 R N ) = 0 .
Applying claim 1 of Domination, Monotonicity and Semiconvexity of the Sup-Convolution to u 1 u_{1} u 1 and to u 2 u_{2} u 2 gives 0 = u 1 ( 0 R m ) ≤ u 1 λ ( 0 R m ) 0=u_{1}(0_{\mathbb{R}^{m}})\le u_{1}^{\lambda}(0_{\mathbb{R}^{m}}) 0 = u 1 ( 0 R m ) ≤ u 1 λ ( 0 R m ) and 0 ≤ u 2 λ ( 0 R n ) 0\le u_{2}^{\lambda}(0_{\mathbb{R}^{n}}) 0 ≤ u 2 λ ( 0 R n ) , while the separation identity at ξ = 0 R m \xi=0_{\mathbb{R}^{m}} ξ = 0 R m , η = 0 R n \eta=0_{\mathbb{R}^{n}} η = 0 R n gives
u 1 λ ( 0 R m ) + u 2 λ ( 0 R n ) = w λ ( 0 R N ) = 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 . u 1 λ ( 0 R m ) + u 2 λ ( 0 R n ) = w λ ( 0 R N ) = 0.
Suppose u 1 λ ( 0 R m ) ≠ 0 u_{1}^{\lambda}(0_{\mathbb{R}^{m}})\ne0 u 1 λ ( 0 R m ) = 0 . Then 0 < u 1 λ ( 0 R m ) 0<u_{1}^{\lambda}(0_{\mathbb{R}^{m}}) 0 < u 1 λ ( 0 R m ) , 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 . By the last display, u 2 λ ( 0 R n ) u_{2}^{\lambda}(0_{\mathbb{R}^{n}}) u 2 λ ( 0 R n ) is the additive inverse of u 1 λ ( 0 R m ) u_{1}^{\lambda}(0_{\mathbb{R}^{m}}) u 1 λ ( 0 R m ) , so u 2 λ ( 0 R n ) < 0 u_{2}^{\lambda}(0_{\mathbb{R}^{n}})<0 u 2 λ ( 0 R n ) < 0 by claim 4 of Elementary Order Arithmetic in an Ordered Field applied to 0 < u 1 λ ( 0 R m ) 0<u_{1}^{\lambda}(0_{\mathbb{R}^{m}}) 0 < u 1 λ ( 0 R m ) , contradicting 0 ≤ u 2 λ ( 0 R n ) 0\le u_{2}^{\lambda}(0_{\mathbb{R}^{n}}) 0 ≤ u 2 λ ( 0 R n ) . Hence u 1 λ ( 0 R m ) = 0 u_{1}^{\lambda}(0_{\mathbb{R}^{m}})=0 u 1 λ ( 0 R m ) = 0 , and then u 2 λ ( 0 R n ) = 0 u_{2}^{\lambda}(0_{\mathbb{R}^{n}})=0 u 2 λ ( 0 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} w λ is semiconvex on R N \mathbb{R}^{N} R N with constant λ \lambda λ , and by Steps 1 and 2,
w λ ( z ) − 1 2 z ⋅ ( B z ) ≤ 0 = w λ ( 0 R N ) for every z ∈ R N . 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}. w λ ( z ) − 2 1 z ⋅ ( B z ) ≤ 0 = w λ ( 0 R N ) for every z ∈ R N .
Thus Second-Order Test Data at a Global Quadratic Maximum of a Semiconvex Function §sequence applies in dimension N N N with the constant λ \lambda λ , the function w λ w^{\lambda} w λ and the matrix B B B : there are Z ∈ S ( N ) Z\in\mathcal{S}(N) Z ∈ S ( N ) and a sequence ( z k ) k ∈ N (z_{k})_{k\in\mathbb{N}} ( z k ) k ∈ N in R N \mathbb{R}^{N} R N such that w λ w^{\lambda} w λ is twice differentiable at every z k z_{k} z k , the sequences ( z k ) (z_{k}) ( z k ) and ( D w λ ( z k ) ) \bigl(Dw^{\lambda}(z_{k})\bigr) ( D w λ ( z k ) ) converge to 0 R N 0_{\mathbb{R}^{N}} 0 R N , the sequence ( D 2 w λ ( z k ) ) \bigl(D^{2}w^{\lambda}(z_{k})\bigr) ( D 2 w λ ( z k ) ) converges to Z Z Z in S ( N ) \mathcal{S}(N) S ( N ) , and
− λ I N ⪯ Z ⪯ B . -\lambda I_{N}\preceq Z\preceq B . − λ I N ⪯ Z ⪯ B .
Write Z k = D 2 w λ ( z k ) Z_{k}=D^{2}w^{\lambda}(z_{k}) Z k = D 2 w λ ( z k ) .
Step 4 (splitting the data). Since ι \iota ι is a bijection, for each k k k there is a unique pair ( ξ k , η k ) ∈ R m × R n (\xi_{k},\eta_{k})\in\mathbb{R}^{m}\times\mathbb{R}^{n} ( ξ k , η k ) ∈ R m × R n with z k = ι ( ξ k , η k ) z_{k}=\iota(\xi_{k},\eta_{k}) z k = ι ( ξ k , η k ) , and there is a unique pair ( p k 1 , p k 2 ) (p^{1}_{k},p^{2}_{k}) ( p k 1 , p k 2 ) with ι ( p k 1 , p k 2 ) = D w λ ( z k ) \iota(p^{1}_{k},p^{2}_{k})=Dw^{\lambda}(z_{k}) ι ( p k 1 , p k 2 ) = D w λ ( z k ) . Because ι \iota ι is surjective, the set { ι ( ξ , η ) : ξ ∈ R m , η ∈ R n } \{\iota(\xi,\eta):\xi\in\mathbb{R}^{m},\ \eta\in\mathbb{R}^{n}\} { ι ( ξ , η ) : ξ ∈ R m , η ∈ R n } is all of R N \mathbb{R}^{N} R N , and by the separation identity displayed at the start of this proof the function determined on it by u 1 λ u_{1}^{\lambda} u 1 λ and u 2 λ u_{2}^{\lambda} u 2 λ in the sense of Twice Differentiability of a Sum in Separated Variables is exactly w λ w^{\lambda} w λ . Applying Twice Differentiability of a Sum in Separated Variables §splitting with U 1 = R m U_{1}=\mathbb{R}^{m} U 1 = R m , U 2 = R n U_{2}=\mathbb{R}^{n} U 2 = R n , v 1 = u 1 λ v_{1}=u_{1}^{\lambda} v 1 = u 1 λ , v 2 = u 2 λ v_{2}=u_{2}^{\lambda} v 2 = u 2 λ and the point z k z_{k} z k , we obtain: u 1 λ u_{1}^{\lambda} u 1 λ is twice differentiable at ξ k \xi_{k} ξ k with first-order coefficient p k 1 p^{1}_{k} p k 1 and Hessian Z k 11 Z_{k}^{11} Z k 11 ; u 2 λ u_{2}^{\lambda} u 2 λ is twice differentiable at η k \eta_{k} η k with first-order coefficient p k 2 p^{2}_{k} p k 2 and Hessian Z k 22 Z_{k}^{22} Z k 22 ; every entry of Z k 12 Z_{k}^{12} Z k 12 equals 0 0 0 ; and Z k = Z k 11 ⊕ Z k 22 Z_{k}=Z_{k}^{11}\oplus Z_{k}^{22} Z k = Z k 11 ⊕ Z k 22 . Here the blocks are those of Block Diagonal Symmetric Matrices and the Blocks of a Symmetric Matrix §blocks .
Step 5 (passing to the limit). By Concatenation and the Sup-Convolution of a Sum in Separated Variables §concatenation , from ( ι ( ξ k , η k ) ) = ( z k ) \bigl(\iota(\xi_{k},\eta_{k})\bigr)=(z_{k}) ( ι ( ξ k , η k ) ) = ( z k ) converging to 0 R N = ι ( 0 R m , 0 R n ) 0_{\mathbb{R}^{N}}=\iota\bigl(0_{\mathbb{R}^{m}},0_{\mathbb{R}^{n}}\bigr) 0 R N = ι ( 0 R m , 0 R n ) we get that ( ξ k ) (\xi_{k}) ( ξ k ) converges to 0 R m 0_{\mathbb{R}^{m}} 0 R m and ( η k ) (\eta_{k}) ( η k ) converges to 0 R n 0_{\mathbb{R}^{n}} 0 R n ; likewise, from ( ι ( p k 1 , p k 2 ) ) = ( D w λ ( z k ) ) \bigl(\iota(p^{1}_{k},p^{2}_{k})\bigr)=\bigl(Dw^{\lambda}(z_{k})\bigr) ( ι ( p k 1 , p k 2 ) ) = ( D w λ ( z k ) ) converging to 0 R N 0_{\mathbb{R}^{N}} 0 R N we get that ( p k 1 ) (p^{1}_{k}) ( p k 1 ) converges to 0 R m 0_{\mathbb{R}^{m}} 0 R m and ( p k 2 ) (p^{2}_{k}) ( p k 2 ) converges to 0 R n 0_{\mathbb{R}^{n}} 0 R n .
Next we show that every entry of Z 12 Z^{12} Z 12 equals 0 0 0 . Let i ∈ [ m ] i\in[m] i ∈ [ m ] and j ∈ [ n ] j\in[n] j ∈ [ n ] . By Block Diagonal Symmetric Matrices and the Blocks of a Symmetric Matrix §blocks we have ( Z k 12 ) i j = ( Z k ) i , m + j = 0 (Z_{k}^{12})_{ij}=(Z_{k})_{i,m+j}=0 ( Z k 12 ) ij = ( Z k ) i , m + j = 0 and ( Z 12 ) i j = Z i , m + j (Z^{12})_{ij}=Z_{i,m+j} ( Z 12 ) ij = Z i , m + j . The matrix Z k − Z Z_{k}-Z Z k − Z lies in S ( N ) \mathcal{S}(N) S ( N ) and its entry in row i i i and column m + j m+j m + j is ( Z k ) i , m + j − Z i , m + j = − Z i , m + j (Z_{k})_{i,m+j}-Z_{i,m+j}=-Z_{i,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 §entry-bound gives
∣ Z i , m + j ∣ ≤ ∥ Z k − Z ∥ = d S ( N ) ( Z k , 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}, Z i , m + j ≤ ∥ Z k − Z ∥ = d S ( N ) ( Z k , Z ) for every k ∈ N ,
using claim 2 of Properties of the Absolute Value in an Ordered Field for the sign. If Z i , m + j ≠ 0 Z_{i,m+j}\ne0 Z i , m + j = 0 then ∣ Z i , m + j ∣ \bigl|Z_{i,m+j}\bigr| Z i , m + j is positive by claim 1 of Properties of the Absolute Value in an Ordered Field together with claim 6 there applied with c = 0 c=0 c = 0 ; but ( Z k ) (Z_{k}) ( Z k ) converges to Z Z Z , so there is k k k with d S ( N ) ( Z k , Z ) < ∣ Z i , m + j ∣ d_{\mathcal{S}(N)}(Z_{k},Z)<\bigl|Z_{i,m+j}\bigr| d S ( N ) ( Z k , Z ) < Z i , m + j , contradicting the display. Hence Z i , m + j = 0 Z_{i,m+j}=0 Z i , m + j = 0 , and by Block Diagonal Symmetric Matrices and the Blocks of a Symmetric Matrix §blocks we conclude Z = Z 11 ⊕ Z 22 Z=Z^{11}\oplus Z^{22} Z = Z 11 ⊕ Z 22 .
Put X 1 = Z 11 ∈ S ( m ) X_{1}=Z^{11}\in\mathcal{S}(m) X 1 = Z 11 ∈ S ( m ) and X 2 = Z 22 ∈ S ( n ) X_{2}=Z^{22}\in\mathcal{S}(n) X 2 = Z 22 ∈ S ( n ) , so that Z = X 1 ⊕ X 2 Z=X_{1}\oplus X_{2} Z = X 1 ⊕ X 2 . Since Z k = Z k 11 ⊕ Z k 22 Z_{k}=Z_{k}^{11}\oplus Z_{k}^{22} Z k = Z k 11 ⊕ Z k 22 converges to X 1 ⊕ X 2 X_{1}\oplus X_{2} X 1 ⊕ X 2 in S ( N ) \mathcal{S}(N) S ( N ) , Block Diagonal Symmetric Matrices and the Blocks of a Symmetric Matrix §norm gives that ( Z k 11 ) (Z_{k}^{11}) ( Z k 11 ) converges to X 1 X_{1} X 1 in S ( m ) \mathcal{S}(m) S ( m ) and ( Z k 22 ) (Z_{k}^{22}) ( Z k 22 ) converges to X 2 X_{2} X 2 in S ( n ) \mathcal{S}(n) S ( n ) .
Finally, ( u 1 λ ( ξ k ) ) \bigl(u_{1}^{\lambda}(\xi_{k})\bigr) ( u 1 λ ( ξ k ) ) converges to u 1 λ ( 0 R m ) u_{1}^{\lambda}(0_{\mathbb{R}^{m}}) u 1 λ ( 0 R m ) . Indeed R m \mathbb{R}^{m} R m is open and convex and u 1 λ u_{1}^{\lambda} u 1 λ 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 = R m S=U=\mathbb{R}^{m} S = U = R m at the point 0 R m 0_{\mathbb{R}^{m}} 0 R m , provides for each positive ε ′ ∈ R \varepsilon'\in\mathbb{R} ε ′ ∈ R a positive δ ∈ R \delta\in\mathbb{R} δ ∈ R such that ∥ y − 0 R m ∥ < δ \lVert y-0_{\mathbb{R}^{m}}\rVert<\delta ∥ y − 0 R m ∥ < δ implies ∣ u 1 λ ( y ) − u 1 λ ( 0 R m ) ∣ < ε ′ \bigl|u_{1}^{\lambda}(y)-u_{1}^{\lambda}(0_{\mathbb{R}^{m}})\bigr|<\varepsilon' u 1 λ ( y ) − u 1 λ ( 0 R m ) < ε ′ ; choosing K K K with d E ( ξ k , 0 R m ) < δ d_{E}(\xi_{k},0_{\mathbb{R}^{m}})<\delta d E ( ξ k , 0 R m ) < δ for k ≥ K k\ge K k ≥ K gives the assertion. The same argument gives that ( u 2 λ ( η k ) ) \bigl(u_{2}^{\lambda}(\eta_{k})\bigr) ( u 2 λ ( η k ) ) converges to u 2 λ ( 0 R n ) u_{2}^{\lambda}(0_{\mathbb{R}^{n}}) u 2 λ ( 0 R n ) .
Step 6 (test data for the sup-convolutions). For each k k k the function u 1 λ u_{1}^{\lambda} u 1 λ is twice differentiable at ξ k \xi_{k} ξ k with first-order coefficient p k 1 p^{1}_{k} p k 1 and Hessian Z k 11 Z_{k}^{11} Z k 11 , so by Quadratic Test Functions, Limits, Translation and Locality for Approximability by Test Data §twice-differentiable , applied with U = R m U=\mathbb{R}^{m} U = R m and u = u 1 λ u=u_{1}^{\lambda} u = u 1 λ , the quadruple ( ξ k , u 1 λ ( ξ k ) , p k 1 , Z k 11 ) \bigl(\xi_{k},u_{1}^{\lambda}(\xi_{k}),p^{1}_{k},Z_{k}^{11}\bigr) ( ξ k , u 1 λ ( ξ k ) , p k 1 , Z k 11 ) is approximable by test data from above for u 1 λ u_{1}^{\lambda} u 1 λ . By Step 5 the sequences ( ξ k ) (\xi_{k}) ( ξ k ) , ( u 1 λ ( ξ k ) ) \bigl(u_{1}^{\lambda}(\xi_{k})\bigr) ( u 1 λ ( ξ k ) ) , ( p k 1 ) (p^{1}_{k}) ( p k 1 ) and ( Z k 11 ) (Z_{k}^{11}) ( Z k 11 ) converge to 0 R m 0_{\mathbb{R}^{m}} 0 R m , u 1 λ ( 0 R m ) u_{1}^{\lambda}(0_{\mathbb{R}^{m}}) u 1 λ ( 0 R m ) , 0 R m 0_{\mathbb{R}^{m}} 0 R m and X 1 X_{1} X 1 respectively, so Quadratic Test Functions, Limits, Translation and Locality for Approximability by Test Data §limits shows that
( 0 R m , u 1 λ ( 0 R m ) , 0 R m , X 1 ) \bigl(0_{\mathbb{R}^{m}},\,u_{1}^{\lambda}(0_{\mathbb{R}^{m}}),\,0_{\mathbb{R}^{m}},\,X_{1}\bigr) ( 0 R m , u 1 λ ( 0 R m ) , 0 R m , X 1 )
is approximable by test data from above for u 1 λ u_{1}^{\lambda} u 1 λ . The same argument gives that ( 0 R n , u 2 λ ( 0 R n ) , 0 R n , X 2 ) \bigl(0_{\mathbb{R}^{n}},u_{2}^{\lambda}(0_{\mathbb{R}^{n}}),0_{\mathbb{R}^{n}},X_{2}\bigr) ( 0 R n , u 2 λ ( 0 R n ) , 0 R n , X 2 ) is approximable by test data from above for u 2 λ u_{2}^{\lambda} u 2 λ .
Step 7 (transfer to u 1 u_{1} u 1 and u 2 u_{2} u 2 ; proof of claim 1). The hypotheses of Transfer of Approximating Test Data from the Sup-Convolution to the Original Function hold with M = m M=m M = m , with v = u 1 v=u_{1} v = u 1 , which is upper semicontinuous on R m \mathbb{R}^{m} R m and has the upper bound C 1 C_{1} C 1 , with the parameter λ \lambda λ , whose sup-convolution is u 1 λ u_{1}^{\lambda} u 1 λ , and with η 0 = 0 R m \eta_{0}=0_{\mathbb{R}^{m}} η 0 = 0 R m , q 0 = 0 R m q_{0}=0_{\mathbb{R}^{m}} q 0 = 0 R m and Y = X 1 Y=X_{1} Y = X 1 , by Step 6. Here
z 0 = 0 R m + λ − 1 0 R m = 0 R m z_{0}=0_{\mathbb{R}^{m}}+\lambda^{-1}\,0_{\mathbb{R}^{m}}=0_{\mathbb{R}^{m}} z 0 = 0 R m + λ − 1 0 R m = 0 R m
by the vector space identities of Euclidean Space R n \mathbb{R}^n R n is a Real Vector Space , so Transfer of Approximating Test Data from the Sup-Convolution to the Original Function §transfer gives that
( 0 R m , u 1 ( 0 R m ) , 0 R m , X 1 ) \bigl(0_{\mathbb{R}^{m}},\,u_{1}(0_{\mathbb{R}^{m}}),\,0_{\mathbb{R}^{m}},\,X_{1}\bigr) ( 0 R m , u 1 ( 0 R m ) , 0 R m , X 1 )
is approximable by test data from above for u 1 u_{1} u 1 . The same argument with M = n M=n M = n , v = u 2 v=u_{2} v = u 2 , C 2 C_{2} C 2 and Y = X 2 Y=X_{2} Y = X 2 gives that ( 0 R n , u 2 ( 0 R n ) , 0 R n , X 2 ) \bigl(0_{\mathbb{R}^{n}},u_{2}(0_{\mathbb{R}^{n}}),0_{\mathbb{R}^{n}},X_{2}\bigr) ( 0 R n , u 2 ( 0 R n ) , 0 R n , X 2 ) is approximable by test data from above for u 2 u_{2} u 2 . This is claim 1.
Step 8 (proof of claim 2). By Steps 3 and 5, X 1 ⊕ X 2 = Z X_{1}\oplus X_{2}=Z X 1 ⊕ X 2 = Z and
− ( ε − 1 + ∥ A ∥ ) I N = − λ I N ⪯ Z ⪯ B = A + ε A 2 , -\bigl(\varepsilon^{-1}+\lVert A\rVert\bigr)I_{N}=-\lambda I_{N}\preceq Z\preceq B=A+\varepsilon A^{2}, − ( ε − 1 + ∥ A ∥ ) I N = − λ I N ⪯ Z ⪯ B = A + ε A 2 ,
which is claim 2.