Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2

Proved
QAlgorithms.Papers.Independent.Gap20.P19.pureOutputRanges

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 isometric dilation of a degradable channel Φ\PhiΦ, with complement ΦC\Phi^CΦC. For any finite family of unit vectors ψj\psi_jψj​, define vector subspaces Bj=range⁡Φ(∣ψj⟩⟨ψj∣)B_j=\operatorname{range}\Phi(|\psi_j\rangle\langle\psi_j|)Bj​=rangeΦ(∣ψj​⟩⟨ψj​∣) and Ej=range⁡ΦC(∣ψj⟩⟨ψj∣)E_j=\operatorname{range}\Phi^C(|\psi_j\rangle\langle\psi_j|)Ej​=rangeΦC(∣ψj​⟩⟨ψj​∣). Then

dim⁡Bj=dim⁡Ejfor every j,span⁡⋃jBj=HB⟹span⁡⋃jEj=HE.\dim B_j=\dim E_j\quad\text{for every }j,\qquad \operatorname{span}\bigcup_j B_j=H_B\Longrightarrow\operatorname{span}\bigcup_j E_j=H_E.dimBj​=dimEj​for every j,spanj⋃​Bj​=HB​⟹spanj⋃​Ej​=HE​.

The spanning implication relates output supports to the minimal environment.

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]

/-- Lemma 2, PDF pp.8–9. Bj and Ej are vector subspaces. The common
dilation is minimal, preventing false spanning conclusions after padding. -/
theorem pureOutputRanges [Nonempty A] [Nonempty B] [Nonempty E]
    (U : Matrix (B × E) A ℂ) (hU : IsDegradable U)
    (hmin : MinimalDilation (receiverChannel U) U) :
    ∀ m : ℕ, ∀ psi : Fin m → EuclideanSpace ℂ A,
      (∀ j, IsState (psi j)) →
      (∀ j, (receiverChannel U (pureDensity (psi j))).rank =
        (complementaryChannel U (pureDensity (psi j))).rank) ∧
      ((⨆ j, matrixRange (receiverChannel U (pureDensity (psi j)))) = ⊤ →
        (⨆ j, matrixRange (complementaryChannel U (pureDensity (psi j)))) = ⊤) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 8, Lemma 2
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 index types with decidable equality, and let U:(B×E)×AU:(B\times E)\times AU:(B×E)×A be a complex matrix. Define 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 traces sum diagonal entries over the indicated factor. Assume that U†U=IAU^\dagger U=I_AU†U=IA​ and there exists a channel DDD from BBB to EEE such that CU(ρ)=D(RU(ρ))C_U(\rho)=D(R_U(\rho))CU​(ρ)=D(RU​(ρ)) for every matrix ρ\rhoρ; here a channel means a map ρ↦∑jKjρKj†\rho\mapsto\sum_jK_j\rho K_j^\daggerρ↦∑j​Kj​ρKj†​ for finitely many matrices satisfying ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Also assume that UUU is minimal in the following precise sense: for every natural number rrr and every matrix W:(B×{0,…,r−1})×AW:(B\times\{0,\ldots,r-1\})\times AW:(B×{0,…,r−1})×A, if Tr⁡env(WρW†)=RU(ρ)\operatorname{Tr}_{\mathrm{env}}(W\rho W^\dagger)=R_U(\rho)Trenv​(WρW†)=RU​(ρ) for all ρ\rhoρ, then ∣E∣≤r|E|\le r∣E∣≤r, without any isometry requirement on this competing WWW. Then, for every natural number mmm and every family of norm-one vectors ψ0,…,ψm−1∈CA\psi_0,\ldots,\psi_{m-1}\in\mathbb C^Aψ0​,…,ψm−1​∈CA, each pair RU(ψjψj†)R_U(\psi_j\psi_j^\dagger)RU​(ψj​ψj†​), CU(ψjψj†)C_U(\psi_j\psi_j^\dagger)CU​(ψj​ψj†​) has equal matrix rank, and

span⁡C ⁣(⋃j<mrange⁡RU(ψjψj†))=CB⟹span⁡C ⁣(⋃j<mrange⁡CU(ψjψj†))=CE.\operatorname{span}_{\mathbb C}\!\left(\bigcup_{j<m}\operatorname{range}R_U(\psi_j\psi_j^\dagger)\right)=\mathbb C^B \quad\Longrightarrow\quad \operatorname{span}_{\mathbb C}\!\left(\bigcup_{j<m}\operatorname{range}C_U(\psi_j\psi_j^\dagger)\right)=\mathbb C^E.spanC​(j<m⋃​rangeRU​(ψj​ψj†​))=CB⟹spanC​(j<m⋃​rangeCU​(ψj​ψj†​))=CE.

The quantification includes m=0m=0m=0: the rank assertions then have no instances, and the implication has a false antecedent because the span of the empty family is zero while BBB is nonempty.

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