Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 986 — lim sₙ/tₙ = 0, from (ii), (2) and λ < ∞

Proved
HeymanStidham.HLG.s_div_t_tendsto_zero

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

little-lawp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingsample-path

Let 0≤t1≤t2≤⋯0 \le t_1 \le t_2 \le \cdots0≤t1​≤t2​≤⋯ be arrival epochs with lim⁡t→∞N(t)/t=λ\lim_{t\to\infty} N(t)/t = \lambdalimt→∞​N(t)/t=λ, 0<λ<∞0 < \lambda < \infty0<λ<∞, and let (sn)(s_n)(sn​) satisfy assumption (ii), sn/n→0s_n/n \to 0sn​/n→0. Then

lim⁡n→∞sntn=0.\lim_{n\to\infty} \frac{s_n}{t_n} = 0.n→∞lim​tn​sn​​=0.

The proof of Theorem 1 states that this follows from (ii), (2) and λ<∞\lambda < \inftyλ<∞, and uses it to show that U(t)/tU(t)/tU(t)/t and V(t)/tV(t)/tV(t)/t have the same limit.

Formalization Note Customers are 0-based in Lean, so (ii) reads sn/(n+1)→0s_n/(n+1) \to 0sn​/(n+1)→0. Since tn→∞t_n \to \inftytn​→∞ by (2), tn>0t_n > 0tn​>0 for all large nnn, and the finitely many quotients with tn=0t_n = 0tn​=0 do not affect the limit.

Preamble
import Mathlib
import Definitions.Def_HeymanStidham_HLG_Setting

open Filter Topology MeasureTheory
Formal statement
namespace HeymanStidham.HLG

/-- p. 986: (ii) together with (2) and `0 < λ < ∞` gives `sₙ/tₙ → 0`. -/
theorem s_div_t_tendsto_zero (t : ℕ → ℝ) (ht : Monotone t) (ht0 : 0 ≤ t 0)
    (s : ℕ → ℝ) (hII : CondII s)
    (lam : ℝ) (hlam : 0 < lam) (hrate : IsArrivalRate t lam) :
    Tendsto (fun n : ℕ => s n / t n) atTop (𝓝 0) := by sorry

end HeymanStidham.HLG
Source
Heyman and Stidham, The relation between customer and time averages in queues, Oper. Res. 28 (1980), p. 986, proof of Theorem 1, first paragraph
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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