Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§II.C: PPT complement and the EB special case

Open
QAlgorithms.Papers.Independent.Support50.P01.complement_ppt

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. If N\mathcal NN is conjugate degradable, then for every positive finite-dimensional reference RRR and density operator ρRA\rho_{RA}ρRA​,

[(id⁡R⊗Nc)(ρRA)]TE⪰0.\big[(\operatorname{id}_R\otimes\mathcal N^c)(\rho_{RA})\big]^{T_E}\succeq0.[(idR​⊗Nc)(ρRA​)]TE​⪰0.

Furthermore, if Nc\mathcal N^cNc is entanglement breaking, then N\mathcal NN is ordinarily degradable: one CPTP map DDD satisfies DN=NcD\mathcal N=\mathcal N^cDN=Nc. Entanglement breaking means that every reference-assisted density output is separable; it is not inferred from one separable output.

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 p.5: PPT complement for every reference; the EB special case implies ordinary degradability. -/
theorem complement_ppt (ha : 0<a) (hb : 0<b) (he : 0<e)
    (U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateDegradable U) :
    (∀ r : ℕ, 0<r → ∀ X : Matrix (Fin r × Fin a) (Fin r × Fin a) ℂ,
      IsDensityMatrix X → (partialTransposeOutput (idTensorSuperop (complementaryChannel U) X)).PosSemidef) ∧
    (EntanglementBreaking ha he (complementaryChannel U) → IsDegradable U) := by sorry

end QAlgorithms.Papers.Independent.Support50.P01

end
Source
Conjugate Degradability and the Quantum Capacity of Cloning Channels, arXiv:0909.3297v1, PDF p. 5, §II.C: PPT complement and the EB special case
Read-back

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

For all positive natural numbers a,b,ea,b,ea,b,e and every complex matrix U:Ca→Cb⊗CeU:\mathbb C^a\to\mathbb C^b\otimes\mathbb C^eU:Ca→Cb⊗Ce, suppose U†U=IaU^\dagger U=I_aU†U=Ia​ and a channel D:Mat⁡b(C)→Mat⁡e(C)D:\operatorname{Mat}_b(\mathbb C)\to\operatorname{Mat}_e(\mathbb C)D:Matb​(C)→Mate​(C) satisfies D(BU(X))=EU(X)TD(B_U(X))=E_U(X)^{\mathsf T}D(BU​(X))=EU​(X)T for every matrix XXX, where BU(X)=Tr⁡e(UXU†)B_U(X)=\operatorname{Tr}_e(UXU^\dagger)BU​(X)=Tre​(UXU†), EU(X)=Tr⁡b(UXU†)E_U(X)=\operatorname{Tr}_b(UXU^\dagger)EU​(X)=Trb​(UXU†), and a channel is a finite Kraus sum with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Then, for every positive natural number rrr and every positive semidefinite trace-one matrix XXX on Cr⊗Ca\mathbb C^r\otimes\mathbb C^aCr⊗Ca, the matrix YYY with entries

Y(i,u),(j,v)=[EU ⁣((X(i,s),(j,t))s,t)]v,uY_{(i,u),(j,v)} =\left[E_U\!\left((X_{(i,s),(j,t)})_{s,t}\right)\right]_{v,u}Y(i,u),(j,v)​=[EU​((X(i,s),(j,t)​)s,t​)]v,u​

is positive semidefinite. In addition, if for every unit vector ψ∈Ca⊗Ca\psi\in\mathbb C^a\otimes\mathbb C^aψ∈Ca⊗Ca the blockwise image (id⁡a⊗EU)(∣ψ⟩⟨ψ∣)(\operatorname{id}_a\otimes E_U)(|\psi\rangle\langle\psi|)(ida​⊗EU​)(∣ψ⟩⟨ψ∣) is a finite sum ∑ℓ=0q−1wℓAℓ⊗Bℓ\sum_{\ell=0}^{q-1}w_\ell A_\ell\otimes B_\ell∑ℓ=0q−1​wℓ​Aℓ​⊗Bℓ​, where wℓ≥0w_\ell\ge0wℓ​≥0, ∑ℓwℓ=1\sum_\ell w_\ell=1∑ℓ​wℓ​=1, and every Aℓ,BℓA_\ell,B_\ellAℓ​,Bℓ​ is positive semidefinite with trace one, then U†U=IaU^\dagger U=I_aU†U=Ia​ and there exists a finite Kraus channel D0:Mat⁡b(C)→Mat⁡e(C)D_0:\operatorname{Mat}_b(\mathbb C)\to\operatorname{Mat}_e(\mathbb C)D0​:Matb​(C)→Mate​(C) satisfying EU(X)=D0(BU(X))E_U(X)=D_0(B_U(X))EU​(X)=D0​(BU​(X)) for every matrix XXX. The first assertion excludes r=0r=0r=0; the separable decompositions allow arbitrary finite qqq, with q=0q=0q=0 unable to satisfy the weight-sum condition.

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