Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 34, p. 1897 — Π² is a p-coagulation of Π¹ with law p₁ iff P(Π¹_n = π¹, Π²_n = π²) = p₁(a₁,…,a_K) p(j₁,…,j_k)

Proved
LambdaCoalescent.CoagFrag.lemma_34

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

coagulationexchangeable-partitionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Π∞1,Π∞2\Pi^1_\infty,\Pi^2_\inftyΠ∞1​,Π∞2​ be two random partitions of N\mathbb NN on a probability space (Ω,P)(\Omega,\mathbb P)(Ω,P), with restrictions Πni=RnΠ∞i\Pi^i_n=R_n\Pi^i_\inftyΠni​=Rn​Π∞i​ to [n][n][n]. Let p1p_1p1​ and ppp be EPFs of exchangeable laws μ1\mu_1μ1​ and ν\nuν on P∞\mathcal P_\inftyP∞​. The following are equivalent.

  1. Π∞1\Pi^1_\inftyΠ∞1​ has law μ1\mu_1μ1​, and given Π∞1=π\Pi^1_\infty=\piΠ∞1​=π, Π∞2\Pi^2_\inftyΠ∞2​ is distributed as the γ\gammaγ-coagulation of π\piπ for γ∼ν\gamma\sim\nuγ∼ν (the kernel ppp-COAG(π,⋅)(\pi,\cdot)(π,⋅) of Definition 5). Equivalently, for every measurable S⊆P∞×P∞S\subseteq\mathcal P_\infty\times\mathcal P_\inftyS⊆P∞​×P∞​,
P((Π∞1,Π∞2)∈S)=(μ1⊗ν){(π,γ):(π, γ-coagulation of π)∈S}.\mathbb P\big((\Pi^1_\infty,\Pi^2_\infty)\in S\big)=(\mu_1\otimes\nu)\{(\pi,\gamma): (\pi,\ \gamma\text{-coagulation of }\pi)\in S\}.P((Π∞1​,Π∞2​)∈S)=(μ1​⊗ν){(π,γ):(π, γ-coagulation of π)∈S}.
  1. For every n≥1n\ge1n≥1 and every pair π1={A1,…,AK}\pi^1=\{A_1,\dots,A_K\}π1={A1​,…,AK​}, π2={B1,…,Bk}\pi^2=\{B_1,\dots,B_k\}π2={B1​,…,Bk​} of partitions of [n][n][n] such that π1\pi^1π1 refines π2\pi^2π2, with ji=#{ℓ:Aℓ⊆Bi}j_i=\#\{\ell:A_\ell\subseteq B_i\}ji​=#{ℓ:Aℓ​⊆Bi​} and aℓ=∣Aℓ∣a_\ell=|A_\ell|aℓ​=∣Aℓ​∣,
P(Πn1=π1, Πn2=π2)=p1(a1,…,aK) p(j1,…,jk).(62)\mathbb P(\Pi^1_n=\pi^1,\ \Pi^2_n=\pi^2)=p_1(a_1,\dots,a_K)\,p(j_1,\dots,j_k).\tag{62}P(Πn1​=π1, Πn2​=π2)=p1​(a1​,…,aK​)p(j1​,…,jk​).(62)

The lemma turns the coagulation kernel into a closed formula for the finite-dimensional joint laws; together with Lemma 35 it reduces Theorem 12 to an identity between EPFs.

Formalization Note The conditional law "for all π∈P∞\pi\in\mathcal P_\inftyπ∈P∞​" is meaningful only almost surely, so condition (i) is stated as the equality of the joint law of (Π1,Π2)(\Pi^1,\Pi^2)(Π1,Π2) with the law of (π,γ-coag of π)(\pi,\gamma\text{-coag of }\pi)(π,γ-coag of π) under μ1⊗ν\mu_1\otimes\nuμ1​⊗ν, through (outer) measures of preimages of measurable sets; the clause "Π1\Pi^1Π1 has law μ1\mu_1μ1​" is kept as on the page. "Exchangeable with distribution p1p_1p1​" is IsEPFLaw p₁ μ₁ for a probability measure μ₁. The random partitions are measurable maps Ω→P∞\Omega\to\mathcal P_\inftyΩ→P∞​. As on the page, (62) is required only for refining pairs; that the other pairs have probability 000 follows from the total mass. Refinement is Mathlib's order on equivalence relations (π1≤π2\pi^1\le\pi^2π1≤π2: every π1\pi^1π1-relation is a π2\pi^2π2-relation). (aℓ)(a_\ell)(aℓ​) and (ji)(j_i)(ji​) are multisets (p1p_1p1​, ppp are symmetric). Labels are 0-based (see the Setting module).

Preamble
import Mathlib
import Definitions.Def_LambdaCoalescent_CoagFrag_Setting
Formal statement
namespace LambdaCoalescent.CoagFrag

open MeasureTheory

theorem lemma_34 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (X₁ X₂ : Ω → LambdaCoalescent.Rates.PInf) (hX₁ : Measurable X₁) (hX₂ : Measurable X₂)
    (p₁ p : Multiset ℕ → ℝ) (μ₁ ν : Measure LambdaCoalescent.Rates.PInf) [IsProbabilityMeasure μ₁] [IsProbabilityMeasure ν]
    (hμ₁ : IsEPFLaw p₁ μ₁) (hν : IsEPFLaw p ν) :
    (P.map X₁ = μ₁ ∧
        ∀ S : Set (LambdaCoalescent.Rates.PInf × LambdaCoalescent.Rates.PInf), MeasurableSet S →
          P {ω | (X₁ ω, X₂ ω) ∈ S} = (μ₁.prod ν) {x | (x.1, coag x.1 x.2) ∈ S}) ↔
      ∀ (n : ℕ) (π₁ π₂ : Setoid (Fin n)), π₁ ≤ π₂ →
        P.real {ω | restrict n (X₁ ω) = π₁ ∧ restrict n (X₂ ω) = π₂} =
          p₁ (blockSizes π₁) * p (coagCounts π₁ π₂) := by sorry

end LambdaCoalescent.CoagFrag
Source
Pitman, Coalescents with multiple collisions, Ann. Probab. 27 (1999), p. 1897, Lemma 34, (62)
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