Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.61) — L(A)=r0/(1−r0)L^{(A)} = r_0/(1-r_0)L(A)=r0​/(1−r0​) and Lq(A)=r02/(1−r0)L_q^{(A)} = r_0^2/(1-r_0)Lq(A)​=r02​/(1−r0​)

Proved
QueueingFundamentals.GM1.arrival_point_means

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

gm1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1performance-measuresqueueing

Consider the G/M/1 queue with interarrival law AAA on [0,∞)[0,\infty)[0,∞) of mean 1/λ1/\lambda1/λ (λ>0\lambda>0λ>0), exponential service at rate μ>0\mu>0μ>0, and λ/μ<1\lambda/\mu < 1λ/μ<1. Let r0∈(0,1)r_0 \in (0,1)r0​∈(0,1) be the root of z=β(z)z = \beta(z)z=β(z), and let q={qn}q = \{q_n\}q={qn​} be a stationary arrival-point probability vector (qP=qqP = qqP=q, qe=1qe = 1qe=1). Then the mean number in the system and the mean number in queue found by an arrival are

L(A)=∑n≥0nqn=r01−r0,Lq(A)=∑n≥1(n−1)qn=r021−r0.L^{(A)} = \sum_{n\ge0} n q_n = \frac{r_0}{1 - r_0}, \qquad L_q^{(A)} = \sum_{n\ge1} (n-1) q_n = \frac{r_0^2}{1 - r_0}.L(A)=n≥0∑​nqn​=1−r0​r0​​,Lq(A)​=n≥1∑​(n−1)qn​=1−r0​r02​​.

The superscript (A)(A)(A) records that these measures are taken at arrival points only.

Formalization Note Lq(A)L_q^{(A)}Lq(A)​ is written ∑n≥0n qn+1\sum_{n\ge0} n\, q_{n+1}∑n≥0​nqn+1​. Both series are asserted to converge.

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

open MeasureTheory

/-- Eq. (5.61): at arrival points, the mean number in the system is `L^{(A)} = r_0/(1 - r_0)` and the
mean number in queue is `L_q^{(A)} = r_0^2/(1 - r_0)`. -/
theorem arrival_point_means (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 : ℂ))
    (q : ℕ → ℝ) (hq : IsArrivalPointStationary A mu q) :
    HasSum (fun n : ℕ => (n : ℝ) * q n) (r0 / (1 - r0)) ∧
      HasSum (fun n : ℕ => (n : ℝ) * q (n + 1)) (r0 ^ 2 / (1 - r0)) := by sorry

end QueueingFundamentals.GM1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.263, Eq. (5.61)
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