(2), p. 985 — for 0 < λ < ∞, N(t)/t → λ iff tₙ/n → λ⁻¹
ProvedHeymanStidham.HLG.eq2_rate_iffarrival-ratelittle-lawp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingsample-path
Let be arrival epochs, the number of with , and . Then
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 for every and .
Formalization Note Customers are 0-based in Lean, so reads . is the cardinality of .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.