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 strict occupied gap defines a unique rank-r spectral projector
Statement
For every at which the response map of The occupied-projector response map on its strict-gap domain has a strict th gap, is a uniquely defined member of . Degeneracies among the first eigenvalues or among the remaining eigenvalues do not affect it.
Facts & Assumptions
Given: A Hermitian matrix with ordered eigenvalues and .
A finite-dimensional Hermitian matrix has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
The response-map definition selects the sum of eigenspaces belonging to the lowest eigenvalues (The occupied-projector response map on its strict-gap domain).
The trace of a square matrix is the sum of its diagonal entries (The trace as the sum of the diagonal entries).
Proof
By [F1], choose an orthonormal eigenbasis of with the eigenvalues in the given order. The strict gap prevents an eigenspace for one eigenvalue from straddling positions and , so the sum of the first eigenspaces is the span of exactly the first basis vectors.
Changing the orthonormal basis within a repeated eigenspace below the gap leaves that entire eigenspace in the sum; changing one within a repeated eigenspace above the gap leaves that entire eigenspace out. Thus the selected subspace does not depend on the eigenbasis chosen in step 1.1. Its orthogonal projector is , which satisfies and by orthonormality. By [F3], , since each is a unit vector.
The operator in step 2.1 is independent of all allowed basis choices, lies in by [L1], and is exactly the map specified by [F2]. Hence it is the unique rank- occupied spectral projector.
Depends on
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- The occupied-projector response map on its strict-gap domain
- Rank-r orthogonal projector domain
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
Used by
- Finite-budget certified SCF with safeguarded DIIS and a contractive fallback Algorithm
- Finite-budget relaxed density-matrix mixing Algorithm
- Finite-budget undamped self-consistent projector iteration Algorithm
- Finite-memory capped DIIS projector proposal with fallback Algorithm
- The finite-basis projector energy model supplies a C1 Hermitian response map Corollary
- A convex density mixture can be admissible without being a projector Example
- A finite-basis occupied projector map can two-cycle despite a uniform gap Example
- Density mixing preserves admissibility but need not preserve idempotence Lemma
- A common separating resolvent contour certifies a Lipschitz response map Theorem
- A contractive self-consistent map converges and admits residual and inexact-solve bounds Theorem
- A level shift preserves a fixed occupied projector exactly under block ordering Theorem
- A separated block spectral projector is Frechet differentiable with a resolvent bound Theorem
- A uniform derivative bound certifies contraction of relaxed density mixing Theorem
Cited to discharge well-definedness by The occupied-projector response map on its strict-gap domain.
Dependency tree · two levels
13 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.4 (standard reference, not scraped)
- Benjamin Texier, Basic matrix perturbation theory, §2 (standard reference, not scraped)