Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2 theorem II; §A.2: normalized operator-sum representation

Proved
QAlgorithms.Papers.Independent.Support50.P41.operatorSumRepresentation

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For a complex-linear completely positive trace-preserving map Φ\PhiΦ on Md(C)M_d(\mathbb C)Md​(C), d≥1d\ge1d≥1, there are m≤d2m\le d^2m≤d2 matrices AμA_\muAμ​ such that

Φ(X)=∑μAμXAμ†for every X,∑μAμ†Aμ=Id.\Phi(X)=\sum_\mu A_\mu X A_\mu^\dagger\quad\text{for every }X,\qquad \sum_\mu A_\mu^\dagger A_\mu=I_d.Φ(X)=μ∑​Aμ​XAμ†​for every X,μ∑​Aμ†​Aμ​=Id​.

The normalization is part of the representation theorem.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P41

open QAlgorithms

open QAlgorithms.Entanglement (IsCompletelyPositive)

open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)

open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)

open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)

open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)

open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)

open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.

local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _

/-- PDF pp.5--6,32--34, theorem II: normalized operator-sum representation from independent CP and TP. -/
theorem operatorSumRepresentation {d : ℕ} [NeZero d]
    (Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
    (hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace) :
    ∃ m : ℕ, m ≤ d^2 ∧ ∃ A : Fin m → Matrix (Fin d) (Fin d) ℂ,
      OperatorSum Phi A := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 6, §2.2 theorem II; §A.2: normalized operator-sum representation
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every integer d≥1d\ge1d≥1 and every complex-linear map Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C) that preserves the trace of every matrix and is completely positive—its blockwise amplification id⁡r⊗Φ\operatorname{id}_r\otimes\Phiidr​⊗Φ preserves positive semidefiniteness for every integer r≥0r\ge0r≥0—there exist an integer m≤d2m\le d^2m≤d2 and matrices A0,…,Am−1∈Md(C)A_0,\ldots,A_{m-1}\in M_d(\mathbb C)A0​,…,Am−1​∈Md​(C) such that

∑k=0m−1Ak†Ak=Id,Φ(X)=∑k=0m−1AkXAk†for every X∈Md(C).\sum_{k=0}^{m-1}A_k^\dagger A_k=I_d, \qquad \Phi(X)=\sum_{k=0}^{m-1}A_kXA_k^\dagger \quad\text{for every }X\in M_d(\mathbb C).k=0∑m−1​Ak†​Ak​=Id​,Φ(X)=k=0∑m−1​Ak​XAk†​for every X∈Md​(C).

There is no explicit positive lower bound on mmm, but m=0m=0m=0 would make the first equality 0=Id0=I_d0=Id​, which is impossible because d≥1d\ge1d≥1.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me