Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2.4, p. 712 — A(t) − A(t − 1) has the same distribution as A(1)

Proved
WhittEfficiency.IS.prop_2_4_increment_law

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-processqueueingstationary-increments

Let the arrival process be Poisson with rate λ>0\lambda > 0λ>0, i.e. the interarrival times T0,T1,…T_0, T_1, \dotsT0​,T1​,… are i.i.d. exponential with rate λ\lambdaλ, and let A(t)A(t)A(t) be the number of arrivals in (0,t](0, t](0,t]. For every t≥1t \ge 1t≥1 the increment A(t)−A(t−1)A(t) - A(t-1)A(t)−A(t−1) has the same distribution as A(1)A(1)A(1):

P(A(t)=A(t−1)+k)=P(A(1)=k)for every k=0,1,2,…P\big(A(t) = A(t-1) + k\big) = P\big(A(1) = k\big) \qquad \text{for every } k = 0, 1, 2, \dotsP(A(t)=A(t−1)+k)=P(A(1)=k)for every k=0,1,2,…

This is the stationary-increment property of the Poisson process over a window of length one, the fact the proof of Proposition 2.4 combines with Proposition 2.3.

Formalization Note The Poisson process is built from exponential interarrival times (IsExpInterarrivals), not postulated through its increments, so the statement has content. The event {A(t)−A(t−1)=k}\{A(t) - A(t-1) = k\}{A(t)−A(t−1)=k} is written as {A(t)=A(t−1)+k}\{A(t) = A(t-1) + k\}{A(t)=A(t−1)+k} to avoid natural-number subtraction.

Preamble
import Mathlib
import Definitions.Def_WhittEfficiency_IS_Model

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

/-- Whitt 1992, proof of Proposition 2.4, p. 712: for a Poisson arrival process of rate `lam`
(i.i.d. exponential interarrival times) and `t ≥ 1`, the increment `A(t) − A(t − 1)` has the same
distribution as `A(1)`. Stated additively to avoid truncated subtraction. -/
theorem prop_2_4_increment_law {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
    [IsProbabilityMeasure μ] (lam : ℝ) (hlam : 0 < lam) (T : ℕ → Ω → ℝ)
    (hT : IsExpInterarrivals μ lam T) (t : ℝ) (ht : 1 ≤ t) :
    ∀ k : ℕ, μ.real {ω | countingProcess T t ω = countingProcess T (t - 1) ω + k} =
      μ.real {ω | countingProcess T 1 ω = k} := by sorry

end WhittEfficiency.IS
Source
Whitt, Understanding the efficiency of multi-server service systems, Management Sci. 38 (1992), p. 712, proof of 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