Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 fixed-particle density-matrix domain is nonempty and compact

Statement

For an integer n≥2 and a real 0<r<n, put Dr:={D∈Hn:0⪯D⪯I, tr⁡D=r}. This agrees with the domain of Fixed-particle finite-temperature density-matrix free energy when r is an integer. Then Dr is a nonempty compact subset of Hn.

Facts & Assumptions

Given: An integer n≥2, a real 0<r<n, the displayed domain Dr, and the Frobenius topology on the Hermitian matrices.

[F1]

For integer 1≤r<n, Fixed-particle finite-temperature density-matrix free energy defines Dr by the constraints D=D∗, 0⪯D⪯I, and tr⁡D=r. For real 0<r<n, the displayed formula in the Statement defines the same notation locally.

[F3]

A subset of finite-dimensional real coordinate space is compact exactly when it is closed and bounded; no choice principle is used (Heine-Borel in Rn: with the Euclidean metric a subset of Rn 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

1.1F1givenconstruct

The matrix D∗=(r/n)I has eigenvalues r/n∈(0,1) and trace r, so [F1] gives D∗∈Dr. Thus the domain is nonempty.

1.2F1given

The conditions D=D∗, D⪰0, I−D⪰0, and tr⁡D=r define a closed subset of the real coordinates of Hn: the first and last are continuous equalities, while positive semidefiniteness is closed because it is the intersection of the closed inequalities ⟨Dx,x⟩≥0 over all fixed vectors x.

1.3F1F2givenalgebra

If d1,…,dn∈[0,1] are the eigenvalues of D∈Dr, then ∥D∥F2=tr⁡(D2)=∑jdj2≤∑jdj=r. Thus Dr is bounded.

2.1F3step 1.2step 1.3algebra∎

The real vector space Hn has dimension n2 and is isomorphic to Rn2 by its real diagonal entries and real and imaginary off-diagonal coordinates. Closedness from step 1.2 and boundedness from step 1.3 give compactness by [F3].

Depends on

Used by

Dependency tree · two levels

50 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