Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 and its explicit nonregularization limitation (seed paper result)

Open
QAlgorithms.Papers.Independent.Gap48.P39.cq_superposition

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-dimensional classical-input quantum broadcast channel with nonempty input alphabet XXX and positive-dimensional outputs B,CB,CB,C. Let C(W)\mathcal C(W)C(W) be the closure of its operational classical rate region: deterministic input words, independent common/Bob/Charlie messages, separate receiver POVMs, and vanishing maximum joint decoding error. Message counts at blocklength nnn are ⌊2nR⌋\lfloor2^{nR}\rfloor⌊2nR⌋, and similarly for the private rates. If a nonnegative rate triple and a probability distribution p(t,x)p(t,x)p(t,x) satisfy

RB≤I(X;B∣T),R+RC≤I(T;C),R+RB+RC≤I(X;B),R_B\le I(X;B\mid T),\qquad R+R_C\le I(T;C),\qquad R+R_B+R_C\le I(X;B),RB​≤I(X;B∣T),R+RC​≤I(T;C),R+RB​+RC​≤I(X;B),

then (R,RB,RC)∈C(W)(R,R_B,R_C)\in\mathcal C(W)(R,RB​,RC​)∈C(W). All information quantities are evaluated in σTXBC=⨁t,xp(t,x)ρxBC\sigma^{TXBC}=\bigoplus_{t,x}p(t,x)\rho_x^{BC}σTXBC=⨁t,x​p(t,x)ρxBC​, with base-two entropy. It suffices to use ∣T∣≤min⁡{∣X∣,∣B∣2+∣C∣2−1}|T|\le\min\{|X|,|B|^2+|C|^2-1\}∣T∣≤min{∣X∣,∣B∣2+∣C∣2−1}. This is the superposition inner bound, with boundary rates interpreted in the closed operational region.

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 1, PDF p.4, proved pp.5–6: all three inequalities imply membership
in CLOSED capacity, the limiting boundary interpretation after expurgation. -/
theorem cq_superposition [Nonempty X] [Nonempty B] [Nonempty C] (W : CQChannel X B C) :
    superpositionRegion W (some (superpositionCap X B C)) ⊆ cqBroadcastCapacity W := by sorry

end QAlgorithms.Papers.Independent.Gap48.P39

end
Source
Quantum broadcast channels, arXiv:quant-ph/0603098v2, PDF p. 4, Theorem 1 and its explicit nonregularization limitation (seed paper result)
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 and any assignment x↦ρxx\mapsto\rho_xx↦ρx​ of density matrices on B×CB\times CB×C, the following inclusion holds. Put Bx=Tr⁡CρxB_x=\operatorname{Tr}_C\rho_xBx​=TrC​ρx​, Cx=Tr⁡BρxC_x=\operatorname{Tr}_B\rho_xCx​=TrB​ρx​, and 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. Consider the set of nonnegative triples r=(r0,r1,r2)r=(r_0,r_1,r_2)r=(r0​,r1​,r2​) for which there are an integer 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} and a joint probability distribution ps,xp_{s,x}ps,x​ on {0,…,t−1}×X\{0,\ldots,t-1\}\times X{0,…,t−1}×X. Define pT(s)=∑xps,xp_T(s)=\sum_xp_{s,x}pT​(s)=∑x​ps,x​, pX(x)=∑sps,xp_X(x)=\sum_sp_{s,x}pX​(x)=∑s​ps,x​, and block diagonal matrices ΩTB\Omega_{TB}ΩTB​ and ΩTC\Omega_{TC}ΩTC​ with blocks ∑xps,xBx\sum_xp_{s,x}B_x∑x​ps,x​Bx​ and ∑xps,xCx\sum_xp_{s,x}C_x∑x​ps,x​Cx​, respectively. Require

r1≤H(ΩTB)−H(diag⁡pT)−∑s,xps,xH(Bx),r0+r2≤H(Tr⁡CΩTC)+H(Tr⁡TΩTC)−H(ΩTC),r0+r1+r2≤H ⁣(∑xpX(x)Bx)−∑xpX(x)H(Bx).\begin{aligned} r_1&\le H(\Omega_{TB})-H(\operatorname{diag}p_T)-\sum_{s,x}p_{s,x}H(B_x),\\ r_0+r_2&\le H(\operatorname{Tr}_C\Omega_{TC})+H(\operatorname{Tr}_T\Omega_{TC})-H(\Omega_{TC}),\\ r_0+r_1+r_2&\le H\!\left(\sum_xp_X(x)B_x\right)-\sum_xp_X(x)H(B_x). \end{aligned}r1​r0​+r2​r0​+r1​+r2​​≤H(ΩTB​)−H(diagpT​)−s,x∑​ps,x​H(Bx​),≤H(TrC​ΩTC​)+H(TrT​ΩTC​)−H(ΩTC​),≤H(x∑​pX​(x)Bx​)−x∑​pX​(x)H(Bx​).​

This entire set is contained in the closure in R3\mathbb R^3R3 of the following achievable set: a nonnegative triple aaa belongs to that set when, for every ϵ>0\epsilon>0ϵ>0, there exists a positive integer n0n_0n0​ such that every n≥n0n\ge n_0n≥n0​ admits words xs,i,j∈Xnx_{s,i,j}\in X^nxs,i,j​∈Xn, indexed by s<⌊2na0⌋s<\lfloor2^{na_0}\rfloors<⌊2na0​⌋, i<⌊2na1⌋i<\lfloor2^{na_1}\rfloori<⌊2na1​⌋, and j<⌊2na2⌋j<\lfloor2^{na_2}\rfloorj<⌊2na2​⌋, positive semidefinite matrices Ms,iM_{s,i}Ms,i​ on BnB^nBn summing to the identity over (s,i)(s,i)(s,i), and positive semidefinite matrices Ns,jN_{s,j}Ns,j​ on CnC^nCn summing to the identity over (s,j)(s,j)(s,j), such that every (s,i,j)(s,i,j)(s,i,j) satisfies 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−ϵ; here ρ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′​)). Thus the conclusion is membership in this closure, without an assertion that every triple in the first set itself satisfies the achievable-set quantifiers.

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