Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.60) — the G/M/1 arrival-point law is geometric, qn=(1−r0)r0nq_n = (1-r_0)r_0^nqn​=(1−r0​)r0n​

Proved
QueueingFundamentals.GM1.arrival_point_geometric

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

geometric-distributiongm1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueingstationary-distribution

Consider the G/M/1 queue: interarrival times are independent with law AAA on [0,∞)[0,\infty)[0,∞) of mean 1/λ1/\lambda1/λ (λ>0\lambda>0λ>0), service times are exponential with rate μ>0\mu > 0μ>0, and ρ=λ/μ<1\rho = \lambda/\mu < 1ρ=λ/μ<1. Let bnb_nbn​ be the probabilities (5.50), PPP the arrival-point transition matrix (5.51), and β(z)=∑nbnzn\beta(z) = \sum_n b_n z^nβ(z)=∑n​bn​zn (5.55). Then there is a real number r0r_0r0​ with the following properties:

  1. 0<r0<10 < r_0 < 10<r0​<1 and r0=β(r0)r_0 = \beta(r_0)r0​=β(r0​);
  2. r0r_0r0​ is the only complex root of z=β(z)z = \beta(z)z=β(z) with ∣z∣<1|z| < 1∣z∣<1;
  3. the geometric vector
qn=(1−r0) r0 n(n≥0, ρ<1)q_n = (1 - r_0)\, r_0^{\,n} \qquad (n \ge 0,\ \rho < 1)qn​=(1−r0​)r0n​(n≥0, ρ<1)

is a probability vector solving qP=qqP = qqP=q, qe=1qe = 1qe=1 (5.52); 4. it is the only probability vector solving (5.52).

So the number of customers an arrival finds in the system is geometric, as in the M/M/1 queue with ρ\rhoρ replaced by r0r_0r0​. This is the arrival-point law qnq_nqn​, not the time-average law pnp_npn​: the two agree only for Poisson input.

Formalization Note The root r0r_0r0​ is not a hypothesis: its existence, its location in (0,1)(0,1)(0,1), and its uniqueness in the unit disk are part of the conclusion, and so is the uniqueness of the stationary vector, which the book's phrase "the steady-state arrival-point distribution is" asserts.

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_GM1_EmbeddedChain
Formal statement
namespace QueueingFundamentals.GM1

open MeasureTheory

/-- Eq. (5.60) with the root result of pp.261–262: when `ρ = λ/μ < 1` there is a root `r_0 ∈ (0, 1)`
of `z = β(z)`, it is the only root of `z = β(z)` in the open unit disk, the geometric vector
`q_n = (1 - r_0) r_0^n` solves `qP = q`, `qe = 1`, and it is the only probability vector that does. -/
theorem arrival_point_geometric (A : Measure ℝ) (lam mu : ℝ) (hlam : 0 < lam) (hmu : 0 < mu)
    (hA : IsInterarrivalLaw A lam) (hrho : lam / mu < 1) :
    ∃ r0 : ℝ, r0 ∈ Set.Ioo (0 : ℝ) 1 ∧ beta A mu (r0 : ℂ) = (r0 : ℂ) ∧
      (∀ z : ℂ, ‖z‖ < 1 → beta A mu z = z → z = (r0 : ℂ)) ∧
      IsArrivalPointStationary A mu (fun n => (1 - r0) * r0 ^ n) ∧
      ∀ q : ℕ → ℝ, IsArrivalPointStationary A mu q → q = fun n => (1 - r0) * r0 ^ n := by sorry

end QueueingFundamentals.GM1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.262, Eq. (5.60), with the root results of pp.261–262
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