Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (5.15)–(5.16) — the Pollaczek–Khintchine transform formula for the M/G/1 queue

Proved
QueueingFundamentals.MG1.pk_transform

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

generating-functionm-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]\mathrm E[S]E[S], and assume

ρ=λ E[S]<1.\rho = \lambda\,\mathrm E[S] < 1 .ρ=λE[S]<1.

Let kik_iki​ be the probability of iii Poisson arrivals during a service time and K(z)=∑ikiziK(z) = \sum_i k_i z^iK(z)=∑i​ki​zi. Then:

  1. the M/G/1 departure-point chain has a stationary distribution;
  2. every stationary distribution π\piπ has π0=1−ρ\pi_0 = 1 - \rhoπ0​=1−ρ (5.15);
  3. for every complex zzz with ∣z∣≤1|z| \le 1∣z∣≤1 and z≠1z \ne 1z=1, K(z)≠zK(z) \ne zK(z)=z and
Π(z)=∑i=0∞πizi=(1−ρ)(1−z)K(z)K(z)−z.\Pi(z) = \sum_{i=0}^\infty \pi_i z^i = \frac{(1-\rho)(1-z)K(z)}{K(z) - z} .Π(z)=i=0∑∞​πi​zi=K(z)−z(1−ρ)(1−z)K(z)​.

At z=1z = 1z=1 the right side is 0/00/00/0 and Π(1)=1\Pi(1) = 1Π(1)=1. This transform formula determines the whole stationary departure-point distribution from the service distribution; its derivatives at z=1z = 1z=1 give the moments of the system size.

Formalization Note The book's "the steady-state probabilities are given by (5.16)" is stated in both halves: a stationary probability vector exists, and every one satisfies (5.15)–(5.16). The point z=1z = 1z=1 is excluded; the non-vanishing of K(z)−zK(z) - zK(z)−z elsewhere in the closed disk is part of the conclusion.

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

open MeasureTheory

/-- Eqs. (5.15)–(5.16), p.227, the Pollaczek–Khintchine transform formula. Let `λ > 0`, let the
service distribution `B` be a probability measure on `[0, ∞)` with finite mean `E[S]`, and
let `ρ = λ E[S] < 1`. Then the M/G/1 departure-point chain (5.10) has a stationary probability
vector, and every stationary probability vector `π` has `π_0 = 1 - ρ` and, for every
`|z| ≤ 1` with `z ≠ 1`, `K(z) ≠ z` and
`Π(z) = (1 - ρ)(1 - z) K(z) / (K(z) - z)`. At `z = 1` the right side is `0/0`; there
`Π(1) = 1`, which is part of `IsStationaryDist`. -/
theorem pk_transform (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) :
    (∃ π : ℕ → ℝ, IsStationaryDist (transitionMatrix lam B) π) ∧
      ∀ π : ℕ → ℝ, IsStationaryDist (transitionMatrix lam B) π →
        π 0 = 1 - utilization lam B ∧
        ∀ z : ℂ, ‖z‖ ≤ 1 → z ≠ 1 →
          pgf (arrivalProb lam B) z ≠ z ∧
          pgf π z = (1 - (utilization lam B : ℂ)) * (1 - z) * pgf (arrivalProb lam B) z /
            (pgf (arrivalProb lam B) z - z) := by sorry

end QueueingFundamentals.MG1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.227, Eqs. (5.15)–(5.16)
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