Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1: diagonal operator-sum representation for a specified input

Proved
QAlgorithms.Papers.Independent.Support50.P41.diagonalKraus

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

prove2quantum

For every density matrix ρ\rhoρ and CPTP map Φ\PhiΦ on a nonzero finite-dimensional system, there exists a normalized Kraus representation (Aμ)(A_\mu)(Aμ​) with

Tr⁡(AμρAν†)=0(μ≠ν).\operatorname{Tr}(A_\mu\rho A_\nu^\dagger)=0\quad(\mu\ne\nu).Tr(Aμ​ρAν†​)=0(μ=ν).

Thus the exchange matrix can be diagonalized by choosing the representation. No full-rank assumption on ρ\rhoρ or global minimality is asserted.

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 p.21: existence of an input-dependent diagonal representation; no minimality for singular inputs. -/
theorem diagonalKraus {d : ℕ} [NeZero d]
    (Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi)
    (rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho) :
    ∃ m : ℕ, ∃ A : Fin m → Matrix (Fin d) (Fin d) ℂ,
      OperatorSum Phi A ∧ ∀ k l, k ≠ l → (A k * rho * (A l)ᴴ).trace = 0 := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 21, §5.1: diagonal operator-sum representation for a specified input
Read-back

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

For every positive integer ddd, every map Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C) that admits a finite representation Φ(X)=∑jEjXEj†\Phi(X)=\sum_j E_jXE_j^\daggerΦ(X)=∑j​Ej​XEj†​ with ∑jEj†Ej=Id\sum_jE_j^\dagger E_j=I_d∑j​Ej†​Ej​=Id​, and every positive semidefinite matrix ρ∈Md(C)\rho\in M_d(\mathbb C)ρ∈Md​(C) with Tr⁡ρ=1\operatorname{Tr}\rho=1Trρ=1, there exist a natural number mmm 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

∑kAk†Ak=Id,Φ(X)=∑kAkXAk†for every X∈Md(C),Tr⁡(AkρAl†)=0(k≠l).\sum_k A_k^\dagger A_k=I_d,\qquad \Phi(X)=\sum_k A_kXA_k^\dagger\quad\text{for every }X\in M_d(\mathbb C), \qquad \operatorname{Tr}(A_k\rho A_l^\dagger)=0\quad(k\ne l).k∑​Ak†​Ak​=Id​,Φ(X)=k∑​Ak​XAk†​for every X∈Md​(C),Tr(Ak​ρAl†​)=0(k=l).

The quantified number mmm is allowed syntactically to be zero, but the completeness identity excludes that case because d>0d>0d>0.

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