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 , let be open and convex (A convex subset of contains every line segment between two of its points), let be of class ( Euclidean maps and diffeomorphisms); for , is its Hessian (The Hessian matrix and critical points of a scalar field). For (The vector space of by matrices over a field, with entrywise operations), define by for all and , termwise distributivity gives , so is linear in the sense of A linear map in Euclidean coordinates; write . For , the quadratic-form notation means in this Euclidean inner product. Define , 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 (The Euclidean inner product on ); 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 satisfy Then for all , where is the Euclidean pairing (The Euclidean inner product on , The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case).
Facts & Assumptions
Given: An open convex set , a function , a constant with on , and points .
For on open convex and , the Lagrange remainder formula gives some with (Multivariable Taylor formula with a Lagrange remainder along a line segment)
The degree-one Taylor polynomial is , 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.
Since , 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 for : the diagonal terms are and each off-diagonal pair contributes . The Hessian convention is (The Hessian matrix and critical points of a scalar field).
For a real matrix and , , since and for unit . (Cauchy–Schwarz: , with equality exactly for dependent pairs, The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||)
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 , with no unit vector at which to attain a maximum. Here the domain is with . (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||)
Matrices in have zero-based entry indices (The vector space of by matrices over a field, with entrywise operations). A map is linear when for all and ; the coordinate formula for in the Statement satisfies this identity termwise. (A linear map in Euclidean coordinates)
Proof
Fix and put . If , then and the estimate is ; assume from now on that . Since is and is open and convex, [L1] applied with , , and increment supplies a with .
By [L2] the polynomial term is , and by [L3] the second-order sum is . Hence the Taylor remainder is
Convexity puts , so the hypothesis gives ; [L4] with yields .
Taking absolute values in step 2.1 and inserting step 2.2 gives , and the case was already disposed of in step 1.1.
The 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
Euclidean maps and diffeomorphisms
A convex subset of contains every line segment between two of its points
The Euclidean inner product on
A linear map in Euclidean coordinates
The Hessian matrix and critical points of a scalar field
The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
The vector space of by matrices over a field, with entrywise operations
The multivariable Taylor polynomial in multi-index notation
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
Cauchy–Schwarz: , with equality exactly for dependent pairs
Clairaut--Schwarz theorem for continuous second partial derivatives
Multivariable Taylor formula with a Lagrange remainder along a line segment
The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector
Dependency tree · 2 levels
Sources
- JCGM 100:2008, Evaluation of measurement data — Guide to the expression of uncertainty in measurement (BIPM), clause 5.1.2, note to equation (10), on higher-order Taylor terms for significant nonlinearity
- K. Bryan, Taylor's Theorem in One and Several Variables (Rose-Hulman MA 433 lecture notes), the second-order case in n dimensions (equation (8)) and its proof (equations (9)-(10))