Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (5.29) and (5.33) — the Pollaczek–Khintchine transform of the system wait

Proved
QueueingFundamentals.MG1.wait_lst

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

laplace-stieltjes-transformm-g-1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1pollaczek-khintchinequeueing

Let λ>0\lambda > 0λ>0, let BBB be a service-time distribution on [0,∞)[0,\infty)[0,∞) with finite mean, ρ=λ E[S]<1\rho = \lambda\,\mathrm E[S] < 1ρ=λE[S]<1, and let π\piπ be the stationary distribution of the M/G/1 departure-point chain. Let WWW be a probability distribution on [0,∞)[0,\infty)[0,∞) (the FCFS system-wait distribution) such that

πn=1n!∫0∞(λt)ne−λt dW(t)(n≥0).\pi_n = \frac{1}{n!}\int_0^\infty (\lambda t)^n e^{-\lambda t}\,dW(t) \qquad (n \ge 0).πn​=n!1​∫0∞​(λt)ne−λtdW(t)(n≥0).

Then:

  1. Π(z)=W∗[λ(1−z)]\Pi(z) = W^*[\lambda(1-z)]Π(z)=W∗[λ(1−z)] for every complex ∣z∣≤1|z| \le 1∣z∣≤1;
  2. for every real s>0s > 0s>0,
W∗(s)=(1−ρ) s B∗(s)s−λ[1−B∗(s)].W^*(s) = \frac{(1-\rho)\,s\,B^*(s)}{s - \lambda[1 - B^*(s)]} .W∗(s)=s−λ[1−B∗(s)](1−ρ)sB∗(s)​.

The second formula expresses the transform of the waiting-time distribution through the service-time transform alone.

Formalization Note The relation between π\piπ and WWW is the book's description of FCFS (p.235: the system size at a departure equals the number of arrivals during that customer's system wait); it is taken as a hypothesis, as the book takes it. The book gives no domain for sss; the statement uses real s>0s > 0s>0.

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_MG1_embeddedChain
import Definitions.Def_QueueingFundamentals_MG1_transforms
Formal statement
namespace QueueingFundamentals.MG1

open MeasureTheory

/-- Eqs. (5.29) and (5.33), pp.235–237. Let `ρ = λ E[S] < 1`, let `π` be the stationary
departure-point distribution, and let `W` be a probability distribution on `[0, ∞)` (the FCFS
system-wait distribution) with `π_n = (1/n!) ∫_0^∞ (λt)^n e^{-λt} dW(t)` for all `n` (p.235).
Then `Π(z) = W*[λ(1 - z)]` for `|z| ≤ 1` (5.29), and for every real `s > 0`,
`W*(s) = (1 - ρ) s B*(s) / (s - λ[1 - B*(s)])` (5.33). -/
theorem wait_lst (lam : ℝ) (hlam : 0 < lam) (B : Measure ℝ) [IsProbabilityMeasure B]
    (hB : B (Set.Iio 0) = 0)
    (hint : Integrable (fun t : ℝ => t) B) (hρ : utilization lam B < 1)
    (π : ℕ → ℝ) (hπ : IsStationaryDist (transitionMatrix lam B) π)
    (W : Measure ℝ) [IsProbabilityMeasure W] (hW : W (Set.Iio 0) = 0)
    (hπW : ∀ n : ℕ, π n = ∫ t, (lam * t) ^ n * Real.exp (-(lam * t)) / (Nat.factorial n : ℝ) ∂W) :
    (∀ z : ℂ, ‖z‖ ≤ 1 → pgf π z = lst W ((lam : ℂ) * (1 - z))) ∧
    ∀ s : ℝ, 0 < s →
      lst W s = (1 - (utilization lam B : ℂ)) * s * lst B s / (s - lam * (1 - lst B s)) := by sorry

end QueueingFundamentals.MG1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, pp.235–237, Eqs. (5.29) and (5.33)
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