Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The nonhomogeneous Poisson law e−m(t)m(t)n/n!e^{-m(t)}m(t)^n/n!e−m(t)m(t)n/n! (p.22)

Proved
QueueingFundamentals.Foundations.nonhomogeneous_poisson

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

differential-equationsnonhomogeneous-poissonp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1poisson-process

Let λ(t)≥0\lambda(t)\ge0λ(t)≥0 be a rate function, continuous on [0,∞)[0,\infty)[0,∞), and put

m(t)=∫0tλ(s) ds.m(t)=\int_0^t\lambda(s)\,ds .m(t)=∫0t​λ(s)ds.

For real functions pn(t)p_n(t)pn​(t), n≥0n\ge0n≥0, t≥0t\ge0t≥0, the following are equivalent.

  1. They satisfy the forward equations with time-dependent rate on t≥0t\ge0t≥0 (one-sided derivative at t=0t=0t=0),
dp0(t)dt=−λ(t)p0(t),dpn(t)dt=−λ(t)pn(t)+λ(t)pn−1(t)(n≥1),\frac{dp_0(t)}{dt}=-\lambda(t)p_0(t),\qquad\frac{dp_n(t)}{dt}=-\lambda(t)p_n(t)+\lambda(t)p_{n-1}(t)\quad(n\ge1),dtdp0​(t)​=−λ(t)p0​(t),dtdpn​(t)​=−λ(t)pn​(t)+λ(t)pn−1​(t)(n≥1),

with 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)=e−m(t)[m(t)]nn!.p_n(t)=e^{-m(t)}\frac{[m(t)]^n}{n!}.pn​(t)=e−m(t)n![m(t)]n​.

These are the equations obtained from the axiomatic derivation of §1.7 when the constant rate λ\lambdaλ is replaced by λ(t)\lambda(t)λ(t); the solution is the nonhomogeneous Poisson distribution.

Preamble
import Mathlib
Formal statement
namespace QueueingFundamentals.Foundations

/-- p.22: with a time-dependent rate `λ(t)`, the unique solution of the forward equations
with `p_0(0) = 1`, `p_n(0) = 0` (`n > 0`) is the nonhomogeneous Poisson law
`p_n(t) = e^{-m(t)} m(t)^n / n!`, `m(t) = ∫_0^t λ(s) ds`. -/
theorem nonhomogeneous_poisson (lam : ℝ → ℝ) (hcont : ContinuousOn lam (Set.Ici 0))
    (hnonneg : ∀ t : ℝ, 0 ≤ t → 0 ≤ lam t) (p : ℕ → ℝ → ℝ) :
    ((∀ t : ℝ, 0 ≤ t → HasDerivWithinAt (p 0) (-lam t * p 0 t) (Set.Ici 0) t) ∧
      (∀ n : ℕ, 1 ≤ n → ∀ t : ℝ, 0 ≤ t →
        HasDerivWithinAt (p n) (-lam t * p n t + lam t * 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 = Real.exp (-(∫ s in (0 : ℝ)..t, lam s)) * (∫ s in (0 : ℝ)..t, lam s) ^ n /
        (n.factorial : ℝ) := by sorry

end QueueingFundamentals.Foundations
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.22, nonhomogeneous Poisson distribution (unnumbered display)
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