Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 2: fixed-law superposition and successive-decoding regions differ

Proved
QAlgorithms.Papers.Independent.Support50.P26.fixed_law_regions_differ

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

prove2quantum

For a fixed finite channel and auxiliary law as in Theorem 1, let S(p)\mathcal S(p)S(p) be the nonnegative region given by (9)–(11), and let D(p)\mathcal D(p)D(p) instead satisfy

R1≤I(X;B1∣W),R2≤I(W;B2),R2≤I(W;B1).R_1\le I(X;B_1|W),\qquad R_2\le I(W;B_2),\qquad R_2\le I(W;B_1).R1​≤I(X;B1​∣W),R2​≤I(W;B2​),R2​≤I(W;B1​).

There is a channel and one fixed law for which D(p)\mathcal D(p)D(p) is a proper subset of S(p)\mathcal S(p)S(p). Explicitly, take independent fair bits W,VW,VW,V, input X=(W,V)X=(W,V)X=(W,V), and the channel ρ(w,v)=∣v⟩⟨v∣B1⊗∣w⟩⟨w∣B2\rho_{(w,v)}=|v\rangle\langle v|^{B_1}\otimes|w\rangle\langle w|^{B_2}ρ(w,v)​=∣v⟩⟨v∣B1​⊗∣w⟩⟨w∣B2​. For this law,

(I(X;B1∣W),I(W;B2),I(X;B1),I(W;B1))=(1,1,1,0).\bigl(I(X;B_1|W),I(W;B_2),I(X;B_1),I(W;B_1)\bigr)=(1,1,1,0).(I(X;B1​∣W),I(W;B2​),I(X;B1​),I(W;B1​))=(1,1,1,0).

Consequently (1/2,1/2)∈S(p)∖D(p)(1/2,1/2)\in\mathcal S(p)\setminus\mathcal D(p)(1/2,1/2)∈S(p)∖D(p), while the successive-decoding corner (I(X;B1∣W),min⁡{I(W;B1),I(W;B2)})=(1,0)(I(X;B_1|W),\min\{I(W;B_1),I(W;B_2)\})=(1,0)(I(X;B1​∣W),min{I(W;B1​),I(W;B2​)})=(1,0) belongs to both regions.

This explicit witness states the fixed-distribution noncoincidence assertion. It makes no claim that the unions over distributions differ.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P26
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Support50.P26

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact primitives from pinned accepted modules, under the independent-paper override.
-- No coding theorem or other paper's channel model is reused.

open QAlgorithms.Papers.Independent.Information100.P22 (Op quantumMI)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon)

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

open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)

variable {X B1 B2 W U V A B : Type}

variable [Fintype X] [Fintype B1] [Fintype B2] [Fintype W] [Fintype U] [Fintype V]

variable [Fintype A] [Fintype B]

variable [DecidableEq X] [DecidableEq B1] [DecidableEq B2] [DecidableEq W]

variable [DecidableEq U] [DecidableEq V] [DecidableEq A] [DecidableEq B]

/-- Remark 2, PDF pp.7–8: a fixed-law proper inclusion, explicit separating pair,
computed information values (1,1,1,0), and the common successive-decoding corner.
No inequality of the unions over auxiliary laws is asserted. -/
theorem fixed_law_regions_differ :
    let C := separatingChannel
    let p := separatingLaw
    superPrivate C p = 1 ∧ quantumMI (superWB2 C p) = 1 ∧ superTotal C p = 1 ∧
    quantumMI (superWB1 C p) = 0 ∧
    SuccessiveRegion C p ⊂ SuperRegion C p ∧
    ((1 / 2, 1 / 2) : ℝ × ℝ) ∈ SuperRegion C p ∧
    ((1 / 2, 1 / 2) : ℝ × ℝ) ∉ SuccessiveRegion C p ∧
    successiveCorner C p ∈ SuccessiveRegion C p ∩ SuperRegion C p := by sorry

end QAlgorithms.Papers.Independent.Support50.P26

end
Source
Classical codes for quantum broadcast channels, arXiv:1111.3645v4, PDF p. 7, Remark 2: fixed-distribution superposition and successive-decoding regions need not coincide
Read-back

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

Take Boolean inputs x=(x1,x2)x=(x_1,x_2)x=(x1​,x2​), the broadcast output ρx=∣(x2,x1)⟩⟨(x2,x1)∣\rho_x=|(x_2,x_1)\rangle\langle(x_2,x_1)|ρx​=∣(x2​,x1​)⟩⟨(x2​,x1​)∣, and the law p(w,x)=1/4p(w,x)=1/4p(w,x)=1/4 when w=x1w=x_1w=x1​ and 000 otherwise. Put ρx(1)=Tr⁡B2ρx\rho_x^{(1)}=\operatorname{Tr}_{B_2}\rho_xρx(1)​=TrB2​​ρx​, ρx(2)=Tr⁡B1ρx\rho_x^{(2)}=\operatorname{Tr}_{B_1}\rho_xρx(2)​=TrB1​​ρx​, pW(w)=∑xp(w,x)p_W(w)=\sum_xp(w,x)pW​(w)=∑x​p(w,x), and σj((w,b),(w′,b′))=1w=w′∑xp(w,x)ρx(j)(b,b′)\sigma_j((w,b),(w',b'))=\mathbf1_{w=w'}\sum_xp(w,x)\rho_x^{(j)}(b,b')σj​((w,b),(w′,b′))=1w=w′​∑x​p(w,x)ρx(j)​(b,b′). Write H(q)=−∑iq(i)log⁡2q(i)H(q)=-\sum_iq(i)\log_2q(i)H(q)=−∑i​q(i)log2​q(i), S(A)=−Re⁡tr⁡[f(A)]S(A)=-\operatorname{Re}\operatorname{tr}[f(A)]S(A)=−Retr[f(A)] with f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t applied through continuous functional calculus, and I(A)=S(Tr⁡2A)+S(Tr⁡1A)−S(A)I(A)=S(\operatorname{Tr}_2A)+S(\operatorname{Tr}_1A)-S(A)I(A)=S(Tr2​A)+S(Tr1​A)−S(A). The theorem asserts

S(σ1)−H(pW)−∑w,xp(w,x)S(ρx(1))=1,I(σ2)=1,S ⁣(∑w,xp(w,x)ρx(1))−∑w,xp(w,x)S(ρx(1))=1,I(σ1)=0.S(\sigma_1)-H(p_W)-\sum_{w,x}p(w,x)S(\rho_x^{(1)})=1,\quad I(\sigma_2)=1,\quad S\!\left(\sum_{w,x}p(w,x)\rho_x^{(1)}\right)-\sum_{w,x}p(w,x)S(\rho_x^{(1)})=1,\quad I(\sigma_1)=0.S(σ1​)−H(pW​)−w,x∑​p(w,x)S(ρx(1)​)=1,I(σ2​)=1,S(w,x∑​p(w,x)ρx(1)​)−w,x∑​p(w,x)S(ρx(1)​)=1,I(σ1​)=0.

It also asserts that the region specified by r1,r2≥0r_1,r_2\ge0r1​,r2​≥0, r1≤1r_1\le1r1​≤1, r2≤1r_2\le1r2​≤1, and r2≤0r_2\le0r2​≤0 is a proper subset of the region specified by r1,r2≥0r_1,r_2\ge0r1​,r2​≥0, r1≤1r_1\le1r1​≤1, r2≤1r_2\le1r2​≤1, and r1+r2≤1r_1+r_2\le1r1​+r2​≤1; that (1/2,1/2)(1/2,1/2)(1/2,1/2) belongs to the latter and not the former; and that the defined corner (1,min⁡{0,1})=(1,0)(1,\min\{0,1\})=(1,0)(1,min{0,1})=(1,0) belongs to both regions.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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