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 local maximum has the wrong Morse index for the saddle certificate
Example
Let on . The origin is a critical point and a strict local maximum, but its Hessian has two negative eigenvalues. It therefore fails the index-one enclosure required by Validated ordered eigenvalue enclosures for an index-one Hessian and cannot be certified by Validated Hessian enclosures and a small gradient residual certify a nearby index-one saddle.
Facts & Assumptions
Given: The quadratic potential on and the definitions of index-one enclosure and the local saddle certificate.
Validated ordered eigenvalue enclosures for an index-one Hessian: an index-one enclosure requires and for every .
Validated Hessian enclosures and a small gradient residual certify a nearby index-one saddle: the nearby-saddle claim requires such an index-one enclosure at the reported point.
Given: and the origin.
Proof
The gradient is , so it vanishes at ; the Hessian is , with ordered eigenvalues .
For any , an interval enclosing cannot have lower endpoint . Thus no exact validated enclosure of this Hessian satisfies [F1].
The point is a maximum with Morse index two, not index one. Since the required enclosure premise in [F2] fails by step 2.1, the theorem makes no certification claim for it; this example illustrates why a small gradient or critical-point report alone does not establish the desired saddle type.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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, Blas P. Uberuaga, and Hannes Jónsson, A climbing image nudged elastic band method for finding saddle points and minimum energy paths (standard reference, not scraped)
- Xuanyu Liu, Huajie Chen, and Christoph Ortner, Convergence of the Discrete Minimum Energy Path (standard reference, not scraped)