Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 18 — finite measures correspond bijectively to consistent arrays

Proved
LambdaCoalescent.Rates.lemma_18_bijection

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

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

Every finite nonnegative Borel measure Λ\LambdaΛ on [0,1][0,1][0,1] gives a consistent nonnegative merger-rate array by formula (1). Conversely, every consistent nonnegative array has exactly one such representing measure:

λb,k=∫[0,1]xk−2(1−x)b−k Λ(dx)(2≤k≤b).\lambda_{b,k}=\int_{[0,1]}x^{k-2}(1-x)^{b-k}\,\Lambda(dx)\qquad(2\le k\le b).λb,k​=∫[0,1]​xk−2(1−x)b−kΛ(dx)(2≤k≤b).

Both directions and uniqueness express the bijection stated after equation (22) in Lemma 18. The zero measure and zero array are included.

Formalization Note Measures are represented on R\mathbb RR with zero mass outside [0,1][0,1][0,1]. Finiteness is explicit to ensure the integral denotes the ordinary finite-measure integral.

Preamble
import Definitions.Def_LambdaCoalescent_Rates_Setting
Formal statement
namespace LambdaCoalescent.Rates

open MeasureTheory

/-- Lemma 18, p. 1882: formula (1) is a bijection. -/
theorem lemma_18_bijection :
    (∀ Λ : Measure ℝ, IsFiniteMeasure Λ → Λ (Set.Icc (0 : ℝ) 1)ᶜ = 0 →
      Consistent (lamOf Λ)) ∧
    (∀ lam : ℕ → ℕ → ℝ,
      (∀ b k, 2 ≤ k → k ≤ b → 0 ≤ lam b k) →
      Consistent lam →
      ∃! Λ : Measure ℝ,
        IsFiniteMeasure Λ ∧ Λ (Set.Icc (0 : ℝ) 1)ᶜ = 0 ∧
          ∀ b k, 2 ≤ k → k ≤ b → lam b k = lamOf Λ b k) := by sorry

end LambdaCoalescent.Rates
Source
Pitman, Coalescents with multiple collisions, Ann. Probab. 27 (1999), p. 1882, Lemma 18, second sentence; eq. (1)
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