Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (1.15) — exponential interarrival times give a Poisson number of arrivals

Proved
QueueingFundamentals.Foundations.poisson_count_cdf

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

exponential-distributionp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1poisson-processqueueing

Let T0,T1,…T_0,T_1,\dotsT0​,T1​,… be independent exponential interarrival times with rate λ>0\lambda>0λ>0, and let N(t)N(t)N(t) be the number of arrivals in [0,t][0,t][0,t]. Then for every n≥0n\ge0n≥0 and every t≥0t\ge0t≥0 the distribution function Pn(t)=Pr⁡{N(t)≤n}P_n(t)=\Pr\{N(t)\le n\}Pn​(t)=Pr{N(t)≤n} satisfies

Pn(t)=∫t∞λ(λx)nn!e−λx dx=∑i=0n(λt)ie−λti!,P_n(t)=\int_t^\infty\frac{\lambda(\lambda x)^n}{n!}e^{-\lambda x}\,dx=\sum_{i=0}^{n}\frac{(\lambda t)^i e^{-\lambda t}}{i!},Pn​(t)=∫t∞​n!λ(λx)n​e−λxdx=i=0∑n​i!(λt)ie−λt​,

and consequently

Pr⁡{N(t)=n}=(λt)nn!e−λt.\Pr\{N(t)=n\}=\frac{(\lambda t)^n}{n!}e^{-\lambda t}.Pr{N(t)=n}=n!(λt)n​e−λt.

The integral is the tail of the Erlang (gamma) distribution of the sum of n+1n+1n+1 interarrival times, Eq. (1.15); the sum is the Poisson distribution function. This is the converse of the derivation of the exponential interarrival law from the Poisson process.

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_Foundations_ArrivalProcess

open MeasureTheory ProbabilityTheory
Formal statement
namespace QueueingFundamentals.Foundations

/-- Eq. (1.15) and the Poisson CDF (pp.18–19): with independent `Exp(λ)` interarrival times, the
number of arrivals `N(t)` by time `t ≥ 0` satisfies
`P_n(t) = Pr{N(t) ≤ n} = ∫_t^∞ λ(λx)^n e^{-λx}/n! dx = ∑_{i=0}^n (λt)^i e^{-λt}/i!`,
and hence `Pr{N(t) = n} = (λt)^n e^{-λt}/n!`. -/
theorem poisson_count_cdf {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω)
    [IsProbabilityMeasure μ] (lam : ℝ) (hlam : 0 < lam) (T : ℕ → Ω → ℝ)
    (hT : IsExpInterarrivals μ lam T) (n : ℕ) (t : ℝ) (ht : 0 ≤ t) :
    (μ {ω | countingProcess T t ω ≤ n}).toReal =
        ∫ x in Set.Ioi t, lam * (lam * x) ^ n / (n.factorial : ℝ) * Real.exp (-(lam * x)) ∧
      (μ {ω | countingProcess T t ω ≤ n}).toReal =
        ∑ i ∈ Finset.range (n + 1), (lam * t) ^ i * Real.exp (-(lam * t)) / (i.factorial : ℝ) ∧
      (μ {ω | countingProcess T t ω = n}).toReal =
        (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, pp.18–19, Eq. (1.15) and the Poisson CDF following it
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).

  • Endorsed by iris · Oct 31, 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