Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§II.C: small conjugate antidegradable channels are EB

Open
QAlgorithms.Papers.Independent.Support50.P01.lowDimension_entanglementBreaking

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 antidegradable and ab≤6ab\le6ab≤6, then

N is entanglement breaking.\mathcal N\ \text{is entanglement breaking}.N is entanglement breaking.

The bound concerns channel input and output dimensions. The conclusion quantifies over all finite references.

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: the dimension bound concerns the input and output, not arbitrary references. -/
theorem lowDimension_entanglementBreaking (ha : 0<a) (hb : 0<b) (he : 0<e)
    (U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateAntidegradable U)
    (hdim : a*b ≤ 6) : EntanglementBreaking ha hb (receiverChannel 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: small conjugate antidegradable channels are EB
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 with ab≤6ab\le6ab≤6, let U:Ca→Cb⊗CeU:\mathbb C^a\to\mathbb C^b\otimes\mathbb C^eU:Ca→Cb⊗Ce be a complex matrix satisfying U†U=IaU^\dagger U=I_aU†U=Ia​. Suppose there exists a map D:Mat⁡e(C)→Mat⁡b(C)D:\operatorname{Mat}_e(\mathbb C)\to\operatorname{Mat}_b(\mathbb C)D:Mate​(C)→Matb​(C), expressible as a finite sum D(X)=∑jKjXKj†D(X)=\sum_jK_jXK_j^\daggerD(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=Ie\sum_jK_j^\dagger K_j=I_e∑j​Kj†​Kj​=Ie​, such that

D(Tr⁡b(UXU†))=(Tr⁡e(UXU†))TD(\operatorname{Tr}_b(UXU^\dagger)) =\bigl(\operatorname{Tr}_e(UXU^\dagger)\bigr)^{\mathsf T}D(Trb​(UXU†))=(Tre​(UXU†))T

for every complex matrix XXX on Ca\mathbb C^aCa. Then, for every unit vector ψ∈Ca⊗Ca\psi\in\mathbb C^a\otimes\mathbb C^aψ∈Ca⊗Ca, applying BU(X)=Tr⁡e(UXU†)B_U(X)=\operatorname{Tr}_e(UXU^\dagger)BU​(X)=Tre​(UXU†) blockwise to the second register of ∣ψ⟩⟨ψ∣|\psi\rangle\langle\psi|∣ψ⟩⟨ψ∣ gives

(id⁡a⊗BU)(∣ψ⟩⟨ψ∣)=∑ℓ=0q−1wℓAℓ⊗Bℓ(\operatorname{id}_a\otimes B_U)(|\psi\rangle\langle\psi|) =\sum_{\ell=0}^{q-1}w_\ell A_\ell\otimes B_\ell(ida​⊗BU​)(∣ψ⟩⟨ψ∣)=ℓ=0∑q−1​wℓ​Aℓ​⊗Bℓ​

for some natural number qqq, nonnegative real weights summing to 111, and positive semidefinite trace-one matrices AℓA_\ellAℓ​ on Ca\mathbb C^aCa and BℓB_\ellBℓ​ on Cb\mathbb C^bCb. The weight condition rules out an empty decomposition.

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