Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Trace of a positive operator is the sum of its eigenvalues

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a real or complex Hilbert space (Hilbert space) and let T∈B(H) be a self-adjoint positive trace-class operator (Self-adjoint, positive, unitary and normal operators, Trace class operator), so that ⟨Tx,x⟩≥0 for every x∈H. Let λ1≥λ2≥⋯>0 be the positive eigenvalues of T listed with multiplicity (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism) and let (sn(T))n≥1 be the zero-padded singular-value sequence (Absolute value and singular values of a compact operator). Then sn(T)=λn for every n, and tr⁡(T)=∑n≥1λn=∥T∥1, where the sum is over the positive eigenvalues with multiplicity and the equalities are also valid in the finite-rank case (then λn:=0 for n beyond the rank). This is the positive compact self-adjoint case only; it is not Lidskii's theorem for arbitrary trace-class operators, which is not claimed here.

Facts & Assumptions

Given: Countable Choice, the Hilbert space H, a self-adjoint positive trace-class T, its positive eigenvalues λn with multiplicity and eigenspaces Eλ.

[A1]

Spectral theorem. T is compact self-adjoint; its positive eigenvalues have finite-dimensional eigenspaces, the closed linear span of those eigenspaces is (ker⁡T)⊥=ran⁡T‾, H=(ker⁡T)⊥⊕ker⁡T, and Tx=∑λ>0λPλx in norm, where Pλ is the orthogonal projection onto Eλ (Spectral theorem for compact self adjoint operators, Eigenspaces of a self adjoint operator are orthogonal, Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism).

[A2]

Positivity forces nonnegative eigenvalues. If Tv=μv with v≠0 then μ∥v∥2=⟨Tv,v⟩≥0, so μ≥0; and T is self-adjoint with T2=T∗T (Self-adjoint, positive, unitary and normal operators, Hilbert-adjoint identities, The Hilbert-space adjoint of a bounded operator, Real and complex inner-product spaces and their induced length).

[A3]

Absolute value of a positive operator. For compact self-adjoint positive T one has ∣T∣=(T∗T)1/2=(T2)1/2=T, by uniqueness of the compact positive square root applied to the compact self-adjoint positive operator T satisfying T2=T∗T (Absolute value and singular values of a compact operator, Positive square root of a compact positive operator).

[A4]

SVD and trace. The singular values of T are the positive eigenvalues of ∣T∣ with multiplicity; the SVD gives orthonormal (ej)j∈J in (ker⁡T)⊥ with ∣T∣ej=sjej and Tej=sjfj; after zero-padding a finite SVD to positive-integer-indexed coefficient families, the trace of a trace-class operator is ∑j≥1⟨vj,uj⟩ for every nuclear representation Tx=∑j≥1⟨x,uj⟩vj, and ∥T∥1=∑nsn(T) (Absolute value and singular values of a compact operator, Singular value decomposition for compact operators, Trace is absolutely convergent and basis independent, Trace class operator, Nuclear series characterizes trace norm).

[A5]

Orthonormal bases of eigenspaces. Every finite-dimensional eigenspace Eλ has an orthonormal basis, and orthonormal families consist of unit pairwise orthogonal vectors (Every finite-dimensional real or complex inner product space has an orthonormal basis, Orthonormal families, complete orthonormal systems and Hilbert bases, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R).

Proof

technique · direct

Given: Countable Choice, the self-adjoint positive trace-class T, its positive eigenvalues with multiplicity and their eigenspaces.

1.1A2A3

∣T∣=T. By [A2] T is self-adjoint with T2=T∗T, so the compact self-adjoint positive operator T satisfies T2=T∗T; since the positive square root of a compact self-adjoint positive operator is unique by [A3], and (T2)1/2=T because T≥0, the definition ∣T∣=(T∗T)1/2 yields ∣T∣=T.

2.1step 1.1A1A2A4

The singular values are the positive eigenvalues. By [A1] and [A2] the eigenvalues of T are nonnegative, its positive eigenvalues are exactly the nonzero eigenvalues, and listing them with multiplicity as λ1≥λ2≥⋯>0 matches the nonincreasing listing of the positive eigenvalues of ∣T∣=T with multiplicity required by [step 1.1]; hence sn(T)=λn for every n, with zeros appended once the positive eigenvalues are exhausted (the finite-rank case), and ∥T∥1=∑nλn.

3.1step 1.1step 2.1A1A4A5

The trace equals the eigenvalue sum. For each positive eigenvalue λ choose an orthonormal basis of Eλ by [A5]; the union over the positive eigenvalues is an orthonormal family (gj)j∈J whose closed span is (ker⁡T)⊥ by [A1] and [A5]. Since ∣T∣=T by [step 1.1], the SVD of T has ej=gj, sj=λj and fj=sj−1Tej=λj−1λjgj=gj. For j∈J put uj=λjgj and vj=gj; in the finite-rank case J={1,…,r}, extend these to all positive integers by uj=vj=0 for j>r (and use the all-zero families when r=0). With R0=0 and Rm=∑j=1m⟨⋅,uj⟩vj, the SVD gives Rm→T in operator norm and ∑j≥1∥uj∥∥vj∥=∑j∈Jλj=∥T∥1<+∞. Thus these positive-integer-indexed families are a nuclear representation in the precise sense of [A4], and its trace formula gives tr⁡(T)=∑j≥1⟨vj,uj⟩=∑j∈Jλj∥gj∥2=∑j∈Jλj.

4.1step 2.1step 3.1A1A4∎

Conclusion. Steps 2.1 and 3.1 give sn(T)=λn and tr⁡(T)=∑nλn=∥T∥1; the computation never chooses a basis of ker⁡T, only orthonormal bases of the finite-dimensional positive eigenspaces, and the identity is stated for self-adjoint positive operators only, as the statement records.

Depends on

Used by

Dependency tree · two levels

88 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