Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A uniform Hessian bound controls the second-order Taylor remainder

Statement

Let m≥1, let U⊆Rm be open and convex (A convex subset of Rm contains every line segment between two of its points), let h:U→R be of class C2 (Ck Euclidean maps and diffeomorphisms); for x∈U, Hh(x) is its Hessian (The Hessian matrix and critical points of a scalar field). For M=(Mij)∈Mm×m(R) (The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations), define M^:Rm→Rm by (M^v)i:=∑j=0m−1Mijvj,0≤i<m; for all u,v∈Rm and α,β∈R, termwise distributivity gives M^(αu+βv)=αM^u+βM^v, so M^ is linear in the sense of A linear map L:Rm→Rn in Euclidean coordinates; write Mv:=M^v. For v∈Rm, the quadratic-form notation vTMv means ⟨v,Mv⟩ in this Euclidean inner product. Define ∥M∥:=∥M^∥op, the operator norm of this linear map (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||) using the Euclidean inner product on Rm (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn); the maximum in this definition exists by The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector. Let B∈[0,+∞) satisfy ∥Hh(x)∥≤Bfor every x∈U. Then for all μ,y∈U, ∣h(y)−h(μ)−∇h(μ)⋅(y−μ)∣≤B2 ∣y−μ∣2, where ∇h(μ)⋅(y−μ) is the Euclidean pairing (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case).

Facts & Assumptions

Given: An open convex set U⊆Rm, a C2 function h:U→R, a constant B≥0 with ∥Hh(x)∥≤B on U, and points μ,y∈U.

[L1]

For f∈C2(U) on open convex U and a,a+h∈U, the Lagrange remainder formula gives some θ∈(0,1) with f(a+h)=T1f(a;h)+∑∣α∣=2Dαf(a+θh)α!hα. (Multivariable Taylor formula with a Lagrange remainder along a line segment)

[L2]

The degree-one Taylor polynomial is T1f(a;h)=f(a)+∑j=0m−1∂jf(a)hj=f(a)+∇f(a)⋅h, using the zero-based coordinates of The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case and the multi-index convention of The multivariable Taylor polynomial in multi-index notation.

[L3]

Since f∈C2(U), its mixed partial derivatives commute by Clairaut–Schwarz (Clairaut--Schwarz theorem for continuous second partial derivatives). Thus the second-order multi-index sum of [L1] equals 12vTHf(a+θh)v for v=h: the diagonal terms are 12(∂i2f)vi2 and each off-diagonal pair contributes (∂i∂jf)vivj. The Hessian convention is Hf=(∂i∂jf)i,j<m (The Hessian matrix and critical points of a scalar field).

[L4]

For a real m×m matrix A and v∈Rm, ∣vTAv∣≤∥Av∥ ∥v∥≤∥A∥ ∥v∥2, since ∣⟨Av,v⟩∣≤∥Av∥∥v∥ and ∥Au∥≤∥A∥ for unit u. (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||)

[L5]

For a linear map between finite-dimensional inner-product spaces with nonzero domain, the operator-norm maximum exists, is attained, and equals the largest singular value. For the zero domain the norm is defined as 0, with no unit vector at which to attain a maximum. Here the domain is Rm with m≥1. (The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector, The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||)

[L6]

Matrices in Mm×m(R) have zero-based entry indices 0≤i,j<m (The vector space Mm×n(F):=F m×n of m by n matrices over a field, with entrywise operations). A map L:Rm→Rm is linear when L(αu+βv)=αL(u)+βL(v) for all u,v∈Rm and α,β∈R; the coordinate formula for M^ in the Statement satisfies this identity termwise. (A linear map L:Rm→Rn in Euclidean coordinates)

Proof

technique · direct
1.1givenL1

Fix μ,y∈U and put v:=y−μ. If v=0, then h(y)−h(μ)−∇h(μ)⋅v=0 and the estimate is 0≤0; assume from now on that v≠0. Since h is C2 and U is open and convex, [L1] applied with k=1, f=h, a=μ and increment v supplies a θ∈(0,1) with h(y)=T1h(μ;v)+∑∣α∣=2Dαh(μ+θv)α!vα.

2.1step 1.1L2L3algebra

By [L2] the polynomial term is h(μ)+∇h(μ)⋅v, and by [L3] the second-order sum is 12vTHh(μ+θv)v. Hence the Taylor remainder is R:=h(y)−h(μ)−∇h(μ)⋅v=12 vTHh(μ+θv)v.

2.2givenstep 1.1L4L5L6

Convexity puts μ+θv∈U, so the hypothesis gives ∥Hh(μ+θv)∥≤B; [L4] with A=Hh(μ+θv) yields ∣vTHh(μ+θv)v∣≤B∣v∣2.

3.1step 1.1step 2.1step 2.2algebra∎

Taking absolute values in step 2.1 and inserting step 2.2 gives ∣R∣≤12B∣v∣2=B2∣y−μ∣2, and the case v=0 was already disposed of in step 1.1.

The C2 hypothesis and Clairaut–Schwarz provide the symmetry needed to identify the multi-index sum with the Hessian quadratic form in [L3]. The norm estimate itself uses only the operator norm.

Depends on

Dependency tree · 2 levels

Sources