Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: degraded cq outer bound and commuting-Bob capacity

Open
QAlgorithms.Papers.Independent.Gap48.P39.degraded_cq_capacity

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

prove2quantum

Let W:x↦ρxBCW:x\mapsto\rho_x^{BC}W:x↦ρxBC​ be a finite cq broadcast channel with nonempty alphabet and positive-dimensional outputs. Suppose a CPTP map M:B→C\mathcal M:B\to CM:B→C satisfies ρxC=M(ρxB)\rho_x^C=\mathcal M(\rho_x^B)ρxC​=M(ρxB​) for every input. For the closed operational classical region with deterministic encoders and vanishing maximum joint decoding error,

C(W)⊆{(R,RB,RC)≥0:RB≤I(X;B∣T)σ, R+RC≤I(T;C)σ},\mathcal C(W)\subseteq\{(R,R_B,R_C)\ge0:R_B\le I(X;B\mid T)_\sigma,\ R+R_C\le I(T;C)_\sigma\},C(W)⊆{(R,RB​,RC​)≥0:RB​≤I(X;B∣T)σ​, R+RC​≤I(T;C)σ​},

where the union ranges over all finite-dimensional quantum auxiliaries TTT and normalized states σTXBC=⨁xp(x)ρxT⊗ρxBC\sigma^{TXBC}=\bigoplus_xp(x)\rho_x^T\otimes\rho_x^{BC}σTXBC=⨁x​p(x)ρxT​⊗ρxBC​; no auxiliary dimension cap is imposed on this outer bound. If Bob's marginal states commute pairwise, the two-inequality region with classical TTT, σ=⨁t,xp(t,x)ρxBC\sigma=\bigoplus_{t,x}p(t,x)\rho_x^{BC}σ=⨁t,x​p(t,x)ρxBC​, and ∣T∣≤min⁡{∣X∣,∣B∣2}|T|\le\min\{|X|,|B|^2\}∣T∣≤min{∣X∣,∣B∣2} equals C(W)\mathcal C(W)C(W) and the three-inequality superposition region. Entropies are in bits. This identifies an exact single-letter capacity using only Bob marginal commutation.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P39
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Gap48.P39

open QAlgorithms.Papers.Independent.Information100.P21 (Op)

open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)

open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks holevoInfo)

open QAlgorithms.Papers.Independent.Dependency50.P19 (both epr mutualInformation marginalRA marginalRB)

open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)

open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity conditionalEntropy groupedChannelPower)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C X T E : Type}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype X] [DecidableEq X]

variable [Fintype T] [DecidableEq T] [Fintype E] [DecidableEq E]

/-- Theorem 2, PDF p.4 (both columns), converse pp.6–7: unbounded quantum T outer
bound, and exact single-letter region when ONLY Bob's marginals commute. -/
theorem degraded_cq_capacity [Nonempty X] [Nonempty B] [Nonempty C] (W : CQChannel X B C)
    (hW : Degraded W) :
    cqBroadcastCapacity W ⊆ quantumOuterRegion W false ∧
    (CommutingBob W → cqBroadcastCapacity W = degradedClassicalRegion W ∧
      degradedClassicalRegion W = superpositionRegion W (some (superpositionCap X B C))) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P39

end
Source
Quantum broadcast channels, arXiv:quant-ph/0603098v2, PDF p. 4, Theorem 2: degraded cq outer bound and commuting-Bob capacity
Read-back

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

For nonempty finite types X,B,CX,B,CX,B,C with decidable equality, let x↦ρxx\mapsto\rho_xx↦ρx​ assign density matrices on B×CB\times CB×C, put Bx=Tr⁡CρxB_x=\operatorname{Tr}_C\rho_xBx​=TrC​ρx​ and Cx=Tr⁡BρxC_x=\operatorname{Tr}_B\rho_xCx​=TrB​ρx​, and assume there is a map D\mathcal DD from matrices on BBB to matrices on CCC of the form D(Z)=∑j<mEjZEj†\mathcal D(Z)=\sum_{j<m}E_jZE_j^\daggerD(Z)=∑j<m​Ej​ZEj†​, for some natural number mmm and matrices EjE_jEj​ with ∑jEj†Ej=IB\sum_jE_j^\dagger E_j=I_B∑j​Ej†​Ej​=IB​, such that Cx=D(Bx)C_x=\mathcal D(B_x)Cx​=D(Bx​) for every xxx. Let C\mathcal CC be the closure of the set of nonnegative triples rrr such that, for every ϵ>0\epsilon>0ϵ>0, all sufficiently large positive block lengths nnn admit words xs,i,j∈Xnx_{s,i,j}\in X^nxs,i,j​∈Xn, with respective message counts ⌊2nr0⌋,⌊2nr1⌋,⌊2nr2⌋\lfloor2^{nr_0}\rfloor,\lfloor2^{nr_1}\rfloor,\lfloor2^{nr_2}\rfloor⌊2nr0​⌋,⌊2nr1​⌋,⌊2nr2​⌋, and positive semidefinite measurement families Ms,iM_{s,i}Ms,i​, Ns,jN_{s,j}Ns,j​, each summing to its respective identity, whose joint success Re⁡tr⁡((Ms,i⊗Ns,j)ρxs,i,j(n))\operatorname{Re}\operatorname{tr}((M_{s,i}\otimes N_{s,j})\rho_{x_{s,i,j}}^{(n)})Retr((Ms,i​⊗Ns,j​)ρxs,i,j​(n)​) is at least 1−ϵ1-\epsilon1−ϵ for every message triple; the product output has entries ρx(n)((b,c),(b′,c′))=∏k<nρxk((bk,ck),(bk′,ck′))\rho_x^{(n)}((b,c),(b',c'))=\prod_{k<n}\rho_{x_k}((b_k,c_k),(b'_k,c'_k))ρx(n)​((b,c),(b′,c′))=∏k<n​ρxk​​((bk​,ck​),(bk′​,ck′​)). Write H(M)=−Re⁡tr⁡(f(M))H(M)=-\operatorname{Re}\operatorname{tr}(f(M))H(M)=−Retr(f(M)), where f(u)=ulog⁡2uf(u)=u\log_2uf(u)=ulog2​u is applied by continuous functional calculus, and I(T:C)Ω=H(Tr⁡CΩ)+H(Tr⁡TΩ)−H(Ω)I(T:C)_\Omega=H(\operatorname{Tr}_C\Omega)+H(\operatorname{Tr}_T\Omega)-H(\Omega)I(T:C)Ω​=H(TrC​Ω)+H(TrT​Ω)−H(Ω). First, every r∈Cr\in\mathcal Cr∈C is nonnegative and admits a positive integer ttt, a probability distribution qxq_xqx​, and density matrices τx\tau_xτx​ on a ttt-dimensional space such that

r1≤H ⁣(∑xqxτx⊗Bx)−H ⁣(∑xqxτx)−∑xqxH(Bx),r0+r2≤I(T:C)∑xqxτx⊗Cx;r_1\le H\!\left(\sum_xq_x\tau_x\otimes B_x\right)-H\!\left(\sum_xq_x\tau_x\right)-\sum_xq_xH(B_x), \qquad r_0+r_2\le I(T:C)_{\sum_xq_x\tau_x\otimes C_x};r1​≤H(x∑​qx​τx​⊗Bx​)−H(x∑​qx​τx​)−x∑​qx​H(Bx​),r0​+r2​≤I(T:C)∑x​qx​τx​⊗Cx​​;

no total-rate inequality is required in this first conclusion. Second, if BxBy=ByBxB_xB_y=B_yB_xBx​By​=By​Bx​ for all x,yx,yx,y, then C=Dcl=S\mathcal C=\mathcal D_{\mathrm{cl}}=\mathcal SC=Dcl​=S, where Dcl\mathcal D_{\mathrm{cl}}Dcl​ consists of nonnegative triples admitting 1≤t≤min⁡{∣X∣,∣B∣2}1\le t\le\min\{|X|,|B|^2\}1≤t≤min{∣X∣,∣B∣2} and a joint distribution ps,xp_{s,x}ps,x​, with pT(s)=∑xps,xp_T(s)=\sum_xp_{s,x}pT​(s)=∑x​ps,x​ and block diagonal matrices ΩTB,ΩTC\Omega_{TB},\Omega_{TC}ΩTB​,ΩTC​ having blocks ∑xps,xBx,∑xps,xCx\sum_xp_{s,x}B_x,\sum_xp_{s,x}C_x∑x​ps,x​Bx​,∑x​ps,x​Cx​, satisfying

r1≤H(ΩTB)−H(diag⁡pT)−∑s,xps,xH(Bx),r0+r2≤I(T:C)ΩTC.r_1\le H(\Omega_{TB})-H(\operatorname{diag}p_T)-\sum_{s,x}p_{s,x}H(B_x), \qquad r_0+r_2\le I(T:C)_{\Omega_{TC}}.r1​≤H(ΩTB​)−H(diagpT​)−s,x∑​ps,x​H(Bx​),r0​+r2​≤I(T:C)ΩTC​​.

The set S\mathcal SS instead allows 1≤t≤min⁡{∣X∣,∣B∣2+∣C∣2−1}1\le t\le\min\{|X|,|B|^2+|C|^2-1\}1≤t≤min{∣X∣,∣B∣2+∣C∣2−1}, requires those same inequalities, and additionally requires r0+r1+r2≤H(∑xpX(x)Bx)−∑xpX(x)H(Bx)r_0+r_1+r_2\le H(\sum_xp_X(x)B_x)-\sum_xp_X(x)H(B_x)r0​+r1​+r2​≤H(∑x​pX​(x)Bx​)−∑x​pX​(x)H(Bx​), where pX(x)=∑sps,xp_X(x)=\sum_sp_{s,x}pX​(x)=∑s​ps,x​.

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