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.
Dimer finite-difference bias competes with force-evaluation error
Example
On , let , take the point and direction . The exact Hessian action is . With exact gradients, the central dimer estimate is . If the two gradient evaluations have errors and , each of norm , the computed estimate becomes . The truncation bias decreases with , while this permitted noise contribution increases as shrinks.
Facts & Assumptions
Given: The potential, point, direction, finite-difference distance , and opposite evaluation errors of magnitude .
The Hessian matrix and critical points of a scalar field: the Hessian is the Jacobian of the gradient; at the origin its action on is zero.
Paired force evaluations give a second-order Hessian-vector estimate: for potentials the paired central gradient difference has truncation error and force-evaluation contribution at most .
Given: The data in the Example.
Proof
The gradient is . Thus and . Their central difference is . The Hessian at the origin is , so [F1] gives .
Adding the stated force errors changes the numerator by ; division by adds . Hence the computed estimate is exactly . This realizes both contributions in [F2] for this example.
For fixed , the deterministic term tends to zero as , but the permitted error term grows without bound. Therefore reducing the dimer separation does not monotonically improve the Hessian-vector estimate when force evaluations are inexact.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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)