Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered gap monotonicity: thermal gap monotone

Open
QAlgorithms.Papers.Independent.Gap20.P15.thermal_gap_monotone

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). For fixed η,NB\eta,N_Bη,NB​, put Δ(NS)=U1(NS)−L(NS)\Delta(N_S)=U_1(N_S)-L(N_S)Δ(NS​)=U1​(NS​)−L(NS​). Then

0≤NS≤NS′⟹Δ(NS)≤Δ(NS′).0\le N_S\le N'_S\quad\Longrightarrow\quad\Delta(N_S)\le\Delta(N'_S).0≤NS​≤NS′​⟹Δ(NS​)≤Δ(NS′​).

This controls input-energy dependence without asserting the incorrect saturation limit. The pure-loss gap is identically zero.

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

/-- Unnumbered monotonicity claim, PDF pp.35-36, (6.22)-(6.25): increasing
means nondecreasing, allowing the identically-zero pure-loss gap. -/
theorem thermal_gap_monotone (eta noise : ℝ)
    (heta : 1 / 2 ≤ eta) (heta1 : eta ≤ 1) (hnoise : 0 ≤ noise) :
    MonotoneOn (thermalGap eta noise) (Set.Ici (0 : ℝ)) := 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. 35, Unnumbered gap monotonicity
Read-back

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

For every real η,ν\eta,\nuη,ν satisfying 12≤η≤1\tfrac12\le\eta\le121​≤η≤1 and ν≥0\nu\ge0ν≥0, set

g(x)=(x+1)ln⁡(x+1)−xln⁡xln⁡2,t=η1+(1−η)ν,d(E)=((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(E)=\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(E)=((1+η)E+(1−η)ν+1)2−4ηE(E+1)​,

and define the real function

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

The assertion is that FFF is nondecreasing on [0,∞)[0,\infty)[0,∞): for every pair of real numbers E1,E2E_1,E_2E1​,E2​ with 0≤E1≤E20\le E_1\le E_20≤E1​≤E2​, one has F(E1)≤F(E2)F(E_1)\le F(E_2)F(E1​)≤F(E2​). Equality is allowed. The cases η=12\eta=\tfrac12η=21​, η=1\eta=1η=1, ν=0\nu=0ν=0, and E1=0E_1=0E1​=0 are included, with 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