Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem-4

Open
QAlgorithms.Papers.Independent.Gap20.P04.theorem4

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

prove2quantum

Let 0≤p≤10\le p\le10≤p≤1 and let Np(σ)=(1−p)σ+pΔ(σ)\mathcal N_p(\sigma)=(1-p)\sigma+p\Delta(\sigma)Np​(σ)=(1−p)σ+pΔ(σ) be the qubit dephasing channel, where Δ\DeltaΔ removes off-diagonal matrix entries. Write H2H_2H2​ for binary entropy in bits and

γ(μ,p)=12+121−16p2(1−p2)μ(1−μ).\gamma(\mu,p)=\frac12+\frac12\sqrt{1-16\frac p2\left(1-\frac p2\right)\mu(1-\mu)}.γ(μ,p)=21​+21​1−162p​(1−2p​)μ(1−μ)​.

For 0≤μ≤1/20\le\mu\le1/20≤μ≤1/2, define

FCQ(μ)=(1−H2(μ), H2(μ)−H2(γ(μ,p))),F_{CQ}(\mu)=(1-H_2(\mu),\ H_2(\mu)-H_2(\gamma(\mu,p))),FCQ​(μ)=(1−H2​(μ), H2​(μ)−H2​(γ(μ,p))), FCE(μ)=(1+H2(μ)−H2(γ(μ,p)), H2(μ)).F_{CE}(\mu)=(1+H_2(\mu)-H_2(\gamma(\mu,p)),\ H_2(\mu)).FCE​(μ)=(1+H2​(μ)−H2​(γ(μ,p)), H2​(μ)).

For a family F(μ)F(\mu)F(μ), 0≤μ≤1/20\le\mu\le1/20≤μ≤1/2, let HCQ(F)\mathsf H_{CQ}(F)HCQ​(F) be its closed convex resource-monotone hull: classical and quantum rates can be lowered. Let HCE(F)\mathsf H_{CE}(F)HCE​(F) instead allow lowering the classical rate and increasing entanglement consumption, with nonnegative rates in both cases. These hulls include time sharing and endpoint limits.

Then

CCQ(Np)=HCQ(FCQ),CCE(Np)=HCE(FCE).\mathcal C_{CQ}(\mathcal N_p)=\mathsf H_{CQ}(F_{CQ}),\qquad \mathcal C_{CE}(\mathcal N_p)=\mathsf H_{CE}(F_{CE}).CCQ​(Np​)=HCQ​(FCQ​),CCE​(Np​)=HCE​(FCE​).

These are exact generating families for both trade-offs, retaining the degenerate flat portions at p=0,1p=0,1p=0,1.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P04

open QAlgorithms

open QAlgorithms.Papers.Independent.Claimed50.P24
  (Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
   dephasingDilation dephasingGamma cloningDilation)

open QAlgorithms.Papers.Independent.Information100.P67
  (receiverChannel complementaryChannel dilationPower)

open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)

open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)

open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)

open scoped BigOperators Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I B E J D F : Type}

variable [Fintype I] [Fintype B] [Fintype E]

variable [Fintype J] [Fintype D] [Fintype F]

variable [DecidableEq I] [DecidableEq B] [DecidableEq E]

variable [DecidableEq J] [DecidableEq D] [DecidableEq F]

variable [Nonempty I] [Nonempty B] [Nonempty E]

variable [Nonempty J] [Nonempty D] [Nonempty F]

/-- PDF pp.12,21--24, Theorem 4: the displayed families generate exactly both regions.
The endpoint flats are retained through resource-monotone hulls, not strict Pareto tests. -/
theorem theorem4 (p : ℝ) (h0 : 0 ≤ p) (h1 : p ≤ 1) :
    capacityCQ (dephasingDilation p) = cqHull (dephasingCQ p) ∧
      capacityCE (dephasingDilation p) = ceHull (dephasingCE p) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P04

end
Source
Trade-off capacities of the quantum Hadamard channels, arXiv:1001.1732v2, PDF p. 12, Theorem-4
Read-back

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

For every real p∈[0,1]p\in[0,1]p∈[0,1], including both endpoints, define Up:C2→C2⊗C2U_p:\mathbb C^2\to\mathbb C^2\otimes\mathbb C^2Up​:C2→C2⊗C2, with indices a,b,e∈{0,1}a,b,e\in\{0,1\}a,b,e∈{0,1}, by

(Up)(b,e),a={1−p/2,b=a, e=0,p/2 (−1)a,b=a, e=1,0,b≠a.(U_p)_{(b,e),a}= \begin{cases} \sqrt{1-p/2},&b=a,\ e=0,\\ \sqrt{p/2}\,(-1)^a,&b=a,\ e=1,\\ 0,&b\ne a. \end{cases}(Up​)(b,e),a​=⎩⎨⎧​1−p/2​,p/2​(−1)a,0,​b=a, e=0,b=a, e=1,b=a.​

For a matrix WWW, write BW(ρ)\mathcal B_W(\rho)BW​(ρ) and EW(ρ)\mathcal E_W(\rho)EW​(ρ) for the receiver and environment partial traces of WρW†W\rho W^\daggerWρW†. A valid purified input family consists of positive integers ℓ,r\ell,rℓ,r, probabilities px≥0p_x\ge0px​≥0 summing to 111, and unit vectors ψx∈Cr⊗Cinput(W)\psi_x\in\mathbb C^r\otimes\mathbb C^{\mathrm{input}(W)}ψx​∈Cr⊗Cinput(W); zero probabilities are allowed. With ρx=Tr⁡Cr∣ψx⟩⟨ψx∣\rho_x=\operatorname{Tr}_{\mathbb C^r}|\psi_x\rangle\langle\psi_x|ρx​=TrCr​∣ψx​⟩⟨ψx​∣, ρˉ=∑xpxρx\bar\rho=\sum_xp_x\rho_xρˉ​=∑x​px​ρx​, and S(ρ)=−∑jλjlog⁡2λjS(\rho)=-\sum_j\lambda_j\log_2\lambda_jS(ρ)=−∑j​λj​log2​λj​, using 0log⁡20=00\log_2 0=00log2​0=0, set

a=∑xpxS(ρx),χ=S(BW(ρˉ))−∑xpxS(BW(ρx)),Q=∑xpx(S(BW(ρx))−S(EW(ρx))),J=a+S(BW(ρˉ))−∑xpxS(EW(ρx)).a=\sum_xp_xS(\rho_x),\quad \chi=S(\mathcal B_W(\bar\rho))-\sum_xp_xS(\mathcal B_W(\rho_x)),\quad Q=\sum_xp_x\bigl(S(\mathcal B_W(\rho_x))-S(\mathcal E_W(\rho_x))\bigr),\quad J=a+S(\mathcal B_W(\bar\rho))-\sum_xp_xS(\mathcal E_W(\rho_x)).a=x∑​px​S(ρx​),χ=S(BW​(ρˉ​))−x∑​px​S(BW​(ρx​)),Q=x∑​px​(S(BW​(ρx​))−S(EW​(ρx​))),J=a+S(BW​(ρˉ​))−x∑​px​S(EW​(ρx​)).

Let RCQ(W)R_{\mathrm{CQ}}(W)RCQ​(W) contain the nonnegative pairs bounded coordinatewise by (χ,Q)(\chi,Q)(χ,Q) for some valid family, and let RCE(W)R_{\mathrm{CE}}(W)RCE​(W) contain the nonnegative pairs (c,e)(c,e)(c,e) satisfying c≤Jc\le Jc≤J and a≤ea\le ea≤e for some valid family. Define C∙(W)=⋃n≥1{z:nz∈R∙(W(n))}‾C_\bullet(W)=\overline{\bigcup_{n\ge1}\{z:nz\in R_\bullet(W^{(n)})\}}C∙​(W)=⋃n≥1​{z:nz∈R∙​(W(n))}​, where W(b,e),i(n)=∏j<nW(bj,ej),ijW^{(n)}_{(b,e),i}=\prod_{j<n}W_{(b_j,e_j),i_j}W(b,e),i(n)​=∏j<n​W(bj​,ej​),ij​​. Write h(t)=−tlog⁡2t−(1−t)log⁡2(1−t)h(t)=-t\log_2t-(1-t)\log_2(1-t)h(t)=−tlog2​t−(1−t)log2​(1−t), with zero terms interpreted as zero, and

γ(μ,p)=1+1−16(p/2)(1−p/2)μ(1−μ)2.\gamma(\mu,p)=\frac{1+\sqrt{1-16(p/2)(1-p/2)\mu(1-\mu)}}2.γ(μ,p)=21+1−16(p/2)(1−p/2)μ(1−μ)​​.

Then CCQ(Up)C_{\mathrm{CQ}}(U_p)CCQ​(Up​) is the closure of the convex hull of all nonnegative (c,q)(c,q)(c,q) for which some μ∈[0,12]\mu\in[0,\tfrac12]μ∈[0,21​] satisfies c≤1−h(μ)c\le1-h(\mu)c≤1−h(μ) and q≤h(μ)−h(γ(μ,p))q\le h(\mu)-h(\gamma(\mu,p))q≤h(μ)−h(γ(μ,p)); and CCE(Up)C_{\mathrm{CE}}(U_p)CCE​(Up​) is the closure of the convex hull of all nonnegative (c,e)(c,e)(c,e) for which some μ∈[0,12]\mu\in[0,\tfrac12]μ∈[0,21​] satisfies c≤1+h(μ)−h(γ(μ,p))c\le1+h(\mu)-h(\gamma(\mu,p))c≤1+h(μ)−h(γ(μ,p)) and h(μ)≤eh(\mu)\le eh(μ)≤e.

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