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 spectral gap persists on a computable matrix ball with a uniform resolvent bound
Statement
Let have eigenvalues with multiplicity and gap . Put and let be positively oriented. For Hermitian , write . Then . For every Hermitian with , exactly the lowest eigenvalues of , counted with multiplicity, lie inside ; the gap is at least , and
Facts & Assumptions
Given: A Hermitian , integers and , and .
Descending ordered Hermitian eigenvalues change by at most the operator norm of the matrix perturbation (Ordered eigenvalues of Hermitian matrices are operator-norm Lipschitz); ascending order is obtained by reversing indices, so the same bound holds for the ascending convention used here.
A finite-dimensional Hermitian matrix has an orthonormal eigenbasis with real eigenvalues (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
The operator norm is the supremum of over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
Proof
Since , we have . Reversing the descending-index convention in [F1] gives the same perturbation bound for the ascending eigenvalues used here. Thus if , then and . Since , every first- eigenvalue therefore satisfies , so it lies at least inside the circle centered at .
The same eigenvalue estimate gives , so all remaining eigenvalues satisfy and lie at least outside the circle. Also . Thus the contour separates exactly the occupied cluster and the stated gap persists.
By [F2], the spectrum of is real and diagonalizes unitarily. For every , reverse triangle gives by steps 1.1 and 2.1. In the unitary eigenbasis, is diagonal with entries of modulus at most . Applying [F3] to a unit vector in this basis gives .
Depends on
- Rank-r orthogonal projector domain
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- Ordered eigenvalues of Hermitian matrices are operator-norm Lipschitz
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
Used by
Dependency tree · two levels
17 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
- Tosio Kato, Perturbation Theory for Linear Operators, 2nd ed., Chapter II §1.3–§1.4 (standard reference, not scraped)
- Benjamin Texier, Basic matrix perturbation theory, §2 (standard reference, not scraped)