Throughout we use the notation of the statement. We record that ε I n ∈ S ( n ) \varepsilon I_{n}\in\mathcal{S}(n) ε I n ∈ S ( n ) with ∥ ε I n ∥ = ∣ ε ∣ \lVert\varepsilon I_{n}\rVert=|\varepsilon| ∥ ε I n ∥ = ∣ ε ∣ for every ε ∈ R \varepsilon\in\mathbb{R} ε ∈ R , by Vector, Entry and Comparison Bounds for the Norm of a Symmetric Real Matrix (vi) , and that h ⋅ ( ( ε I n ) h ) = ε ∥ h ∥ 2 h\cdot\bigl((\varepsilon I_{n})h\bigr)=\varepsilon\lVert h\rVert^{2} h ⋅ ( ( ε I n ) h ) = ε ∥ h ∥ 2 for every h ∈ R n h\in\mathbb{R}^{n} h ∈ R n , by claims 1 and 2 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum , claim 5 of The Dot Product on R n \mathbb{R}^n R n Is Symmetric, Bilinear and Positive Definite and claim 1 of Properties of the Euclidean Norm on R n \mathbb{R}^n R n : Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square .
Claim 1. Suppose first that ( x 0 , u ( x 0 ) , p , X ) \bigl(x_{0},u(x_{0}),p,X\bigr) ( x 0 , u ( x 0 ) , p , X ) is approximable by test data from above for u u u , and let ε \varepsilon ε be positive. Put ε ′ = ε 2 \varepsilon'=\tfrac{\varepsilon}{2} ε ′ = 2 ε , positive by claim 8 of Elementary Order Arithmetic in an Ordered Field . By Quadruple Approximable by Test-Function Data (i) applied with ε ′ \varepsilon' ε ′ there are y ∈ U y\in U y ∈ U and φ : U → R \varphi:U\to\mathbb{R} φ : U → R of class C 2 C^{2} C 2 on U U U such that u − φ u-\varphi u − φ has a local maximum at y y y relative to U U U and
d E ( y , x 0 ) < ε ′ , ∣ u ( y ) − u ( x 0 ) ∣ < ε ′ , ∥ D φ ( y ) − p ∥ < ε ′ , d S ( n ) ( D 2 φ ( y ) , X ) < ε ′ . d_{E}(y,x_{0})<\varepsilon',\quad |u(y)-u(x_{0})|<\varepsilon',\quad \lVert D\varphi(y)-p\rVert<\varepsilon',\quad d_{\mathcal{S}(n)}\bigl(D^{2}\varphi(y),X\bigr)<\varepsilon'. d E ( y , x 0 ) < ε ′ , ∣ u ( y ) − u ( x 0 ) ∣ < ε ′ , ∥ D φ ( y ) − p ∥ < ε ′ , d S ( n ) ( D 2 φ ( y ) , X ) < ε ′ .
Put r = D φ ( y ) r=D\varphi(y) r = D φ ( y ) and Y = D 2 φ ( y ) + ε ′ I n Y=D^{2}\varphi(y)+\varepsilon'I_{n} Y = D 2 φ ( y ) + ε ′ I n , which lies in S ( n ) \mathcal{S}(n) S ( n ) by claim 1 of The Positive Semidefinite Ordering is a Partial Order Compatible with the Linear Structure . Since Y − X = ( D 2 φ ( y ) − X ) + ε ′ I n Y-X=\bigl(D^{2}\varphi(y)-X\bigr)+\varepsilon'I_{n} Y − X = ( D 2 φ ( y ) − X ) + ε ′ I n , claim 5 of Properties of the Norm of a Symmetric Real Matrix gives
d S ( n ) ( Y , X ) = ∥ Y − X ∥ ≤ d S ( n ) ( D 2 φ ( y ) , X ) + ε ′ < ε ′ + ε ′ = ε , d_{\mathcal{S}(n)}(Y,X)=\lVert Y-X\rVert\le d_{\mathcal{S}(n)}\bigl(D^{2}\varphi(y),X\bigr)+\varepsilon'<\varepsilon'+\varepsilon'=\varepsilon, d S ( n ) ( Y , X ) = ∥ Y − X ∥ ≤ d S ( n ) ( D 2 φ ( y ) , X ) + ε ′ < ε ′ + ε ′ = ε ,
and the first three displayed inequalities hold a fortiori with ε \varepsilon ε in place of ε ′ \varepsilon' ε ′ , since ε ′ < ε \varepsilon'<\varepsilon ε ′ < ε .
By Basic Properties of Twice Differentiability at a Point (ii) the function φ \varphi φ is twice differentiable at y y y with first-order coefficient D φ ( y ) = r D\varphi(y)=r D φ ( y ) = r and Hessian D 2 φ ( y ) D^{2}\varphi(y) D 2 φ ( y ) . Applying Twice Differentiability at a Point (i) with the positive parameter ε ′ 2 \tfrac{\varepsilon'}{2} 2 ε ′ , there is a positive δ 1 \delta_{1} δ 1 such that every h ∈ R n h\in\mathbb{R}^{n} h ∈ R n with ∥ h ∥ < δ 1 \lVert h\rVert<\delta_{1} ∥ h ∥ < δ 1 satisfies y + h ∈ U y+h\in U y + h ∈ U and
φ ( y + h ) − φ ( y ) − r ⋅ h − 1 2 h ⋅ ( D 2 φ ( y ) h ) ≤ ε ′ 2 ∥ h ∥ 2 , \varphi(y+h)-\varphi(y)-r\cdot h-\tfrac{1}{2}h\cdot\bigl(D^{2}\varphi(y)h\bigr)\le\tfrac{\varepsilon'}{2}\lVert h\rVert^{2}, φ ( y + h ) − φ ( y ) − r ⋅ h − 2 1 h ⋅ ( D 2 φ ( y ) h ) ≤ 2 ε ′ ∥ h ∥ 2 ,
using claim 3 of Properties of the Absolute Value in an Ordered Field . Since 1 2 h ⋅ ( Y h ) = 1 2 h ⋅ ( D 2 φ ( y ) h ) + ε ′ 2 ∥ h ∥ 2 \tfrac{1}{2}h\cdot(Yh)=\tfrac{1}{2}h\cdot\bigl(D^{2}\varphi(y)h\bigr)+\tfrac{\varepsilon'}{2}\lVert h\rVert^{2} 2 1 h ⋅ ( Yh ) = 2 1 h ⋅ ( D 2 φ ( y ) h ) + 2 ε ′ ∥ h ∥ 2 by claim 1 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum , claim 5 of The Dot Product on R n \mathbb{R}^n R n Is Symmetric, Bilinear and Positive Definite and the identity recorded at the start, this reads
φ ( y + h ) − φ ( y ) ≤ r ⋅ h + 1 2 h ⋅ ( Y h ) whenever ∥ h ∥ < δ 1 . \varphi(y+h)-\varphi(y)\le r\cdot h+\tfrac{1}{2}h\cdot(Yh)\qquad\text{whenever }\lVert h\rVert<\delta_{1}. φ ( y + h ) − φ ( y ) ≤ r ⋅ h + 2 1 h ⋅ ( Yh ) whenever ∥ h ∥ < δ 1 .
Let δ 2 \delta_{2} δ 2 be positive with the property that every z ∈ U z\in U z ∈ U with d E ( z , y ) < δ 2 d_{E}(z,y)<\delta_{2} d E ( z , y ) < δ 2 satisfies u ( z ) − φ ( z ) ≤ u ( y ) − φ ( y ) u(z)-\varphi(z)\le u(y)-\varphi(y) u ( z ) − φ ( z ) ≤ u ( y ) − φ ( y ) , as provided by Local Maximum of a Function Relative to a Subset of a Metric Space , and let δ \delta δ be the smaller of δ 1 \delta_{1} δ 1 and δ 2 \delta_{2} δ 2 . For z ∈ U z\in U z ∈ U with d E ( z , y ) < δ d_{E}(z,y)<\delta d E ( z , y ) < δ , put h = z − y h=z-y h = z − y , so that ∥ h ∥ = d E ( z , y ) < δ 1 \lVert h\rVert=d_{E}(z,y)<\delta_{1} ∥ h ∥ = d E ( z , y ) < δ 1 by claim 2 of Properties of the Euclidean Norm on R n \mathbb{R}^n R n : Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square ; then
u ( z ) ≤ u ( y ) + φ ( z ) − φ ( y ) ≤ u ( y ) + r ⋅ ( z − y ) + 1 2 ( z − y ) ⋅ ( Y ( z − y ) ) , u(z)\le u(y)+\varphi(z)-\varphi(y)\le u(y)+r\cdot(z-y)+\tfrac{1}{2}(z-y)\cdot\bigl(Y(z-y)\bigr), u ( z ) ≤ u ( y ) + φ ( z ) − φ ( y ) ≤ u ( y ) + r ⋅ ( z − y ) + 2 1 ( z − y ) ⋅ ( Y ( z − y ) ) ,
which is the required inequality.
Conversely, suppose the stated condition holds and let ε \varepsilon ε be positive; take y y y , r r r , Y Y Y and δ \delta δ as provided. By Quadratic and Affine Functions of Class C 2 C^2 C 2 , Translation, and Quadratic Perturbation of Semiconvexity (i) the function Ψ : R n → R \Psi:\mathbb{R}^{n}\to\mathbb{R} Ψ : R n → R with Ψ ( ζ ) = 1 2 ζ ⋅ ( Y ζ ) + r ⋅ ζ + u ( y ) \Psi(\zeta)=\tfrac{1}{2}\zeta\cdot(Y\zeta)+r\cdot\zeta+u(y) Ψ ( ζ ) = 2 1 ζ ⋅ ( Y ζ ) + r ⋅ ζ + u ( y ) is of class C 2 C^{2} C 2 on R n \mathbb{R}^{n} R n with D Ψ ( ζ ) = Y ζ + r D\Psi(\zeta)=Y\zeta+r D Ψ ( ζ ) = Y ζ + r and D 2 Ψ ( ζ ) = Y D^{2}\Psi(\zeta)=Y D 2 Ψ ( ζ ) = Y . By Quadratic and Affine Functions of Class C 2 C^2 C 2 , Translation, and Quadratic Perturbation of Semiconvexity (ii) , applied with the vector − y -y − y , for which R n − ( − y ) = R n \mathbb{R}^{n}-(-y)=\mathbb{R}^{n} R n − ( − y ) = R n , the function φ 0 : R n → R \varphi_{0}:\mathbb{R}^{n}\to\mathbb{R} φ 0 : R n → R with φ 0 ( z ) = Ψ ( z − y ) \varphi_{0}(z)=\Psi(z-y) φ 0 ( z ) = Ψ ( z − y ) is of class C 2 C^{2} C 2 on R n \mathbb{R}^{n} R n with D φ 0 ( z ) = Y ( z − y ) + r D\varphi_{0}(z)=Y(z-y)+r D φ 0 ( z ) = Y ( z − y ) + r and D 2 φ 0 ( z ) = Y D^{2}\varphi_{0}(z)=Y D 2 φ 0 ( z ) = Y ; explicitly
φ 0 ( z ) = u ( y ) + r ⋅ ( z − y ) + 1 2 ( z − y ) ⋅ ( Y ( z − y ) ) , \varphi_{0}(z)=u(y)+r\cdot(z-y)+\tfrac{1}{2}(z-y)\cdot\bigl(Y(z-y)\bigr), φ 0 ( z ) = u ( y ) + r ⋅ ( z − y ) + 2 1 ( z − y ) ⋅ ( Y ( z − y ) ) ,
so that φ 0 ( y ) = u ( y ) \varphi_{0}(y)=u(y) φ 0 ( y ) = u ( y ) , D φ 0 ( y ) = r D\varphi_{0}(y)=r D φ 0 ( y ) = r and D 2 φ 0 ( y ) = Y D^{2}\varphi_{0}(y)=Y D 2 φ 0 ( y ) = Y . Let φ \varphi φ be the restriction of φ 0 \varphi_{0} φ 0 to U U U , which is of class C 2 C^{2} C 2 on U U U with the same gradient and Hessian at points of U U U , by claims 1 and 3 of Restriction of a Cᵏ Function to an Open Subset . For z ∈ U z\in U z ∈ U with d E ( z , y ) < δ d_{E}(z,y)<\delta d E ( z , y ) < δ the hypothesis gives u ( z ) ≤ φ ( z ) u(z)\le\varphi(z) u ( z ) ≤ φ ( z ) , hence
u ( z ) − φ ( z ) ≤ 0 = u ( y ) − φ ( y ) , u(z)-\varphi(z)\le0=u(y)-\varphi(y), u ( z ) − φ ( z ) ≤ 0 = u ( y ) − φ ( y ) ,
so u − φ u-\varphi u − φ has a local maximum at y y y relative to U U U . Since D φ ( y ) = r D\varphi(y)=r D φ ( y ) = r and D 2 φ ( y ) = Y D^{2}\varphi(y)=Y D 2 φ ( y ) = Y , the four numerical inequalities of Quadruple Approximable by Test-Function Data (i) are exactly those assumed, and the quadruple is approximable by test data from above for u u u .
For approximability from below the argument is the same with Y = D 2 φ ( y ) − ε ′ I n Y=D^{2}\varphi(y)-\varepsilon'I_{n} Y = D 2 φ ( y ) − ε ′ I n in the first direction, all the inequalities between values of u u u and of φ \varphi φ reversed, local minima in place of local maxima, and ∥ − ε ′ I n ∥ = ε ′ \lVert-\varepsilon'I_{n}\rVert=\varepsilon' ∥ − ε ′ I n ∥ = ε ′ used in the estimate of d S ( n ) ( Y , X ) d_{\mathcal{S}(n)}(Y,X) d S ( n ) ( Y , X ) .
Claim 2. Let ε \varepsilon ε be positive. Take y = x 0 y=x_{0} y = x 0 , r = p r=p r = p and Y = X + ε 2 I n ∈ S ( n ) Y=X+\tfrac{\varepsilon}{2}I_{n}\in\mathcal{S}(n) Y = X + 2 ε I n ∈ S ( n ) . Then d E ( y , x 0 ) = 0 < ε d_{E}(y,x_{0})=0<\varepsilon d E ( y , x 0 ) = 0 < ε and ∣ u ( y ) − u ( x 0 ) ∣ = 0 < ε |u(y)-u(x_{0})|=0<\varepsilon ∣ u ( y ) − u ( x 0 ) ∣ = 0 < ε and ∥ r − p ∥ = 0 < ε \lVert r-p\rVert=0<\varepsilon ∥ r − p ∥ = 0 < ε , by claim 3 of Properties of the Euclidean Norm on R n \mathbb{R}^n R n : Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square , while d S ( n ) ( Y , X ) = ∥ ε 2 I n ∥ = ε 2 < ε d_{\mathcal{S}(n)}(Y,X)=\lVert\tfrac{\varepsilon}{2}I_{n}\rVert=\tfrac{\varepsilon}{2}<\varepsilon d S ( n ) ( Y , X ) = ∥ 2 ε I n ∥ = 2 ε < ε . Applying Twice Differentiability at a Point (i) with the positive parameter ε 4 \tfrac{\varepsilon}{4} 4 ε , there is a positive δ \delta δ such that ∥ h ∥ < δ \lVert h\rVert<\delta ∥ h ∥ < δ implies x 0 + h ∈ U x_{0}+h\in U x 0 + h ∈ U and
u ( x 0 + h ) − u ( x 0 ) − p ⋅ h − 1 2 h ⋅ ( X h ) ≤ ε 4 ∥ h ∥ 2 . u(x_{0}+h)-u(x_{0})-p\cdot h-\tfrac{1}{2}h\cdot(Xh)\le\tfrac{\varepsilon}{4}\lVert h\rVert^{2}. u ( x 0 + h ) − u ( x 0 ) − p ⋅ h − 2 1 h ⋅ ( X h ) ≤ 4 ε ∥ h ∥ 2 .
Since 1 2 h ⋅ ( Y h ) = 1 2 h ⋅ ( X h ) + ε 4 ∥ h ∥ 2 \tfrac{1}{2}h\cdot(Yh)=\tfrac{1}{2}h\cdot(Xh)+\tfrac{\varepsilon}{4}\lVert h\rVert^{2} 2 1 h ⋅ ( Yh ) = 2 1 h ⋅ ( X h ) + 4 ε ∥ h ∥ 2 , this gives, for z ∈ U z\in U z ∈ U with d E ( z , x 0 ) < δ d_{E}(z,x_{0})<\delta d E ( z , x 0 ) < δ and h = z − y h=z-y h = z − y ,
u ( z ) ≤ u ( y ) + r ⋅ ( z − y ) + 1 2 ( z − y ) ⋅ ( Y ( z − y ) ) , u(z)\le u(y)+r\cdot(z-y)+\tfrac{1}{2}(z-y)\cdot\bigl(Y(z-y)\bigr), u ( z ) ≤ u ( y ) + r ⋅ ( z − y ) + 2 1 ( z − y ) ⋅ ( Y ( z − y ) ) ,
so claim 1 gives approximability from above. Taking instead Y = X − ε 2 I n Y=X-\tfrac{\varepsilon}{2}I_{n} Y = X − 2 ε I n and using the lower estimate supplied by the same application of Twice Differentiability at a Point (i) gives approximability from below.
Claim 3. Let ε \varepsilon ε be positive and put ε ′ = ε 2 \varepsilon'=\tfrac{\varepsilon}{2} ε ′ = 2 ε . By the four convergence hypotheses there are N 1 , N 2 , N 3 , N 4 ∈ N N_{1},N_{2},N_{3},N_{4}\in\mathbb{N} N 1 , N 2 , N 3 , N 4 ∈ N beyond which the corresponding distances are smaller than ε ′ \varepsilon' ε ′ ; put k = N 1 + N 2 + N 3 + N 4 k=N_{1}+N_{2}+N_{3}+N_{4} k = N 1 + N 2 + N 3 + N 4 , which is at least each of them since natural numbers are nonnegative, so that
d E ( y k , x 0 ) < ε ′ , ∣ u ( y k ) − u ( x 0 ) ∣ < ε ′ , ∥ p k − p ∥ < ε ′ , d S ( n ) ( X k , X ) < ε ′ . d_{E}(y_{k},x_{0})<\varepsilon',\quad |u(y_{k})-u(x_{0})|<\varepsilon',\quad \lVert p_{k}-p\rVert<\varepsilon',\quad d_{\mathcal{S}(n)}(X_{k},X)<\varepsilon' . d E ( y k , x 0 ) < ε ′ , ∣ u ( y k ) − u ( x 0 ) ∣ < ε ′ , ∥ p k − p ∥ < ε ′ , d S ( n ) ( X k , X ) < ε ′ .
Since ( y k , u ( y k ) , p k , X k ) \bigl(y_{k},u(y_{k}),p_{k},X_{k}\bigr) ( y k , u ( y k ) , p k , X k ) is approximable by test data from above for u u u , claim 1 applied with ε ′ \varepsilon' ε ′ yields y ∈ U y\in U y ∈ U , r ∈ R n r\in\mathbb{R}^{n} r ∈ R n , Y ∈ S ( n ) Y\in\mathcal{S}(n) Y ∈ S ( n ) and a positive δ \delta δ with
d E ( y , y k ) < ε ′ , ∣ u ( y ) − u ( y k ) ∣ < ε ′ , ∥ r − p k ∥ < ε ′ , d S ( n ) ( Y , X k ) < ε ′ d_{E}(y,y_{k})<\varepsilon',\quad |u(y)-u(y_{k})|<\varepsilon',\quad \lVert r-p_{k}\rVert<\varepsilon',\quad d_{\mathcal{S}(n)}(Y,X_{k})<\varepsilon' d E ( y , y k ) < ε ′ , ∣ u ( y ) − u ( y k ) ∣ < ε ′ , ∥ r − p k ∥ < ε ′ , d S ( n ) ( Y , X k ) < ε ′
and u ( z ) ≤ u ( y ) + r ⋅ ( z − y ) + 1 2 ( z − y ) ⋅ ( Y ( z − y ) ) u(z)\le u(y)+r\cdot(z-y)+\tfrac{1}{2}(z-y)\cdot(Y(z-y)) u ( z ) ≤ u ( y ) + r ⋅ ( z − y ) + 2 1 ( z − y ) ⋅ ( Y ( z − y )) for every z ∈ U z\in U z ∈ U with d E ( z , y ) < δ d_{E}(z,y)<\delta d E ( z , y ) < δ . The triangle inequality for the metric d E d_{E} d E , for the absolute value (claim 5 of Properties of the Absolute Value in an Ordered Field ), for the Euclidean norm (claim 6 of Properties of the Euclidean Norm on R n \mathbb{R}^n R n : Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square ) and for the metric d S ( n ) d_{\mathcal{S}(n)} d S ( n ) gives
d E ( y , x 0 ) < ε , ∣ u ( y ) − u ( x 0 ) ∣ < ε , ∥ r − p ∥ < ε , d S ( n ) ( Y , X ) < ε . d_{E}(y,x_{0})<\varepsilon,\quad |u(y)-u(x_{0})|<\varepsilon,\quad \lVert r-p\rVert<\varepsilon,\quad d_{\mathcal{S}(n)}(Y,X)<\varepsilon . d E ( y , x 0 ) < ε , ∣ u ( y ) − u ( x 0 ) ∣ < ε , ∥ r − p ∥ < ε , d S ( n ) ( Y , X ) < ε .
As ε \varepsilon ε was arbitrary, claim 1 shows that ( x 0 , u ( x 0 ) , p , X ) \bigl(x_{0},u(x_{0}),p,X\bigr) ( x 0 , u ( x 0 ) , p , X ) is approximable by test data from above for u u u . The argument for approximability from below is identical.
Claim 4. Note that x 0 − b ∈ U − b x_{0}-b\in U-b x 0 − b ∈ U − b and that u ~ ( x 0 − b ) = u ( x 0 ) + q ⋅ ( x 0 − b ) + c \tilde{u}(x_{0}-b)=u(x_{0})+q\cdot(x_{0}-b)+c u ~ ( x 0 − b ) = u ( x 0 ) + q ⋅ ( x 0 − b ) + c .
Assume ( x 0 , u ( x 0 ) , p , X ) \bigl(x_{0},u(x_{0}),p,X\bigr) ( x 0 , u ( x 0 ) , p , X ) is approximable by test data from above for u u u and let ε \varepsilon ε be positive. The number 1 + ∥ q ∥ 1+\lVert q\rVert 1 + ∥ q ∥ is positive, so ε 1 = ε ( 1 + ∥ q ∥ ) − 1 \varepsilon_{1}=\varepsilon\,(1+\lVert q\rVert)^{-1} ε 1 = ε ( 1 + ∥ q ∥ ) − 1 is positive, and ε 1 ≤ ε \varepsilon_{1}\le\varepsilon ε 1 ≤ ε because 1 ≤ 1 + ∥ q ∥ 1\le1+\lVert q\rVert 1 ≤ 1 + ∥ q ∥ . Apply claim 1 with ε 1 \varepsilon_{1} ε 1 to obtain y ∈ U y\in U y ∈ U , r r r , Y Y Y and a positive δ \delta δ . Put y ~ = y − b ∈ U − b \tilde{y}=y-b\in U-b y ~ = y − b ∈ U − b and r ~ = r + q \tilde{r}=r+q r ~ = r + q . Then, by claim 2 of Properties of the Euclidean Norm on R n \mathbb{R}^n R n : Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square and the vector space identities,
d E ( y ~ , x 0 − b ) = ∥ y − x 0 ∥ = d E ( y , x 0 ) < ε 1 ≤ ε , d_{E}(\tilde{y},x_{0}-b)=\lVert y-x_{0}\rVert=d_{E}(y,x_{0})<\varepsilon_{1}\le\varepsilon, d E ( y ~ , x 0 − b ) = ∥ y − x 0 ∥ = d E ( y , x 0 ) < ε 1 ≤ ε ,
and ∥ r ~ − ( p + q ) ∥ = ∥ r − p ∥ < ε \lVert\tilde{r}-(p+q)\rVert=\lVert r-p\rVert<\varepsilon ∥ r ~ − ( p + q )∥ = ∥ r − p ∥ < ε , and d S ( n ) ( Y , X ) < ε d_{\mathcal{S}(n)}(Y,X)<\varepsilon d S ( n ) ( Y , X ) < ε . Moreover
u ~ ( y ~ ) − u ~ ( x 0 − b ) = ( u ( y ) − u ( x 0 ) ) + q ⋅ ( y − x 0 ) , \tilde{u}(\tilde{y})-\tilde{u}(x_{0}-b)=\bigl(u(y)-u(x_{0})\bigr)+q\cdot(y-x_{0}), u ~ ( y ~ ) − u ~ ( x 0 − b ) = ( u ( y ) − u ( x 0 ) ) + q ⋅ ( y − x 0 ) ,
so by claim 5 of Properties of the Absolute Value in an Ordered Field and The Cauchy-Schwarz Inequality on R n \mathbb{R}^n R n ,
∣ u ~ ( y ~ ) − u ~ ( x 0 − b ) ∣ < ε 1 + ∥ q ∥ ε 1 = ε 1 ( 1 + ∥ q ∥ ) = ε . \bigl|\tilde{u}(\tilde{y})-\tilde{u}(x_{0}-b)\bigr|<\varepsilon_{1}+\lVert q\rVert\,\varepsilon_{1}=\varepsilon_{1}\bigl(1+\lVert q\rVert\bigr)=\varepsilon . u ~ ( y ~ ) − u ~ ( x 0 − b ) < ε 1 + ∥ q ∥ ε 1 = ε 1 ( 1 + ∥ q ∥ ) = ε .
Finally let z ∈ U − b z\in U-b z ∈ U − b with d E ( z , y ~ ) < δ d_{E}(z,\tilde{y})<\delta d E ( z , y ~ ) < δ . Then z + b ∈ U z+b\in U z + b ∈ U and d E ( z + b , y ) = ∥ z − y ~ ∥ = d E ( z , y ~ ) < δ d_{E}(z+b,y)=\lVert z-\tilde{y}\rVert=d_{E}(z,\tilde{y})<\delta d E ( z + b , y ) = ∥ z − y ~ ∥ = d E ( z , y ~ ) < δ , so
u ( z + b ) ≤ u ( y ) + r ⋅ ( ( z + b ) − y ) + 1 2 ( ( z + b ) − y ) ⋅ ( Y ( ( z + b ) − y ) ) , u(z+b)\le u(y)+r\cdot\bigl((z+b)-y\bigr)+\tfrac{1}{2}\bigl((z+b)-y\bigr)\cdot\Bigl(Y\bigl((z+b)-y\bigr)\Bigr), u ( z + b ) ≤ u ( y ) + r ⋅ ( ( z + b ) − y ) + 2 1 ( ( z + b ) − y ) ⋅ ( Y ( ( z + b ) − y ) ) ,
and ( z + b ) − y = z − y ~ (z+b)-y=z-\tilde{y} ( z + b ) − y = z − y ~ . Adding q ⋅ z + c q\cdot z+c q ⋅ z + c to both sides and using
u ( y ) + q ⋅ z + c = ( u ( y ) + q ⋅ y ~ + c ) + q ⋅ ( z − y ~ ) = u ~ ( y ~ ) + q ⋅ ( z − y ~ ) , u(y)+q\cdot z+c=\bigl(u(y)+q\cdot\tilde{y}+c\bigr)+q\cdot(z-\tilde{y})=\tilde{u}(\tilde{y})+q\cdot(z-\tilde{y}), u ( y ) + q ⋅ z + c = ( u ( y ) + q ⋅ y ~ + c ) + q ⋅ ( z − y ~ ) = u ~ ( y ~ ) + q ⋅ ( z − y ~ ) ,
which holds by claims 2 and 5 of The Dot Product on R n \mathbb{R}^n R n Is Symmetric, Bilinear and Positive Definite , we obtain
u ~ ( z ) ≤ u ~ ( y ~ ) + r ~ ⋅ ( z − y ~ ) + 1 2 ( z − y ~ ) ⋅ ( Y ( z − y ~ ) ) . \tilde{u}(z)\le\tilde{u}(\tilde{y})+\tilde{r}\cdot(z-\tilde{y})+\tfrac{1}{2}(z-\tilde{y})\cdot\bigl(Y(z-\tilde{y})\bigr). u ~ ( z ) ≤ u ~ ( y ~ ) + r ~ ⋅ ( z − y ~ ) + 2 1 ( z − y ~ ) ⋅ ( Y ( z − y ~ ) ) .
By claim 1, applied on the open set U − b U-b U − b to the function u ~ \tilde{u} u ~ , the quadruple ( x 0 − b , u ~ ( x 0 − b ) , p + q , X ) \bigl(x_{0}-b,\tilde{u}(x_{0}-b),p+q,X\bigr) ( x 0 − b , u ~ ( x 0 − b ) , p + q , X ) is approximable by test data from above for u ~ \tilde{u} u ~ .
For the converse, apply what has just been proved to the function u ~ \tilde{u} u ~ on U − b U-b U − b with the vector − b -b − b , the vector − q -q − q and the constant q ⋅ b − c q\cdot b-c q ⋅ b − c . The resulting set is ( U − b ) − ( − b ) = U (U-b)-(-b)=U ( U − b ) − ( − b ) = U and the resulting function is
z ↦ u ~ ( z − b ) + ( − q ) ⋅ z + ( q ⋅ b − c ) = u ( z ) + q ⋅ ( z − b ) + c − q ⋅ z + q ⋅ b − c = u ( z ) , z\mapsto\tilde{u}(z-b)+(-q)\cdot z+\bigl(q\cdot b-c\bigr)=u(z)+q\cdot(z-b)+c-q\cdot z+q\cdot b-c=u(z), z ↦ u ~ ( z − b ) + ( − q ) ⋅ z + ( q ⋅ b − c ) = u ( z ) + q ⋅ ( z − b ) + c − q ⋅ z + q ⋅ b − c = u ( z ) ,
so the conclusion reads that ( ( x 0 − b ) − ( − b ) , u ( x 0 ) , ( p + q ) + ( − q ) , X ) = ( x 0 , u ( x 0 ) , p , X ) \bigl((x_{0}-b)-(-b),\,u(x_{0}),\,(p+q)+(-q),\,X\bigr)=\bigl(x_{0},u(x_{0}),p,X\bigr) ( ( x 0 − b ) − ( − b ) , u ( x 0 ) , ( p + q ) + ( − q ) , X ) = ( x 0 , u ( x 0 ) , p , X ) is approximable by test data from above for u u u , as required. The argument for approximability from below is identical throughout.
Claim 5. Assume ( x 0 , u ( x 0 ) , p , X ) \bigl(x_{0},u(x_{0}),p,X\bigr) ( x 0 , u ( x 0 ) , p , X ) is approximable by test data from above for u u u and let ε \varepsilon ε be positive. Since W W W is open and x 0 ∈ W x_{0}\in W x 0 ∈ W there is a positive ρ \rho ρ with { z : d E ( z , x 0 ) < ρ } ⊆ W \{z:d_{E}(z,x_{0})<\rho\}\subseteq W { z : d E ( z , x 0 ) < ρ } ⊆ W . Let ε 1 \varepsilon_{1} ε 1 be the smaller of ε \varepsilon ε and ρ 2 \tfrac{\rho}{2} 2 ρ , which is positive, and apply claim 1 with ε 1 \varepsilon_{1} ε 1 to obtain y ∈ U y\in U y ∈ U , r r r , Y Y Y and a positive δ \delta δ ; let δ ′ \delta' δ ′ be the smaller of δ \delta δ and ρ 2 \tfrac{\rho}{2} 2 ρ . Since d E ( y , x 0 ) < ε 1 ≤ ρ 2 < ρ d_{E}(y,x_{0})<\varepsilon_{1}\le\tfrac{\rho}{2}<\rho d E ( y , x 0 ) < ε 1 ≤ 2 ρ < ρ we have y ∈ W y\in W y ∈ W , hence y ∈ U ′ y\in U' y ∈ U ′ and u ′ ( y ) = u ( y ) u'(y)=u(y) u ′ ( y ) = u ( y ) ; and u ′ ( x 0 ) = u ( x 0 ) u'(x_{0})=u(x_{0}) u ′ ( x 0 ) = u ( x 0 ) because x 0 ∈ W x_{0}\in W x 0 ∈ W . Therefore the four numerical inequalities hold for u ′ u' u ′ with ε 1 ≤ ε \varepsilon_{1}\le\varepsilon ε 1 ≤ ε in place of ε \varepsilon ε .
Let z ∈ U ′ z\in U' z ∈ U ′ with d E ( z , y ) < δ ′ d_{E}(z,y)<\delta' d E ( z , y ) < δ ′ . By the triangle inequality for d E d_{E} d E ,
d E ( z , x 0 ) ≤ d E ( z , y ) + d E ( y , x 0 ) < ρ 2 + ρ 2 = ρ , d_{E}(z,x_{0})\le d_{E}(z,y)+d_{E}(y,x_{0})<\tfrac{\rho}{2}+\tfrac{\rho}{2}=\rho, d E ( z , x 0 ) ≤ d E ( z , y ) + d E ( y , x 0 ) < 2 ρ + 2 ρ = ρ ,
so z ∈ W z\in W z ∈ W , whence z ∈ U z\in U z ∈ U and u ′ ( z ) = u ( z ) u'(z)=u(z) u ′ ( z ) = u ( z ) ; and d E ( z , y ) < δ d_{E}(z,y)<\delta d E ( z , y ) < δ , so
u ′ ( z ) = u ( z ) ≤ u ( y ) + r ⋅ ( z − y ) + 1 2 ( z − y ) ⋅ ( Y ( z − y ) ) = u ′ ( y ) + r ⋅ ( z − y ) + 1 2 ( z − y ) ⋅ ( Y ( z − y ) ) . u'(z)=u(z)\le u(y)+r\cdot(z-y)+\tfrac{1}{2}(z-y)\cdot\bigl(Y(z-y)\bigr)=u'(y)+r\cdot(z-y)+\tfrac{1}{2}(z-y)\cdot\bigl(Y(z-y)\bigr). u ′ ( z ) = u ( z ) ≤ u ( y ) + r ⋅ ( z − y ) + 2 1 ( z − y ) ⋅ ( Y ( z − y ) ) = u ′ ( y ) + r ⋅ ( z − y ) + 2 1 ( z − y ) ⋅ ( Y ( z − y ) ) .
By claim 1, applied on U ′ U' U ′ to u ′ u' u ′ , the quadruple ( x 0 , u ′ ( x 0 ) , p , X ) \bigl(x_{0},u'(x_{0}),p,X\bigr) ( x 0 , u ′ ( x 0 ) , p , X ) is approximable by test data from above for u ′ u' u ′ . The argument for approximability from below is identical.