Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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-class duality and finite-rank density

Statement

Assume the Axiom of Choice. Let H be a complex Hilbert space, and let S1(H) be its trace-class operators with trace norm ∥⋅∥1. Write Tr⁡:=tr⁡ for the basis-independent trace defined earlier. Finite-rank operators are dense in (S1(H),∥⋅∥1). For every bounded linear functional Φ:S1(H)→C, there is a unique X∈B(H) such that Φ(T)=Tr⁡(TX)(T∈S1(H)), and the correspondence is isometric: ∥Φ∥=∥X∥.

Facts & Assumptions

Given: [A1], a complex Hilbert space H, its trace-class space, trace norm and trace.

[A1]

Assume the Axiom of Choice; it implies Countable Choice, the stated choice input for the imported trace-class tools (The Axiom of Choice, AC implies DC implies countable choice, The Axiom of Countable Choice (ACω)).

[F1]

Trace class operator defines S1(H) by summability of singular values. Singular value decomposition for compact operators indexes exactly the positive singular values by a finite initial segment or the positive integers and gives norm-convergent partial sums; the trace-norm characterization Nuclear series characterizes trace norm identifies their sum as the trace norm.

[F2]

Trace class is a Banach space and a two-sided ideal: ∥AYB∥1≤∥A∥∥Y∥1∥B∥ (Trace class is a two sided Banach operator ideal).

[F3]

The basis-independent trace equals the scalar sum of any nuclear representation and obeys ∣Tr⁡(Y)∣≤∥Y∥1 (Trace of a trace class operator, Trace is absolutely convergent and basis independent).

[F4]

The inner product is linear in its first argument; every bounded linear functional on H has a unique Riesz vector (Real and complex inner-product spaces and their induced length, Riesz representation for Hilbert spaces).

[F5]

Bounded operators have Hilbert adjoints satisfying ⟨Xξ,η⟩=⟨ξ,X∗η⟩ (Hilbert-adjoint identities).

Proof

technique · direct

Given: [F1]–[F5], a bounded linear functional Φ on S1(H), and its trace pairing.

1.1A1F1construct

Let J={1,…,r} if T has finite rank r, and J=N>0 otherwise, as in [F1]. Write its singular expansion T=∑j∈Jsj⟨ ⋅,ej⟩fj and let TN=∑j∈J, j≤Nsj⟨ ⋅,ej⟩fj. The SVD gives T−TN=∑j∈J, j>Nsj⟨ ⋅,ej⟩fj as a norm-convergent nuclear representation whose coefficient products sum to the tail ∑j∈J, j>Nsj→0. The nuclear characterization in [F1] therefore gives ∥T−TN∥1≤∑j∈J, j>Nsj→0. In finite rank the tail is empty once N≥r. Thus finite-rank operators are trace-norm dense.

1.2F1F4construct

For ξ,η∈H, define the rank-one operator Rξ,ηz=⟨z,η⟩ξ. Its only possible nonzero singular value is ∥ξ∥∥η∥, so ∥Rξ,η∥1=∥ξ∥∥η∥. The form b(ξ,η):=Φ(Rξ,η) is linear in ξ, conjugate-linear in η, and satisfies ∣b(ξ,η)∣≤∥Φ∥∥ξ∥∥η∥. For fixed ξ, the map gξ(η):=b(ξ,η)‾ is bounded and linear in η. Riesz representation [F4] gives a unique vector Xξ such that gξ(η)=⟨η,Xξ⟩; conjugating gives b(ξ,η)=⟨Xξ,η⟩. Uniqueness makes X linear, and the bound gives ∥Xξ∥≤∥Φ∥∥ξ∥, so X∈B(H) and ∥X∥≤∥Φ∥.

2.1F3F5step 1.2algebra

The nuclear representation Rξ,ηX=Rξ,X∗η and [F3] give Tr⁡(Rξ,ηX)=⟨ξ,X∗η⟩=⟨Xξ,η⟩. Every finite-rank operator is a finite sum of rank-one operators, so linearity of Φ and of the trace gives Φ(T)=Tr⁡(TX) for every finite-rank T.

3.1F2F3step 1.1step 2.1

For arbitrary T∈S1(H), use the finite-rank approximants TN from step 1.1. Boundedness of Φ gives Φ(TN)→Φ(T). Also ∣Tr⁡((T−TN)X)∣≤∥(T−TN)X∥1≤∥T−TN∥1∥X∥→0 by [F2] and [F3]. Hence the same trace identity holds for every trace-class T.

4.1F2F3step 1.2step 3.1

If H={0}, then S1(H)=B(H)={0}, so the only bounded functional and representing operator are zero and the isometry assertion holds. Otherwise the trace identity and [F2]–[F3] imply ∣Φ(T)∣≤∥T∥1∥X∥, so ∥Φ∥≤∥X∥. For unit ξ,η, step 2.1 gives ∣⟨Xξ,η⟩∣=∣Φ(Rξ,η)∣≤∥Φ∥, since ∥Rξ,η∥1=1. Taking suprema over unit ξ,η gives ∥X∥≤∥Φ∥. If Y also represents Φ, applying the identity to each Rξ,η gives ⟨(X−Y)ξ,η⟩=0 for all ξ,η, hence X=Y.

5.1step 1.1step 1.2step 2.1step 3.1step 4.1∎

Steps 1.1–4.1 prove finite-rank trace-norm density and establish a unique operator X with the stated pairing and norm equality for every bounded functional Φ.

Depends on

Dependency tree · 2 levels

Sources