Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 35: amplifier gap bound

Open
QAlgorithms.Papers.Independent.Gap20.P15.amplifier_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 G>1G>1G>1, NB,NS≥0N_B,N_S\ge0NB​,NS​≥0, and (G−1)NB<1(G-1)N_B<1(G−1)NB​<1, all finite. Set G′=G/[1−(G−1)NB]G'=G/[1-(G-1)N_B]G′=G/[1−(G−1)NB​] and U1=g(G′NS+G′−1)−g((G′−1)(NS+1))U_1=g(G'N_S+G'-1)-g((G'-1)(N_S+1))U1​=g(G′NS​+G′−1)−g((G′−1)(NS​+1)). Put D=((1+G)NS+(G−1)(NB+1)+1)2−4GNS(NS+1)D=\sqrt{((1+G)N_S+(G-1)(N_B+1)+1)^2-4GN_S(N_S+1)}D=((1+G)NS​+(G−1)(NB​+1)+1)2−4GNS​(NS​+1)​ and L=g(GNS+(G−1)(NB+1))−g((D+(G−1)(NS+NB+1)−1)/2)−g((D−(G−1)(NS+NB+1)−1)/2)L=g(GN_S+(G-1)(N_B+1))-g((D+(G-1)(N_S+N_B+1)-1)/2)-g((D-(G-1)(N_S+N_B+1)-1)/2)L=g(GNS​+(G−1)(NB​+1))−g((D+(G−1)(NS​+NB​+1)−1)/2)−g((D−(G−1)(NS​+NB​+1)−1)/2). Then

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

Both expressions are raw scalar values. This bounds their separation uniformly over the stated parameters.

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 35, PDF p.45, (9.22), using (9.10)-(9.11) and (9.20)-(9.21).
The strict non-entanglement-breaking condition keeps the gain denominator positive. -/
theorem amplifier_gap_bound (gain noise energy : ℝ)
    (hgain : 1 < gain) (hnoise : 0 ≤ noise) (henergy : 0 ≤ energy)
    (hphysical : (gain - 1) * noise < 1) :
    amplifierCoherent gain noise energy ≤ amplifierDataProcessing gain noise energy ∧
    amplifierDataProcessing gain noise energy ≤
      amplifierCoherent gain 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. 45, Theorem 35
Read-back

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

For all real G,ν,EG,\nu,EG,ν,E satisfying G>1G>1G>1, ν≥0\nu\ge0ν≥0, E≥0E\ge0E≥0, and (G−1)ν<1(G-1)\nu<1(G−1)ν<1, define

g(x)=(x+1)ln⁡(x+1)−xln⁡xln⁡2,G′=G1−(G−1)ν,d=((1+G)E+(G−1)(ν+1)+1)2−4GE(E+1),g(x)=\frac{(x+1)\ln(x+1)-x\ln x}{\ln2},\qquad G'=\frac{G}{1-(G-1)\nu},\qquad d=\sqrt{\bigl((1+G)E+(G-1)(\nu+1)+1\bigr)^2-4GE(E+1)},g(x)=ln2(x+1)ln(x+1)−xlnx​,G′=1−(G−1)νG​,d=((1+G)E+(G−1)(ν+1)+1)2−4GE(E+1)​,

and

P=g(G′E+G′−1)−g((G′−1)(E+1)),P=g(G'E+G'-1)-g((G'-1)(E+1)),P=g(G′E+G′−1)−g((G′−1)(E+1)), C=g(GE+(G−1)(ν+1))−g ⁣(d+(G−1)(E+ν+1)−12)−g ⁣(d−(G−1)(E+ν+1)−12).C=g(GE+(G-1)(\nu+1)) -g\!\left(\frac{d+(G-1)(E+\nu+1)-1}{2}\right) -g\!\left(\frac{d-(G-1)(E+\nu+1)-1}{2}\right).C=g(GE+(G−1)(ν+1))−g(2d+(G−1)(E+ν+1)−1​)−g(2d−(G−1)(E+ν+1)−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 denominator defining G′G'G′ is strictly positive under the stated hypothesis. Zero noise and zero energy are included, with ln⁡0=0\ln0=0ln0=0; gain G=1G=1G=1 and the boundary (G−1)ν=1(G-1)\nu=1(G−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