Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corrected positive low-photon slope of the scalar Dolinar/BPSK capacity

Open
QAlgorithms.Papers.Independent.Intakenext100.P76.dolinarCapacitySlope

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

prove2quantum

For x>0x>0x>0, let e(x)=(1−1−e−4x)/2e(x)=(1-\sqrt{1-e^{-4x}})/2e(x)=(1−1−e−4x​)/2 be the binary symmetric crossover probability in (6.17), and define C1(x)=(ln⁡2)[1−h2(e(x))]C_1(x)=(\ln2)[1-h_2(e(x))]C1​(x)=(ln2)[1−h2​(e(x))] in nats per mode. Then

C1(x)=2x+o(x),lim⁡x↓0C1(x)x=2.C_1(x)=2x+o(x),\qquad \lim_{x\downarrow0}\frac{C_1(x)}x=2.C1​(x)=2x+o(x),x↓0lim​xC1​(x)​=2.

The sign printed in (6.18) is corrected from minus to plus: the exact capacity expression and the following two-nats-per-photon sentence fix the intended positive slope. This is a scalar asymptotic identity, without an additional receiver-optimality theorem.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P76
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P76

open MeasureTheory Filter

open QAlgorithms.Papers.Independent.Information100.P63 (logTwo normalCDF normalQuantile)

open QAlgorithms.Papers.Independent.Information100.P54 (thermalEntropy)

open QAlgorithms.Papers.Independent.Dependency50.P39 (coherentCoefficient)

open QAlgorithms.Papers.Independent.Next46.P32 (PositiveKernel)

open scoped BigOperators ENNReal Topology

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF p.13, corrected (6.18). Printed: -2 NS + o(NS). Changed: +2 NS + o(NS).
Reason: the exact nonnegative capacity preceding (6.18), and the following
"two nats per photon" sentence, both fix the positive sign. This scalar result
makes no assertion about physical optimality of a receiver. Independent
moderation of the source correction remains required. -/
theorem dolinarCapacitySlope :
    Asymptotics.IsLittleO (𝓝[>] (0 : ℝ))
      (fun x : ℝ => dolinarNats x - 2 * x) (fun x : ℝ => x) ∧
    Tendsto (fun x : ℝ => dolinarNats x / x) (𝓝[>] 0) (𝓝 2) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P76

end
Source
Second-order coding rates for pure-loss bosonic channels, arXiv:1408.5328v3, PDF p. 13, §6.2, corrected (6.18)
Read-back

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

Define

D(x)=ln⁡2(1−H2 ⁣(1−1−e−4x2)),H2(t)=−tln⁡t−(1−t)ln⁡(1−t)ln⁡2,D(x)=\ln2\left(1-H_2\!\left( \frac{1-\sqrt{1-e^{-4x}}}{2}\right)\right), \qquad H_2(t)=\frac{-t\ln t-(1-t)\ln(1-t)}{\ln2},D(x)=ln2(1−H2​(21−1−e−4x​​)),H2​(t)=ln2−tlnt−(1−t)ln(1−t)​,

with the total real logarithm satisfying ln⁡0=0\ln0=0ln0=0 and the real square root equal to 000 on negative arguments. As xxx approaches 000 through strictly positive real values, D(x)−2x=o(x)D(x)-2x=o(x)D(x)−2x=o(x): explicitly, for every real c>0c>0c>0, eventually ∣D(x)−2x∣≤c∣x∣|D(x)-2x|\le c|x|∣D(x)−2x∣≤c∣x∣. Also,

lim⁡x→0+D(x)x=2.\lim_{x\to0^+}\frac{D(x)}x=2.x→0+lim​xD(x)​=2.
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