Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (6.8) — Lindley's equation for the stationary G/G/1 delay

Proved
QueueingFundamentals.GG1.lindley_equation

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

g-g-1lindley-equationp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueingstationary-distribution

Consider the G/G/1 queue with interarrival distribution AAA and service distribution BBB, both lifetime laws with finite means, E[T]>0\mathrm E[T]>0E[T]>0, and traffic intensity ρ=E[S]/E[T]<1\rho=\mathrm E[S]/\mathrm E[T]<1ρ=E[S]/E[T]<1. Let UUU be the law of S−TS-TS−T for independent S∼BS\sim BS∼B, T∼AT\sim AT∼A, as in (6.9). Then:

  1. there is a stationary delay distribution, that is, a probability law ν\nuν such that if Wq(n)∼νW_q^{(n)}\sim\nuWq(n)​∼ν is independent of S(n)S^{(n)}S(n) and T(n)T^{(n)}T(n), then Wq(n+1)=max⁡(0,Wq(n)+S(n)−T(n))∼νW_q^{(n+1)}=\max(0,W_q^{(n)}+S^{(n)}-T^{(n)})\sim\nuWq(n+1)​=max(0,Wq(n)​+S(n)−T(n))∼ν;
  2. the CDF Wq(t)W_q(t)Wq​(t) of every stationary delay distribution satisfies Lindley's equation
Wq(t)={∫−∞tWq(t−x) dU(x)(0≤t<∞),0(t<0)  =  −∫0∞Wq(y) dU(t−y)(0≤t<∞).W_q(t)=\begin{cases}\displaystyle\int_{-\infty}^{t}W_q(t-x)\,dU(x) & (0\le t<\infty),\\[4pt] 0 & (t<0)\end{cases} \;=\;-\int_{0}^{\infty}W_q(y)\,dU(t-y)\quad(0\le t<\infty).Wq​(t)=⎩⎨⎧​∫−∞t​Wq​(t−x)dU(x)0​(0≤t<∞),(t<0)​=−∫0∞​Wq​(y)dU(t−y)(0≤t<∞).

Lindley's equation is the integral equation of Wiener–Hopf type from which all the book's G/G/1 results follow; part 1 guarantees that it has a probability solution coming from the queue when ρ<1\rho<1ρ<1.

Formalization Note The book's sentence "In the steady state (ρ<1\rho<1ρ<1) … we find Lindley's equation" is stated as its two halves: existence of a stationary law of the recursion (part 1), and the equation for every such law (part 2). The stationary law is a fixed point of the law map of the recursion, not an arbitrary CDF satisfying the equation. The Stieltjes integral −∫0∞Wq(y) dU(t−y)-\int_0^\infty W_q(y)\,dU(t-y)−∫0∞​Wq​(y)dU(t−y) is written as the integral of WqW_qWq​ over [0,∞)[0,\infty)[0,∞) against the law of t−Ut-Ut−U (the minus sign accounts for y↦U(t−y)y\mapsto U(t-y)y↦U(t−y) being decreasing). Integrals over (−∞,t](-\infty,t](−∞,t] and [0,∞)[0,\infty)[0,∞) include their endpoints.

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_GG1_Lindley
Formal statement
namespace QueueingFundamentals.GG1

open MeasureTheory

/-- Lindley's equation (6.8) (p.285) for the G/G/1 queue. Let the interarrival times have law `A`
and the service times law `B` (lifetime laws with finite means), and let `ρ = E[S]/E[T] < 1`.
Then (i) a stationary delay distribution exists: a probability law `ν` that Lindley's recursion
`W_q^{(n+1)} = max(0, W_q^{(n)} + S^{(n)} − T^{(n)})` maps to itself; and (ii) the CDF
`W_q = cdfOf ν` of every stationary delay distribution satisfies
`W_q(t) = ∫_{−∞}^{t} W_q(t − x) dU(x) = −∫_0^∞ W_q(y) dU(t − y)` for `0 ≤ t < ∞` and
`W_q(t) = 0` for `t < 0`, where `U` is the law of `S − T` (6.9). The Stieltjes integral
`−∫_0^∞ W_q(y) dU(t − y)` is the integral of `W_q` over `[0, ∞)` against the law of `t − U`. -/
theorem lindley_equation (A B : Measure ℝ) (hA : IsLifetimeLaw A) (hB : IsLifetimeLaw B)
    (hAint : Integrable (fun x : ℝ => x) A) (hBint : Integrable (fun x : ℝ => x) B)
    (hmeanA : 0 < meanOf A) (hρ : trafficIntensity A B < 1) :
    (∃ ν : Measure ℝ, IsStationaryDelay A B ν) ∧
    ∀ ν : Measure ℝ, IsStationaryDelay A B ν →
      ∀ t : ℝ,
        (0 ≤ t →
          cdfOf ν t = ∫ x in Set.Iic t, cdfOf ν (t - x) ∂(diffLaw A B) ∧
          cdfOf ν t = ∫ y in Set.Ici 0, cdfOf ν y ∂((diffLaw A B).map (fun x => t - x))) ∧
        (t < 0 → cdfOf ν t = 0) := by sorry

end QueueingFundamentals.GG1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.285, Eq. (6.8), for the recursion of p.284 and U of Eq. (6.9)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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