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 isometric dilation and partial-trace recovery

Statement

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

∑a≤A, r≤RMa,r∗Ma,r⟶Istrongly as A,R→∞.

Let (ea,r)a,r≥1 be the standard orthonormal basis of ℓ2 and form H⊗^ℓ2 (Hilbert tensor construction: inner product, completion and product bases). Then

W:H→H⊗^ℓ2,Wψ:=∑a,r≥1Ma,rψ⊗ea,r

is a linear isometry; for each outcome label a the strong limit Pa:=∑r≥1IH⊗Tea,r,ea,r is an orthogonal projection (The Hilbert orthogonal projection onto a closed subspace), the family (Pa)a≥1 consists of pairwise orthogonal projections with ∑aPa=I strongly, and

W∗PaW=∑r≥1Ma,r∗Ma,r=:Fa;

moreover the partial trace of the dilated state over ℓ2 recovers the Kraus instrument: for every trace-class ρ on H,

Tr⁡ℓ2(WρW∗)=∑a,r≥1Ma,rρMa,r∗,

the series converging in trace norm and the right side being the map of Countable Kraus normalization and trace-norm convergence. This realizes the specified family; it is not a classification of all channels.

Facts & Assumptions

Given: H; the family (Ma,r) with the stated strong completeness; the orthonormal basis (ea,r) of ℓ2.

[F1]

For ψ∈H, the nonnegative double series ∑a,r∥Ma,rψ∥2 has value ∥ψ∥2, and ∥Wψ∥2=∑a,r∥Ma,rψ∥2 whenever the partial sums converge (Countable Kraus normalization and trace-norm convergence, Hilbert tensor construction: inner product, completion and product bases, Parseval equivalences for an orthonormal family).

[F2]

The operators Tea,r,ea,r are orthogonal projections onto Cea,r, pairwise orthogonal, with ∑a,rTea,r,ea,r=I strongly; a strong sum of pairwise orthogonal projections is the orthogonal projection onto the closed span of their ranges, and telescoping strong sums behave additively (Weak and strong additivity of orthogonal projections, The Hilbert orthogonal projection onto a closed subspace, Finite effects and instruments: normalization and non-determination of the update).

[F3]

Tr⁡ℓ2 is the trace-norm continuous linear map with defining identity tr⁡((Tr⁡ℓ2T)A)=tr⁡(T(A⊗I)) for bounded A, and on rank-one operators Tr⁡ℓ2Tu⊗e,u′⊗e′=⟨e,e′⟩Tu,u′ (Separable partial trace and its basic properties).

[F4]

tr⁡(Tx,z)=⟨x,z⟩, and for bounded B, Tx,zB=Tx,B∗z (Rank-one operator calculus, Nuclear bounded cyclicity for trace-class operators).

Proof

1.1givenF1algebra

[The dilation is an isometry] The series defining Wψ converges: the partial sums ∑a≤A,r≤RMa,rψ⊗ea,r are Cauchy because for A′≥A, R′≥R the squared norm of the difference is the corresponding nonnegative subsum, which is bounded by the tail of the summable series ∑a,r∥Ma,rψ∥2; by [F1] the limit Wψ has ∥Wψ∥2=∑a,r∥Ma,rψ∥2=∥ψ∥2, so W is linear and isometric.

2.1step 1.1F2algebra

[Outcome projections] By [F2] each Pa=∑rI⊗Tea,r,ea,r is the orthogonal projection onto H⊗^span⁡‾{ea,r:r≥1}, the strong sums over a telescope to I, and PaPb=δabPa.

3.1step 2.1F1algebra

[Compression] As in the finite case, W∗(ξ⊗ea,r)=Ma,r∗ξ because W is an isometry with the displayed action, so W∗PaWψ=∑rMa,r∗Ma,rψ for every ψ, the strong limit defining Fa.

4.1step 1.1step 3.1F1F3F4algebra∎

[Partial-trace recovery by truncations] For x,y∈H and a finite rectangle D of index pairs put wD:=∑(a,r)∈DMa,rx⊗ea,r and zD:=∑(a,r)∈DMa,ry⊗ea,r. Then wD→Wx, zD→Wy by step 1.1, and rank-one trace-norm continuity gives TwD,zD→TWx,Wy=WTx,yW∗. For each finite rectangle the elementary formula [F3] gives Tr⁡ℓ2TwD,zD=∑(a,r)∈DTMa,rx,Ma,ry; Cauchy–Schwarz and [F1] give ∑a,r∥Ma,rx∥∥Ma,ry∥≤∥x∥∥y∥, so these diagonal terms converge absolutely in trace norm. Taking limits using [F3] proves the Kraus formula on rank-one inputs. Both sides are bounded linear maps on trace class: the left side by the two-sided ideal bound for W,W∗ and [F3], and the right side by nuclear expansion and the preceding rank-one bound. Finite rank-one sums are trace-norm dense by the nuclear characterization in Nuclear bounded cyclicity for trace-class operators, so the identity extends to every trace-class input and equals the map of Countable Kraus normalization and trace-norm convergence.

Depends on

Dependency tree · 2 levels

Sources