Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Repeater-dominant additive asymptotic

Proved
QAlgorithms.Papers.Independent.Advance50.P44.large_repeaters

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

prove2quantum

Fix a total transmissivity 0<η<10<\eta<10<η<1. For each nonnegative integer NNN, let

F(η,N)=−log⁡2 ⁣(1−η1/(N+1)),F(\eta,N)=-\log_2\!\left(1-\eta^{1/(N+1)}\right),F(η,N)=−log2​(1−η1/(N+1)),

the explicit equal-spacing rate expression in Eq. (113), measured in bits per chain use. As the number of repeaters tends to infinity,

lim⁡N→∞[F(η,N)−(log⁡2N−log⁡2ln⁡(1/η))]=0.\lim_{N\to\infty}\left[F(\eta,N)-\left(\log_2 N-\log_2\ln(1/\eta)\right)\right]=0.N→∞lim​[F(η,N)−(log2​N−log2​ln(1/η))]=0.

Thus the logarithmic coefficient is independent of the fixed loss; the additive offset depends on that loss.

Formalization Note This node is the analytic expansion of the explicit expression. The separate operational capacity identification and placement optimization are deferred; neither is a hypothesis of this limit theorem.

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.(114): for fixed total transmissivity in (0,1), the
equal-spacing expression has the stated additive logarithmic expansion.
The offset depends on eta. The totalized log at N=0 affects only a finite
prefix of the sequence and imposes no restriction on the number of repeaters. -/
theorem large_repeaters (eta : ℝ) (heta0 : 0 < eta) (heta1 : eta < 1) :
    Tendsto (fun N : ℕ => equalSpacingLossExpression eta N -
      (Real.logb 2 (N : ℝ) - Real.logb 2 (Real.log (1 / eta))))
      atTop (nhds 0) := 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 repeater-dominant asymptotic, Eq. (114)
Read-back

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

For every real number η\etaη satisfying 0<η<10<\eta<10<η<1, the following limit holds as the natural number NNN tends to infinity:

lim⁡N→∞[−log⁡2 ⁣(1−η1/(N+1))−(log⁡2N−log⁡2 ⁣(ln⁡(1/η)))]=0.\lim_{N\to\infty} \left[ -\log_2\!\left(1-\eta^{1/(N+1)}\right) -\left(\log_2 N-\log_2\!\left(\ln(1/\eta)\right)\right) \right]=0.N→∞lim​[−log2​(1−η1/(N+1))−(log2​N−log2​(ln(1/η)))]=0.

Here ln⁡\lnln is the natural logarithm and log⁡2\log_2log2​ is the base-222 logarithm. The sequence is defined for every natural number NNN, including 000, where the total logarithm convention gives log⁡20=0\log_2 0=0log2​0=0.

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