Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 986 — lim U(t)/t = lim V(t)/t (= λG)

Proved
HeymanStidham.HLG.U_V_same_limit

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<λ<∞. Let an≥0a_n \ge 0an​≥0 have finite customer average G=lim⁡N→∞1N∑n=1NanG = \lim_{N\to\infty}\frac1N\sum_{n=1}^N a_nG=limN→∞​N1​∑n=1N​an​, and let sn≥0s_n \ge 0sn​≥0 with sn/tn→0s_n/t_n \to 0sn​/tn​→0. With U(t)=∑n: tn≤tanU(t) = \sum_{n:\, t_n \le t} a_nU(t)=∑n:tn​≤t​an​ and V(t)=∑n: tn+sn≤tanV(t) = \sum_{n:\, t_n + s_n \le t} a_nV(t)=∑n:tn​+sn​≤t​an​,

lim⁡t→∞V(t)t=lim⁡t→∞U(t)t=λG.\lim_{t\to\infty} \frac{V(t)}{t} = \lim_{t\to\infty} \frac{U(t)}{t} = \lambda G .t→∞lim​tV(t)​=t→∞lim​tU(t)​=λG.

This is the step that completes the proof of Theorem 1: combined with (3) and (4), it squeezes 1T∫0Th\frac1T\int_0^T hT1​∫0T​h to λG\lambda GλG. The page states it as lim⁡U(t)/t=lim⁡V(t)/t\lim U(t)/t = \lim V(t)/tlimU(t)/t=limV(t)/t; the value λG\lambda GλG of the common limit is (4).

Formalization Note The statement is given for an arbitrary nonnegative sequence (an)(a_n)(an​) (the paper's gn≥0g_n \ge 0gn​≥0, by (iii)) and assumes sn/tn→0s_n/t_n \to 0sn​/tn​→0 directly, as the page does ("using lim⁡sn/tn=0\lim s_n/t_n = 0limsn​/tn​=0"). VVV is an infinite sum in Lean; it equals the page's finite sum because λ>0\lambda > 0λ>0 makes {n:tn≤t}\{n : t_n \le t\}{n:tn​≤t} finite.

Preamble
import Mathlib
import Definitions.Def_HeymanStidham_HLG_Setting

open Filter Topology MeasureTheory
Formal statement
namespace HeymanStidham.HLG

/-- p. 986: with `aₙ ≥ 0`, `sₙ ≥ 0`, `sₙ/tₙ → 0`, `0 < λ < ∞` and customer average `G`,
`V(t)/t` has the same limit `λG` as `U(t)/t`, where `V(t) = Σ_{tₙ + sₙ ≤ t} aₙ`. -/
theorem U_V_same_limit (t : ℕ → ℝ) (ht : Monotone t) (ht0 : 0 ≤ t 0)
    (a : ℕ → ℝ) (ha : ∀ n, 0 ≤ a n)
    (s : ℕ → ℝ) (hs : ∀ n, 0 ≤ s n) (hst : Tendsto (fun n : ℕ => s n / t n) atTop (𝓝 0))
    (lam : ℝ) (hlam : 0 < lam) (hrate : IsArrivalRate t lam)
    (G : ℝ) (hG : IsCustomerAverage a G) :
    Tendsto (fun T : ℝ => finishedTotal t s 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. 986, proof of Theorem 1, first paragraph (by mimicking Theorem 2 of Stidham 1974)
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