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.
Near-orthonormal residual data enclose all ordered Hermitian eigenvalues
Statement
Let and let be a residual and orthogonality certificate for a nonempty family of Hermitian matrices in . Sort the diagonal entries of increasingly as . Then every has ordered eigenvalues satisfying
Facts & Assumptions
Given: The certificate and all bounds in Residual and near-orthogonality data for an approximate Hermitian eigenbasis.
Hermitian matrices are unitarily diagonalizable with real eigenvalues (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root).
Complex Hermitian eigenvalues change by at most the spectral norm of a Hermitian perturbation (Hermitian eigenvalues move by at most the spectral norm perturbation).
Rank-nullity converts injectivity of a square endomorphism into invertibility (Rank-nullity: ).
The operator norm is induced by the Euclidean norm and is unchanged by unitary factors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).
Cauchy–Schwarz gives in a complex inner-product space (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
The induced operator norm is submultiplicative (The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2).
Proof
Put . For every unit vector , [F6] gives by [F5], so all eigenvalues of the Hermitian lie in . Since , is positive definite. By [F1] and [F2] it has a positive square root ; its eigenvalues are , so is invertible.
Set . Then . Thus is injective and [F4] makes the square matrix invertible, so is unitary. The eigenvalues of lie between and , hence . For the upper deviation, because . Unitary invariance in [F5] justifies the norm equality.
For each , the residual identity and certificate bounds give . By the triangle inequality and submultiplicativity [F7], each product term in the identity is bounded by its factor norms, giving the displayed estimate. Since is unitary, [F5] gives that has the same ordered eigenvalues as and, using [F7], .
Both and are Hermitian. Their eigenvalues are ordered increasingly in the statement of the enclosure, whereas [F3] uses decreasing order; reversing both lists sends index to , so the same absolute-difference bound holds at each increasing index. Applying [F3] to their difference gives for every . The family bounds are uniform, so the same intervals hold for every .
Depends on
- Residual and near-orthogonality data for an approximate Hermitian eigenbasis
- Hermitian eigenvalues move by at most the spectral norm perturbation
- A non-negative operator has a unique non-negative square root
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
- 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||
- Cauchy–Schwarz: $|\langle u,v\rangle|\leq\lVert u\rVert\lVert v\rVert$, with equality exactly for linearly dependent vectors
- The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2
Used by
Dependency tree · two levels
29 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
- Nicholas J. Higham, Numerical Linear Algebra and Matrix Analysis, MIMS EPrint 2015.103, §§5.2 and 5.4 (standard reference, not scraped)