Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§II.C, Eq.(4): single-letter capacity of conjugate degradable channels

Open
QAlgorithms.Papers.Independent.Support50.P01.conjugateDegradable_capacity

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

Q(N)=Q(1)(N)=Ic(N,ρ∗),Ic(N,ρ)≤Ic(N,ρ∗)for every density ρ,Q(\mathcal N)=Q^{(1)}(\mathcal N)=I_c(\mathcal N,\rho_*),\qquad I_c(\mathcal N,\rho)\le I_c(\mathcal N,\rho_*)\quad\text{for every density }\rho,Q(N)=Q(1)(N)=Ic​(N,ρ∗​),Ic​(N,ρ)≤Ic​(N,ρ∗​)for every density ρ,

for some density operator ρ∗\rho_*ρ∗​. This is the attained single-letter capacity formula.

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.1,3–4, Eq.(4): single-letter capacity, including attainment. -/
theorem conjugateDegradable_capacity (ha : 0<a) (hb : 0<b) (he : 0<e)
    (U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateDegradable U) :
    quantumCapacity (receiverChannel U) = maximumCoherentInformation U ∧
    ∃ rho, IsDensityMatrix rho ∧ coherentInformation (receiverChannel U) rho = maximumCoherentInformation U ∧
      ∀ sigma, IsDensityMatrix sigma → coherentInformation (receiverChannel U) sigma ≤ coherentInformation (receiverChannel U) rho := by sorry

end QAlgorithms.Papers.Independent.Support50.P01

end
Source
Conjugate Degradability and the Quantum Capacity of Cloning Channels, arXiv:0909.3297v1, PDF p. 4, §II.C, Eq.(4): single-letter capacity of conjugate degradable channels
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, assume U†U=IaU^\dagger U=I_aU†U=Ia​ and that there exists 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) such that D(BU(X))=EU(X)TD(B_U(X))=E_U(X)^{\mathsf T}D(BU​(X))=EU​(X)T for every complex matrix XXX, where BU(X)=Tr⁡e(UXU†)B_U(X)=\operatorname{Tr}_e(UXU^\dagger)BU​(X)=Tre​(UXU†) and EU(X)=Tr⁡b(UXU†)E_U(X)=\operatorname{Tr}_b(UXU^\dagger)EU​(X)=Trb​(UXU†). A channel here means a map admitting finitely many matrices KjK_jKj​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I and D(X)=∑jKjXKj†D(X)=\sum_jK_jXK_j^\daggerD(X)=∑j​Kj​XKj†​; the transpose is ordinary transpose. For a density matrix ρ\rhoρ, meaning ρ⪰0\rho\succeq0ρ⪰0 and tr⁡ρ=1\operatorname{tr}\rho=1trρ=1, set

IΦ(ρ)=S(Φ(ρ))−S((id⁡⊗Φ)(∣vρ⟩⟨vρ∣)),vρ(i,j)=(ρ)j,i,I_\Phi(\rho)=S(\Phi(\rho))-S((\operatorname{id}\otimes\Phi)(|v_\rho\rangle\langle v_\rho|)),\qquad v_\rho(i,j)=(\sqrt{\rho})_{j,i},IΦ​(ρ)=S(Φ(ρ))−S((id⊗Φ)(∣vρ​⟩⟨vρ​∣)),vρ​(i,j)=(ρ​)j,i​,

where square roots use continuous functional calculus and S(H)=−Re⁡tr⁡[x↦xlog⁡2x](H)S(H)=-\operatorname{Re}\operatorname{tr}[x\mapsto x\log_2x](H)S(H)=−Retr[x↦xlog2​x](H). Define

Q(Φ)=sup⁡n>0sup⁡ω⪰0, tr⁡ω=1IΦ⊗n(ω)n,J(U)=sup⁡σ⪰0, tr⁡σ=1(S(BU(σ))−S(EU(σ))).Q(\Phi)=\sup_{n>0}\frac{\sup_{\omega\succeq0,\ \operatorname{tr}\omega=1}I_{\Phi^{\otimes n}}(\omega)}{n}, \qquad J(U)=\sup_{\sigma\succeq0,\ \operatorname{tr}\sigma=1}\bigl(S(B_U(\sigma))-S(E_U(\sigma))\bigr).Q(Φ)=n>0sup​nsupω⪰0, trω=1​IΦ⊗n​(ω)​,J(U)=σ⪰0, trσ=1sup​(S(BU​(σ))−S(EU​(σ))).

The tensor extension acts by Φ⊗n(X)=∑x,yXx,y⨂iΦ(∣xi⟩⟨yi∣)\Phi^{\otimes n}(X)=\sum_{\mathbf x,\mathbf y}X_{\mathbf x,\mathbf y}\bigotimes_i\Phi(|x_i\rangle\langle y_i|)Φ⊗n(X)=∑x,y​Xx,y​⨂i​Φ(∣xi​⟩⟨yi​∣), and id⁡⊗Φ\operatorname{id}\otimes\Phiid⊗Φ applies Φ\PhiΦ to each block of the reference register. Then Q(BU)=J(U)Q(B_U)=J(U)Q(BU​)=J(U), and there exists a density matrix ρ\rhoρ on Ca\mathbb C^aCa such that IBU(ρ)=J(U)I_{B_U}(\rho)=J(U)IBU​​(ρ)=J(U) and IBU(σ)≤IBU(ρ)I_{B_U}(\sigma)\le I_{B_U}(\rho)IBU​​(σ)≤IBU​​(ρ) for every density matrix σ\sigmaσ on Ca\mathbb C^aCa.

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