Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, (50)–(53), p. 11 — for constant rates λ₀ ≤ μ₀, ψ(1, w, ∞) generates the law Q_M of the cumulative population M_∞

Proved
KendallBD.Cumul.cumulative_law

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

birth-death-processcentral-binomialcumulative-populationgenerating-functionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a simple birth-and-death process with constant birth rate λ0>0\lambda_0 > 0λ0​>0 and death rate μ0≥λ0\mu_0 \ge \lambda_0μ0​≥λ0​ (a transient process), started from one ancestor. Let ψ(z,w,t)\psi(z, w, t)ψ(z,w,t) be the function (50),

ψ(z,w,t)=w α(β−z)+β(z−α)e−λ0w(β−α)t(β−z)+(z−α)e−λ0w(β−α)t,\psi(z, w, t) = w\,\frac{\alpha(\beta - z) + \beta(z - \alpha)e^{-\lambda_0 w(\beta - \alpha)t}}{(\beta - z) + (z - \alpha)e^{-\lambda_0 w(\beta - \alpha)t}},ψ(z,w,t)=w(β−z)+(z−α)e−λ0​w(β−α)tα(β−z)+β(z−α)e−λ0​w(β−α)t​,

where α<β\alpha < \betaα<β are the roots of λ0wz2−(λ0+μ0)z+μ0=0\lambda_0 w z^2 - (\lambda_0 + \mu_0) z + \mu_0 = 0λ0​wz2−(λ0​+μ0​)z+μ0​=0, and let

QM=λ0+μ02λ0 (2M)!22M(M!)2 xM2M−1(M=1,2,3,… ),x=4λ0μ0(λ0+μ0)2,Q_M = \frac{\lambda_0 + \mu_0}{2\lambda_0}\,\frac{(2M)!}{2^{2M}(M!)^2}\,\frac{x^M}{2M - 1} \quad (M = 1, 2, 3, \dots), \qquad x = \frac{4\lambda_0\mu_0}{(\lambda_0 + \mu_0)^2},QM​=2λ0​λ0​+μ0​​22M(M!)2(2M)!​2M−1xM​(M=1,2,3,…),x=(λ0​+μ0​)24λ0​μ0​​,

with Q0=0Q_0 = 0Q0​=0. Then:

  1. for every w∈(0,1)w \in (0, 1)w∈(0,1), ψ\psiψ solves the equation (31), ∂ψ/∂t={λ0wz2−(λ0+μ0)z+μ0} ∂ψ/∂z\partial\psi/\partial t = \{\lambda_0 w z^2 - (\lambda_0 + \mu_0) z + \mu_0\}\,\partial\psi/\partial z∂ψ/∂t={λ0​wz2−(λ0​+μ0​)z+μ0​}∂ψ/∂z, at every z∈[0,1]z \in [0, 1]z∈[0,1] and t≥0t \ge 0t≥0, and satisfies the boundary condition (32), ψ(z,w,0)=zw\psi(z, w, 0) = zwψ(z,w,0)=zw for every real zzz;
  2. for every w∈(0,1)w \in (0, 1)w∈(0,1) the series ∑MQMwM\sum_M Q_M w^M∑M​QM​wM converges and
lim⁡t→∞ψ(1,w,t)=∑M=1∞QMwM;\lim_{t \to \infty}\psi(1, w, t) = \sum_{M = 1}^{\infty} Q_M w^M;t→∞lim​ψ(1,w,t)=M=1∑∞​QM​wM;
  1. QM≥0Q_M \ge 0QM​≥0 for every MMM and ∑M≥1QM=1\sum_{M \ge 1} Q_M = 1∑M≥1​QM​=1.

In words: the joint generating function of the population size and the cumulative population MtM_tMt​ (the number of individuals ever alive) is (50), and the limiting distribution of MtM_tMt​, read off ψ(1,w,∞)\psi(1, w, \infty)ψ(1,w,∞), is the proper probability law (QM)M≥1(Q_M)_{M \ge 1}(QM​)M≥1​ of (52). For λ0=μ0\lambda_0 = \mu_0λ0​=μ0​ the law has an infinite mean; for λ0<μ0\lambda_0 < \mu_0λ0​<μ0​ its mean is μ0/(μ0−λ0)\mu_0/(\mu_0 - \lambda_0)μ0​/(μ0​−λ0​).

Formalization Note. The process and the joint law Pn,M(t)P_{n,M}(t)Pn,M​(t) are not constructed, as in the paper: "the law of M∞M_\inftyM∞​" is read, as on p. 11, as the coefficients of the generating function lim⁡t→∞ψ(1,w,t)\lim_{t\to\infty}\psi(1, w, t)limt→∞​ψ(1,w,t), and ψ\psiψ is tied to the process through the equation (31) and the boundary condition (32). The roots are used only for 0<w<10 < w < 10<w<1, where 0<α<1<β0 < \alpha < 1 < \beta0<α<1<β; this range determines the coefficients. Q0=0Q_0 = 0Q0​=0 encodes M∞≥M0=1M_\infty \ge M_0 = 1M∞​≥M0​=1.

Preamble
import Mathlib
import Definitions.Def_KendallBD_Cumul_Setting
open Filter Topology
Formal statement
namespace KendallBD.Cumul

theorem cumulative_law (lam0 mu0 : ℝ) (hlam : 0 < lam0) (hle : lam0 ≤ mu0) :
    (∀ w ∈ Set.Ioo (0:ℝ) 1,
      (∀ z ∈ Set.Icc (0:ℝ) 1, ∀ t : ℝ, 0 ≤ t → SolvesPDE lam0 mu0 (psi lam0 mu0) z w t) ∧
      ∀ z : ℝ, psi lam0 mu0 z w 0 = z * w) ∧
    (∀ w ∈ Set.Ioo (0:ℝ) 1,
      Summable (fun M : ℕ => Q lam0 mu0 M * w ^ M) ∧
      Tendsto (fun t => psi lam0 mu0 1 w t) atTop (𝓝 (∑' M : ℕ, Q lam0 mu0 M * w ^ M))) ∧
    ((∀ M : ℕ, 0 ≤ Q lam0 mu0 M) ∧ HasSum (Q lam0 mu0) 1) := by sorry

end KendallBD.Cumul
Source
Kendall, On the generalized "birth-and-death" process, Ann. Math. Statist. 19 (1948), §5, (50), (51), (52), (53), p. 11, with §4, (31)–(32), p. 8
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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