Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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 is absolutely convergent and basis independent

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 trace class (Trace class operator). Then:

  1. for every nuclear representation Tx=∑j⟨x,uj⟩vj of T (operator-norm convergence of the partial sums, ∑j∥uj∥∥vj∥<+∞), the scalar series ∑j⟨vj,uj⟩ converges absolutely and ∣∑j⟨vj,uj⟩∣≤∑j∥uj∥ ∥vj∥;
  2. the sum ∑j⟨vj,uj⟩ depends only on T; denoting it tr⁡(T), one has tr⁡(T)=∑j⟨vj,uj⟩ for every nuclear representation of T. This defines tr⁡(T) without assuming that H has a Hilbert basis;
  3. for every supplied Hilbert basis E of H, tr⁡E(T)=tr⁡(T) (Trace of a trace class operator);
  4. the trace is linear in the trace-class variable and bounded by the trace norm: for trace-class S,T and scalars a,b, tr⁡(aS+bT)=atr⁡(S)+btr⁡(T) and ∣tr⁡(T)∣≤∥T∥1.

Facts & Assumptions

Given: Countable Choice, a Hilbert space H, a trace-class T∈B(H), its nuclear representations, and the supplied bases.

[A1]

Nuclear representations exist and compute the trace norm. trace class means that T has a nuclear representation; the SVD series is one, and ∥T∥1=∑nsn(T) is the infimum of the nuclear sums (Nuclear series characterizes trace norm, Trace class operator, Singular value decomposition for compact operators, Absolute value and singular values of a compact operator).

[A2]

Absolute convergence tools. A nonnegative family has a finite-sum supremum; if the finite subsums are bounded by C then the family is summable with sum at most C, and sums of finite subfamilies of a nonnegative family are bounded by the full sum; for a scalar family, absolute summability implies summability with ∣∑∣ci∣ bound. Suprema over finite subsets of two index sets commute. (Square-summable families on an arbitrary index set and the space ℓ2(I), Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R)

[A3]

Parseval, Bessel, separable bases. For a Hilbert basis G of a closed subspace M and w∈M, w=∑g∈G⟨w,g⟩g with ∥w∥2=∑g∈G∣⟨w,g⟩∣2; for an orthonormal family and any vector the finite coefficient sums obey Bessel; a closed subspace of H with a given countable dense sequence has a finite or countable Hilbert basis obtained from that sequence by Gram–Schmidt, with no choice (Parseval equivalences for an orthonormal family, Fourier expansion in a Hilbert space, The finite Bessel inequality and best approximation by a finite orthonormal family, A Hilbert space with a dense sequence has a finite or countable orthonormal basis, Orthonormal families, complete orthonormal systems and Hilbert bases, Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets, Finite, countably infinite, countable, uncountable).

[A4]

Cauchy–Schwarz and pairing. ∣⟨u,v⟩∣≤∥u∥∥v∥, the pairing is linear in the first argument and conjugate-linear in the second, and ∥Sv∥≤∥S∥∥v∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, Real and complex inner-product spaces and their induced length, A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A5]

Countable Choice is the standing hypothesis; the deterministic construction below uses no choice beyond it (The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: Countable Choice, the trace-class T and nuclear representations R=((uj),(vj)), R′=((uj′),(vj′)).

1.1A1A2A4

The candidate scalar is absolutely convergent. For a nuclear representation, ∣⟨vj,uj⟩∣≤∥uj∥∥vj∥ by [A4], so the scalar series converges absolutely with ∣∑j⟨vj,uj⟩∣≤∑j∥uj∥∥vj∥ by [A2].

1.2A1A2A3A4

Comparison of two representations. Put K0:=span⁡‾({uj}∪{uj′}∪{vj}∪{vj′}), listing the finitely many zero families as the constant zero sequence when necessary. Let F0:=Q when H is real and F0:=Q(i) when H is complex. Then K0 is a closed subspace with the at most countable dense set of all finite F0-linear combinations of the listed vectors (which exists without choice), so by [A3] it has a finite or countable Hilbert basis (gn)n∈N obtained from that sequence by Gram–Schmidt. Both representations show T(K0)⊆K0 (the value at x∈K0 is a norm limit of combinations of the vj, respectively vj′) and Tx=0 for x⊥K0 (all coefficients ⟨x,uj⟩, ⟨x,uj′⟩ vanish). For the representation R, expanding both factors in the basis (gn) by Parseval [A3] and using absolute convergence and the interchange of nonnegative finite-subset suprema [A2], ∑j⟨vj,uj⟩=∑j∑n⟨vj,gn⟩⟨gn,uj⟩=∑n∑j⟨vj,gn⟩⟨gn,uj⟩=∑n⟨Tgn,gn⟩, the inner identity because Tgn=∑j⟨gn,uj⟩vj in norm. The same computation applies to R′, so both representations have the same scalar sum; since a trace-class operator has at least one nuclear representation by [A1], the scalar tr⁡(T):=∑j⟨vj,uj⟩ is well defined and claim 2 holds.

1.3A2A3A4

Agreement with every supplied basis. Let E be a Hilbert basis of H and let R=((uj),(vj)) be any nuclear representation of T. For each j, Parseval in the full space gives ∥uj∥2=∑e∈E∣⟨uj,e⟩∣2 and ∥vj∥2=∑e∈E∣⟨vj,e⟩∣2; hence, by Cauchy–Schwarz for the e-sum, interchange of the nonnegative suprema [A2] and the definition of the representation, ∑e∈E∑j∣⟨e,uj⟩∣ ∣⟨vj,e⟩∣≤∑j∥uj∥∥vj∥<+∞. Therefore the double sum ∑e∑j⟨e,uj⟩⟨vj,e⟩ converges absolutely, its value may be computed in either order, and ∑e∈E⟨Te,e⟩=∑e∈E∑j⟨e,uj⟩⟨vj,e⟩=∑j∑e∈E⟨e,uj⟩⟨vj,e⟩=∑j⟨vj,uj⟩, the last equality by Parseval applied to the pair (vj,uj) in H. This is exactly tr⁡E(T)=tr⁡(T), and it also reproves the absolute summability of (⟨Te,e⟩) required by the definition.

2.1step 1.1step 1.2A1A2algebra

Linearity and the bound. For trace-class S,T with nuclear representations RS and RT, the concatenation of RS scaled by a and RT scaled by b is a nuclear representation of aS+bT with scalar sum a∑⟨vj,uj⟩+b∑⟨vj′,uj′⟩ by absolute convergence, so tr⁡(aS+bT)=atr⁡(S)+btr⁡(T); and ∣tr⁡(T)∣≤∑j∥uj∥∥vj∥ for every nuclear representation by [step 1.1], so the infimum characterization [A1] gives ∣tr⁡(T)∣≤∥T∥1.

3.1step 1.1step 1.2step 1.3step 2.1A1A5∎

Conclusion. Claims 1 and 2 are [step 1.1] and [step 1.2], claim 3 is [step 1.3] and claim 4 is [step 2.1]; the definition of tr⁡(T) uses only nuclear representations of T, so no Hilbert basis of H is assumed to exist, while claim 3 handles every basis that is supplied.

Depends on

Dependency tree · 2 levels

Sources