Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (3.50)–(3.52): the differential equation for the partial generating functions of the M/M/1 retrial queue

Proved
QueueingFundamentals.AdvMarkov.retrial_pgf_equations

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, that is, a probability distribution on {0,1}×{0,1,2,… }\{0,1\}\times\{0,1,2,\dots\}{0,1}×{0,1,2,…} solving the rate-balance equations (3.47)–(3.49), and let 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​ be its partial generating functions.

Then for every real zzz with −1<z<1-1 < z < 1−1<z<1, the function P0P_0P0​ is differentiable at zzz and

λP0(z)+zγP0′(z)=μP1(z),(3.50)(λ+μ)P1(z)=λP0(z)+γP0′(z)+λzP1(z),(3.51)P0′(z)=λργ(1−ρz) P0(z).(3.52)\begin{aligned} \lambda P_0(z) + z\gamma P_0'(z) &= \mu P_1(z), && (3.50)\\ (\lambda+\mu)P_1(z) &= \lambda P_0(z) + \gamma P_0'(z) + \lambda z P_1(z), && (3.51)\\ P_0'(z) &= \frac{\lambda\rho}{\gamma(1-\rho z)}\,P_0(z). && (3.52) \end{aligned}λP0​(z)+zγP0′​(z)(λ+μ)P1​(z)P0′​(z)​=μP1​(z),=λP0​(z)+γP0′​(z)+λzP1​(z),=γ(1−ρz)λρ​P0​(z).​​(3.50)(3.51)(3.52)​

Equations (3.50)–(3.51) are the balance equations transformed into generating functions; (3.52) is the separable differential equation from which the book obtains P0P_0P0​ and P1P_1P1​ in closed form.

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 power series converge and are differentiable. The hypothesis ρ<1\rho < 1ρ<1 is the condition under which a steady-state solution exists; it guarantees 1−ρz>01 - \rho z > 01−ρz>0 on this range.

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

/-- Eqs. (3.50)–(3.52), p.160: for a steady-state solution of the `M/M/1` retrial queue, the
partial generating functions `P_0`, `P_1` satisfy, for `z ∈ (−1, 1)`,
`λP_0(z) + zγP_0'(z) = μP_1(z)` (3.50), `(λ + μ)P_1(z) = λP_0(z) + γP_0'(z) + λzP_1(z)` (3.51)
and `P_0'(z) = λρ/(γ(1 − ρz)) · P_0(z)` (3.52), with `ρ = λ/μ < 1`. -/
theorem retrial_pgf_equations (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.Ioo (-1 : ℝ) 1,
      DifferentiableAt ℝ (pgf p0) z ∧
      lam * pgf p0 z + z * gam * deriv (pgf p0) z = mu * pgf p1 z ∧
      (lam + mu) * pgf p1 z = lam * pgf p0 z + gam * deriv (pgf p0) z + lam * z * pgf p1 z ∧
      deriv (pgf p0) z = lam * ρ / (gam * (1 - ρ * z)) * pgf p0 z := by sorry

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