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.

Cyclicity of the trace

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a real or complex Hilbert space (Hilbert space), let T∈B(H) be trace class (Trace class operator) and let S∈B(H) be bounded. Then ST and TS are trace class and tr⁡(ST)=tr⁡(TS). If A,B∈B(H) are Hilbert–Schmidt relative to a supplied Hilbert basis E of H (Hilbert–Schmidt operator and Hilbert–Schmidt norm), then the products AB and BA are trace class and tr⁡(AB)=tr⁡(BA).

Facts & Assumptions

Given: Countable Choice, a Hilbert space H, a trace-class T, a bounded S, and Hilbert–Schmidt A,B relative to a supplied basis E.

[A1]

Trace and its properties. Every trace-class T has a nuclear representation and a well-defined trace. For every supplied Hilbert basis E, that trace equals the absolutely convergent diagonal sum ∑e∈E⟨Te,e⟩. It is equal to ∑j⟨vj,uj⟩ for every nuclear representation Tx=∑j⟨x,uj⟩vj, with ∣tr⁡(T)∣≤∥T∥1 and linearity in the trace-class variable; ∥T∥1=∑nsn(T) (Trace is absolutely convergent and basis independent, Trace class operator, Nuclear series characterizes trace norm, Trace of a trace class operator).

[A2]

Trace ideal. Bounded one-sided multiplication preserves trace class, and ∥STB∥1≤∥S∥∥T∥1∥B∥ (Trace class is a two sided Banach operator ideal).

[A3]

Hilbert–Schmidt products. An operator which is Hilbert–Schmidt relative to a supplied basis is compact. Thus A and B are compact, and their bounded composites AB and BA are compact; the product clause of the factorization theorem then makes both products trace class and gives ∥AB∥1,∥BA∥1≤∥A∥HS,E∥B∥HS,E (Hilbert–Schmidt operators are compact, Compositions with a compact operator are compact, Trace class iff product of two Hilbert Schmidt operators, Hilbert Schmidt operators form a two sided ideal).

[A4]

SVD and adjoints. The SVD uses only positive singular-value indices, with numerical zero padding beyond finite rank, and its partial sums converge in operator norm. The adjoint is bounded with ∥S∗∥=∥S∥, and the identity ⟨Sv,u⟩=⟨v,S∗u⟩ holds (Singular value decomposition for compact operators, Absolute value and singular values of a compact operator, Hilbert-adjoint identities, The Hilbert-space adjoint of a bounded operator).

Proof

technique · direct

Given: Countable Choice, the trace-class T, bounded S, Hilbert–Schmidt A,B relative to E.

1.1A2

Products are trace class. ST and TS are trace class by [A2] with ∥ST∥1≤∥S∥∥T∥1 and ∥TS∥1≤∥S∥∥T∥1.

1.2A1A4

Cyclicity for rank-one operators. Let R:=⟨⋅,u⟩v for fixed u,v∈H, so that R is trace class; then SR=⟨⋅,u⟩Sv and RS=⟨⋅,S∗u⟩v are nuclear representations with one term, so by [A1] tr⁡(SR)=⟨Sv,u⟩ and tr⁡(RS)=⟨v,S∗u⟩, and these are equal by the adjoint identity of [A4].

1.3A1A3A5algebra

The Hilbert–Schmidt case. Write ek=k for k∈E, so that basis elements and indices are unambiguous. Let A,B be Hilbert–Schmidt relative to the supplied basis E; by [A3] the products AB and BA are trace class. Since A is continuous and E is a Hilbert basis, ⟨ABe,e⟩=∑k∈E⟨Be,ek⟩⟨Aek,e⟩ for every e, and the double family αk,eβk,e with αk,e:=⟨Aek,e⟩, βk,e:=⟨Be,ek⟩ has finite total, ∑k,e∣αk,e∣ ∣βk,e∣≤∥A∥HS,E∥B∥HS,E, by two applications of finite Cauchy–Schwarz, Bessel and Parseval [A5]; For detail, on each finite rectangle K×F⊆E×E, finite Cauchy–Schwarz bounds the absolute sum by (∑k∈K,e∈F∣αk,e∣2)1/2(∑k∈K,e∈F∣βk,e∣2)1/2≤∥A∥HS,E∥B∥HS,E, using Bessel in the inner sums. Every finite set of pairs lies in a finite rectangle. The full absolute sum is therefore finite; outside a finite rectangle its tail is arbitrarily small by [A5], which proves that both iterated scalar sums have the same value as the double-family sum. Invoking the diagonal trace formula in [A1] for the trace-class products, tr⁡(AB)=∑e∈E∑k∈Eαk,eβk,e=∑k∈E∑e∈Eβk,eαk,e=tr⁡(BA), the last equality by the symmetric computation for BA.

2.1step 1.1A1A4A5

Cyclicity for general trace-class operators. By [A1] take a nuclear representation Tx=∑j≥1⟨x,uj⟩vj with C=∑j≥1∥uj∥∥vj∥<∞ and partial sums Rn=∑1≤j≤n⟨⋅,uj⟩vj for n∈N, so R0=0 and Rn→T in operator norm. Then SRn→ST and RnS→TS: both errors are at most ∥S∥∥T−Rn∥ by the operator-norm bound. Their terms give nuclear representations ST=∑j⟨⋅,uj⟩Svj and TS=∑j⟨⋅,S∗uj⟩vj. Their sums of norm products are at most ∥S∥C and ∥S∗∥C=∥S∥C, respectively. Both products are already trace class by step 1.1, so [A1] gives tr⁡(ST)=∑j⟨Svj,uj⟩=∑j⟨vj,S∗uj⟩=tr⁡(TS) by [A4], term by term in absolutely convergent series. No ambient Hilbert basis is used in this part.

3.1step 1.1step 1.3step 2.1∎

Conclusion. The general cyclicity statement is [step 2.1] with [step 1.1], and the Hilbert–Schmidt statement is [step 1.3].

Depends on

Used by

Dependency tree · two levels

108 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