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.
The finite rank-r projector domain is nonempty and compact
Statement
For integers and , from Rank-r orthogonal projector domain is a nonempty compact subset of the real finite-dimensional space .
Facts & Assumptions
Given: Integers and and the Frobenius topology on .
consists of Hermitian idempotents with trace (Rank-r orthogonal projector domain).
A Hermitian idempotent has rank equal to its trace (A Hermitian idempotent has trace equal to its rank).
In real coordinates, a subset of is compact exactly when it is closed and bounded; this theorem uses no choice principle (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
Proof
The diagonal matrix satisfies , , and , so it belongs to by [F1]. It has rank by [F2], making the domain nonempty.
The equations , , and are closed conditions on the real coordinates of , since adjoint, multiplication, and trace are continuous finite-dimensional maps. Thus is closed. For , , so it is bounded.
The real dimension of is : there are real diagonal entries and two real coordinates for each of the off-diagonal conjugate pairs. Therefore is linearly homeomorphic to . By [F3], the closed bounded nonempty subset is compact.
Depends on
- Rank-r orthogonal projector domain
- A Hermitian idempotent has trace equal to its rank
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- The Frobenius norm $\lVert A\rVert_F=(\sum_{i,j}|a_{ij}|^2)^{1/2}$ on real or complex matrices
Used by
Dependency tree · two levels
43 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
- Eric Cancès and Claude Le Bris, On the convergence of SCF algorithms for the Hartree-Fock equations, ESAIM: Mathematical Modelling and Numerical Analysis 34 (2000), §2.1 (standard reference, not scraped)
- Alan Edelman, Tomás A. Arias, and Steven T. Smith, The Geometry of Algorithms with Orthogonality Constraints, SIAM Journal on Matrix Analysis and Applications 20 (1998), §2.5 (standard reference, not scraped)