Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.5, p. 713 — for t > max dᵢ, N(t) is a sum of independent Poisson(λpᵢdᵢ) class counts

Proved
WhittEfficiency.IS.sec_2_5_class_counts

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

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

In the infinite-server model with Poisson arrivals of rate λ>0\lambda > 0λ>0 and i.i.d. service times, independent of the arrivals, equal to di≥0d_i \ge 0di​≥0 with probability pip_ipi​ (i=1,…,mi = 1,\dots,mi=1,…,m), let Ni(t)N_i(t)Ni​(t) be the number of busy servers occupied by class-iii customers at time ttt and N(t)N(t)N(t) the total number of busy servers. If t>max⁡idit > \max_i d_it>maxi​di​, then

  1. N1(t),…,Nm(t)N_1(t), \dots, N_m(t)N1​(t),…,Nm​(t) are mutually independent;
  2. Ni(t)N_i(t)Ni​(t) is Poisson with mean λpidi\lambda p_i d_iλpi​di​:
P(Ni(t)=k)=e−λpidi (λpidi)kk!,k=0,1,2,… ;P\big(N_i(t) = k\big) = e^{-\lambda p_i d_i}\,\frac{(\lambda p_i d_i)^k}{k!}, \qquad k = 0, 1, 2, \dots;P(Ni​(t)=k)=e−λpi​di​k!(λpi​di​)k​,k=0,1,2,…;
  1. almost surely N(t)=N1(t)+⋯+Nm(t)N(t) = N_1(t) + \cdots + N_m(t)N(t)=N1​(t)+⋯+Nm​(t).

So the number of busy servers has the distribution of a sum of mmm independent Poisson variables with means λpidi\lambda p_i d_iλpi​di​.

Formalization Note Part 3 holds almost surely rather than for every outcome because the counts are Set.ncard, which returns 000 on the null event of infinitely many arrivals in a bounded window. Classes are indexed by Fin m.

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 "Hence" sentence): for `t > max d i`, the number of busy
servers is almost surely the sum over classes of the class busy counts, which are independent
Poisson variables with means `lam * p i * d i`. -/
theorem sec_2_5_class_counts {Ω : 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)
    (t : ℝ) (ht : ∀ i, d i < t) :
    iIndepFun (fun i ω => classBusyCount T J d i t ω) μ ∧
    (∀ (i : Fin m) (k : ℕ), μ.real {ω | classBusyCount T J d i t ω = k} =
      Real.exp (-(lam * p i * d i)) * (lam * p i * d i) ^ k / k.factorial) ∧
    ∀ᵐ ω ∂μ, busyCount T (fun j ω => d (J j ω)) t ω = ∑ i, classBusyCount T J d i t ω := by sorry

end WhittEfficiency.IS
Source
Whitt, Understanding the efficiency of multi-server service systems, Management Sci. 38 (1992), p. 713, §2.5, fifth sentence ("Hence, for t > max …")
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