Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

Countable Kraus normalization and trace-norm convergence

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space (Hilbert space) and let (Ma)a≥1 be bounded operators on H with

∑a=1NMa∗Ma⟶Istrongly as N→∞.

Then:

(a) ∑a≥1∥Max∥2=∥x∥2 for every x∈H;

(b) for every self-adjoint positive trace-class ρ (positivity as in Self-adjoint, positive, unitary and normal operators) the series ∑a≥1MaρMa∗ converges in trace norm to a self-adjoint positive trace-class operator Φ(ρ) with tr⁡Φ(ρ)=tr⁡ρ;

(c) Φ extends uniquely to a linear positive map Φ:S1(H)→S1(H) with tr⁡Φ(ρ)=tr⁡ρ for all trace-class ρ and ∥Φ(ρ)∥1≤∥ρ∥1 for self-adjoint ρ; it maps density operators to density operators. No claim is made that every positive trace-preserving map has such a family.

Facts & Assumptions

Given: A complex Hilbert space H; bounded operators Ma with strong completeness ∑a≤NMa∗Ma→I; a positive trace-class ρ.

[F1]

For every x, ⟨(∑a≤NMa∗Ma)x,x⟩→⟨x,x⟩ and the partial sums are increasing (each term Ma∗Ma≥0), so the nonnegative series ∑a∥Max∥2=∑a⟨Ma∗Max,x⟩ has value ∥x∥2 (Hilbert space).

[F2]

tr⁡(MaρMa∗)=tr⁡(Ma∗Maρ); Tx,zB=Tx,B∗z; T is trace class exactly when it is a nuclear series; trace class is a complete two-sided ideal; the trace is linear, continuous for ∥⋅∥1 and tr⁡T=∑jtr⁡Twj,zj for nuclear representations (Nuclear bounded cyclicity for trace-class operators, Rank-one operator calculus, Trace class is a two sided Banach operator ideal, Trace is absolutely convergent and basis independent).

[F3]

A self-adjoint positive trace-class operator with positive trace becomes a density operator after dividing by its trace and has the spectral expansion ρ=∑nwnTun,un with orthonormal un, wn≥0 and tr⁡ρ=∑nwn; a zero-trace self-adjoint positive trace-class operator is zero. Conversely such sums (with ∑wn<∞) are self-adjoint positive trace class (Density operators and scalar spectral probability, Trace of a positive operator is the sum of its eigenvalues, Self-adjoint, positive, unitary and normal operators).

[F4]

A self-adjoint compact operator has an expansion ∑λλPλ and tr⁡(T±)=∑±λ>0∣λ∣; for a positive trace-class operator S, ∥S∥1=tr⁡S (Spectral theorem for compact self adjoint operators, Trace of a positive operator is the sum of its eigenvalues, Trace class is a two sided Banach operator ideal, Trace class iff product of two Hilbert Schmidt operators).

Proof

1.1givenF1algebra

[Norm identity, including the zero space] If H={0}, then every Ma and every trace-class input is zero, so the unique map on S1(H)={0} satisfies (a)-(c). Suppose henceforth that H≠{0}. For every x, ∑a≤N∥Max∥2 is the increasing sequence ⟨(∑a≤NMa∗Ma)x,x⟩, so its supremum is ⟨x,x⟩=∥x∥2 by strong convergence and continuity of the inner product in N; by [F1] this supremum is ∑a∥Max∥2.

2.1step 1.1F2F3F4algebra

[Positive input] Let ρ=∑nwnTun,un be the spectral expansion [F3]. The partial sums ΦN(ρ):=∑a≤NMaρMa∗ are positive trace-class with tr⁡ΦN(ρ)=∑a≤N∑nwn∥Maun∥2 by [F2]; the double sum increases with N, and its limit is ∑nwn∑a∥Maun∥2=∑nwn∥un∥2=tr⁡ρ by step 1.1 and Tonelli for nonnegative series. Hence the increasing positive sequence ΦN(ρ) has traces increasing to tr⁡ρ, so for N≥M we have ∥ΦN(ρ)−ΦM(ρ)∥1=tr⁡ΦN(ρ)−tr⁡ΦM(ρ)→0 ([F4] with positivity of the difference); by completeness of S1(H) [F2] the series converges in trace norm to a trace-class Φ(ρ)≥0 (the trace-norm limit of positive operators is positive) with tr⁡Φ(ρ)=tr⁡ρ.

3.1step 1.1step 2.1F2F3F4algebra

[Linear extension by nuclear convergence] For rank-one input, MaTu,vMa∗=TMau,Mav by [F2]. Step 1.1 and Cauchy–Schwarz give ∑a∥Mau∥∥Mav∥≤∥u∥∥v∥. Thus for a nuclear input T=∑jTuj,vj the double series of Kraus rank-one images is absolutely summable in trace norm, with total norm at most ∑j∥uj∥∥vj∥. Its sum is the trace-norm limit of ΦN(T)=∑a≤NMaTMa∗, by interchanging absolutely convergent sums and the bounded two-sided ideal action. This limit depends only on T, so defines a linear map Φ extending the positive-input map of step 2.1. Taking the nuclear infimum (Nuclear series characterizes trace norm) gives the bound ∥Φ(T)∥1≤∥T∥1 for every input. For rank-one inputs, the trace sum is ∑a⟨Mau,Mav⟩=⟨u,v⟩, by strong completeness and the adjoint identity; extending through the absolutely convergent nuclear sum proves tr⁡Φ(T)=tr⁡T. The positive trace-class operators linearly span trace class by the self-adjoint real/imaginary and positive/negative spectral decompositions in [F4], so no other linear extension agreeing with step 2.1 is possible.

4.1step 2.1step 3.1F4∎

[Norm bound and conclusion] For self-adjoint ρ with spectral decomposition ρ=ρ+−ρ− write T=ρ. Then Φ(ρ)=Φ(ρ+)−Φ(ρ−) by construction, so ∥Φ(ρ)∥1≤tr⁡Φ(ρ+)+tr⁡Φ(ρ−)=tr⁡ρ++tr⁡ρ−=∥ρ∥1 using step 2.1 and [F4]. Positivity for arbitrary ρ≥0 is step 2.1, and trace preservation was shown in step 3.1; hence density operators map to density operators.

Depends on

Dependency tree · 2 levels

Sources