Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.34) — the Pollaczek–Khintchine transform of the line wait

Proved
QueueingFundamentals.MG1.queue_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

Under the hypotheses of (5.33), let also WqW_qWq​ be a probability distribution on [0,∞)[0,\infty)[0,∞) (the FCFS line-wait distribution) with W=Wq∗BW = W_q * BW=Wq​∗B, the convolution expressing T=Tq+ST = T_q + ST=Tq​+S with TqT_qTq​ and SSS independent. Then for every real s>0s > 0s>0,

Wq∗(s)=(1−ρ) ss−λ[1−B∗(s)].W_q^*(s) = \frac{(1-\rho)\,s}{s - \lambda[1 - B^*(s)]} .Wq∗​(s)=s−λ[1−B∗(s)](1−ρ)s​.

Expanding this as a geometric series gives the book's representation (5.35) of WqW_qWq​ through the residual-service distribution.

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

open MeasureTheory

/-- Eq. (5.34), p.237. Under the hypotheses of (5.33), let `W_q` be a probability distribution on
`[0, ∞)` (the FCFS line-wait distribution) with `W = W_q * B`, the convolution expressing
`T = T_q + S` with `T_q` and `S` independent. Then for every real `s > 0`,
`W_q*(s) = (1 - ρ) s / (s - λ[1 - B*(s)])`. -/
theorem queue_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)
    (Wq : Measure ℝ) [IsProbabilityMeasure Wq] (hWq : Wq (Set.Iio 0) = 0)
    (hconv : W = Wq.conv B) :
    ∀ s : ℝ, 0 < s →
      lst Wq s = (1 - (utilization lam 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, p.237, Eq. (5.34)
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).

  • Endorsed by WillR · Nov 20, 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