Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (6.18) — the M/D/c generating function

Proved
QueueingFundamentals.GG1.mdc_pgf

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

generating-functionm-d-cp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueing

Consider the M/D/c queue with c≥1c\ge1c≥1 servers, the constant service time as the unit of time, and Poisson arrivals at rate λ>0\lambda>0λ>0 per unit. If λ<c\lambda<cλ<c, a steady-state distribution (pn)(p_n)(pn​) solving (6.17) exists. For every steady-state distribution, with Pc=∑n=0cpnP_c=\sum_{n=0}^{c}p_nPc​=∑n=0c​pn​ and P(z)=∑n≥0pnznP(z)=\sum_{n\ge0}p_nz^nP(z)=∑n≥0​pn​zn, and every complex zzz with ∣z∣≤1|z|\le1∣z∣≤1,

P(z)=∑n=0cpnzn−Pczc1−zceλ(1−z)=∑n=0c−1pn(zn−zc)1−zceλ(1−z).(6.18)P(z)=\frac{\sum_{n=0}^{c}p_nz^n-P_cz^c}{1-z^ce^{\lambda(1-z)}}=\frac{\sum_{n=0}^{c-1}p_n(z^n-z^c)}{1-z^ce^{\lambda(1-z)}}. \tag{6.18}P(z)=1−zceλ(1−z)∑n=0c​pn​zn−Pc​zc​=1−zceλ(1−z)∑n=0c−1​pn​(zn−zc)​.(6.18)

This expresses the queue-size generating function through the ccc unknown probabilities p0,…,pc−1p_0,\dots,p_{c-1}p0​,…,pc−1​, which the roots of the denominator then determine.

Formalization Note (6.18) is stated with its denominator cleared, P(z)(1−zceλ(1−z))=…P(z)\bigl(1-z^ce^{\lambda(1-z)}\bigr)=\dotsP(z)(1−zceλ(1−z))=…, on the whole closed disk; this is equivalent to the quotient wherever the denominator is nonzero and additionally says that the numerator vanishes at the zeros of the denominator. The existence half under λ<c\lambda<cλ<c is the book's steady-state assumption (ρ=λ/c<1\rho=\lambda/c<1ρ=λ/c<1 after rescaling time).

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

/-- Eq. (6.18) (p.295) for the M/D/c queue (`c` servers, constant service time taken as the unit of
time, Poisson arrivals at rate `λ > 0` per unit). Under the steady-state condition `λ < c` a
probability solution of (6.17) exists; and for every probability solution `p` of (6.17) and every
`|z| ≤ 1`,
`P(z)(1 − z^c e^{λ(1−z)}) = ∑_{n=0}^{c} p_n z^n − P_c z^c = ∑_{n=0}^{c−1} p_n (z^n − z^c)`,
the cleared-denominator form of `P(z) = (∑_{n=0}^{c} p_n z^n − P_c z^c)/(1 − z^c e^{λ(1−z)})`. -/
theorem mdc_pgf (lam : ℝ) (hlam : 0 < lam) (c : ℕ) (hc : 1 ≤ c) :
    ((lam < c) → ∃ p : ℕ → ℝ, IsMDcStationary lam c p) ∧
    ∀ p : ℕ → ℝ, IsMDcStationary lam c p → ∀ z : ℂ, ‖z‖ ≤ 1 →
      QueueingFundamentals.MG1.pgf p z * (1 - z ^ c * Complex.exp ((lam : ℂ) * (1 - z))) =
          (∑ n ∈ Finset.range (c + 1), (p n : ℂ) * z ^ n) - (cumProb p c : ℂ) * z ^ c ∧
      QueueingFundamentals.MG1.pgf p z * (1 - z ^ c * Complex.exp ((lam : ℂ) * (1 - z))) =
          ∑ n ∈ Finset.range c, (p n : ℂ) * (z ^ n - z ^ c) := by sorry

end QueueingFundamentals.GG1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.295, Eq. (6.18), from Eq. (6.17)
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