Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1: minimal orthogonal representation at maximally mixed input

Proved
QAlgorithms.Papers.Independent.Support50.P41.orthogonalMinimalKraus

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

prove2quantum

Every CPTP map Φ\PhiΦ on a nonzero finite-dimensional system has a normalized Kraus representation (Aμ)(A_\mu)(Aμ​) of nonzero Hilbert--Schmidt orthogonal operators. Furthermore, every such representation is minimal:

Tr⁡(Aμ†Aν)=0 (μ≠ν), Aμ≠0⟹m≤n\operatorname{Tr}(A_\mu^\dagger A_\nu)=0\ (\mu\ne\nu),\ A_\mu\ne0 \quad\Longrightarrow\quad m\le nTr(Aμ†​Aν​)=0 (μ=ν), Aμ​=0⟹m≤n

for every other Kraus representation with nnn terms, where mmm is the size of (Aμ)(A_\mu)(Aμ​). These are the diagonal representations at maximally mixed input after discarding zero operators.

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: a nonzero orthogonal Kraus family exists and is minimal; read in the maximally mixed case. -/
theorem orthogonalMinimalKraus {d : ℕ} [NeZero d]
    (Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi) :
    (∃ m : ℕ, ∃ A : Fin m → Matrix (Fin d) (Fin d) ℂ,
      OperatorSum Phi A ∧ (∀ k, A k ≠ 0) ∧
        ∀ k l, k ≠ l → ((A k)ᴴ * A l).trace = 0) ∧
    ∀ m (A : Fin m → Matrix (Fin d) (Fin d) ℂ), OperatorSum Phi A →
      (∀ k, A k ≠ 0) → (∀ k l, k ≠ l → ((A k)ᴴ * A l).trace = 0) →
      ∀ n (B : Fin n → Matrix (Fin d) (Fin d) ℂ), OperatorSum Phi B → m ≤ n := 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: minimal orthogonal representation at maximally mixed input
Read-back

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

For every positive integer ddd and every map Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C) admitting a finite representation Φ(X)=∑jEjXEj†\Phi(X)=\sum_jE_jXE_j^\daggerΦ(X)=∑j​Ej​XEj†​ with ∑jEj†Ej=Id\sum_jE_j^\dagger E_j=I_d∑j​Ej†​Ej​=Id​, there exist a natural number mmm and matrices Ak∈Md(C)A_k\in M_d(\mathbb C)Ak​∈Md​(C), 0≤k<m0\le k<m0≤k<m, satisfying

∑kAk†Ak=Id,Φ(X)=∑kAkXAk†for every X,Ak≠0,Tr⁡(Ak†Al)=0(k≠l).\sum_kA_k^\dagger A_k=I_d,\qquad \Phi(X)=\sum_kA_kXA_k^\dagger\quad\text{for every }X,\qquad A_k\ne0,\qquad \operatorname{Tr}(A_k^\dagger A_l)=0\quad(k\ne l).k∑​Ak†​Ak​=Id​,Φ(X)=k∑​Ak​XAk†​for every X,Ak​=0,Tr(Ak†​Al​)=0(k=l).

Furthermore, for every natural number mmm and every family AAA satisfying all these conditions, every natural number nnn and family B0,…,Bn−1B_0,\ldots,B_{n-1}B0​,…,Bn−1​ satisfying ∑jBj†Bj=Id\sum_jB_j^\dagger B_j=I_d∑j​Bj†​Bj​=Id​ and Φ(X)=∑jBjXBj†\Phi(X)=\sum_jB_jXB_j^\daggerΦ(X)=∑j​Bj​XBj†​ for all XXX obey m≤nm\le nm≤n; no nonzero or orthogonality condition is imposed on BBB. Both family sizes range over all natural numbers, although an empty complete family is impossible when 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