Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform 0.06-bit gap after Eq. (9)

Open
QAlgorithms.Papers.Independent.Intakenext100.P62.balancedGapBits

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All capacities below are unassisted operational capacities: finite message codes may use arbitrary mixed signal states entangled across channel uses and arbitrary collective output POVMs. The uniform-message average decoding error vanishes at all sufficiently large blocklengths. The constraint is ensemble-average total input photon number at most nNnNnN for nnn uses. Write g(x)=(x+1)ln⁡(x+1)−xln⁡xg(x)=(x+1)\ln(x+1)-x\ln xg(x)=(x+1)ln(x+1)−xlnx, with 0ln⁡0=00\ln0=00ln0=0, and use nats unless bits are specified.

For all NE,N≥0N_E,N\ge0NE​,N≥0, let U1/2=g((N+NE)/2)−ln⁡(1+eg(NE))+ln⁡2U_{1/2}=g((N+N_E)/2)-\ln(1+e^{g(N_E)})+\ln2U1/2​=g((N+NE​)/2)−ln(1+eg(NE​))+ln2 and L1/2=g((N+NE)/2)−g(NE/2)L_{1/2}=g((N+N_E)/2)-g(N_E/2)L1/2​=g((N+NE​)/2)−g(NE​/2). Then

U1/2−L1/2ln⁡2≤0.06.\frac{U_{1/2}-L_{1/2}}{\ln2}\le0.06.ln2U1/2​−L1/2​​≤0.06.

Thus the explicit balanced upper and coherent-signal lower bounds differ by at most 0.060.060.06 bits uniformly in both photon means. The statement compares numerical bounds on capacity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P62
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P62

open scoped ENNReal BigOperators

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

open QAlgorithms.Papers.Independent.Frontier18.P07 (extendedEntropyNats)

open QAlgorithms.Papers.Independent.Claimed50.P19 (FockIndex)

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

open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)

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

open QAlgorithms.Papers.Independent.Bridge50.P28
  (classicalPhotonCapacityBits thermalNoiseChannelKernel coherentSignalRateBits)

open QAlgorithms.Papers.Independent.Next46.P17
  (beamSplitter bosonicEntropyPower diffusionChannel TotalFisherRegular totalFisher)

/-- PDF p.3, sentence after (9): the balanced numerical upper bound minus
the Holevo coherent-signal lower bound is at most 0.06 bits, uniformly over
both photon means. This compares explicit bounds, not capacity with itself. -/
theorem balancedGapBits (NE N : ℝ) (hNE : 0 ≤ NE) (hN : 0 ≤ N) :
    balancedThermalUpperNats NE N / Real.log 2 -
      coherentSignalRateBits (1 / 2) NE N ≤ (6 / 100 : ℝ) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P62

end
Source
Limits on classical communication from quantum entropy power inequalities, arXiv:1205.3407v2, PDF p. 3, Uniform 0.06-bit gap after Eq. (9)
Read-back

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

For every pair of nonnegative real numbers NE,NN_E,NNE​,N, the theorem asserts the real inequality

g ⁣(N+NE2)−log⁡(1+eg(NE))+log⁡2log⁡2−g ⁣(N+NE2)−g ⁣(NE2)log⁡2≤6100,g(x)=(x+1)log⁡(x+1)−xlog⁡x.\frac{ g\!\left(\frac{N+N_E}{2}\right)-\log(1+e^{g(N_E)})+\log2 }{\log2} - \frac{ g\!\left(\frac{N+N_E}{2}\right)-g\!\left(\frac{N_E}{2}\right) }{\log2} \le\frac6{100}, \qquad g(x)=(x+1)\log(x+1)-x\log x.log2g(2N+NE​​)−log(1+eg(NE​))+log2​−log2g(2N+NE​​)−g(2NE​​)​≤1006​,g(x)=(x+1)log(x+1)−xlogx.

All logarithms here are natural logarithms, including the total convention log⁡0=0\log0=0log0=0. The assumptions include NE=0N_E=0NE​=0 and N=0N=0N=0; the displayed terms are real numbers without nonnegative truncation.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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