Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.4, p. 712 — in M/D/∞ with unit service times, N(t) ~ Poisson(λ) for each t > 1

Proved
WhittEfficiency.IS.proposition_2_4

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

infinite-serverp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poissonqueueing

Consider the M/D/∞ model: Poisson arrivals with rate λ>0\lambda > 0λ>0 (i.i.d. exponential interarrival times), infinitely many servers, and every service time equal to 111, the system starting empty at time 000. Let N(t)N(t)N(t) be the number of busy servers at time ttt. Then for each t>1t > 1t>1, 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,…

The mean and the variance of N(t)N(t)N(t) are both λ\lambdaλ, which is the starting point of the paper's derivation of the square-root staffing formula s=λ+γλs = \lambda + \gamma\sqrt{\lambda}s=λ+γλ​.

Formalization Note The Poisson law is stated pointwise through the probability mass function. The printed condition t>1t > 1t>1 is kept as is.

Preamble
import Mathlib
import Definitions.Def_WhittEfficiency_IS_Model

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

/-- Whitt 1992, Proposition 2.4, p. 712: in an M/D/∞ model with service times of length `1` and
Poisson arrivals of rate `lam`, the number of busy servers `N(t)` is Poisson with mean `lam` for
each `t > 1`. -/
theorem proposition_2_4 {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
    [IsProbabilityMeasure μ] (lam : ℝ) (hlam : 0 < lam) (T : ℕ → Ω → ℝ)
    (hT : IsExpInterarrivals μ lam T) (t : ℝ) (ht : 1 < t) :
    ∀ k : ℕ, μ.real {ω | busyCount T (fun _ _ => 1) 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. 712, Proposition 2.4
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