Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Thermal coherent public/private and CQ families coincide

Proved
QAlgorithms.Papers.Independent.Gap48.P44.thermal_publicPrivate_equals_cq

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

prove2quantum

Write gn(x)=(x+1)ln⁡(x+1)−xln⁡xg_n(x)=(x+1)\ln(x+1)-x\ln xgn​(x)=(x+1)ln(x+1)−xlnx and gb(x)=gn(x)/ln⁡2g_b(x)=g_n(x)/\ln2gb​(x)=gn​(x)/ln2 for x≥0x\ge0x≥0, with 0ln⁡0=00\ln0=00ln0=0. Fix 0≤η≤10\le\eta\le10≤η≤1 and finite NS,NB≥0N_S,N_B\ge0NS​,NB​≥0. Write a=gb(ηNS+(1−η)NB)a=g_b(\eta N_S+(1-\eta)N_B)a=gb​(ηNS​+(1−η)NB​), bλ=gb(ηλNS+(1−η)NB)b_\lambda=g_b(\eta\lambda N_S+(1-\eta)N_B)bλ​=gb​(ηλNS​+(1−η)NB​), h=gb((1−η)NB)h=g_b((1-\eta)N_B)h=gb​((1−η)NB​), and eλ=gb([D+λ(1−η)NS−(1−η)NB−1]/2)+gb([D−λ(1−η)NS+(1−η)NB−1]/2)e_\lambda=g_b([D+\lambda(1-\eta)N_S-(1-\eta)N_B-1]/2)+g_b([D-\lambda(1-\eta)N_S+(1-\eta)N_B-1]/2)eλ​=gb​([D+λ(1−η)NS​−(1−η)NB​−1]/2)+gb​([D−λ(1−η)NS​+(1−η)NB​−1]/2), where D=[λ(1+η)NS+(1−η)NB+1]2−4ηλNS(λNS+1)D=\sqrt{[\lambda(1+\eta)N_S+(1-\eta)N_B+1]^2-4\eta\lambda N_S(\lambda N_S+1)}D=[λ(1+η)NS​+(1−η)NB​+1]2−4ηλNS​(λNS​+1)​ is nonnegative. Let AAA be the union over λ∈[0,1]\lambda\in[0,1]λ∈[0,1] of nonnegative pairs (u,v)(u,v)(u,v) with v≤bλ−eλv\le b_\lambda-e_\lambdav≤bλ​−eλ​ and u+v≤a−eλu+v\le a-e_\lambdau+v≤a−eλ​. Then

{(u,v)∈A:u+v≤a−h}=A.\{(u,v)\in A:u+v\le a-h\}=A.{(u,v)∈A:u+v≤a−h}=A.

The left side is the coherent-ensemble private inner family at zero key rate, relabeled as public/private rates; the right side is the displayed CQ inner family. The complementary entropy includes the thermal purifier, and this equality does not assert equality of operational capacities.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P44
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P44

open Filter

open scoped ENNReal Topology

open QAlgorithms.Papers.Independent.Claimed50.P39 (g)

open QAlgorithms.Papers.Independent.Information100.P54 (thermalEntropy)

/-- PDF p.15, Section IV B: the displayed coherent-ensemble public/private
family at S=0 equals the displayed CQ family, after relabeling (R,P)=(C,Q).
Only the explicit inner families are compared, with both modes of the true
complement in (80); this is not equality of operational channel capacities. -/
theorem thermal_publicPrivate_equals_cq (eta budget noise : ℝ)
    (heta0 : 0 ≤ eta) (heta1 : eta ≤ 1) (hbudget : 0 ≤ budget) (hnoise : 0 ≤ noise) :
    let output := thermalEntropy (eta * budget + (1 - eta) * noise)
    let conditional := fun share => thermalEntropy (eta * share * budget + (1 - eta) * noise)
    let environment := fun share => thermalEnvironment eta share budget noise
    {r ∈ cqFamily output conditional environment |
      r.1 + r.2 ≤ output - thermalEntropy ((1 - eta) * noise)} =
      cqFamily output conditional environment := by sorry

end QAlgorithms.Papers.Independent.Gap48.P44

end
Source
Quantum trade-off coding for bosonic communication, arXiv:1105.0119v4, PDF p. 15, §IV B: coherent-ensemble public/private and CQ coincidence
Read-back

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

For every real η,B,N\eta,B,Nη,B,N with 0≤η≤10\le\eta\le10≤η≤1, B≥0B\ge0B≥0, and N≥0N\ge0N≥0, define

H(x)=(x+1)ln⁡(x+1)−xln⁡xln⁡2,O=H(ηB+(1−η)N),C(s)=H(ηsB+(1−η)N),D(s)=(s(1+η)B+(1−η)N+1)2−4ηsB(sB+1),E(s)=H ⁣(D(s)+s(1−η)B−(1−η)N−12)+H ⁣(D(s)−s(1−η)B+(1−η)N−12),\begin{aligned} H(x)&=\frac{(x+1)\ln(x+1)-x\ln x}{\ln2},\\ O&=H(\eta B+(1-\eta)N),\\ C(s)&=H(\eta sB+(1-\eta)N),\\ D(s)&=\sqrt{(s(1+\eta)B+(1-\eta)N+1)^2-4\eta sB(sB+1)},\\ E(s)&= H\!\left(\frac{D(s)+s(1-\eta)B-(1-\eta)N-1}{2}\right) + H\!\left(\frac{D(s)-s(1-\eta)B+(1-\eta)N-1}{2}\right), \end{aligned}H(x)OC(s)D(s)E(s)​=ln2(x+1)ln(x+1)−xlnx​,=H(ηB+(1−η)N),=H(ηsB+(1−η)N),=(s(1+η)B+(1−η)N+1)2−4ηsB(sB+1)​,=H(2D(s)+s(1−η)B−(1−η)N−1​)+H(2D(s)−s(1−η)B+(1−η)N−1​),​

using the total real logarithm, with ln⁡0=0\ln0=0ln0=0, and the real square root, which is zero on nonpositive arguments. Let

Q={(r1,r2)∈[0,∞)2:∃s∈[0,1], r2≤C(s)−E(s),r1+r2≤O−E(s)}.Q=\left\{(r_1,r_2)\in[0,\infty)^2: \exists s\in[0,1],\ r_2\le C(s)-E(s),\quad r_1+r_2\le O-E(s) \right\}.Q={(r1​,r2​)∈[0,∞)2:∃s∈[0,1], r2​≤C(s)−E(s),r1​+r2​≤O−E(s)}.

Then

{r∈Q:r1+r2≤O−H((1−η)N)}=Q.\{r\in Q:r_1+r_2\le O-H((1-\eta)N)\}=Q.{r∈Q:r1​+r2​≤O−H((1−η)N)}=Q.

Equivalently, every pair satisfying the defining conditions of QQQ also satisfies the displayed additional bound on its coordinate sum. The assertion includes η=0\eta=0η=0, η=1\eta=1η=1, B=0B=0B=0, and N=0N=0N=0.

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