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.
Finite-budget index-one eigenvector-following Newton step
Definition
Let be as in Regular minimum-energy paths on a declared collision-free tube. Inputs: an initial point , a unit initial mode reference , a local-ball center , radius , gradient tolerance , eigenvalue margin , eigenpair residual tolerance , mode-overlap threshold , update budget , and a supplied spectral-data routine . On input , must return in finite time either failure or an orthogonal matrix , ordered approximate eigenvalues , and validated ordered intervals with their checked certificates as specified below. This input routine supplies spectral data; the enclosure definition does not compute them. Return the last point, the most recently accepted mode reference, and a termination status from geometry-failure, outside-local-basin, gradient-residual-tolerance, budget-exhausted, eigensolve-tolerance-failure, index-one-branch-failure, mode-tracking-failure, or singular-jacobian. The mode reference starts at and changes only after a successful eigenpair and overlap check, storing the signed from that check. A positive residual tolerance does not in general certify that is an exact lowest eigenvector, and a reference accepted at an earlier iterate carries no spectral certification at the returned point. When called at in step 2, the input routine supplies an orthogonal matrix , ordered approximate eigenvalues , and validated intervals in the sense of Validated ordered eigenvalue enclosures for an index-one Hessian. Require every residual , , and . The Hessian is symmetric by The Hessian of a scalar field is symmetric.
For , in order:
- If , return
geometry-failure. If , returnoutside-local-basin. Compute . If , returngradient-residual-tolerance; if , returnbudget-exhausted. - Evaluate and call . If it returns
failure, returneigensolve-tolerance-failure; otherwise use its returned , , and . If an eigenpair residual exceeds , , or some , returneigensolve-tolerance-failure. If the validated intervals do not satisfy and for all (with the dimension-one convention in the definition), returnindex-one-branch-failure. If , returnmode-tracking-failure; otherwise retain when and replace it by when . Use the resulting direction as the next mode reference. This overlap check screens changes of the computed reference direction; it does not certify exact mode identity or alter the Newton correction. - Call Newton correction for a square vector residual with and . If it returns
singular-jacobian, return that status. Its correction is the exact Newton solution of in the mathematical model; the eigenpair data certifies the index-one branch but does not replace this linear solve. - If or lies outside , return
outside-local-basin. Otherwise set and continue.
An approximate eigensolve has a finite residual-tolerance branch and an explicit failure status. The definition makes no global-convergence claim. Local quadratic behavior is stated separately and requires the hypotheses of Updated-Jacobian Newton has local quadratic convergence at a simple root.
Depends on
- Newton correction for a square vector residual
- The Hessian of a $C^2$ scalar field is symmetric
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Regular minimum-energy paths on a declared collision-free tube
- Validated ordered eigenvalue enclosures for an index-one Hessian
- Updated-Jacobian Newton has local quadratic convergence at a simple root
Used by
Dependency tree · two levels
23 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
- E. Hairer and G. Wanner, Solving Ordinary Differential Equations II, Chapter VI: Iterative Methods—Nonlinear Equations (standard reference, not scraped)
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, version 1.0 (standard reference, not scraped)