Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2), p. 985 — for 0 < λ < ∞, N(t)/t → λ iff tₙ/n → λ⁻¹

Proved
HeymanStidham.HLG.eq2_rate_iff

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

arrival-ratelittle-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, N(t)N(t)N(t) the number of nnn with tn≤tt_n \le ttn​≤t, and 0<λ<∞0 < \lambda < \infty0<λ<∞. Then

lim⁡t→∞N(t)t=λ  ⟺  lim⁡n→∞tnn=λ−1.\lim_{t\to\infty} \frac{N(t)}{t} = \lambda \iff \lim_{n\to\infty} \frac{t_n}{n} = \lambda^{-1}.t→∞lim​tN(t)​=λ⟺n→∞lim​ntn​​=λ−1.

This is Lemma 3 of Stidham (1972), quoted as display (2) in the proof of Theorem 1. It converts the arrival rate, a time-indexed limit, into a statement about the arrival epochs, a customer-indexed limit; in particular it shows tn<∞t_n < \inftytn​<∞ for every nnn and tn→∞t_n \to \inftytn​→∞.

Formalization Note Customers are 0-based in Lean, so tn/nt_n/ntn​/n reads tn/(n+1)t_n/(n+1)tn​/(n+1). N(t)N(t)N(t) is the cardinality of {n:tn≤t}\{n : t_n \le t\}{n:tn​≤t}.

Preamble
import Mathlib
import Definitions.Def_HeymanStidham_HLG_Setting

open Filter Topology MeasureTheory
Formal statement
namespace HeymanStidham.HLG

/-- (2), p. 985 (Lemma 3 of Stidham 1972): for nondecreasing arrival epochs and
`0 < λ < ∞`, `N(t)/t → λ` if and only if `tₙ/n → λ⁻¹`. -/
theorem eq2_rate_iff (t : ℕ → ℝ) (ht : Monotone t) (ht0 : 0 ≤ t 0)
    (lam : ℝ) (hlam : 0 < lam) :
    IsArrivalRate t lam ↔ Tendsto (fun n : ℕ => t n / ((n : ℝ) + 1)) atTop (𝓝 lam⁻¹) := by sorry

end HeymanStidham.HLG
Source
Heyman and Stidham, The relation between customer and time averages in queues, Oper. Res. 28 (1980), p. 985, proof of Theorem 1, display (2) (Lemma 3 of Stidham 1972)
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