Fixed-repeater high-loss asymptotic
ProvedQAlgorithms.Papers.Independent.Advance50.P44.high_lossFix a nonnegative integer . Write for the equal-spacing rate expression in Eq. (113), in bits per chain use. Then
The number of repeaters is fixed throughout this limit. Multiplication by converts bits to nats, giving leading term nats per use. The printed coefficient is a decimal approximation to .
Formalization Note The one-sided filter excludes zero and is eventually contained in . This states the analytic asymptotic of Eq. (113); the operational identification of that expression is separately deferred.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P44
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , including , the following limit holds as the real number approaches through strictly positive values:
Here is the natural logarithm and is the base- logarithm. The approach excludes and requires no additional hypothesis on ; sufficiently close to within this domain, . For , the power is simply .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.