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 principal-angle bound encloses the largest selected generalized Ritz value across a spectral gap
Statement
Let , , and be the generalized eigenvalues of . Fix with the strict gap and let be the corresponding sum of the first eigenspaces, with -orthonormal. For a -dimensional trial subspace with -orthonormal basis , define Let be the generalized Ritz values from Generalized Ritz values obey min-max bounds and are monotone under trial-space inclusion. Then The strict gap identifies uniquely; the estimate is a subspace enclosure, not an iteration convergence rate.
Facts & Assumptions
Given: A Hermitian-definite pair , its ordered generalized eigenvalues and -orthonormal eigenbasis, the strict gap at , and a -dimensional -orthonormal trial basis spanning .
A Hermitian-definite pencil has a real spectrum and a B-orthonormal eigenbasis: and have a -orthonormal generalized eigenbasis with real eigenvalues.
Generalized Ritz values obey min-max bounds and are monotone under trial-space inclusion: each selected Ritz value is at least the corresponding ambient generalized eigenvalue, and Ritz values decrease when the trial subspace is enlarged.
Proof
By [F2], write a B-unit vector as with and . In the B-orthonormal generalized eigenbasis, if , then and . Thus and ; the cross terms vanish since for . Therefore , which is at most the stated angle bound.
Diagonalizing the finite Hermitian compression shows that is the maximum Rayleigh quotient on , so step 1.1 gives its upper bound. The lower bounds are [L1]. The strict gap isolates the first q eigenspaces, so their sum is unique; no step asserts an iteration rate.
Depends on
Used by
Dependency tree · two levels
14 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
- Peter Arbenz, Lecture Notes on Solving Large Scale Eigenvalue Problems, §§13.1 and 13.6 (standard reference, not scraped)
- Andrew Knyazev, Recent implementations, applications, and extensions of LOBPCG, §1 (standard reference, not scraped)