Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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 of a trace class operator

Definition

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a real or complex Hilbert space (Hilbert space), let TB(H) be a trace-class operator on H (Trace class operator) and let E be a Hilbert basis of H, supplied as data (Orthonormal families, complete orthonormal systems and Hilbert bases; existence of such a basis is not asserted here). The trace of T relative to E is trE(T):=eETe,e, the sum of the scalar family (Te,e)eE in the finite-subset-net sense of Square-summable families on an arbitrary index set and the space 2(I).

The family is absolutely summable, uniformly in E. Let T=jsj,ejfj be the singular-value series (Singular value decomposition for compact operators, Absolute value and singular values of a compact operator) with (ej)jJ, (fj)jJ orthonormal and jsj=T1<+ (Trace class operator). For every eH the series Te,e=jsje,ejfj,e converges absolutely, because the moduli are bounded by s1je,ejfj,es1e2 by Cauchy–Schwarz and Bessel (Cauchy–Schwarz: x,yxy, with equality exactly for dependent pairs, The finite Bessel inequality and best approximation by a finite orthonormal family). Consequently, for every finite FE, using the interchange of finite sums with the nonnegative finite-subset supremum over j and then finite Cauchy–Schwarz and Bessel twice, eFTe,eeFjsje,ejfj,e=jsjeFe,ejfj,ejsj(eFe,ej2)1/2(eFfj,e2)1/2jsj=T1, because for each j the two finite coefficient sums are bounded by ej=1 and fj=1 (finite Bessel). Hence the finite subsums of (Te,e)eE are bounded by T1, the family is absolutely summable, and an absolutely summable family of scalars is summable in ZF with eETe,eT1 (Square-summable families on an arbitrary index set and the space 2(I)). This justifies the notation trE(T) before any basis-independence statement.

Choice accounting and status. Only a supplied basis E and the singular values of T are used; no Hilbert basis of H is assumed to exist, and the next theorem proves that trE(T) does not depend on the supplied basis and equals the basis-free trace of T (Trace is absolutely convergent and basis independent).

Depends on

Used by

Dependency tree · two levels

80 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