Each result cited is universally quantified over the data in its own statement. Throughout, β = ∥ B ∥ \beta=\lVert B\rVert β = ∥ B ∥ is the norm of B ∈ S ( n ) B\in\mathcal{S}(n) B ∈ S ( n ) , so that ∣ k ⋅ ( B k ) ∣ ≤ β ∥ k ∥ 2 |k\cdot(Bk)|\le\beta\lVert k\rVert^{2} ∣ k ⋅ ( B k ) ∣ ≤ β ∥ k ∥ 2 for every k ∈ R n k\in\mathbb{R}^{n} k ∈ R n by claim 2 of Properties of the Norm of a Symmetric Real Matrix , and 0 ≤ β 0\le\beta 0 ≤ β by claim 1 there.
Claim 1. By Basic Properties of Twice Differentiability at a Point §gradient , f f f is differentiable at y y y with derivative matrix the one-row matrix whose entry in column i i i is the i i i th coordinate of p p p . Since U U U is open and convex and f f f is convex on U U U , Elementary Calculus of the Subdifferential of a Convex Function §gradient gives ∂ U f ( y ) = { g } \partial_{U}f(y)=\{g\} ∂ U f ( y ) = { g } for the point g g g whose i i i th coordinate is that entry, that is, g = p g=p g = p (points of R n \mathbb{R}^{n} R n are equal when their coordinates are). Hence ∂ U f ( y ) = { p } \partial_{U}f(y)=\{p\} ∂ U f ( y ) = { p } .
Claim 2. Let ε > 0 \varepsilon>0 ε > 0 . Put t = min { 1 , ε ( β + 1 ) − 1 } t=\min\{1,\varepsilon(\beta+1)^{-1}\} t = min { 1 , ε ( β + 1 ) − 1 } , which satisfies 0 < t ≤ 1 0<t\le1 0 < t ≤ 1 and β t ≤ ε \beta t\le\varepsilon βt ≤ ε , and η = 1 10 ε t > 0 \eta=\tfrac{1}{10}\varepsilon t>0 η = 10 1 εt > 0 . By the definition of twice differentiability applied with η \eta η there is δ 0 > 0 \delta_{0}>0 δ 0 > 0 such that every h h h with ∥ h ∥ < δ 0 \lVert h\rVert<\delta_{0} ∥ h ∥ < δ 0 satisfies y + h ∈ U y+h\in U y + h ∈ U and
∣ f ( y + h ) − f ( y ) − p ⋅ h − 1 2 h ⋅ ( B h ) ∣ ≤ η ∥ h ∥ 2 . ( 1 ) \Bigl|f(y+h)-f(y)-p\cdot h-\tfrac12\,h\cdot(Bh)\Bigr|\le\eta\lVert h\rVert^{2}.\qquad(1) f ( y + h ) − f ( y ) − p ⋅ h − 2 1 h ⋅ ( B h ) ≤ η ∥ h ∥ 2 . ( 1 )
Put δ = 1 2 δ 0 \delta=\tfrac12\delta_{0} δ = 2 1 δ 0 . Let y ′ ∈ R n y'\in\mathbb{R}^{n} y ′ ∈ R n with ∥ y ′ − y ∥ < δ \lVert y'-y\rVert<\delta ∥ y ′ − y ∥ < δ and put h = y ′ − y h=y'-y h = y ′ − y ; then y ′ = y + h ∈ U y'=y+h\in U y ′ = y + h ∈ U since ∥ h ∥ < δ 0 \lVert h\rVert<\delta_{0} ∥ h ∥ < δ 0 . Let q ∈ ∂ U f ( y ′ ) q\in\partial_{U}f(y') q ∈ ∂ U f ( y ′ ) and w = q − p − B h w=q-p-Bh w = q − p − B h . If h = 0 R n h=0_{\mathbb{R}^{n}} h = 0 R n , then y ′ = y y'=y y ′ = y and q = p q=p q = p by claim 1, so w = 0 R n w=0_{\mathbb{R}^{n}} w = 0 R n (as B 0 R n = 0 R n B0_{\mathbb{R}^{n}}=0_{\mathbb{R}^{n}} B 0 R n = 0 R n by claim 1 of Linearity, Compatibility with the Matrix Product, and a Norm Bound for the Matrix-Vector Product ) and the inequality holds. If w = 0 R n w=0_{\mathbb{R}^{n}} w = 0 R n there is nothing to prove. Otherwise h ≠ 0 R n h\ne0_{\mathbb{R}^{n}} h = 0 R n and w ≠ 0 R n w\ne0_{\mathbb{R}^{n}} w = 0 R n ; put e = ∥ w ∥ − 1 w e=\lVert w\rVert^{-1}w e = ∥ w ∥ − 1 w and k = t ∥ h ∥ e k=t\lVert h\rVert e k = t ∥ h ∥ e , so that ∥ k ∥ = t ∥ h ∥ \lVert k\rVert=t\lVert h\rVert ∥ k ∥ = t ∥ h ∥ and w ⋅ k = t ∥ h ∥ ∥ w ∥ w\cdot k=t\lVert h\rVert\lVert w\rVert w ⋅ k = t ∥ h ∥ ∥ w ∥ . Then ∥ h + k ∥ ≤ ( 1 + t ) ∥ h ∥ ≤ 2 ∥ h ∥ < δ 0 \lVert h+k\rVert\le(1+t)\lVert h\rVert\le2\lVert h\rVert<\delta_{0} ∥ h + k ∥ ≤ ( 1 + t ) ∥ h ∥ ≤ 2 ∥ h ∥ < δ 0 , so y + h + k ∈ U y+h+k\in U y + h + k ∈ U , and the subgradient inequality of Subdifferential of a Real-Valued Function on a Convex Subset of R n \mathbb{R}^n R n §subdifferential at y ′ y' y ′ gives f ( y + h + k ) ≥ f ( y + h ) + q ⋅ k f(y+h+k)\ge f(y+h)+q\cdot k f ( y + h + k ) ≥ f ( y + h ) + q ⋅ k . Applying (1) at h + k h+k h + k (upper bound) and at h h h (lower bound), and expanding ( h + k ) ⋅ ( B ( h + k ) ) = h ⋅ ( B h ) + 2 ( B h ) ⋅ k + k ⋅ ( B k ) (h+k)\cdot(B(h+k))=h\cdot(Bh)+2(Bh)\cdot k+k\cdot(Bk) ( h + k ) ⋅ ( B ( h + k )) = h ⋅ ( B h ) + 2 ( B h ) ⋅ k + k ⋅ ( B k ) by linearity of the matrix-vector product (claim 1 of Linearity, Compatibility with the Matrix Product, and a Norm Bound for the Matrix-Vector Product ), bilinearity and symmetry of the dot product (Bilinearity and Symmetry of the Dot Product on R n \mathbb{R}^n R n ), and the identity h ⋅ ( B k ) = k ⋅ ( B h ) h\cdot(Bk)=k\cdot(Bh) h ⋅ ( B k ) = k ⋅ ( B h ) , which holds because both sides equal ∑ i , j ∈ [ n ] h i B i j k j \sum_{i,j\in[n]}h_{i}B_{ij}k_{j} ∑ i , j ∈ [ n ] h i B ij k j by the double-sum formula of claim 4 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum and B i j = B j i B_{ij}=B_{ji} B ij = B ji , we get
q ⋅ k ≤ f ( y + h + k ) − f ( y + h ) ≤ p ⋅ k + ( B h ) ⋅ k + 1 2 k ⋅ ( B k ) + η ( ∥ h + k ∥ 2 + ∥ h ∥ 2 ) . q\cdot k\le f(y+h+k)-f(y+h)\le p\cdot k+(Bh)\cdot k+\tfrac12\,k\cdot(Bk)+\eta\bigl(\lVert h+k\rVert^{2}+\lVert h\rVert^{2}\bigr). q ⋅ k ≤ f ( y + h + k ) − f ( y + h ) ≤ p ⋅ k + ( B h ) ⋅ k + 2 1 k ⋅ ( B k ) + η ( ∥ h + k ∥ 2 + ∥ h ∥ 2 ) .
Hence w ⋅ k ≤ 1 2 β t 2 ∥ h ∥ 2 + 5 η ∥ h ∥ 2 w\cdot k\le\tfrac12\beta t^{2}\lVert h\rVert^{2}+5\eta\lVert h\rVert^{2} w ⋅ k ≤ 2 1 β t 2 ∥ h ∥ 2 + 5 η ∥ h ∥ 2 , that is, t ∥ h ∥ ∥ w ∥ ≤ ( 1 2 β t 2 + 5 η ) ∥ h ∥ 2 t\lVert h\rVert\lVert w\rVert\le(\tfrac12\beta t^{2}+5\eta)\lVert h\rVert^{2} t ∥ h ∥ ∥ w ∥ ≤ ( 2 1 β t 2 + 5 η ) ∥ h ∥ 2 . Dividing by the positive number t ∥ h ∥ t\lVert h\rVert t ∥ h ∥ ,
∥ w ∥ ≤ ( 1 2 β t + 5 η t − 1 ) ∥ h ∥ ≤ ( 1 2 ε + 1 2 ε ) ∥ h ∥ = ε ∥ y ′ − y ∥ . \lVert w\rVert\le\bigl(\tfrac12\beta t+5\eta t^{-1}\bigr)\lVert h\rVert\le\bigl(\tfrac12\varepsilon+\tfrac12\varepsilon\bigr)\lVert h\rVert=\varepsilon\lVert y'-y\rVert . ∥ w ∥ ≤ ( 2 1 βt + 5 η t − 1 ) ∥ h ∥ ≤ ( 2 1 ε + 2 1 ε ) ∥ h ∥ = ε ∥ y ′ − y ∥ .
Claim 3. By claim 1, ∂ U f ( y ) = { p } \partial_{U}f(y)=\{p\} ∂ U f ( y ) = { p } , so Elementary Calculus of the Subdifferential of a Convex Function §continuity applied with the positive number L − ∥ p ∥ L-\lVert p\rVert L − ∥ p ∥ gives δ 1 > 0 \delta_{1}>0 δ 1 > 0 such that every y ′ ∈ U y'\in U y ′ ∈ U with ∥ y ′ − y ∥ < δ 1 \lVert y'-y\rVert<\delta_{1} ∥ y ′ − y ∥ < δ 1 and every q ∈ ∂ U f ( y ′ ) q\in\partial_{U}f(y') q ∈ ∂ U f ( y ′ ) satisfy ∥ q − p ∥ < L − ∥ p ∥ \lVert q-p\rVert<L-\lVert p\rVert ∥ q − p ∥ < L − ∥ p ∥ , hence ∥ q ∥ ≤ ∥ q − p ∥ + ∥ p ∥ < L \lVert q\rVert\le\lVert q-p\rVert+\lVert p\rVert<L ∥ q ∥ ≤ ∥ q − p ∥ + ∥ p ∥ < L by the triangle inequality (claim 6 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n ). Since U U U is open there is r 0 > 0 r_{0}>0 r 0 > 0 with every y ′ y' y ′ satisfying ∥ y ′ − y ∥ < r 0 \lVert y'-y\rVert<r_{0} ∥ y ′ − y ∥ < r 0 in U U U ; put r = min { r 0 , δ 1 } r=\min\{r_{0},\delta_{1}\} r = min { r 0 , δ 1 } . Let ∥ y ′ − y ∥ < r \lVert y'-y\rVert<r ∥ y ′ − y ∥ < r . Then y ′ ∈ U y'\in U y ′ ∈ U , ∂ U f ( y ′ ) \partial_{U}f(y') ∂ U f ( y ′ ) is nonempty by The Subdifferential of a Convex Function on an Open Convex Set is Nonempty , and any q q q in it satisfies ∥ q ∥ < L \lVert q\rVert<L ∥ q ∥ < L , so f L ( y ′ ) = f ( y ′ ) f^{L}(y')=f(y') f L ( y ′ ) = f ( y ′ ) by The Lipschitz Truncation of a Convex Function: a Global Lipschitz Convex Minorant Agreeing with It Where the Slope is Small §agreement .
Finally let ε > 0 \varepsilon>0 ε > 0 , let δ \delta δ be as in the definition of twice differentiability of f f f at y y y with this ε \varepsilon ε , and put δ ′ = min { δ , r } \delta'=\min\{\delta,r\} δ ′ = min { δ , r } . For ∥ h ∥ < δ ′ \lVert h\rVert<\delta' ∥ h ∥ < δ ′ we have y + h ∈ R n y+h\in\mathbb{R}^{n} y + h ∈ R n , f L ( y + h ) = f ( y + h ) f^{L}(y+h)=f(y+h) f L ( y + h ) = f ( y + h ) and f L ( y ) = f ( y ) f^{L}(y)=f(y) f L ( y ) = f ( y ) , so
∣ f L ( y + h ) − f L ( y ) − p ⋅ h − 1 2 h ⋅ ( B h ) ∣ = ∣ f ( y + h ) − f ( y ) − p ⋅ h − 1 2 h ⋅ ( B h ) ∣ ≤ ε ∥ h ∥ 2 . \Bigl|f^{L}(y+h)-f^{L}(y)-p\cdot h-\tfrac12\,h\cdot(Bh)\Bigr|=\Bigl|f(y+h)-f(y)-p\cdot h-\tfrac12\,h\cdot(Bh)\Bigr|\le\varepsilon\lVert h\rVert^{2}. f L ( y + h ) − f L ( y ) − p ⋅ h − 2 1 h ⋅ ( B h ) = f ( y + h ) − f ( y ) − p ⋅ h − 2 1 h ⋅ ( B h ) ≤ ε ∥ h ∥ 2 .
Since R n \mathbb{R}^{n} R n is open and convex and f L f^{L} f L is defined on it, f L f^{L} f L is twice differentiable at y y y with first-order coefficient p p p and Hessian B B B .