Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.5, p. 713 (the M/G/∞ claim) — service times dᵢ w.p. pᵢ with mean 1: N(t) ~ Poisson(λ) for t > max dᵢ

Proved
WhittEfficiency.IS.sec_2_5_busy_poisson

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

infinite-serverm-g-infinityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poissonqueueing

Consider an infinite-server model with Poisson arrivals of rate λ>0\lambda > 0λ>0, started empty at time 000, in which the service times are i.i.d., independent of the arrival process, and take the value di≥0d_i \ge 0di​≥0 with probability pip_ipi​, i=1,…,mi = 1, \dots, mi=1,…,m, where the mean service time is

∑i=1mpidi=1.\sum_{i=1}^m p_i d_i = 1.i=1∑m​pi​di​=1.

Let N(t)N(t)N(t) be the number of busy servers at time ttt. Then for every t>max⁡{di:1≤i≤m}t > \max\{d_i : 1 \le i \le m\}t>max{di​:1≤i≤m}, N(t)N(t)N(t) has a Poisson distribution with mean λ\lambdaλ:

P(N(t)=k)=e−λ λkk!,k=0,1,2,…P\big(N(t) = k\big) = e^{-\lambda}\,\frac{\lambda^k}{k!}, \qquad k = 0, 1, 2, \dotsP(N(t)=k)=e−λk!λk​,k=0,1,2,…

In particular the (steady-state) number of busy servers depends on the service-time distribution only through its mean, so the M/D/∞ analysis behind the square-root staffing formula s=λ+γλs = \lambda + \gamma\sqrt\lambdas=λ+γλ​ extends to general finite service-time distributions.

Formalization Note The service-time law is encoded by i.i.d. class labels JkJ_kJk​ with P(Jk=i)=piP(J_k = i) = p_iP(Jk​=i)=pi​, independent of the exponential interarrival times; customer kkk has service time dJkd_{J_k}dJk​​. The paper's index range 1≤i≤n1 \le i \le n1≤i≤n is Fin m. The constraint ∑ipidi=1\sum_i p_i d_i = 1∑i​pi​di​=1 forces m≥1m \ge 1m≥1; the label law together with a probability measure forces pi≥0p_i \ge 0pi​≥0 and ∑ipi=1\sum_i p_i = 1∑i​pi​=1, so these are not separate hypotheses. "Steady state" is the law at each fixed t>max⁡idit > \max_i d_it>maxi​di​, not a limit t→∞t \to \inftyt→∞.

Preamble
import Mathlib
import Definitions.Def_WhittEfficiency_IS_Model

open MeasureTheory ProbabilityTheory QueueingFundamentals.Foundations
Formal statement
namespace WhittEfficiency.IS

/-- Whitt 1992, §2.5, p. 713 (the M/G/∞ claim): with Poisson arrivals of rate `lam` and i.i.d.
service times independent of the arrivals, taking the value `d i` with probability `p i`, where
`∑ p i * d i = 1` (mean service time `1`), the number of busy servers `N(t)` is Poisson with mean
`lam` for every `t > max d i`. -/
theorem sec_2_5_busy_poisson {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
    [IsProbabilityMeasure μ] (lam : ℝ) (hlam : 0 < lam) (T : ℕ → Ω → ℝ)
    {m : ℕ} (p d : Fin m → ℝ) (hd : ∀ i, 0 ≤ d i) (J : ℕ → Ω → Fin m)
    (hM : IsMarkedPoisson μ lam T p J)
    (hmean : ∑ i, p i * d i = 1) (t : ℝ) (ht : ∀ i, d i < t) :
    ∀ k : ℕ, μ.real {ω | busyCount T (fun j ω => d (J j ω)) t ω = k} =
      Real.exp (-lam) * lam ^ k / k.factorial := by sorry

end WhittEfficiency.IS
Source
Whitt, Understanding the efficiency of multi-server service systems, Management Sci. 38 (1992), p. 713, §2.5, first paragraph
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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