Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 44: additive gap bound

Open
QAlgorithms.Papers.Independent.Gap20.P15.additive_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 0<nˉ<10<\bar n<10<nˉ<1 and NS≥0N_S\ge0NS​≥0 be finite. Define U1=g(NS/(1+nˉ))−g(nˉNS/(1+nˉ))U_1=g(N_S/(1+\bar n))-g(\bar nN_S/(1+\bar n))U1​=g(NS​/(1+nˉ))−g(nˉNS​/(1+nˉ)) and d=(1+nˉ)2+4nˉNSd=\sqrt{(1+\bar n)^2+4\bar nN_S}d=(1+nˉ)2+4nˉNS​​. The thermal-input comparator obtained from the thermal-channel limit is L=g(NS+nˉ)−g((d+nˉ−1)/2)−g((d−nˉ−1)/2)L=g(N_S+\bar n)-g((d+\bar n-1)/2)-g((d-\bar n-1)/2)L=g(NS​+nˉ)−g((d+nˉ−1)/2)−g((d−nˉ−1)/2). Then

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

This is the scalar claim in Remark 44. The comparator comes from the analytic limit of (6.1), without postulating an operational capacity formula.

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

/-- Remark 44, PDF p.48: scalar gap to the analytic thermal-input lower-bound
limit. No operational definition is replaced by this scalar function. -/
theorem additive_gap_bound (noise energy : ℝ)
    (hnoise : 0 < noise) (hnoise1 : noise < 1) (henergy : 0 ≤ energy) :
    additiveCoherent noise energy ≤ additiveDataProcessing noise energy ∧
    additiveDataProcessing noise energy ≤
      additiveCoherent 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. 48, Remark 44
Read-back

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

For all real ν,E\nu,Eν,E satisfying 0<ν<10<\nu<10<ν<1 and E≥0E\ge0E≥0, define

g(x)=(x+1)ln⁡(x+1)−xln⁡xln⁡2,d=(1+ν)2+4νE,g(x)=\frac{(x+1)\ln(x+1)-x\ln x}{\ln2},\qquad d=\sqrt{(1+\nu)^2+4\nu E},g(x)=ln2(x+1)ln(x+1)−xlnx​,d=(1+ν)2+4νE​, P=g ⁣(E1+ν)−g ⁣(νE1+ν),C=g(E+ν)−g ⁣(d+ν−12)−g ⁣(d−ν−12).P=g\!\left(\frac{E}{1+\nu}\right) -g\!\left(\frac{\nu E}{1+\nu}\right),\qquad C=g(E+\nu)-g\!\left(\frac{d+\nu-1}{2}\right) -g\!\left(\frac{d-\nu-1}{2}\right).P=g(1+νE​)−g(1+ννE​),C=g(E+ν)−g(2d+ν−1​)−g(2d−ν−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​.

Zero energy is included, with logarithmic terms at zero evaluated using ln⁡0=0\ln0=0ln0=0, while noise values ν=0\nu=0ν=0 and ν=1\nu=1ν=1 are excluded.

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