Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 normal density states

Definition

Let H≠{0} be a separable complex Hilbert space, with inner product linear in its first argument. An operator ρ∈B(H) is a density operator when it is positive, trace class, and Tr⁡ρ=1. Here trace class means compact with summable singular values, and Tr⁡ is the basis-independent trace of a trace-class operator.

The normal density state represented by ρ is the functional on bounded operators ωρ(A):=Tr⁡(ρA),A∈B(H). In this page, “normal density state” means this specified trace-pairing representation; no equivalence with other definitions of normal functionals is assumed. The trace pairing is used only for bounded A. Unbounded observables are treated through their spectral probability measures in Trace-state cyclicity and spectral probability calculus.

Facts & Assumptions

Given: Countable Choice, a nonzero separable complex Hilbert space H, a positive trace-class operator ρ with Tr⁡ρ=1, and a bounded operator A∈B(H).

[A1]

Countable Choice is the exact choice assumption used to index the nonzero eigenvalues by a finite or countable set (The Axiom of Countable Choice (ACω)).

[F1]

Trace class operator: a trace-class operator is compact with summable singular values; its trace norm dominates its operator norm.

[F2]

Spectral theorem for compact self adjoint operators: a positive compact operator has at most countably many positive eigenvalues with an orthonormal family spanning its support.

[F3]

Trace of a positive operator is the sum of its eigenvalues: for a positive trace-class operator, its trace is the sum of its positive eigenvalues with multiplicity and its trace norm is that sum. This gives the trace directly without treating the positive eigenfamily as a Hilbert basis.

[F4]

Trace is absolutely convergent and basis independent: the trace of a trace-class operator is absolutely defined, basis independent, linear, and bounded by its trace norm.

[F5]

Trace class is a two sided Banach operator ideal: if T is trace class and A,B are bounded, then ATB is trace class and ∥ATB∥1≤∥A∥∥T∥1∥B∥.

[F6]

Nuclear bounded cyclicity for trace-class operators: for a trace-class nuclear expansion T=∑jTuj,vj and bounded A, Tr⁡(AT)=∑j⟨Auj,vj⟩ and Tr⁡(TA)=Tr⁡(AT).

Proof

1.1givenA1F1F2F3

By [F1] and [F2], write ρ=∑j∈Jpj∣uj⟩⟨uj∣, where J is finite or countable, pj>0, and the uj are orthonormal. The positive-operator trace formula [F3] gives ∑jpj=Tr⁡ρ=1 and ∥ρ∥1=1. For every finite subset F⊆J, the remainder ρ−∑j∈Fpj∣uj⟩⟨uj∣ is positive trace class with trace norm 1−∑j∈Fpj. Thus these finite partial sums converge to ρ in trace norm as the finite-subset net exhausts J; no basis of ker⁡ρ is used.

2.1givenstep 1.1F4F5F6algebra

By [F5], ρA is trace class. The trace-norm expansion from step 1.1 is the nuclear representation ρ=∑j∈JTpjuj,uj, since ∑j∥pjuj∥∥uj∥=∑jpj=1. The basis-independent trace [F4] and bounded cyclicity and its nuclear-series formula [F6] give Tr⁡(ρA)=∑j∈Jpj⟨Auj,uj⟩. The series is absolutely convergent because ∑jpj∣⟨Auj,uj⟩∣≤∥A∥∑jpj=∥A∥. Thus ωρ is a well-defined bounded linear functional with ∣ωρ(A)∣≤∥A∥.

3.1givenstep 1.1step 2.1algebra∎

For A=I, step 2.1 gives ωρ(I)=∑jpj=1. If A≥0, every ⟨Auj,uj⟩≥0, so step 2.1 gives ωρ(A)≥0. Therefore the trace pairing is a positive normalized bounded functional, as asserted.

Depends on

Dependency tree · 2 levels

Sources