Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, (49), pp. 10–11 — the roots of λ₀wz² − (λ₀+μ₀)z + μ₀ = 0 satisfy 0 < α < 1 < β for 0 < w < 1

Proved
KendallBD.Cumul.roots_order

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

birth-death-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-roots

Let 0<λ0≤μ00 < \lambda_0 \le \mu_00<λ0​≤μ0​ be constant birth and death rates of a transient simple birth-and-death process, and let 0<w<10 < w < 10<w<1. Then the quadratic (49)

λ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

has positive discriminant (λ0+μ0)2−4λ0μ0w>0(\lambda_0 + \mu_0)^2 - 4\lambda_0\mu_0 w > 0(λ0​+μ0​)2−4λ0​μ0​w>0; the numbers

α=λ0+μ0−(λ0+μ0)2−4λ0μ0w2λ0w,β=λ0+μ0+(λ0+μ0)2−4λ0μ0w2λ0w\alpha = \frac{\lambda_0 + \mu_0 - \sqrt{(\lambda_0 + \mu_0)^2 - 4\lambda_0\mu_0 w}}{2\lambda_0 w}, \qquad \beta = \frac{\lambda_0 + \mu_0 + \sqrt{(\lambda_0 + \mu_0)^2 - 4\lambda_0\mu_0 w}}{2\lambda_0 w}α=2λ0​wλ0​+μ0​−(λ0​+μ0​)2−4λ0​μ0​w​​,β=2λ0​wλ0​+μ0​+(λ0​+μ0​)2−4λ0​μ0​w​​

are both roots of it; and

0<α<1<β.0 < \alpha < 1 < \beta.0<α<1<β.

This is the choice of roots with which Kendall writes the general solution of the equation (31) for the joint generating function of the population size and the cumulative population.

Formalization Note. The page says "so chosen that 0<α<1<β0 < \alpha < 1 < \beta0<α<1<β" under the standing assumption λ0≤μ0\lambda_0 \le \mu_0λ0​≤μ0​. At w=1w = 1w=1 with λ0<μ0\lambda_0 < \mu_0λ0​<μ0​ the roots are 111 and μ0/λ0\mu_0/\lambda_0μ0​/λ0​, so the strict ordering holds only for 0<w<10 < w < 10<w<1, which is the range stated here; this range determines all coefficients of a power series in www.

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

theorem roots_order (lam0 mu0 : ℝ) (hlam : 0 < lam0) (hle : lam0 ≤ mu0) :
    ∀ w ∈ Set.Ioo (0:ℝ) 1,
      0 < disc lam0 mu0 w ∧
      lam0 * w * alpha lam0 mu0 w ^ 2 - (lam0 + mu0) * alpha lam0 mu0 w + mu0 = 0 ∧
      lam0 * w * beta lam0 mu0 w ^ 2 - (lam0 + mu0) * beta lam0 mu0 w + mu0 = 0 ∧
      0 < alpha lam0 mu0 w ∧ alpha lam0 mu0 w < 1 ∧ 1 < beta lam0 mu0 w := by sorry

end KendallBD.Cumul
Source
Kendall, On the generalized "birth-and-death" process, Ann. Math. Statist. 19 (1948), §5, (49) and the sentence following it, pp. 10–11
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