Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 18, (24)–(25) — nonnegative array representation

Proved
LambdaCoalescent.Rates.eq_24_iff_eq_25

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

coalescentexchangeable-partitionlambda-coalescentmarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (μi,j)i,j≥0(\mu_{i,j})_{i,j\ge0}(μi,j​)i,j≥0​ be a nonnegative real array with μ0,0=1\mu_{0,0}=1μ0,0​=1. The additive relation

μi,j=μi+1,j+μi,j+1(i,j≥0)\mu_{i,j}=\mu_{i+1,j}+\mu_{i,j+1}\qquad(i,j\ge0)μi,j​=μi+1,j​+μi,j+1​(i,j≥0)

holds exactly when there is a probability law FFF supported on [0,1][0,1][0,1] such that

μi,j=∫[0,1]xi(1−x)j F(dx)(i,j≥0).\mu_{i,j}=\int_{[0,1]}x^i(1-x)^j\,F(dx)\qquad(i,j\ge0).μi,j​=∫[0,1]​xi(1−x)jF(dx)(i,j≥0).

This is the array form of the representation used in Lemma 18, after the paper’s reindexing μi,j=λi+j+2,i+2\mu_{i,j}=\lambda_{i+j+2,i+2}μi,j​=λi+j+2,i+2​.

Formalization Note The law FFF represents the paper’s random variable X∈[0,1]X\in[0,1]X∈[0,1]; its expectation is written as an integral over R\mathbb RR.

Preamble
import Definitions.Def_LambdaCoalescent_Rates_Setting
Formal statement
namespace LambdaCoalescent.Rates

open MeasureTheory

/-- Equations (24) and (25), in the proof of Lemma 18, p. 1882. -/
theorem eq_24_iff_eq_25 (μ : ℕ → ℕ → ℝ)
    (hμ : ∀ i j, 0 ≤ μ i j) (h00 : μ 0 0 = 1) :
    (∀ i j, μ i j = μ (i + 1) j + μ i (j + 1)) ↔
      ∃ F : Measure ℝ, IsProbabilityMeasure F ∧ F (Set.Icc (0 : ℝ) 1)ᶜ = 0 ∧
        ∀ i j, μ i j = ∫ x, x ^ i * (1 - x) ^ j ∂F := by sorry

end LambdaCoalescent.Rates
Source
Pitman, Coalescents with multiple collisions, Ann. Probab. 27 (1999), p. 1882, proof of Lemma 18, eqs. (23)–(25)
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