Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 n≥2 and 1≤r<n, Pr from Rank-r orthogonal projector domain is a nonempty compact subset of the real finite-dimensional space Hn.

Facts & Assumptions

Given: Integers n≥2 and 1≤r<n and the Frobenius topology on Hn.

[F1]

Pr consists of Hermitian idempotents with trace r (Rank-r orthogonal projector domain).

[F2]

A Hermitian idempotent has rank equal to its trace (A Hermitian idempotent has trace equal to its rank).

Proof

1.1F1F2givenconstruct

The diagonal matrix P∗:=diag⁡(Ir,0) satisfies P∗∗=P∗, P∗2=P∗, and tr⁡P∗=r, so it belongs to Pr by [F1]. It has rank r by [F2], making the domain nonempty.

1.2F1givenalgebra

The equations P=P∗, P2=P, and tr⁡P=r are closed conditions on the real coordinates of Hn, since adjoint, multiplication, and trace are continuous finite-dimensional maps. Thus Pr is closed. For P∈Pr, ∥P∥F2=tr⁡(P∗P)=tr⁡(P2)=r, so it is bounded.

2.1F3step 1.1step 1.2algebra∎

The real dimension of Hn is n2: there are n real diagonal entries and two real coordinates for each of the n(n−1)/2 off-diagonal conjugate pairs. Therefore Hn is linearly homeomorphic to Rn2. By [F3], the closed bounded nonempty subset Pr is compact.

Depends on

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