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 residual and a spectral separation bound an invariant-subspace gap
Statement
Assume Countable Choice (The Axiom of Countable Choice ()). Let be a real or complex Hilbert space and let be compact and self-adjoint. Put Let be a finite cluster of nonzero eigenvalues, let be the sum of their eigenspaces, and assume for a real number . The compact spectral theorem makes finite-dimensional. Define the directed Hilbert-space gap by If is a nonzero finite-dimensional subspace and then The estimate compares subspaces and makes no choice of eigenvectors in a multiple eigenspace.
Facts & Assumptions
Given: Countable Choice, the compact self-adjoint operator , its spectral cluster and invariant subspace , the real number , and the residual bound on .
The eigenspaces of a compact self-adjoint operator are mutually orthogonal and its spectral projections give a norm-convergent orthogonal expansion; the kernel is the orthogonal complement of the nonzero spectral subspace (Spectral theorem for compact self adjoint operators).
For a closed subspace of a Hilbert space, every has an orthogonal decomposition , with (Orthogonal decomposition by a closed subspace).
Proof
Given: , , , , , , and as in the statement.
Fix . Decompose using [F2]. The spectral projection commutes with because is a sum of whole eigenspaces. By [F1], the orthogonal spectral expansion of on contains only nonzero eigenvalues outside and the kernel component; all their multipliers belong to and are at distance at least from . Parseval therefore gives
If , divide step 1.1 by and take square roots to obtain . The same bound is vacuous for . Taking the supremum over nonzero proves the stated directed gap estimate.
Depends on
Used by
Dependency tree · two levels
52 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
- Bertrand Mercier, Topics in Finite Element Solution of Elliptic Problems, Chapter 8 (standard reference, not scraped)
- Jean-Luc Guermond, MATH 661 Finite Element Methods, Fall 2025, Chapter 47 (standard reference, not scraped)