Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, (12), p. 4 — ξ and η solve the coupled equations

Proved
KendallBD.Sol.xi_eta_solve

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

birth-death-processordinary-differential-equationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let λ,μ\lambda,\muλ,μ be continuous, nonnegative rates and define ξt=1−e−ρ(t)/W(t)\xi_t=1-e^{-\rho(t)}/W(t)ξt​=1−e−ρ(t)/W(t) and ηt=1−1/W(t)\eta_t=1-1/W(t)ηt​=1−1/W(t). Then ξ0=η0=0\xi_0=\eta_0=0ξ0​=η0​=0, and for every t≥0t\ge0t≥0 both functions are differentiable with derivatives satisfying

(ηξ′−ξη′)+η′=λ(1−ξ)(1−η),ξ′=μ(1−ξ)(1−η).(\eta\xi'-\xi\eta')+\eta'=\lambda(1-\xi)(1-\eta),\qquad \xi'=\mu(1-\xi)(1-\eta).(ηξ′−ξη′)+η′=λ(1−ξ)(1−η),ξ′=μ(1−ξ)(1−η).

Thus Kendall’s explicit expressions (12) satisfy the equations derived from the generating-function PDE.

Formalization Note Nonnegative death rates ensure W(t)>0W(t)>0W(t)>0 on nonnegative times, so both divisions in (12) are genuine.

Preamble
import Mathlib
import Definitions.Def_KendallBD_Sol_Setting

open Filter
open scoped Topology
Formal statement
namespace KendallBD.Sol

theorem xi_eta_solve (lam mu : ℝ → ℝ) (hlam : Continuous lam) (hmu : Continuous mu)
    (hlam0 : ∀ t, 0 ≤ t → 0 ≤ lam t) (hmu0 : ∀ t, 0 ≤ t → 0 ≤ mu t) :
    xi lam mu 0 = 0 ∧ eta lam mu 0 = 0 ∧
      ∀ t, 0 ≤ t → ∃ ξ' η' : ℝ,
        HasDerivAt (xi lam mu) ξ' t ∧ HasDerivAt (eta lam mu) η' t ∧
        (eta lam mu t * ξ' - xi lam mu t * η') + η' =
          lam t * (1 - xi lam mu t) * (1 - eta lam mu t) ∧
        ξ' = mu t * (1 - xi lam mu t) * (1 - eta lam mu t) := by sorry

end KendallBD.Sol
Source
Kendall, On the generalized "birth-and-death" process, Ann. Math. Statist. 19 (1948), §2, (12), p. 4
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