Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 12

Proved
QAlgorithms.Papers.Independent.Gap20.P19.twistedDiagonalRank

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

prove2quantum

All Hilbert spaces are finite dimensional, complex, and nonzero. A channel is completely positive and trace preserving on every operator. Write r(Φ)r(\Phi)r(Φ) for its Choi rank, the minimum pure-environment dimension. Receiver and complementary channels are always obtained from the same isometry.

Let Φ:Md→Md\Phi:M_d\to M_dΦ:Md​→Md​ have a normalized Kraus representation Φ(ρ)=∑kAkρAk†\Phi(\rho)=\sum_k A_k\rho A_k^\daggerΦ(ρ)=∑k​Ak​ρAk†​ and invertible matrices X,YX,YX,Y for which every YAkXYA_kXYAk​X is diagonal. Then

r(Φ)≤d,∃ψ: ∥ψ∥=1,rank⁡Φ(∣ψ⟩⟨ψ∣)=r(Φ).r(\Phi)\le d,\qquad\exists\psi:\ \|\psi\|=1,\quad\operatorname{rank}\Phi(|\psi\rangle\langle\psi|)=r(\Phi).r(Φ)≤d,∃ψ: ∥ψ∥=1,rankΦ(∣ψ⟩⟨ψ∣)=r(Φ).

The second equality corrects the printed dBd_BdB​ to dEd_EdE​, exactly as computed by (54). The identity channel in dimension greater than one disproves the printed version.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P19
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P19

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Kronecker

open Filter Topology

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
   maximumCoherentInformation dilationPower)

open QAlgorithms.Papers.Independent.Claimed50.P48
  (MinimalDilation indexedKrausDilation arbitraryVectorComplement superopTensor tensorDilation)

open QAlgorithms.Papers.Independent.Claimed50.P24 (ChannelEB)

open QAlgorithms.Papers.Independent.Information100.P60 (wernerHolevo)

open QAlgorithms.Papers.Independent.Gap48.P36 (finWeyl WeylLabel)

open QAlgorithms.Papers.Independent.Information100.P69 (choi)

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

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

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C E F R K A2 B2 E2 : Type}

variable [Fintype A] [DecidableEq A] [Nonempty A]

variable [Fintype B] [DecidableEq B] [Nonempty B]

variable [Fintype C] [DecidableEq C] [Nonempty C]

variable [Fintype E] [DecidableEq E] [Nonempty E]

variable [Fintype F] [DecidableEq F] [Nonempty F]

variable [Fintype R] [DecidableEq R] [Nonempty R]

variable [Fintype K] [DecidableEq K]

variable [Fintype A2] [DecidableEq A2] [Nonempty A2]

variable [Fintype B2] [DecidableEq B2] [Nonempty B2]

variable [Fintype E2] [DecidableEq E2] [Nonempty E2]

/-- Theorem 12, PDF pp.19–20. Corrected printed output rank d_B to d_E:
(54) computes d_E, and the identity channel disproves the printed d_B clause. -/
theorem twistedDiagonalRank [Nonempty A] (Phi : Superop A A)
    (hPhi : IsChannel Phi) (htwist : TwistedDiagonal Phi) :
    (choi Phi).rank ≤ Fintype.card A ∧
    ∃ psi : EuclideanSpace ℂ A, IsState psi ∧
      (Phi (pureDensity psi)).rank = (choi Phi).rank := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 19, Theorem 12
Read-back

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

Let AAA be a nonempty finite type with decidable equality, and let Φ\PhiΦ be a map on complex matrices indexed by AAA, admitting a finite Kraus representation with completeness relation ∑jKj†Kj=IA\sum_jK_j^\dagger K_j=I_A∑j​Kj†​Kj​=IA​. Suppose there exist a natural number mmm, matrices H0,…,Hm−1H_0,\ldots,H_{m-1}H0​,…,Hm−1​ satisfying ∑kHk†Hk=IA\sum_kH_k^\dagger H_k=I_A∑k​Hk†​Hk​=IA​ and Φ(ρ)=∑kHkρHk†\Phi(\rho)=\sum_kH_k\rho H_k^\daggerΦ(ρ)=∑k​Hk​ρHk†​ for every matrix ρ\rhoρ, and invertible matrices X,YX,YX,Y such that, for every kkk, YHkXYH_kXYHk​X is diagonal, with an arbitrary complex diagonal depending on kkk. Then

rank⁡JΦ≤∣A∣,∃ψ∈CA:∥ψ∥=1 and rank⁡Φ(ψψ†)=rank⁡JΦ,\operatorname{rank}J_\Phi\le |A|, \qquad \exists\psi\in\mathbb C^A:\quad \|\psi\|=1\ \text{and}\ \operatorname{rank}\Phi(\psi\psi^\dagger)=\operatorname{rank}J_\Phi,rankJΦ​≤∣A∣,∃ψ∈CA:∥ψ∥=1 and rankΦ(ψψ†)=rankJΦ​,

where JΦ((i,b),(j,c))=Φ(∣i⟩⟨j∣)bcJ_\Phi((i,b),(j,c))=\Phi(|i\rangle\langle j|)_{bc}JΦ​((i,b),(j,c))=Φ(∣i⟩⟨j∣)bc​. The invertible matrices X,YX,YX,Y are not required to be unitary, and the hypotheses impose no fixed value on the number mmm of Kraus matrices.

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