Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4), p. 985 — λG = lim U(t)/t

Proved
HeymanStidham.HLG.eq4_lambda_G

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=λ, where 0<λ<∞0 < \lambda < \infty0<λ<∞ and N(t)N(t)N(t) is the number of nnn with tn≤tt_n \le ttn​≤t. Let (an)(a_n)(an​) be a real sequence whose customer average G=lim⁡N→∞1N∑n=1NanG = \lim_{N\to\infty} \frac1N \sum_{n=1}^N a_nG=limN→∞​N1​∑n=1N​an​ exists and is finite, and let U(t)=∑n: tn≤tanU(t) = \sum_{n:\, t_n \le t} a_nU(t)=∑n:tn​≤t​an​. Then

λG=lim⁡t→∞N(t)t⋅1N(t)∑n=1N(t)an=lim⁡t→∞U(t)t.\lambda G = \lim_{t\to\infty} \frac{N(t)}{t}\cdot\frac{1}{N(t)}\sum_{n=1}^{N(t)} a_n = \lim_{t\to\infty} \frac{U(t)}{t}.λG=t→∞lim​tN(t)​⋅N(t)1​n=1∑N(t)​an​=t→∞lim​tU(t)​.

This is display (4) in the proof of Theorem 1, applied there with an=gna_n = g_nan​=gn​. It turns the customer average into the long-run rate of the arrived totals.

Formalization Note The statement is given for an arbitrary sequence (an)(a_n)(an​), of which the paper's gng_ngn​ is an instance; the claim does not use any property of gng_ngn​.

Preamble
import Mathlib
import Definitions.Def_HeymanStidham_HLG_Setting

open Filter Topology MeasureTheory
Formal statement
namespace HeymanStidham.HLG

/-- (4), p. 985: if `λ = lim N(t)/t` exists with `0 < λ < ∞` and the customer average
`G` of `(aₙ)` exists, then `U(t)/t → λG`, where `U(t) = Σ_{tₙ ≤ t} aₙ`. -/
theorem eq4_lambda_G (t : ℕ → ℝ) (ht : Monotone t) (ht0 : 0 ≤ t 0)
    (a : ℕ → ℝ) (lam : ℝ) (hlam : 0 < lam) (hrate : IsArrivalRate t lam)
    (G : ℝ) (hG : IsCustomerAverage a G) :
    Tendsto (fun T : ℝ => arrivedTotal t a T / T) atTop (𝓝 (lam * G)) := 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 (4)
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