Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.11.2 — the limit of (2.75) as t→∞t \to \inftyt→∞

Proved
QueueingFundamentals.Transient.mm1_transient_limit

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

mm1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueingsteady-statetransient

Let λ,μ>0\lambda, \mu > 0λ,μ>0, ρ=λ/μ\rho = \lambda/\muρ=λ/μ, let i≥0i \ge 0i≥0 and let pn(t)p_n(t)pn​(t) be the expression (2.75) for the M/M/1 queue started with iii customers. For every n≥0n \ge 0n≥0:

  1. if ρ<1\rho < 1ρ<1, then
lim⁡t→∞pn(t)=(1−ρ)ρn;\lim_{t\to\infty} p_n(t) = (1-\rho)\rho^n ;t→∞lim​pn​(t)=(1−ρ)ρn;
  1. if ρ≥1\rho \ge 1ρ≥1, then lim⁡t→∞pn(t)=0\lim_{t\to\infty} p_n(t) = 0limt→∞​pn​(t)=0.

So the transient law converges to the stationary geometric distribution exactly when ρ<1\rho < 1ρ<1, in agreement with the steady-state result (2.9).

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_Transient_mm1Transient
Formal statement
namespace QueueingFundamentals.Transient

open Filter Topology

/-- The limit of (2.75) (p.101). For `λ, μ > 0`, every initial size `i` and every `n`:
if `ρ = λ/μ < 1` then `p_n(t) → (1 - ρ) ρ^n` as `t → ∞`; if `λ/μ ≥ 1` then `p_n(t) → 0`. -/
theorem mm1_transient_limit (lam mu : ℝ) (hlam : 0 < lam) (hmu : 0 < mu) (i n : ℕ) :
    (lam / mu < 1 →
        Tendsto (fun t : ℝ => mm1Transient lam mu i n t) atTop
          (𝓝 ((1 - lam / mu) * (lam / mu) ^ n))) ∧
      (1 ≤ lam / mu → Tendsto (fun t : ℝ => mm1Transient lam mu i n t) atTop (𝓝 0)) := by sorry

end QueueingFundamentals.Transient
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.101, limit of Eq. (2.75), §2.11.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