Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 2.1 — the birth-death process is reversible

Proved
SerfozoStochasticNetworks.birthDeath_reversible

by naimengye · Sep 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainprobabilitystochastic-systems

Consider the classical birth–death process on the non-negative integers: from state xxx the arrival rate is λ(x)>0\lambda(x)>0λ(x)>0 and the departure rate is μ(x)>0\mu(x)>0μ(x)>0 for x≥1x\ge1x≥1, all other rates being zero. Let

π(x)=∏n=1xλ(n−1)μ(n),π(0)=1.\pi(x)=\prod_{n=1}^{x}\frac{\lambda(n-1)}{\mu(n)},\qquad \pi(0)=1 .π(x)=n=1∏x​μ(n)λ(n−1)​,π(0)=1.

Then π\piπ satisfies the detailed balance equations for these rates, and consequently the rate function is reversible.

The single family of equations π(x)λ(x)=π(x+1)μ(x+1)\pi(x)\lambda(x)=\pi(x+1)\mu(x+1)π(x)λ(x)=π(x+1)μ(x+1) carries everything: the equations for y=x+1y=x+1y=x+1 and for y=x−1y=x-1y=x−1 are the same family read from the two ends, and a backward iteration solves them.

Formalization Note The rates are given as an explicit function: q(x,y)=λ(x)q(x,y)=\lambda(x)q(x,y)=λ(x) when y=x+1y=x+1y=x+1, q(x,y)=μ(x)q(x,y)=\mu(x)q(x,y)=μ(x) when x=y+1x=y+1x=y+1, and 000 otherwise, so in particular q(x,x)=0q(x,x)=0q(x,x)=0 and q(x,y)=0q(x,y)=0q(x,y)=0 whenever ∣x−y∣≥2|x-y|\ge2∣x−y∣≥2. The value μ(0)\mu(0)μ(0) never appears, the state −1-1−1 not existing, which is why only μ(n+1)\mu(n+1)μ(n+1) is assumed positive.

π\piπ is normalized at the origin rather than carrying the free constant π(0)\pi(0)π(0) of the book; detailed balance is homogeneous, so this is no loss. Nothing is claimed about summability of π\piπ: whether the process has a stationary distribution depends on the convergence of ∑xπ(x)\sum_x\pi(x)∑x​π(x), which the book records separately and which is not part of this statement.

Preamble
import Mathlib
import Definitions.Def_SerfozoStochasticNetworks_Reversible
Formal statement
namespace SerfozoStochasticNetworks

theorem birthDeath_reversible (lam mu : ℕ → ℝ) (hlam : ∀ n, 0 < lam n)
    (hmu : ∀ n, 0 < mu (n + 1)) :
    DetailedBalance (birthDeathRate lam mu) (birthDeathMeasure lam mu) ∧
      IsReversible (birthDeathRate lam mu) := by sorry

end SerfozoStochasticNetworks
Source
Serfozo, Introduction to Stochastic Networks, Springer 1999, pp. 45-46 (PDF pp. 58-59), Example 2.1: "Birth-Death Process. ... Its detailed balance equations for y = x + 1 and y = x - 1 are respectively pi(x) lambda(x) = pi(x + 1) mu(x + 1), x >= 0, pi(x) mu(x) = pi(x - 1) lambda(x - 1), x >= 1. But these two equations are the same. The second one yields pi(x) = pi(x - 1) lambda(x - 1)/mu(x), x >= 1. By a backward iteration of this equation, it follows that it has a solution pi(x) = pi(0) prod_{n=1}^{x} lambda(n - 1)/mu(n), x >= 1. (2.3) Thus, the process is reversible with invariant measure pi." sha256 919f20ee082ec19faa80bdd923a5529fce9c4b6d3264fdb77c5efa64256bb463
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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