Proposition 1 — asymptotic latency ratio as
ProvedSpecActions.prop1_limitAs the horizon grows, the latency ratio of Algorithm 1 converges:
for all and . The oscillating term is bounded but does not vanish termwise in an obvious way, so it must be controlled uniformly before the prefactor is taken to zero.
import Definitions.Def_SpecActions_model
import Definitions.Def_SpecActions_model
import Mathlib.Order.Filter.AtTopBot.Basic
namespace SpecActions
open Filter Topology
theorem prop1_limit (α β pk : ℝ) (hα : 0 < α) (hβ : 0 < β)
(hpk0 : 0 ≤ pk) (hpk1 : pk ≤ 1) :
Tendsto (fun T : ℕ => specTime T α β pk / seqTime T β) atTop
(𝓝 (1 - pk / (1 + pk) * (α / (α + β)))) := by sorry
end SpecActions
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back of prop1_limit.
Fix three real numbers , and (the third is called pk in the code; it is an arbitrary real parameter, not tied to any of the bundle's other definitions such as ). The hypotheses are exactly four: , , , and . Nothing else is assumed — in particular there is no assumed relation between and (neither nor ), is allowed to equal or , and all four hypotheses are simultaneously satisfiable (e.g. , ), so the statement is not vacuous.
Two quantities are built from the imported bundle. First, the real-valued sequence (), defined by the two-step recursion
This recursive definition is what the statement uses; the separate closed-form expression that also appears in the bundle is a different definition and is not referenced here, so no identity between the two is asserted or used.
Second, for each natural number , two real numbers
where is the natural number viewed as a real number, and the index is truncated natural-number subtraction: for it is (not ), and for it is the ordinary . These are simply the two displayed formulas; the statement asserts nothing about their interpretation as runtimes, expectations, or anything probabilistic.
The assertion is a single convergence claim: the sequence of real numbers indexed by the natural numbers
tends, as through the natural numbers, to the real number
convergence being with respect to the usual topology on (the neighbourhood filter of that point) and the limit being taken along the "eventually large " filter on . The grouping of the limit value is as displayed: the quotient is multiplied by , and that product is subtracted from . Under the hypotheses every denominator occurring in the limit value is nonzero ( and ), and inside the sequence.
Degenerate and edge cases the quantifiers silently include:
- . The term of the sequence at is , which is by the total-function convention for real division; likewise . Since the limit is along the at-top filter, this term (and any finite number of initial terms) is irrelevant to the truth of the claim.
- . Then for every , the sequence is identically for , and the asserted limit is .
- . Permitted; the recursion becomes and the asserted limit is .
- For the displayed ratio is algebraically equal to , so the claim concerns the limiting behaviour of ; the statement itself, however, is phrased as the limit of the ratio of the two defined quantities.
What is not claimed: no rate of convergence, no monotonicity, no error bound, no statement for a fixed finite , and nothing about the other definitions in the bundle (, the closed form for , the token-cost proxies, the depth-focused quantities, or the confidence-aware objective), none of which appear in this declaration. The declaration is stated with its proof left as an admitted gap.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).