Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.5, p. 713 — splitting: the class-i arrivals are independent Poisson streams of rates λpᵢ

Proved
WhittEfficiency.IS.sec_2_5_split

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-processqueueingthinning

Let arrivals form a Poisson process of rate λ>0\lambda > 0λ>0 and let each customer independently carry a class label Jk∈{1,…,m}J_k \in \{1,\dots,m\}Jk​∈{1,…,m} with P(Jk=i)=piP(J_k = i) = p_iP(Jk​=i)=pi​, the labels being independent of the arrival process. For each class iii fix a window (ai,bi](a_i, b_i](ai​,bi​] with 0≤ai≤bi0 \le a_i \le b_i0≤ai​≤bi​ (windows of different classes may overlap), and let Ai(ai,bi]A_i(a_i, b_i]Ai​(ai​,bi​] be the number of class-iii arrivals in it. Then

  1. the counts A1(a1,b1],…,Am(am,bm]A_1(a_1,b_1], \dots, A_m(a_m,b_m]A1​(a1​,b1​],…,Am​(am​,bm​] are mutually independent, and
  2. each Ai(ai,bi]A_i(a_i,b_i]Ai​(ai​,bi​] is Poisson with mean λpi(bi−ai)\lambda p_i (b_i - a_i)λpi​(bi​−ai​):
P(Ai(ai,bi]=k)=e−λpi(bi−ai) (λpi(bi−ai))kk!,k=0,1,2,…P\big(A_i(a_i,b_i] = k\big) = e^{-\lambda p_i (b_i - a_i)}\,\frac{(\lambda p_i (b_i - a_i))^k}{k!}, \qquad k = 0, 1, 2, \dotsP(Ai​(ai​,bi​]=k)=e−λpi​(bi​−ai​)k!(λpi​(bi​−ai​))k​,k=0,1,2,…

This is the content of the paper's observation that, since the arrival process is Poisson, the model is equivalent to the superposition of mmm independent Poisson arrival processes, the iii-th with rate λpi\lambda p_iλpi​.

Formalization Note The page asserts that the class streams are independent Poisson processes; the Lean statement gives the consequence for one window per class, which is the form the next step of the argument uses (windows (t−di,t](t - d_i, t](t−di​,t]).

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 superposition sentence): with Poisson arrivals of rate `lam`
and i.i.d. class labels with law `p`, the class-`i` arrivals form independent Poisson streams of
rates `lam * p i`. Stated for one window `(a i, b i]` per class (windows of different classes may
overlap): the class window counts are mutually independent and the `i`-th is Poisson with mean
`lam * p i * (b i - a i)`. -/
theorem sec_2_5_split {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
    [IsProbabilityMeasure μ] (lam : ℝ) (hlam : 0 < lam) (T : ℕ → Ω → ℝ)
    {m : ℕ} (p : Fin m → ℝ) (J : ℕ → Ω → Fin m)
    (hM : IsMarkedPoisson μ lam T p J)
    (a b : Fin m → ℝ) (hab : ∀ i, 0 ≤ a i ∧ a i ≤ b i) :
    iIndepFun (fun i ω => classWindowCount T J i (a i) (b i) ω) μ ∧
    ∀ (i : Fin m) (k : ℕ), μ.real {ω | classWindowCount T J i (a i) (b i) ω = k} =
      Real.exp (-(lam * p i * (b i - a i))) * (lam * p i * (b i - a i)) ^ 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, fourth sentence
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