Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered appendix result: Choi rank equals minimum Kraus number

Proved
QAlgorithms.Papers.Independent.Gap48.P36.choi_kraus_minimality

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

prove2quantum

All Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. For Φ:Md→MdB\Phi:M_d\to M_{d_B}Φ:Md​→MdB​​ let Γ=d−1∑j,k∣j⟩⟨k∣⊗Φ(∣j⟩⟨k∣)\Gamma=d^{-1}\sum_{j,k}|j\rangle\langle k|\otimes\Phi(|j\rangle\langle k|)Γ=d−1∑j,k​∣j⟩⟨k∣⊗Φ(∣j⟩⟨k∣). Choose its orthonormal spectral basis, retain nonzero eigenvalues λμ\lambda_\muλμ​ with multiplicities, and reshape Gμ(b,a)=dλμ zμ(a,b)G_\mu(b,a)=\sqrt{d\lambda_\mu}\,z_\mu(a,b)Gμ​(b,a)=dλμ​​zμ​(a,b). Then

rank⁡Γ=κ=min⁡{number of Kraus operators for Φ}≤d dB.\operatorname{rank}\Gamma=\kappa=\min\{\text{number of Kraus operators for }\Phi\}\le d\,d_B.rankΓ=κ=min{number of Kraus operators for Φ}≤ddB​.

The computed family GμG_\muGμ​ is normalized, represents Φ\PhiΦ, and has exactly κ\kappaκ members. Tensor pair indices avoid the faulty flattening factor.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P36

open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal

open QAlgorithms.Papers.Independent.Claimed50.P48

open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)

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

open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)

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

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C D E K L A2 B2 C2 : Type*}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]

variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]

variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]

/-- Unnumbered Choi/Kraus minimality, PDF pp.29–30: normalized Choi rank,
actual minimum Kraus number, and its dimension bound. Pair indices avoid the
printed flattening subscript (dprime-1)m+j. Correction: use the pair
(input j, output m); (88)-(89) determine this order and sqrt(d lambda). -/
theorem choi_kraus_minimality [Nonempty A] [Nonempty B]
    (Phi : Superop A B) (hPhi : IsChannel Phi) :
    (normalizedChoi Phi).IsHermitian ∧
    Matrix.rank (normalizedChoi Phi) = krausNumber Phi ∧
    Fintype.card (ChoiSupport Phi) = krausNumber Phi ∧
    IsKrausFamily (spectralKraus Phi) ∧ krausApply (spectralKraus Phi) = Phi ∧
    krausNumber Phi ≤ Fintype.card A * Fintype.card B ∧
    ∃ F : Fin (krausNumber Phi) → Matrix B A ℂ, IsKrausFamily F ∧ Phi = krausApply F := by sorry

end QAlgorithms.Papers.Independent.Gap48.P36

end
Source
Properties of Conjugate Channels with Applications to Additivity and Multiplicativity, arXiv:quant-ph/0509126v3, PDF p. 30, Unnumbered appendix result: Choi rank equals minimum Kraus number
Read-back

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

For any finite nonempty index types A,BA,BA,B, each equipped with decidable equality, and any map Φ:CA×A→CB×B\Phi:\mathbb C^{A\times A}\to\mathbb C^{B\times B}Φ:CA×A→CB×B admitting a finite Kraus representation with ∑jEj†Ej=IA\sum_jE_j^\dagger E_j=I_A∑j​Ej†​Ej​=IA​, define its normalized Choi matrix by J(a,b),(a′,b′)=Φ(Ea,a′)b,b′/∣A∣J_{(a,b),(a',b')}=\Phi(E_{a,a'})_{b,b'}/|A|J(a,b),(a′,b′)​=Φ(Ea,a′​)b,b′​/∣A∣, and let rΦr_\PhirΦ​ be the infimum in N\mathbb NN of all natural numbers rrr for which there are matrices FjF_jFj​, j<rj<rj<r, satisfying ∑jFj†Fj=IA\sum_jF_j^\dagger F_j=I_A∑j​Fj†​Fj​=IA​ and Φ(X)=∑jFjXFj†\Phi(X)=\sum_jF_jXF_j^\daggerΦ(X)=∑j​Fj​XFj†​ for every XXX. Then JJJ is Hermitian and rank⁡J=rΦ\operatorname{rank}J=r_\PhirankJ=rΦ​. Using the Hermitian eigenvalues λk\lambda_kλk​ and orthonormal eigenvectors vkv_kvk​ supplied for JJJ, indexed by k∈A×Bk\in A\times Bk∈A×B, the set S={k:λk≠0}S=\{k:\lambda_k\ne0\}S={k:λk​=0} has cardinality rΦr_\PhirΦ​; the matrices

(Kk)b,a=∣A∣λk vk(a,b)(k∈S)(K_k)_{b,a}=\sqrt{|A|\lambda_k}\,v_k(a,b)\qquad(k\in S)(Kk​)b,a​=∣A∣λk​​vk​(a,b)(k∈S)

satisfy ∑k∈SKk†Kk=IA\sum_{k\in S}K_k^\dagger K_k=I_A∑k∈S​Kk†​Kk​=IA​ and ∑k∈SKkXKk†=Φ(X)\sum_{k\in S}K_kXK_k^\dagger=\Phi(X)∑k∈S​Kk​XKk†​=Φ(X) for every XXX. Moreover, rΦ≤∣A∣∣B∣r_\Phi\le |A||B|rΦ​≤∣A∣∣B∣, and there exists such a normalized Kraus representation indexed by exactly {0,…,rΦ−1}\{0,\ldots,r_\Phi-1\}{0,…,rΦ​−1}. In the definitions, the eigenvalues and eigenvectors would be set to zero for a non-Hermitian JJJ; the conclusion here explicitly includes Hermiticity.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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