Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Density operators have an orthogonal spectral ensemble

Statement

Let ρ be a density operator on a nonzero finite-dimensional complex-inner-product space H. Then there are m=rank⁡(ρ)≥1, positive numbers λ1,…,λm with ∑j=1mλj=1, and orthonormal unit vectors e1,…,em such that

ρ=∑j=1mλj∣ej⟩⟨ej∣.

The eigenvectors with eigenvalue zero are omitted; the displayed pure-state projectors are pairwise orthogonal.

Facts & Assumptions

Given: A nonzero finite-dimensional complex-inner-product space H and a density operator ρ on H.

[F1]

Density operator: ρ is non-negative and has trace one.

[F3]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the sum of the diagonal entries of a representing matrix in any ordered basis.

[F4]

Ray-to-projector is well-defined and bijective: a unit vector's ray projector is a rank-one orthogonal projection, and hence is the operator ∣e⟩⟨e∣ used for its pure-state representative.

[F5]

Rank and nullity of a linear map with finite-dimensional domain: rank⁡(ρ)=dim⁡(im⁡ρ) for the finite-dimensional endomorphism ρ.

Proof

1.1F1F2F3choosealgebra

By [F1]–[F2], choose an orthonormal eigenbasis e1′,…,ed′ with ρek′=μkek′ and μk≥0. In this basis the representing matrix is diagonal, so [F1] and [F3] give ∑k=1dμk=tr⁡(ρ)=1. Thus the index set J={k:μk>0} is nonempty, and omitting its complement removes exactly the zero eigenvalues.

2.1F2F4F5step 1.1algebra∎

List the finite set J in increasing order as k1,…,km and put λj=μkj and ej=ekj′. By [F4], each unit eigenvector has a rank-one projector ∣ej⟩⟨ej∣; the eigenbasis gives ρ=∑j=1mλj∣ej⟩⟨ej∣, with positive weights summing to one. The operator maps each ekj′ to the nonzero vector μkjekj′ and maps every other eigenbasis vector to zero, so its image is exactly the span of the ekj′. Thus [F5] gives rank⁡(ρ)=m. Distinct basis vectors give orthogonal projectors.

Remarks

The proof uses one finite-dimensional orthonormal eigenbasis and the increasing enumeration of a finite set of its indices; no arbitrary-index choice is used.

Depends on

Used by

Dependency tree · two levels

25 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