Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1: support dimensions and spanning of the environment

Proved
QAlgorithms.Papers.Independent.Support50.P01.support_dimensions_and_spanning

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

prove2quantum

Let A=CaA=\mathbb C^aA=Ca, B=CbB=\mathbb C^bB=Cb, and E=CeE=\mathbb C^eE=Ce have positive finite dimensions and fixed orthonormal bases. Fix an isometry U:A→B⊗EU:A\to B\otimes EU:A→B⊗E and define the channel N(X)=Tr⁡E(UXU†)\mathcal N(X)=\operatorname{Tr}_E(UXU^\dagger)N(X)=TrE​(UXU†) and its genuine complement Nc(X)=Tr⁡B(UXU†)\mathcal N^c(X)=\operatorname{Tr}_B(UXU^\dagger)Nc(X)=TrB​(UXU†). Density operators are positive semidefinite with trace one, and all entropies use base-two logarithms with 0log⁡0=00\log 0=00log0=0. Write Ic(N,ρ)=H(N(ρ))−H(Nc(ρ))I_c(\mathcal N,\rho)=H(\mathcal N(\rho))-H(\mathcal N^c(\rho))Ic​(N,ρ)=H(N(ρ))−H(Nc(ρ)), Q(1)(N)=sup⁡ρIc(N,ρ)Q^{(1)}(\mathcal N)=\sup_\rho I_c(\mathcal N,\rho)Q(1)(N)=supρ​Ic​(N,ρ), and Q(N)=sup⁡n≥1Q(1)(N⊗n)/nQ(\mathcal N)=\sup_{n\ge1}Q^{(1)}(\mathcal N^{\otimes n})/nQ(N)=supn≥1​Q(1)(N⊗n)/n, with arbitrary entangled block inputs. Conjugate degradability means one CPTP map DDD satisfies DN(X)=(Nc(X))TD\mathcal N(X)=(\mathcal N^c(X))^TDN(X)=(Nc(X))T for every operator XXX; conjugate antidegradability reverses the receiver and environment in this identity. Assume conjugate degradability and fix any finite family of unit vectors ψ1,…,ψm\psi_1,\ldots,\psi_mψ1​,…,ψm​. Set Bj=range⁡N(ψj)B_j=\operatorname{range}\mathcal N(\psi_j)Bj​=rangeN(ψj​) and Ej=range⁡Nc(ψj)E_j=\operatorname{range}\mathcal N^c(\psi_j)Ej​=rangeNc(ψj​), writing ψj\psi_jψj​ also for its rank-one projector. Then

dim⁡Bj=dim⁡Ej(1≤j≤m),[e=rank⁡J(N), span⁡jBj=B]⟹span⁡jEj=E.\dim B_j=\dim E_j\quad(1\le j\le m),\qquad \left[e=\operatorname{rank}J(\mathcal N),\ \operatorname{span}_j B_j=B\right] \Longrightarrow \operatorname{span}_j E_j=E.dimBj​=dimEj​(1≤j≤m),[e=rankJ(N), spanj​Bj​=B]⟹spanj​Ej​=E.

The minimal-environment condition is imposed only on the spanning conclusion.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P01

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

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

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)

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

open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

variable {a b e c : ℕ}

/-- PDF pp.12–13, Lemma 1: equal support dimensions and environment spanning.
Minimality e=Choi rank is required only for the second conclusion. -/
theorem support_dimensions_and_spanning (ha : 0<a) (hb : 0<b) (he : 0<e)
    (U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateDegradable U)
    (m : ℕ) (psi : Fin m → EuclideanSpace ℂ (Fin a)) (hpsi : ∀ j, ‖psi j‖ = 1) :
    (∀ j, (receiverChannel U (pureDensity (psi j))).rank =
      (complementaryChannel U (pureDensity (psi j))).rank) ∧
    (e = (outputFirstChoi (receiverChannel U)).rank →
      (⨆ j, LinearMap.range (receiverChannel U (pureDensity (psi j))).mulVecLin) = ⊤ →
      (⨆ j, LinearMap.range (complementaryChannel U (pureDensity (psi j))).mulVecLin) = ⊤) := by sorry

end QAlgorithms.Papers.Independent.Support50.P01

end
Source
Conjugate Degradability and the Quantum Capacity of Cloning Channels, arXiv:0909.3297v1, PDF p. 12, Lemma 1: support dimensions and spanning of the environment
Read-back

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

Let a,b,ea,b,ea,b,e be positive natural numbers and U:Ca→Cb⊗CeU:\mathbb C^a\to\mathbb C^b\otimes\mathbb C^eU:Ca→Cb⊗Ce. Put N(X)=Tr⁡E(UXU†)\mathcal N(X)=\operatorname{Tr}_{E}(UXU^\dagger)N(X)=TrE​(UXU†) and E(X)=Tr⁡B(UXU†)\mathcal E(X)=\operatorname{Tr}_{B}(UXU^\dagger)E(X)=TrB​(UXU†). Assume U†U=IaU^\dagger U=I_aU†U=Ia​ and that there exists a finite Kraus map D(Y)=∑ℓKℓYKℓ†\mathcal D(Y)=\sum_\ell K_\ell YK_\ell^\daggerD(Y)=∑ℓ​Kℓ​YKℓ†​ from b×bb\times bb×b to e×ee\times ee×e matrices, with ∑ℓKℓ†Kℓ=Ib\sum_\ell K_\ell^\dagger K_\ell=I_b∑ℓ​Kℓ†​Kℓ​=Ib​, such that D(N(X))=E(X)T\mathcal D(\mathcal N(X))=\mathcal E(X)^{\mathsf T}D(N(X))=E(X)T for every complex a×aa\times aa×a matrix XXX, using ordinary transpose. For any natural number mmm and any family of unit vectors ψ0,…,ψm−1∈Ca\psi_0,\ldots,\psi_{m-1}\in\mathbb C^aψ0​,…,ψm−1​∈Ca, one has

rank⁡N(∣ψj⟩⟨ψj∣)=rank⁡E(∣ψj⟩⟨ψj∣)(0≤j<m).\operatorname{rank}\mathcal N(|\psi_j\rangle\langle\psi_j|) =\operatorname{rank}\mathcal E(|\psi_j\rangle\langle\psi_j|) \quad(0\le j<m).rankN(∣ψj​⟩⟨ψj​∣)=rankE(∣ψj​⟩⟨ψj​∣)(0≤j<m).

Furthermore, if e=rank⁡JNe=\operatorname{rank}J_{\mathcal N}e=rankJN​, where (JN)(o,i),(p,j)=N(Ei,j)o,p(J_{\mathcal N})_{(o,i),(p,j)}=\mathcal N(E_{i,j})_{o,p}(JN​)(o,i),(p,j)​=N(Ei,j​)o,p​, and if the sum of the ranges of the matrices N(∣ψj⟩⟨ψj∣)\mathcal N(|\psi_j\rangle\langle\psi_j|)N(∣ψj​⟩⟨ψj​∣) is all of Cb\mathbb C^bCb, then the sum of the ranges of E(∣ψj⟩⟨ψj∣)\mathcal E(|\psi_j\rangle\langle\psi_j|)E(∣ψj​⟩⟨ψj​∣) is all of Ce\mathbb C^eCe. Here sums of ranges mean their linear span, and (∣v⟩⟨v∣)i,j=vivj‾(|v\rangle\langle v|)_{i,j}=v_i\overline{v_j}(∣v⟩⟨v∣)i,j​=vi​vj​​. The case m=0m=0m=0 is included: the rank assertions are then vacuous, and the receiver-spanning antecedent is false because b>0b>0b>0.

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

    Confirmed by the moderator at approval.

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