Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 18 — adjacent restrictions suffice for consistency

Proved
LambdaCoalescent.Rates.consistent_of_succ

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}\ge 0λb,k​≥0 for every 2≤k≤b2\le k\le b2≤k≤b. Suppose that, for every nnn, every starting partition of [n+1][n+1][n+1], every target partition of [n][n][n], and every t≥0t\ge0t≥0, restricting the (n+1)(n+1)(n+1)-label chain gives the same time-ttt transition probability as the nnn-label chain. Then the chains are consistent under every restriction RnR_nRn​ from [m][m][m] with n<mn<mn<m:

Rn(Πm)=dΠn(n<m),R_n(\Pi_m)\mathrel{\overset{d}{=}}\Pi_n\quad(n<m),Rn​(Πm​)=dΠn​(n<m),

with the initial states related by restriction. This reduces the consistency check in Lemma 18 to adjacent sizes.

Formalization Note The hypothesis and conclusion use semigroup transition probabilities from every starting state. These determine the full finite-dimensional laws of the Markov chains.

Preamble
import Definitions.Def_LambdaCoalescent_Rates_Setting
Formal statement
namespace LambdaCoalescent.Rates

open MeasureTheory

/-- Proof of Lemma 18, p. 1882: checking one added label suffices. -/
theorem consistent_of_succ (lam : ℕ → ℕ → ℝ)
    (hlam : ∀ b k, 2 ≤ k → k ≤ b → 0 ≤ lam b k)
    (hsucc : ∀ (n : ℕ) (π : Setoid (Fin (n + 1))) (σ : Setoid (Fin n))
      (t : ℝ), 0 ≤ t →
        (∑ π' : Setoid (Fin (n + 1)),
          if restrictLE (Nat.le_succ n) π' = σ then
            NormedSpace.exp (t • rateMatrix lam (n + 1)) π π' else 0) =
        NormedSpace.exp (t • rateMatrix lam n)
          (restrictLE (Nat.le_succ n) π) σ) :
    Consistent lam := by sorry

end LambdaCoalescent.Rates
Source
Pitman, Coalescents with multiple collisions, Ann. Probab. 27 (1999), p. 1882, proof of Lemma 18, “it suffices to consider m = n + 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