Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fixed-repeater high-loss asymptotic

Proved
QAlgorithms.Papers.Independent.Advance50.P44.high_loss

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

prove2quantum

Fix a nonnegative integer NNN. Write F(η,N)=−log⁡2(1−η1/(N+1))F(\eta,N)=-\log_2(1-\eta^{1/(N+1)})F(η,N)=−log2​(1−η1/(N+1)) for the equal-spacing rate expression in Eq. (113), in bits per chain use. Then

lim⁡η↓0F(η,N)η1/(N+1)/ln⁡2=1.\lim_{\eta\downarrow0}\frac{F(\eta,N)}{\eta^{1/(N+1)}/\ln2}=1.η↓0lim​η1/(N+1)/ln2F(η,N)​=1.

The number of repeaters is fixed throughout this limit. Multiplication by ln⁡2\ln2ln2 converts bits to nats, giving leading term η1/(N+1)\eta^{1/(N+1)}η1/(N+1) nats per use. The printed coefficient 1.441.441.44 is a decimal approximation to 1/ln⁡21/\ln21/ln2.

Formalization Note The one-sided filter excludes zero and is eventually contained in (0,1)(0,1)(0,1). This states the analytic asymptotic of Eq. (113); the operational identification of that expression is separately deferred.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P44
Formal statement
namespace QAlgorithms.Papers.Independent.Advance50.P44

noncomputable section

open Filter

/-- PDF p.19, Eq.(115): at fixed N, the high-loss expression is asymptotic
to eta^(1/(N+1))/ln 2 bits per use. The printed 1.44 is rounded.
The right-hand limit stays eventually in the physical interval (0,1);
eta=0 is excluded by the filter, so division by a zero leading term is unused. -/
theorem high_loss (N : ℕ) :
    Tendsto (fun eta : ℝ => equalSpacingLossExpression eta N /
      (eta ^ (1 / ((N : ℝ) + 1)) / Real.log 2))
      (nhdsWithin 0 (Set.Ioi 0)) (nhds 1) := by sorry

end

end QAlgorithms.Papers.Independent.Advance50.P44
Source
End-to-end capacities of a quantum communication network, arXiv:1905.12674v1, PDF p. 19, Unnumbered loss-dominant asymptotic, Eq. (115)
Read-back

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

For every natural number NNN, including N=0N=0N=0, the following limit holds as the real number η\etaη approaches 000 through strictly positive values:

lim⁡η→0+−log⁡2 ⁣(1−η1/(N+1))η1/(N+1)/ln⁡2=1.\lim_{\eta\to0^+} \frac{-\log_2\!\left(1-\eta^{1/(N+1)}\right)} {\eta^{1/(N+1)}/\ln2}=1.η→0+lim​η1/(N+1)/ln2−log2​(1−η1/(N+1))​=1.

Here ln⁡\lnln is the natural logarithm and log⁡2\log_2log2​ is the base-222 logarithm. The approach excludes η=0\eta=0η=0 and requires no additional hypothesis on η\etaη; sufficiently close to 000 within this domain, 0<η<10<\eta<10<η<1. For N=0N=0N=0, the power η1/(N+1)\eta^{1/(N+1)}η1/(N+1) is simply η\etaη.

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

    Confirmed by the moderator at approval.

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