Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3

Proved
QAlgorithms.Papers.Independent.Gap20.P19.fullRankPureOutput

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 U:HA→HB⊗HEU:H_A\to H_B\otimes H_EU:HA​→HB​⊗HE​ be a minimal dilation of a degradable channel Φ\PhiΦ. Suppose some unit vector ψ\psiψ has rank⁡Φ(∣ψ⟩⟨ψ∣)=dB\operatorname{rank}\Phi(|\psi\rangle\langle\psi|)=d_BrankΦ(∣ψ⟩⟨ψ∣)=dB​. Then

dE=dB.d_E=d_B.dE​=dB​.

This identifies the minimal environment dimension when one pure output has full rank. The printed expression rank⁡Φ(ρ)\operatorname{rank}\Phi(\rho)rankΦ(ρ) is corrected to rank⁡ρ\operatorname{rank}\rhorankρ, with ρ=Φ(∣ψ⟩⟨ψ∣)\rho=\Phi(|\psi\rangle\langle\psi|)ρ=Φ(∣ψ⟩⟨ψ∣), as in the proof.

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 3, PDF p.9. Printed rank Phi(rho)=d_B is corrected to rank rho=d_B,
as required by rho=Phi(|psi><psi|) and the m=1 proof using Lemma 2. -/
theorem fullRankPureOutput [Nonempty A] [Nonempty B] [Nonempty E]
    (U : Matrix (B × E) A ℂ) (hU : IsDegradable U)
    (hmin : MinimalDilation (receiverChannel U) U)
    (hfull : ∃ psi : EuclideanSpace ℂ A, IsState psi ∧
      (receiverChannel U (pureDensity psi)).rank = Fintype.card B) :
    Fintype.card E = Fintype.card B := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

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

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

Let A,B,EA,B,EA,B,E be nonempty finite types with decidable equality, and let U:CA→CB⊗CEU:\mathbb C^A\to\mathbb C^B\otimes\mathbb C^EU:CA→CB⊗CE be a matrix. Write RU(ρ)=Tr⁡E(UρU†)R_U(\rho)=\operatorname{Tr}_E(U\rho U^\dagger)RU​(ρ)=TrE​(UρU†) and CU(ρ)=Tr⁡B(UρU†)C_U(\rho)=\operatorname{Tr}_B(U\rho U^\dagger)CU​(ρ)=TrB​(UρU†), where partial trace sums matching indices of the discarded factor. Assume U†U=IAU^\dagger U=I_AU†U=IA​ and there is a map D(X)=∑j=1rKjXKj†D(X)=\sum_{j=1}^r K_jXK_j^\daggerD(X)=∑j=1r​Kj​XKj†​, with Kj:CB→CEK_j:\mathbb C^B\to\mathbb C^EKj​:CB→CE and ∑jKj†Kj=IB\sum_jK_j^\dagger K_j=I_B∑j​Kj†​Kj​=IB​, such that CU(ρ)=D(RU(ρ))C_U(\rho)=D(R_U(\rho))CU​(ρ)=D(RU​(ρ)) for every matrix ρ\rhoρ. Assume also that UUU has minimal environment dimension: for every natural number rrr and matrix W:CA→CB⊗CrW:\mathbb C^A\to\mathbb C^B\otimes\mathbb C^rW:CA→CB⊗Cr satisfying RW=RUR_W=R_URW​=RU​, one has ∣E∣≤r|E|\le r∣E∣≤r; these competing matrices WWW are not required to be isometries. Finally, assume there exists ψ∈CA\psi\in\mathbb C^Aψ∈CA with ∥ψ∥=1\|\psi\|=1∥ψ∥=1 such that RU(ψψ†)R_U(\psi\psi^\dagger)RU​(ψψ†) has rank ∣B∣|B|∣B∣. Then ∣E∣=∣B∣|E|=|B|∣E∣=∣B∣.

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