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.
Shift-invert maps eigenvalues exactly and transfers an inexact solve residual to the original eigenpair
Statement
Let , , and be invertible. Then a nonzero vector is an eigenvector of with eigenvalue if and only if it is an eigenvector of with eigenvalue . In particular, and .
For any nonzero candidate , any , and any computed vector with solve residual , define the transformed residual and . Then and consequently
Facts & Assumptions
Given: invertible, a nonzero vector , a nonzero scalar , and a computed solve vector with .
Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism: with is the definition of an eigenpair.
Shift-invert and harmonic Ritz extraction with solve and pencil status: the inexact candidate solve records and .
Proof
If , then . Invertibility of and imply , so applying gives . Conversely, if with , multiplying by gives ; hence . Thus the eigenvalue map is exact and the inverse Ritz value cannot be zero.
From [F2], . Rearranging yields . Since and , the left side is , proving the residual identity.
Taking Euclidean norms in step 1.2 and applying the triangle inequality gives the stated residual bound, which keeps the solve residual and the transformed residual after multiplication by as separate terms.
Depends on
Used by
Dependency tree · two levels
12 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
- Yousef Saad, Numerical Methods for Large Eigenvalue Problems, second edition, §8.1.1 (standard reference, not scraped)
- Peter Arbenz, Lecture Notes on Solving Large Scale Eigenvalue Problems, §§11.4 and 12.6 (standard reference, not scraped)