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.

Local trace-preserving Kraus maps do not change the opposite reduced state

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H,K be complex Hilbert spaces, let (Ma)a≥1 be bounded operators on K with ∑a≤NMa∗Ma→IK strongly, and let R be a trace-class operator on H⊗^K. In this statement, R≥0 means that R is self-adjoint and ⟨Rx,x⟩≥0 for every x, as in Self-adjoint, positive, unitary and normal operators. Then the series (when either factor is {0}, use the zero partial-trace maps Tr⁡K:S1({0})→S1(H) and Tr⁡H:S1({0})→S1(K); when both factors are nonzero, use the partial traces of Separable partial trace and its basic properties)

∑a≥1(IH⊗Ma)R(IH⊗Ma∗)

converges in trace norm, its sum Φ(R) is trace class with tr⁡Φ(R)=tr⁡R and Φ(R)≥0 if R≥0, and the reduced state on H is unchanged:

Tr⁡KΦ(R)=Tr⁡KR.

By symmetry, a local map R↦∑a(Na⊗IK)R(Na∗⊗IK) on the first factor also leaves Tr⁡HR fixed. Selective conditioning (one summand normalized by its nonzero trace) is not covered.

Facts & Assumptions

Given: H,K; the family (Ma); a trace-class R on H⊗^K with nuclear representation R=∑jTwj,zj; a bounded A∈B(H).

[F1]

The amplified family (IH⊗Ma) consists of bounded operators on H⊗^K with (IH⊗Ma)∗(IH⊗Ma)=IH⊗Ma∗Ma, and ∑a≤N(IH⊗Ma)∗(IH⊗Ma)→I strongly: on finite sums of elementary tensors this is the strong convergence of ∑a≤NMa∗Ma, and the general case follows by approximation and ∥IH⊗SN∥≤1 (Bounded tensor maps: extension, norm estimate, adjoint and commutation, Hilbert tensor construction: inner product, completion and product bases).

[F2]

Under the strong completeness hypothesis, ∑aVaRVa∗ converges in trace norm for every trace-class R, is positive for positive R, and preserves the trace, where Va:=IH⊗Ma; moreover the identity tr⁡(∑aVaRVa∗)=tr⁡R is the trace-preservation clause (Countable Kraus normalization and trace-norm convergence, Finite-ancilla complete positivity of countable Kraus maps).

[F3]

When H,K≠{0}, Tr⁡K is the unique linear map on S1(H⊗^K) with tr⁡((Tr⁡KT)A)=tr⁡(T(A⊗IK)) for all bounded A, and it satisfies ∥Tr⁡KT∥1≤∥T∥1 (Separable partial trace and its basic properties); the Statement supplies the zero-map convention when a factor is zero.

[F4]

For a bounded operator B and trace-class T, BT is trace class with ∥BT∥1≤∥B∥ ∥T∥1, and tr⁡(BT) is linear in T and continuous in trace norm (Trace class is a two sided Banach operator ideal, Trace is absolutely convergent and basis independent). In addition, every trace-class T has a nuclear representation T=∑jTwj,zj, and for bounded B the trace formulas tr⁡(TB)=∑j⟨wj,B∗zj⟩=tr⁡(BT) hold with absolute convergence (Nuclear bounded cyclicity for trace-class operators, Facts [F2] and Statement (b)).

Proof

1.1givenF1F2

[Convergence of the local map] If H={0} or K={0}, then R=0 and every summand (IH⊗Ma)R(IH⊗Ma)∗ is zero; hence Φ(R)=0 and both sides of Tr⁡KΦ(R)=Tr⁡KR are zero by the convention in the Statement. Assume henceforth H,K≠{0}. By [F1] the amplified family satisfies the strong completeness hypothesis of [F2] on the Hilbert space H⊗^K, so the series ∑aVaRVa∗ with Va=IH⊗Ma converges in trace norm, its sum Φ(R) is trace class with tr⁡Φ(R)=tr⁡R, and Φ(R)≥0 for R≥0.

2.1step 1.1F4algebra

[Pairing computation] For bounded A and Va=IH⊗Ma, apply the bounded cyclicity of [F4] to the trace-class operator T=RVa∗(A⊗IK) and bounded Va. It gives tr⁡(VaRVa∗(A⊗IK))=tr⁡(R Va∗(A⊗IK)Va) with Va∗(A⊗IK)Va=(IH⊗Ma∗)(A⊗IK)(IH⊗Ma)=A⊗Ma∗Ma. For each N, sum this identity over a≤N; trace-norm convergence of the series in step 1.1 and trace-norm continuity of the bounded trace pairing [F4] give tr⁡(Φ(R)(A⊗IK))=lim⁡N→∞tr⁡(R(A⊗SN)), where SN=∑a≤NMa∗Ma.

3.1step 2.1F1F4algebra

[Passing to the limit in the completeness sum] Let R=∑jTwj,zj be nuclear. For each N, tr⁡(R(A⊗∑a≤NMa∗Ma))=∑j⟨wj,(A⊗SN)∗zj⟩ with SN:=∑a≤NMa∗Ma, an absolutely convergent series with ∣⟨wj,(A⊗SN)∗zj⟩∣≤∥A∥ ∥wj∥ ∥zj∥; since (A⊗SN)∗→A∗⊗I strongly, each term converges to ⟨wj,(A∗⊗I)zj⟩, and the summable majorant gives ∑j⟨wj,(A⊗SN)∗zj⟩→∑j⟨wj,(A∗⊗I)zj⟩=tr⁡(R(A⊗IK)). Hence tr⁡(Φ(R)(A⊗IK))=tr⁡(R(A⊗IK)).

4.1step 3.1F3∎

[Conclusion] By [F3], tr⁡((Tr⁡KΦ(R))A)=tr⁡(Φ(R)(A⊗IK))=tr⁡(R(A⊗IK))=tr⁡((Tr⁡KR)A) for every bounded A; since the pairings with all A determine a trace-class operator by the uniqueness in [F3], Tr⁡KΦ(R)=Tr⁡KR. The statement for the first factor is obtained by exchanging the roles of H and K.

Depends on

Dependency tree · 2 levels

Sources