Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

pp.261–262 — z=β(z)z = \beta(z)z=β(z) has exactly one root in (0,1)(0,1)(0,1) iff λ/μ<1\lambda/\mu < 1λ/μ<1

Proved
QueueingFundamentals.GM1.unique_root_unit_interval

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

convexityfixed-pointgm1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueing

Consider the G/M/1 queue with interarrival law AAA on [0,∞)[0,\infty)[0,∞) of mean 1/λ1/\lambda1/λ (λ>0\lambda>0λ>0) and exponential service at rate μ>0\mu > 0μ>0, and let β(z)=∑nbnzn\beta(z) = \sum_n b_n z^nβ(z)=∑n​bn​zn be the generating function (5.55). Then:

  1. the equation z=β(z)z = \beta(z)z=β(z) has at most one real root in (0,1)(0,1)(0,1);
  2. it has a root in (0,1)(0,1)(0,1) if and only if
λμ<1.\frac{\lambda}{\mu} < 1 .μλ​<1.

This is the book's comparison of the graphs y=β(z)y = \beta(z)y=β(z) and y=zy = zy=z (5.58), Figure 5.2: either there is no intersection in (0,1)(0,1)(0,1), or exactly one, and the latter case occurs when β′(1)=μ/λ>1\beta'(1) = \mu/\lambda > 1β′(1)=μ/λ>1. The root is denoted r0r_0r0​.

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

open MeasureTheory

/-- pp.261–262, the graphs of (5.58): `z = β(z)` has at most one root in `(0, 1)`, and it has one
exactly when `λ/μ < 1`. -/
theorem unique_root_unit_interval (A : Measure ℝ) (lam mu : ℝ) (hlam : 0 < lam) (hmu : 0 < mu)
    (hA : IsInterarrivalLaw A lam) :
    (∀ r s : ℝ, r ∈ Set.Ioo (0 : ℝ) 1 → beta A mu (r : ℂ) = (r : ℂ) →
        s ∈ Set.Ioo (0 : ℝ) 1 → beta A mu (s : ℂ) = (s : ℂ) → r = s) ∧
      ((∃ r : ℝ, r ∈ Set.Ioo (0 : ℝ) 1 ∧ beta A mu (r : ℂ) = (r : ℂ)) ↔ lam / mu < 1) := by sorry

end QueueingFundamentals.GM1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, pp.261–262, Eq. (5.58) and Figure 5.2 ("there is exactly one root r_0 of (5.55) in (0, 1)")
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