Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 12, p. 1878 — an (α, θ) partition coagulated by (β, θ/α) has the joint law of an (αβ, θ) partition fragmented by (α, −αβ)

Proved
LambdaCoalescent.CoagFrag.theorem_12

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

coagulationexchangeable-partitionfragmentationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-dirichlet

Let 0<α<10<\alpha<10<α<1, 0≤β<10\le\beta<10≤β<1 and θ>−αβ\theta>-\alpha\betaθ>−αβ. For a pair (Π,Π′)(\Pi,\Pi')(Π,Π′) of random partitions of N\mathbb NN the following conditions are equivalent:

  1. Π\PiΠ is an (α,θ)(\alpha,\theta)(α,θ) partition and Π′\Pi'Π′ is a (β,θ/α)(\beta,\theta/\alpha)(β,θ/α)-coagulation of Π\PiΠ;
  2. Π′\Pi'Π′ is an (αβ,θ)(\alpha\beta,\theta)(αβ,θ) partition and Π\PiΠ is an (α,−αβ)(\alpha,-\alpha\beta)(α,−αβ)-fragmentation of Π′\Pi'Π′.

Here an (α,θ)(\alpha,\theta)(α,θ) partition is an exchangeable random partition with EPF pα,θp_{\alpha,\theta}pα,θ​ of (15); Π′\Pi'Π′ is a (β,θ/α)(\beta,\theta/\alpha)(β,θ/α)-coagulation of Π\PiΠ if, given Π=π\Pi=\piΠ=π, Π′\Pi'Π′ is the γ\gammaγ-coagulation of π\piπ for an independent γ\gammaγ with law pβ,θ/αp_{\beta,\theta/\alpha}pβ,θ/α​ (Definition 5); and Π\PiΠ is an (α,−αβ)(\alpha,-\alpha\beta)(α,−αβ)-fragmentation of Π′\Pi'Π′ if, given Π′=π′\Pi'=\pi'Π′=π′, Π\PiΠ is obtained by restricting independent partitions Γ(1),Γ(2),…\Gamma^{(1)},\Gamma^{(2)},\dotsΓ(1),Γ(2),… with law pα,−αβp_{\alpha,-\alpha\beta}pα,−αβ​ to the successive blocks of π′\pi'π′ (Definition 11).

Since each condition fixes the joint law of (Π,Π′)(\Pi,\Pi')(Π,Π′), the theorem says that two measures on P∞×P∞\mathcal P_\infty\times\mathcal P_\inftyP∞​×P∞​ coincide: if μ,ν,ρ,κ\mu,\nu,\rho,\kappaμ,ν,ρ,κ are the laws with EPFs pα,θp_{\alpha,\theta}pα,θ​, pβ,θ/αp_{\beta,\theta/\alpha}pβ,θ/α​, pαβ,θp_{\alpha\beta,\theta}pαβ,θ​, pα,−αβp_{\alpha,-\alpha\beta}pα,−αβ​, then for every measurable S⊆P∞×P∞S\subseteq\mathcal P_\infty\times\mathcal P_\inftyS⊆P∞​×P∞​,

(μ⊗ν){(π,γ):(π, γ-coag of π)∈S}=(ρ⊗κ⊗N){(π′,Γ):(Γ-frag of π′, π′)∈S}.(\mu\otimes\nu)\{(\pi,\gamma):(\pi,\ \gamma\text{-coag of }\pi)\in S\}=\big(\rho\otimes\kappa^{\otimes\mathbb N}\big)\{(\pi',\Gamma):(\Gamma\text{-frag of }\pi',\ \pi')\in S\}.(μ⊗ν){(π,γ):(π, γ-coag of π)∈S}=(ρ⊗κ⊗N){(π′,Γ):(Γ-frag of π′, π′)∈S}.

The theorem describes one joint law of a pair of exchangeable partitions, Π\PiΠ refining Π′\Pi'Π′, from both ends; with β=0\beta=0β=0 it links the (α,θ)(\alpha,\theta)(α,θ) family to Ewens' (0,θ)(0,\theta)(0,θ) family, and through Kingman's correspondence it gives the Poisson–Dirichlet statement of Corollary 13.

Formalization Note "(i) ⇔\Leftrightarrow⇔ (ii) for every pair (Π,Π′)(\Pi,\Pi')(Π,Π′)" is the equality of the two joint laws: each condition determines the joint law (conditional laws given Π=π\Pi=\piΠ=π are meaningful only almost surely, so the conditions are encoded through joint laws), and each law is realized on the canonical space, so the equivalence for all pairs and the equality of laws imply each other. The equality is stated through (outer) measures of preimages of measurable sets. The four laws exist by Lemma 9, so the hypotheses are not vacuous; all four parameter pairs satisfy (14) under the hypotheses (θ/α>−β\theta/\alpha>-\betaθ/α>−β, −αβ>−α-\alpha\beta>-\alpha−αβ>−α). θ/α\theta/\alphaθ/α is a real division with α>0\alpha>0α>0. The fragmenting partitions are an i.i.d. sequence, one sample of Measure.infinitePi (fun _ => κ), indexed from 000 in the order of least elements of the blocks of Π′\Pi'Π′. EPFs are in the cancelled form of the Setting module, which matters at β=0\beta=0β=0.

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

open MeasureTheory

theorem theorem_12 (α β θ : ℝ) (hα0 : 0 < α) (hα1 : α < 1) (hβ0 : 0 ≤ β) (hβ1 : β < 1)
    (hθ : -(α * β) < θ)
    (μ ν ρ κ : Measure LambdaCoalescent.Rates.PInf) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν]
    [IsProbabilityMeasure ρ] [IsProbabilityMeasure κ]
    (hμ : IsEPFLaw (pdEPF α θ) μ) (hν : IsEPFLaw (pdEPF β (θ / α)) ν)
    (hρ : IsEPFLaw (pdEPF (α * β) θ) ρ) (hκ : IsEPFLaw (pdEPF α (-(α * β))) κ) :
    ∀ S : Set (LambdaCoalescent.Rates.PInf × LambdaCoalescent.Rates.PInf), MeasurableSet S →
      (μ.prod ν) {x | (x.1, coag x.1 x.2) ∈ S} =
        (ρ.prod (Measure.infinitePi (fun _ : ℕ => κ))) {y | (frag y.1 y.2, y.1) ∈ S} := by sorry

end LambdaCoalescent.CoagFrag
Source
Pitman, Coalescents with multiple collisions, Ann. Probab. 27 (1999), p. 1878, Theorem 12 (with Definitions 5, 11 and the (α, θ) notation of p. 1878)
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