Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2: constant-composition common-message cq code

Open
QAlgorithms.Papers.Independent.Gap48.P39.constant_composition_common_code

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 input alphabet and positive-dimensional outputs, and let ppp be a probability distribution on XXX. Fix ε,δ>0\varepsilon,\delta>0ε,δ>0 and a nonnegative rate

R=min⁡{I(X;B),I(X;C)}−δ,R=\min\{I(X;B),I(X;C)\}-\delta,R=min{I(X;B),I(X;C)}−δ,

where the information quantities are computed in ⨁xp(x)ρxBC\bigoplus_xp(x)\rho_x^{BC}⨁x​p(x)ρxBC​ in bits. For every sufficiently large positive blocklength nnn, there is an indexed family of ⌊2nR⌋\lfloor2^{nR}\rfloor⌊2nR⌋ words, all of one empirical type PPP with ∑x∣P(x)−p(x)∣≤δ\sum_x|P(x)-p(x)|\le\delta∑x​∣P(x)−p(x)∣≤δ, and separate Bob and Charlie POVMs such that, for every message mmm,

Tr⁡[(Λm⊗Λm′)⨂i=1nρxi(m)BC]≥1−ε.\operatorname{Tr}[(\Lambda_m\otimes\Lambda'_m)\bigotimes_{i=1}^n\rho_{x_i(m)}^{BC}]\ge1-\varepsilon.Tr[(Λm​⊗Λm′​)i=1⨂n​ρxi​(m)BC​]≥1−ε.

The entire code is chosen before the message. This gives constant-composition common-message coding with a joint maximum-error criterion; injectivity of the indexed family is not assumed.

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]

/-- Proposition 2, PDF p.4: constant-composition common-message cq coding.
The code family is chosen before the message and the error is joint maximum error. -/
theorem constant_composition_common_code [Nonempty X] [Nonempty B] [Nonempty C]
    (W : CQChannel X B C) (p : Distribution X) (epsilon delta R : ℝ)
    (he : 0 < epsilon) (hd : 0 < delta) (hR : 0 ≤ R)
    (hRate : R = min (holevoInfo p.val (fun x => traceRight (W.state x)))
      (holevoInfo p.val (fun x => traceLeft (W.state x))) - delta) :
    ∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
      ∃ D : CommonCode X B C n (rank n R), D.Good W p epsilon delta := by sorry

end QAlgorithms.Papers.Independent.Gap48.P39

end
Source
Quantum broadcast channels, arXiv:quant-ph/0603098v2, PDF p. 4, Proposition 2: constant-composition common-message cq code
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, and let p:X→Rp:X\to\mathbb Rp:X→R satisfy px≥0p_x\ge0px​≥0 and ∑xpx=1\sum_xp_x=1∑x​px​=1. Write 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)), where f(u)=ulog⁡2uf(u)=u\log_2uf(u)=ulog2​u is applied by continuous functional calculus. For real numbers ϵ,δ,R\epsilon,\delta,Rϵ,δ,R, assume ϵ>0\epsilon>0ϵ>0, δ>0\delta>0δ>0, R≥0R\ge0R≥0, and the exact equality

R=min⁡{H ⁣(∑xpxBx)−∑xpxH(Bx),H ⁣(∑xpxCx)−∑xpxH(Cx)}−δ.R=\min\left\{ H\!\left(\sum_xp_xB_x\right)-\sum_xp_xH(B_x), H\!\left(\sum_xp_xC_x\right)-\sum_xp_xH(C_x) \right\}-\delta.R=min{H(x∑​px​Bx​)−x∑​px​H(Bx​),H(x∑​px​Cx​)−x∑​px​H(Cx​)}−δ.

Then there exists a positive integer n0n_0n0​ such that every n≥n0n\ge n_0n≥n0​ admits m=⌊2nR⌋m=\lfloor2^{nR}\rfloorm=⌊2nR⌋ words xs∈Xnx_s\in X^nxs​∈Xn, positive semidefinite matrices MsM_sMs​ on BnB^nBn summing to IBnI_{B^n}IBn​, and positive semidefinite matrices NsN_sNs​ on CnC^nCn summing to ICnI_{C^n}ICn​, together with a function P:X→RP:X\to\mathbb RP:X→R, such that ∑x∣P(x)−px∣≤δ\sum_x|P(x)-p_x|\le\delta∑x​∣P(x)−px​∣≤δ, every word has frequency P(a)=∣{i<n:xs(i)=a}∣/nP(a)=|\{i<n:x_s(i)=a\}|/nP(a)=∣{i<n:xs​(i)=a}∣/n for every aaa, and every message satisfies

Re⁡tr⁡((Ms⊗Ns)ρxs(n))≥1−ϵ,ρxs(n)((b,c),(b′,c′))=∏i<nρxs(i)((bi,ci),(bi′,ci′)).\operatorname{Re}\operatorname{tr}\bigl((M_s\otimes N_s)\rho_{x_s}^{(n)}\bigr)\ge1-\epsilon, \qquad \rho_{x_s}^{(n)}((b,c),(b',c'))=\prod_{i<n}\rho_{x_s(i)}((b_i,c_i),(b'_i,c'_i)).Retr((Ms​⊗Ns​)ρxs​(n)​)≥1−ϵ,ρxs​(n)​((b,c),(b′,c′))=i<n∏​ρxs​(i)​((bi​,ci​),(bi′​,ci′​)).

The assumptions allow R=0R=0R=0, giving one message. They impose no upper bound on ϵ\epsilonϵ; the equality defining RRR, together with R≥0R\ge0R≥0, requires the displayed minimum to be at least δ\deltaδ.

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