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.
Paired force evaluations give a second-order Hessian-vector estimate
Statement
Let on an open set , let , and let satisfy and for . Assume the segments lie in . Define
If approximate gradient evaluations satisfy , and bounds the third derivatives of each gradient coordinate in the Taylor remainders on these segments, then
Thus the deterministic truncation error is and the force-evaluation error contributes . This is an error bound for the Hessian action on the supplied direction; it is not an operator-norm bound for a full Hessian approximation.
Facts & Assumptions
Given: The smooth potential, admissible line segment, unit direction, finite-difference step, and force discrepancy bound in the Statement.
maps and multi-index derivative notation in Euclidean space, The Hessian matrix and critical points of a scalar field, and The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case: gives continuous coordinate partials of each gradient coordinate through order three. Applying If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative to those iterated partials through order two gives their total derivatives, whose Jacobian entries are continuous. A total derivative computes every directional derivative, and its matrix is the Jacobian identifies the matrix of with the Jacobian, and The Hessian of a scalar field is symmetric makes its Jacobian entries agree with the Hessian convention .
By [F1], maps and multi-index derivative notation in Euclidean space, and repeated application of The chain rule for total derivatives: , each restriction is on its open interval domain. The one-dimensional case of Multivariable Taylor formula with a Lagrange remainder along a line segment then gives its coordinatewise degree-two Taylor expansion with Lagrange remainder.
For each coordinate , the third derivative of is bounded in absolute value by for ; this is the remainder bound required for [F2].
Given: The hypotheses of the Statement.
Proof
Let be the open interval component of containing ; it exists because that line segment lies in the open set . Each is on the open, convex interval . Apply [F2] to at with displacements . The linear terms are by [F1], the quadratic terms agree, and the coordinate remainders satisfy by [A1]. Thus . Subtracting and dividing by cancels the constant and quadratic terms and gives .
Write . Then , so their contribution after division by is at most . Adding this to step 1.1 proves the inequality. A bound on this single direction alone supplies no bound on an operator acting on all directions.
Depends on
- $C^k$ maps and multi-index derivative notation in Euclidean space
- 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 Hessian of a $C^2$ scalar field is symmetric
- A total derivative computes every directional derivative, and its matrix is the Jacobian
- If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- Multivariable Taylor formula with a Lagrange remainder along a line segment
Used by
Dependency tree · two levels
29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Graeme Henkelman and Hannes Jónsson, A dimer method for finding saddle points on high dimensional potential surfaces using only first derivatives (standard reference, not scraped)
- Weinan E, Weiqing Ren, and Eric Vanden-Eijnden, Simplified and improved string method for computing the minimum energy paths in barrier-crossing events (standard reference, not scraped)