Repeater-dominant additive asymptotic
ProvedQAlgorithms.Papers.Independent.Advance50.P44.large_repeatersFix a total transmissivity . For each nonnegative integer , let
the explicit equal-spacing rate expression in Eq. (113), measured in bits per chain use. As the number of repeaters tends to infinity,
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.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P44
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real number satisfying , the following limit holds as the natural number tends to infinity:
Here is the natural logarithm and is the base- logarithm. The sequence is defined for every natural number , including , where the total logarithm convention gives .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.