Proof of Proposition 2.4, p. 712 — A(t) − A(t − 1) has the same distribution as A(1)
ProvedWhittEfficiency.IS.prop_2_4_increment_lawp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-processqueueingstationary-increments
Let the arrival process be Poisson with rate , i.e. the interarrival times are i.i.d. exponential with rate , and let be the number of arrivals in . For every the increment has the same distribution as :
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 is written as 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.