Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.59) — successive substitution converges to r0r_0r0​

Proved
QueueingFundamentals.GM1.successive_substitution

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

fixed-pointgm1numerical-methodsp2o-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, with λ/μ<1\lambda/\mu < 1λ/μ<1, and let r0∈(0,1)r_0 \in (0,1)r0​∈(0,1) be the root of z=β(z)z = \beta(z)z=β(z). For every starting point 0<z(0)<10 < z^{(0)} < 10<z(0)<1, the iterates

z(k+1)=β(z(k))(k=0,1,2,… )z^{(k+1)} = \beta(z^{(k)}) \qquad (k = 0, 1, 2, \dots)z(k+1)=β(z(k))(k=0,1,2,…)

converge to r0r_0r0​.

This is the numerical procedure the book recommends for computing r0r_0r0​.

Formalization Note On real arguments the iteration map is x↦Re⁡β(x)x \mapsto \operatorname{Re}\beta(x)x↦Reβ(x), which equals β(x)\beta(x)β(x) since the bnb_nbn​ are real. The root r0r_0r0​ is a hypothesis; it exists and is unique by the preceding milestone.

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

open MeasureTheory Filter Topology

/-- Eq. (5.59): when `λ/μ < 1`, successive substitution `z^{(k+1)} = β(z^{(k)})` started at any
`0 < z^{(0)} < 1` converges to the root `r_0 ∈ (0, 1)` of `z = β(z)`. -/
theorem successive_substitution (A : Measure ℝ) (lam mu : ℝ) (hlam : 0 < lam) (hmu : 0 < mu)
    (hA : IsInterarrivalLaw A lam) (hrho : lam / mu < 1)
    (r0 : ℝ) (hr0 : r0 ∈ Set.Ioo (0 : ℝ) 1) (hroot : beta A mu (r0 : ℂ) = (r0 : ℂ))
    (z0 : ℝ) (hz0 : z0 ∈ Set.Ioo (0 : ℝ) 1) :
    Tendsto (fun k : ℕ => (fun x : ℝ => (beta A mu (x : ℂ)).re)^[k] z0) atTop (𝓝 r0) := 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.59)
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