Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3.55): the partial generating functions of the M/M/1 retrial queue in closed form

Proved
QueueingFundamentals.AdvMarkov.retrial_pgf_closed_form

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

generating-functionp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueingretrial-queue

Consider the M/M/1M/M/1M/M/1 retrial queue with arrival rate λ>0\lambda > 0λ>0, service rate μ>0\mu > 0μ>0 and retrial rate γ>0\gamma > 0γ>0, and let ρ=λ/μ<1\rho = \lambda/\mu < 1ρ=λ/μ<1. Let {pi,n}\{p_{i,n}\}{pi,n​} be a steady-state solution of the rate-balance equations (3.47)–(3.49), with partial generating functions P0(z)=∑nznp0,nP_0(z) = \sum_n z^n p_{0,n}P0​(z)=∑n​znp0,n​ and P1(z)=∑nznp1,nP_1(z) = \sum_n z^n p_{1,n}P1​(z)=∑n​znp1,n​. Then for every real zzz with −1≤z≤1-1 \le z \le 1−1≤z≤1,

P0(z)=(1−ρz)(1−ρ1−ρz)(λ/γ)+1,P1(z)=ρ(1−ρ1−ρz)(λ/γ)+1.P_0(z) = (1-\rho z)\left(\frac{1-\rho}{1-\rho z}\right)^{(\lambda/\gamma)+1}, \qquad P_1(z) = \rho\left(\frac{1-\rho}{1-\rho z}\right)^{(\lambda/\gamma)+1}.P0​(z)=(1−ρz)(1−ρz1−ρ​)(λ/γ)+1,P1​(z)=ρ(1−ρz1−ρ​)(λ/γ)+1.

At z=1z = 1z=1 this gives P1(1)=∑np1,n=ρP_1(1) = \sum_n p_{1,n} = \rhoP1​(1)=∑n​p1,n​=ρ, the fraction of time the server is busy. Expanding these functions in powers of zzz yields the steady-state probabilities (3.57).

Formalization Note The book does not state the range of zzz; the statement takes real z∈[−1,1]z \in [-1,1]z∈[−1,1], where the series converge absolutely and 1−ρz>01 - \rho z > 01−ρz>0. The power (λ/γ)+1(\lambda/\gamma)+1(λ/γ)+1 is a real power of a positive number.

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_AdvMarkov_Retrial
Formal statement
namespace QueueingFundamentals.AdvMarkov

/-- Eq. (3.55), p.161: for a steady-state solution of the `M/M/1` retrial queue with
`ρ = λ/μ < 1`, the partial generating functions are, for `z ∈ [−1, 1]`,
`P_0(z) = (1 − ρz)((1 − ρ)/(1 − ρz))^{(λ/γ)+1}` and `P_1(z) = ρ((1 − ρ)/(1 − ρz))^{(λ/γ)+1}`. -/
theorem retrial_pgf_closed_form (lam mu gam : ℝ) (hlam : 0 < lam) (hmu : 0 < mu) (hgam : 0 < gam)
    (ρ : ℝ) (hρ : ρ = lam / mu) (hρ1 : ρ < 1)
    (p0 p1 : ℕ → ℝ) (hp : IsRetrialSteadyState lam mu gam p0 p1) :
    ∀ z ∈ Set.Icc (-1 : ℝ) 1,
      pgf p0 z = (1 - ρ * z) * ((1 - ρ) / (1 - ρ * z)) ^ (lam / gam + 1) ∧
      pgf p1 z = ρ * ((1 - ρ) / (1 - ρ * z)) ^ (lam / gam + 1) := by sorry

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