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 zero Ritz residual can belong to an excited eigenstate
Example
Under Countable Choice, take and the unit Ritz vector . Its Rayleigh quotient is and its residual norm is , yet the ground eigenvalue is . The residual certifies spectral proximity but does not identify the ground-state branch.
Facts & Assumptions
Given: Countable Choice, the finite Hermitian residual theorem, , and .
Countable Choice as stated in The Axiom of Countable Choice ().
The residual bound places the Rayleigh value near some eigenvalue; the residual alone does not identify which eigenvalue or the lowest one (A Hermitian Ritz residual certifies spectral proximity and a gap-conditioned direction).
A Hermitian matrix has real eigenvalues and an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Verification
By [F2], the eigenvalues of are and , so its ground eigenvalue is . The vector is a unit eigenvector for , whence and . Thus .
The general residual theorem [F1] therefore returns exact proximity to the spectrum, but this example's nearby eigenvalue is the excited value , not the ground value . A zero residual still cannot supply spectral ordering information.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 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.