Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p.262 — r0r_0r0​ is the only root of z=β(z)z = \beta(z)z=β(z) in the open unit disk

Proved
QueueingFundamentals.GM1.unique_root_unit_disk

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

complex-analysisfixed-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 as in (5.55). If λ/μ<1\lambda/\mu < 1λ/μ<1, then there is exactly one complex number zzz with

∣z∣<1andz=β(z).|z| < 1 \quad\text{and}\quad z = \beta(z).∣z∣<1andz=β(z).

Together with the real root r0∈(0,1)r_0 \in (0,1)r0​∈(0,1), this shows that r0r_0r0​ is the only root of the characteristic equation inside the unit disk, which is why the stationary vector is a single geometric term.

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

open MeasureTheory

/-- p.262 (Rouché's theorem): when `λ/μ < 1` there is exactly one complex root of `z = β(z)` with
`|z| < 1`. -/
theorem unique_root_unit_disk (A : Measure ℝ) (lam mu : ℝ) (hlam : 0 < lam) (hmu : 0 < mu)
    (hA : IsInterarrivalLaw A lam) (hrho : lam / mu < 1) :
    ∃! z : ℂ, ‖z‖ < 1 ∧ beta A mu z = z := by sorry

end QueueingFundamentals.GM1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.262, the argument by Rouché's theorem following Figure 5.2
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