Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 1, p. 985 — for fₙ ≥ 0 under (i)–(iv), H = λG

Proved
HeymanStidham.HLG.theorem_1

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

h-equals-lambda-glittle-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 the arrival epochs of customers 1,2,…1, 2, \ldots1,2,… and N(t)N(t)N(t) the number of nnn with tn≤tt_n \le ttn​≤t. Customer nnn carries a function fnf_nfn​ on [0,∞)[0,\infty)[0,∞); let gn=∫0∞fn(t) dtg_n = \int_0^\infty f_n(t)\,dtgn​=∫0∞​fn​(t)dt and h(t)=∑n=1∞fn(t)h(t) = \sum_{n=1}^\infty f_n(t)h(t)=∑n=1∞​fn​(t). Assume that for each nnn there is sn∈[0,∞)s_n \in [0,\infty)sn​∈[0,∞) such that

  1. (i) fn(t)=0f_n(t) = 0fn​(t)=0 for t∉[tn,tn+sn]t \notin [t_n, t_n + s_n]t∈/[tn​,tn​+sn​];
  2. (ii) sn/n→0s_n/n \to 0sn​/n→0;
  3. (iii) fn(t)≥0f_n(t) \ge 0fn​(t)≥0;
  4. (iv) ∫0∞fn(t) dt<∞\int_0^\infty f_n(t)\,dt < \infty∫0∞​fn​(t)dt<∞.

If λ=lim⁡t→∞N(t)/t\lambda = \lim_{t\to\infty} N(t)/tλ=limt→∞​N(t)/t and G=lim⁡N→∞1N∑n=1NgnG = \lim_{N\to\infty} \frac1N\sum_{n=1}^N g_nG=limN→∞​N1​∑n=1N​gn​ exist with 0<λ<∞0 < \lambda < \infty0<λ<∞ and G<∞G < \inftyG<∞, then H=lim⁡T→∞1T∫0Th(t) dtH = \lim_{T\to\infty} \frac1T\int_0^T h(t)\,dtH=limT→∞​T1​∫0T​h(t)dt exists and

H=λG.(1)H = \lambda G. \tag{1}H=λG.(1)

This is the nonnegative case of the relation H=λGH = \lambda GH=λG between time and customer averages. With fnf_nfn​ the indicator of customer nnn's sojourn it is Little's law L=λWL = \lambda WL=λW, and the proof of Theorem 2 applies it to fn+f_n^+fn+​ and fn−f_n^-fn−​.

Formalization Note Customers are 0-based in Lean, so (ii) reads sn/(n+1)→0s_n/(n+1) \to 0sn​/(n+1)→0. Ties between arrival epochs are allowed. The page prints (iv) as "∫0∞fn dt≤∞\int_0^\infty f_n\,dt \le \infty∫0∞​fn​dt≤∞", a misprint for "<∞< \infty<∞"; Lean states (iv) as integrability of fnf_nfn​ on [0,∞)[0,\infty)[0,∞), which also carries the measurability the page presupposes ("assume that these functions are well defined"). The conclusion "HHH exists" includes that hhh is integrable on every [0,T][0,T][0,T]. N(t)N(t)N(t) is the cardinality of {n:tn≤t}\{n : t_n \le t\}{n:tn​≤t}, which is finite because λ>0\lambda > 0λ>0.

Preamble
import Mathlib
import Definitions.Def_HeymanStidham_HLG_Setting

open Filter Topology MeasureTheory
Formal statement
namespace HeymanStidham.HLG

/-- THEOREM 1, p. 985: under (i), (ii), (iii) `fₙ ≥ 0` and (iv) `∫₀^∞ fₙ < ∞`, if
`λ` and `G` exist with `0 < λ < ∞` and `G < ∞`, then `H` exists and `H = λG` (1). -/
theorem theorem_1 (t : ℕ → ℝ) (ht : Monotone t) (ht0 : 0 ≤ t 0)
    (f : ℕ → ℝ → ℝ) (s : ℕ → ℝ) (hI : CondI t f s) (hII : CondII s)
    (lam : ℝ) (hlam : 0 < lam) (hrate : IsArrivalRate t lam)
    (hiii : ∀ n τ, 0 ≤ τ → 0 ≤ f n τ)
    (hiv : ∀ n, IntegrableOn (f n) (Set.Ici 0))
    (G : ℝ) (hG : IsCustomerAverage (custTotal f) G) :
    IsTimeAverage (rate f) (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, THEOREM 1 and display (1)
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