Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 18 — consistency iff adjacent merger rates add

Proved
LambdaCoalescent.Rates.lemma_18_consistent_iff

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

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

Let λb,k≥0\lambda_{b,k}\ge0λb,k​≥0 be the rate for each unordered kkk-tuple of blocks to merge when there are bbb blocks, for 2≤k≤b2\le k\le b2≤k≤b. The associated finite coalescent chains are consistent under restriction exactly when

λb,k=λb+1,k+λb+1,k+1(2≤k≤b).\lambda_{b,k}=\lambda_{b+1,k}+\lambda_{b+1,k+1}\qquad(2\le k\le b).λb,k​=λb+1,k​+λb+1,k+1​(2≤k≤b).

This local identity is the rate-level criterion behind the existence characterization in Theorem 1.

Formalization Note Consistency is expressed by equality of the finite chains’ semigroup transition probabilities after restriction, for all times and initial states.

Preamble
import Definitions.Def_LambdaCoalescent_Rates_Setting
Formal statement
namespace LambdaCoalescent.Rates

/-- Lemma 18, p. 1882, equivalence (22). -/
theorem lemma_18_consistent_iff (lam : ℕ → ℕ → ℝ)
    (hlam : ∀ b k, 2 ≤ k → k ≤ b → 0 ≤ lam b k) :
    Consistent lam ↔
      ∀ b k, 2 ≤ k → k ≤ b →
        lam b k = lam (b + 1) k + lam (b + 1) (k + 1) := by sorry

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