Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 26: thermal gap bound

Open
QAlgorithms.Papers.Independent.Gap20.P15.thermal_gap_bound

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

prove2quantum

Write g(x)=((x+1)ln⁡(x+1)−xln⁡x)/ln⁡2g(x)=((x+1)\ln(x+1)-x\ln x)/\ln2g(x)=((x+1)ln(x+1)−xlnx)/ln2 for thermal entropy in bits, with g(0)=0g(0)=0g(0)=0.

Let 1/2≤η≤11/2\le\eta\le11/2≤η≤1, NB≥0N_B\ge0NB​≥0, and NS≥0N_S\ge0NS​≥0 be finite real parameters. Set t=η/[1+(1−η)NB]t=\eta/[1+(1-\eta)N_B]t=η/[1+(1−η)NB​], U1=g(tNS)−g((1−t)NS)U_1=g(tN_S)-g((1-t)N_S)U1​=g(tNS​)−g((1−t)NS​), and D=((1+η)NS+(1−η)NB+1)2−4ηNS(NS+1)D=\sqrt{((1+\eta)N_S+(1-\eta)N_B+1)^2-4\eta N_S(N_S+1)}D=((1+η)NS​+(1−η)NB​+1)2−4ηNS​(NS​+1)​. Define L=g(ηNS+(1−η)NB)−g((D+(1−η)(NS−NB)−1)/2)−g((D−(1−η)(NS−NB)−1)/2)L=g(\eta N_S+(1-\eta)N_B)-g((D+(1-\eta)(N_S-N_B)-1)/2)-g((D-(1-\eta)(N_S-N_B)-1)/2)L=g(ηNS​+(1−η)NB​)−g((D+(1−η)(NS​−NB​)−1)/2)−g((D−(1−η)(NS​−NB​)−1)/2). Then

L≤U1≤L+1ln⁡2.L\le U_1\le L+\frac1{\ln2}.L≤U1​≤L+ln21​.

This compares the raw scalar expressions, including the identity-channel and vacuum endpoints. It makes no assertion of fixed-channel saturation of the constant.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P15
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P15

open QAlgorithms.Papers.Independent.Frontier30.P24 (bosonicEntropy)

open QAlgorithms.Papers.Independent.Dependency50.P33 (State)

open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel Hamiltonian)

open QAlgorithms.Papers.Independent.Gap48.P26 (entropyBits)

open QAlgorithms.Papers.Independent.Claimed50.P35 (traceClassChannelPower)

open scoped ENNReal

/-- Theorem 26, PDF p.34, (6.3). Raw U1 and L, including eta=1, NB=0,
and NS=0. The incorrect fixed-channel saturation claim on pp.34-35 is deferred. -/
theorem thermal_gap_bound (eta noise energy : ℝ)
    (heta : 1 / 2 ≤ eta) (heta1 : eta ≤ 1)
    (hnoise : 0 ≤ noise) (henergy : 0 ≤ energy) :
    thermalCoherent eta noise energy ≤ thermalDataProcessing eta noise energy ∧
    thermalDataProcessing eta noise energy ≤
      thermalCoherent eta noise energy + 1 / Real.log 2 := by sorry

end QAlgorithms.Papers.Independent.Gap20.P15

end
Source
Bounding the energy-constrained quantum and private capacities of phase-insensitive bosonic Gaussian channels, arXiv:1708.07257v3, PDF p. 34, Theorem 26
Read-back

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

For all real η,ν,E\eta,\nu,Eη,ν,E satisfying 12≤η≤1\tfrac12\le\eta\le121​≤η≤1, ν≥0\nu\ge0ν≥0, and E≥0E\ge0E≥0, define

g(x)=(x+1)ln⁡(x+1)−xln⁡xln⁡2,t=η1+(1−η)ν,d=((1+η)E+(1−η)ν+1)2−4ηE(E+1),g(x)=\frac{(x+1)\ln(x+1)-x\ln x}{\ln2},\qquad t=\frac{\eta}{1+(1-\eta)\nu},\qquad d=\sqrt{\bigl((1+\eta)E+(1-\eta)\nu+1\bigr)^2-4\eta E(E+1)},g(x)=ln2(x+1)ln(x+1)−xlnx​,t=1+(1−η)νη​,d=((1+η)E+(1−η)ν+1)2−4ηE(E+1)​,

and

P=g(tE)−g((1−t)E),C=g(ηE+(1−η)ν)−g ⁣(d+(1−η)(E−ν)−12)−g ⁣(d−(1−η)(E−ν)−12).P=g(tE)-g((1-t)E),\qquad C=g(\eta E+(1-\eta)\nu) -g\!\left(\frac{d+(1-\eta)(E-\nu)-1}{2}\right) -g\!\left(\frac{d-(1-\eta)(E-\nu)-1}{2}\right).P=g(tE)−g((1−t)E),C=g(ηE+(1−η)ν)−g(2d+(1−η)(E−ν)−1​)−g(2d−(1−η)(E−ν)−1​).

The assertion is the conjunction

C≤PandP≤C+1ln⁡2.C\le P\qquad\text{and}\qquad P\le C+\frac1{\ln2}.C≤PandP≤C+ln21​.

The boundary cases η=12\eta=\tfrac12η=21​, η=1\eta=1η=1, ν=0\nu=0ν=0, and E=0E=0E=0 are included; logarithmic terms at zero use the convention ln⁡0=0\ln0=0ln0=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