Eqs. (1.11)–(1.14) — the Poisson probabilities are the unique solution of the differential-difference equations
ProvedQueueingFundamentals.Foundations.poisson_forward_equationsdifferential-equationsp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1poisson-processqueueing
Let and let , , , be real functions. The following are equivalent.
- The functions satisfy the differential-difference equations of the Poisson process on (one-sided derivative at ),
together with the initial conditions and for . 2. For all and ,
So the Poisson probabilities (1.14) solve (1.11)–(1.12) with these initial conditions, and they are the only solution. This is the step (left as Problem 1.13 in the book) that turns the derivation of §1.7 into the Poisson law of the number of arrivals.
Preamble
import Mathlib
Formal statement
namespace QueueingFundamentals.Foundations
/-- Eqs. (1.11)–(1.14): the unique solution of the Poisson differential-difference equations
with `p_0(0) = 1`, `p_n(0) = 0` (`n > 0`) is `p_n(t) = (λt)^n e^{-λt} / n!` on `t ≥ 0`. -/
theorem poisson_forward_equations (lam : ℝ) (hlam : 0 < lam) (p : ℕ → ℝ → ℝ) :
((∀ t : ℝ, 0 ≤ t → HasDerivWithinAt (p 0) (-lam * p 0 t) (Set.Ici 0) t) ∧
(∀ n : ℕ, 1 ≤ n → ∀ t : ℝ, 0 ≤ t →
HasDerivWithinAt (p n) (-lam * p n t + lam * p (n - 1) t) (Set.Ici 0) t) ∧
p 0 0 = 1 ∧ (∀ n : ℕ, 0 < n → p n 0 = 0)) ↔
∀ n : ℕ, ∀ t : ℝ, 0 ≤ t →
p n t = (lam * t) ^ n / (n.factorial : ℝ) * Real.exp (-(lam * t)) := by sorry
end QueueingFundamentals.Foundations
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.17, Eqs. (1.11)–(1.14)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.