Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (1.11)–(1.14) — the Poisson probabilities are the unique solution of the differential-difference equations

Proved
QueueingFundamentals.Foundations.poisson_forward_equations

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

differential-equationsp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1poisson-processqueueing

Let λ>0\lambda>0λ>0 and let pn(t)p_n(t)pn​(t), n=0,1,2,…n=0,1,2,\dotsn=0,1,2,…, t≥0t\ge0t≥0, be real functions. The following are equivalent.

  1. The functions satisfy the differential-difference equations of the Poisson process on t≥0t\ge0t≥0 (one-sided derivative at t=0t=0t=0),
dp0(t)dt=−λp0(t),dpn(t)dt=−λpn(t)+λpn−1(t)(n≥1),\frac{dp_0(t)}{dt}=-\lambda p_0(t),\qquad \frac{dp_n(t)}{dt}=-\lambda p_n(t)+\lambda p_{n-1}(t)\quad(n\ge1),dtdp0​(t)​=−λp0​(t),dtdpn​(t)​=−λpn​(t)+λpn−1​(t)(n≥1),

together with the initial conditions p0(0)=1p_0(0)=1p0​(0)=1 and pn(0)=0p_n(0)=0pn​(0)=0 for n>0n>0n>0. 2. For all n≥0n\ge0n≥0 and t≥0t\ge0t≥0,

pn(t)=(λt)nn!e−λt.p_n(t)=\frac{(\lambda t)^n}{n!}e^{-\lambda t}.pn​(t)=n!(λt)n​e−λt.

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
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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