Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6: no extra cq corner for erasure MAC

Open
QAlgorithms.Papers.Independent.Support50.P02.erasure_side_information

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

prove2quantum

Let d,k≥1d,k\ge1d,k≥1 and let Ed\mathcal E_dEd​ be the controlled-erasure MAC that flags Alice's computational-basis outcome 000 and coherently transfers Bob's ddd-dimensional input on outcome 111. Fix any pure ensemble on Alice's kkk inputs and an independent pure Bob reference/input pair, and let σXBCk\sigma^{XBC^k}σXBCk be their output under Ed⊗k\mathcal E_d^{\otimes k}Ed⊗k​. If Ic(B⟩Ck)σ≥0I_c(B\rangle C^k)_\sigma\ge0Ic​(B⟩Ck)σ​≥0, then the new cq corner lies in the old rectangle for that very state:

(I(X;BCk)σ,Ic(B⟩Ck)σ)∈{(u,v)≥0:u≤I(X;Ck)σ, v≤Ic(B⟩CkX)σ}.\bigl(I(X;BC^k)_\sigma,I_c(B\rangle C^k)_\sigma\bigr)\in\{(u,v)\ge0:u\le I(X;C^k)_\sigma,\ v\le I_c(B\rangle C^kX)_\sigma\}.(I(X;BCk)σ​,Ic​(B⟩Ck)σ​)∈{(u,v)≥0:u≤I(X;Ck)σ​, v≤Ic​(B⟩CkX)σ​}.

This is pointwise for every positive blocklength and every such input, without optimization. The hypothesis precisely restricts the claimed corner to nonnegative operational rates; negative information coordinates are not in the source's rate rectangles.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P02
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Support50.P02

open QAlgorithms.Papers.Independent.Information100.P67
  (squaredFidelity receiverChannel complementaryChannel IsDegradable)

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

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

open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C E R S I J : Type*}

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

variable [Fintype C] [DecidableEq C] [Fintype E] [DecidableEq E]

variable [Fintype R] [DecidableEq R] [Fintype S] [DecidableEq S]

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

/-- No extra erasure cq corner, PDF p.31, with the channel defined on pp.32–33.
This is pointwise at EVERY positive blocklength, not merely optimized-region equality.
The new corner is an operational rate pair when its quantum coordinate is nonnegative;
negative information corners are not elements of the source's nonnegative rectangles. -/
theorem erasure_side_information (d n : ℕ) (hd : 0 < d) (hn : 0 < n)
    (D : CQMacData (Fin n → Bool) (Fin n → Fin d))
    (hcorner : 0 ≤ D.coherent (macPower (controlledErasure d) n)) :
    D.Rectangle (macPower (controlledErasure d) n)
      (D.sideClassical (macPower (controlledErasure d) n),
        D.coherent (macPower (controlledErasure d) n)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P02

end
Source
Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions, arXiv:quant-ph/0501045v3, PDF p. 31, §6: no extra cq corner for erasure MAC
Read-back

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

For every pair of positive natural numbers d,nd,nd,n, consider any data DDD consisting of a finite ensemble of unit vectors αx\alpha_xαx​ on {false,true}n\{\mathrm{false},\mathrm{true}\}^n{false,true}n, real weights wx≥0w_x\ge0wx​≥0 summing to one, a positive integer kkk, and a unit vector β\betaβ on R×{0,…,d−1}nR\times\{0,\ldots,d-1\}^nR×{0,…,d−1}n, where R={0,…,k−1}R=\{0,\ldots,k-1\}R={0,…,k−1}. Let Ed\mathcal E_dEd​ send the false-control block trace to an extra erasure index, retain the true-control block, and set cross entries to zero, and apply this map independently to the nnn input pairs. Define

ωx=(idR⊗Ed⊗n)(∣αx⟩⟨αx∣⊗∣β⟩⟨β∣),ωˉ=∑xwxωx,ωxC=tr⁡Rωx,ωˉC=tr⁡Rωˉ,\omega_x=(\mathrm{id}_R\otimes\mathcal E_d^{\otimes n}) \bigl(|\alpha_x\rangle\langle\alpha_x|\otimes|\beta\rangle\langle\beta|\bigr), \quad \bar\omega=\sum_xw_x\omega_x,\quad \omega_x^C=\operatorname{tr}_R\omega_x,\quad \bar\omega^C=\operatorname{tr}_R\bar\omega,ωx​=(idR​⊗Ed⊗n​)(∣αx​⟩⟨αx​∣⊗∣β⟩⟨β∣),ωˉ=x∑​wx​ωx​,ωxC​=trR​ωx​,ωˉC=trR​ωˉ,

where the factors are reordered so that each channel receives one Boolean input and one ddd-dimensional input. Put

χC=S(ωˉC)−∑xwxS(ωxC),χRC=S(ωˉ)−∑xwxS(ωx),J=S(ωˉC)−S(ωˉ),Jcond=∑xwx(S(ωxC)−S(ωx)),\chi_C=S(\bar\omega^C)-\sum_xw_xS(\omega_x^C),\quad \chi_{RC}=S(\bar\omega)-\sum_xw_xS(\omega_x),\quad J=S(\bar\omega^C)-S(\bar\omega),\quad J_{\mathrm{cond}}=\sum_xw_x\bigl(S(\omega_x^C)-S(\omega_x)\bigr),χC​=S(ωˉC)−x∑​wx​S(ωxC​),χRC​=S(ωˉ)−x∑​wx​S(ωx​),J=S(ωˉC)−S(ωˉ),Jcond​=x∑​wx​(S(ωxC​)−S(ωx​)),

with S(X)=−Re⁡tr⁡[f(X)]S(X)=-\operatorname{Re}\operatorname{tr}[f(X)]S(X)=−Retr[f(X)] for the continuous functional calculus of f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t. Under the hypothesis J≥0J\ge0J≥0, the assertion is precisely that (χRC,J)(\chi_{RC},J)(χRC​,J) belongs to the rectangle determined by these same data, namely

0≤χRC,0≤J,χRC≤χC,J≤Jcond.0\le\chi_{RC},\qquad 0\le J,\qquad \chi_{RC}\le\chi_C,\qquad J\le J_{\mathrm{cond}}.0≤χRC​,0≤J,χRC​≤χC​,J≤Jcond​.

No existence of data satisfying the hypothesis is asserted.

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

    Confirmed by the moderator at approval.

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