Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§II-C unnumbered quantum outer bound: degraded message sets

Open
QAlgorithms.Papers.Independent.Gap48.P39.degraded_message_outer

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 any finite cq broadcast channel, with nonempty alphabet and positive-dimensional outputs, and let (R,RB,0)(R,R_B,0)(R,RB​,0) belong to its closed operational classical capacity region. The third rate is zero: Bob decodes all common information intended for Charlie and his private message. Then a finite quantum auxiliary TTT, a distribution p(x)p(x)p(x) and normalized states ρxT\rho_x^TρxT​ exist such that, in σTXBC=⨁xp(x)ρxT⊗ρxBC\sigma^{TXBC}=\bigoplus_xp(x)\rho_x^T\otimes\rho_x^{BC}σTXBC=⨁x​p(x)ρxT​⊗ρxBC​,

RB≤I(X;B∣T)σ,R≤I(T;C)σ,R+RB≤I(X;B)σ.R_B\le I(X;B\mid T)_\sigma,\qquad R\le I(T;C)_\sigma,\qquad R+R_B\le I(X;B)_\sigma.RB​≤I(X;B∣T)σ​,R≤I(T;C)σ​,R+RB​≤I(X;B)σ​.

Rates are nonnegative and information quantities are in bits. The operational region uses deterministic encoders, separate receiver POVMs and vanishing maximum joint error. No degraded-channel hypothesis or dimension cap on quantum TTT is added. This is the authors' quantum outer bound, not the classical-auxiliary exact-capacity theorem cited as background.

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]

/-- §II-C quantum outer bound for degraded message sets, PDF p.7.
T is quantum, with no finite dimension cap; the channel need not be degraded. -/
theorem degraded_message_outer [Nonempty X] [Nonempty B] [Nonempty C]
    (W : CQChannel X B C) (R RB : ℝ) (h : (R, RB, 0) ∈ cqBroadcastCapacity W) :
    (R, RB, 0) ∈ quantumOuterRegion W true := by sorry

end QAlgorithms.Papers.Independent.Gap48.P39

end
Source
Quantum broadcast channels, arXiv:quant-ph/0603098v2, PDF p. 7, §II-C unnumbered quantum outer bound: degraded message sets
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​ be any assignment of density matrices on B×CB\times CB×C, and let R,RB∈RR,R_B\in\mathbb RR,RB​∈R. Assume (R,RB,0)(R,R_B,0)(R,RB​,0) lies in the closure of the following set of achievable triples: a nonnegative triple rrr is achievable when, for every ϵ>0\epsilon>0ϵ>0, every sufficiently large positive integer nnn admits words xs,i,j∈Xnx_{s,i,j}\in X^nxs,i,j​∈Xn with 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​ on BnB^nBn and Ns,jN_{s,j}Ns,j​ on CnC^nCn, each summing to its identity, such that Re⁡tr⁡((Ms,i⊗Ns,j)ρxs,i,j(n))≥1−ϵ\operatorname{Re}\operatorname{tr}((M_{s,i}\otimes N_{s,j})\rho_{x_{s,i,j}}^{(n)})\ge1-\epsilonRetr((Ms,i​⊗Ns,j​)ρxs,i,j​(n)​)≥1−ϵ for every message triple, where ρ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′​)). Then R,RB≥0R,R_B\ge0R,RB​≥0, and there exist a positive integer ttt, a probability distribution qxq_xqx​ on XXX, and density matrices τx\tau_xτx​ on a ttt-dimensional space such that, writing Bx=Tr⁡CρxB_x=\operatorname{Tr}_C\rho_xBx​=TrC​ρx​, Cx=Tr⁡BρxC_x=\operatorname{Tr}_B\rho_xCx​=TrB​ρx​, ΩTB=∑xqxτx⊗Bx\Omega_{TB}=\sum_xq_x\tau_x\otimes B_xΩTB​=∑x​qx​τx​⊗Bx​, and ΩTC=∑xqxτx⊗Cx\Omega_{TC}=\sum_xq_x\tau_x\otimes C_xΩTC​=∑x​qx​τx​⊗Cx​,

RB≤H(ΩTB)−H ⁣(∑xqxτx)−∑xqxH(Bx),R≤H(Tr⁡CΩTC)+H(Tr⁡TΩTC)−H(ΩTC),R+RB≤H ⁣(∑xqxBx)−∑xqxH(Bx).\begin{aligned} R_B&\le H(\Omega_{TB})-H\!\left(\sum_xq_x\tau_x\right)-\sum_xq_xH(B_x),\\ R&\le H(\operatorname{Tr}_C\Omega_{TC})+H(\operatorname{Tr}_T\Omega_{TC})-H(\Omega_{TC}),\\ R+R_B&\le H\!\left(\sum_xq_xB_x\right)-\sum_xq_xH(B_x). \end{aligned}RB​RR+RB​​≤H(ΩTB​)−H(x∑​qx​τx​)−x∑​qx​H(Bx​),≤H(TrC​ΩTC​)+H(TrT​ΩTC​)−H(ΩTC​),≤H(x∑​qx​Bx​)−x∑​qx​H(Bx​).​

Here H(M)=−Re⁡tr⁡(f(M))H(M)=-\operatorname{Re}\operatorname{tr}(f(M))H(M)=−Retr(f(M)), with f(u)=ulog⁡2uf(u)=u\log_2uf(u)=ulog2​u applied by continuous functional calculus. There is no degrading-map or commutativity hypothesis, and no upper bound on ttt.

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