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 small spectral gap makes the dimer mode sensitive to perturbations
Example
For each , let
The exact lowest eigenvector is . For every , the perturbation satisfies , and this amplification tends to zero with the gap, but the lowest eigenvector of remains at angle from . Thus an absolute perturbation tolerance alone cannot guarantee a mode error tending to zero as the spectral gap collapses.
Facts & Assumptions
Given: The matrices above and the mode-separation context in A separated dimer mode gives a local inexact saddle error bound.
A separated dimer mode gives a local inexact saddle error bound: the mode-angle bound depends on the error-to-gap ratio, not on absolute error alone.
Proof
Given: and the two symmetric matrices in the Example.
The eigenvalues of are and , with exact lowest eigenvector and spectral gap . Also , so for every we have and hence .
The eigenvalues of are . For the negative eigenvalue, the first row equation gives , so a lowest unit eigenvector is proportional to . Its angle with is therefore , a positive constant independent of .
As , the perturbation norm tends to zero while this angle stays fixed at . The spectral gap also tends to zero, so this does not contradict the separated-mode bound [F1]; it shows why that bound must include a gap scale.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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.