Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 12, p. 1898 — sharper form: for parameters in PAR the coagulation and fragmentation joint laws agree iff (64)

Proved
LambdaCoalescent.CoagFrag.theorem_12_sharp

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

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

Let PAR={(α,θ):0≤α<1, θ>−α}\mathrm{PAR}=\{(\alpha,\theta):0\le\alpha<1,\ \theta>-\alpha\}PAR={(α,θ):0≤α<1, θ>−α} and let (α,θ)(\alpha,\theta)(α,θ), (αc,θc)(\alpha_c,\theta_c)(αc​,θc​), (α1,θ1)(\alpha_1,\theta_1)(α1​,θ1​), (αf,θf)(\alpha_f,\theta_f)(αf​,θf​) lie in PAR. Consider the joint law of (Π,Π′)(\Pi,\Pi')(Π,Π′) defined by

  1. Π\PiΠ is an (α,θ)(\alpha,\theta)(α,θ) partition and Π′\Pi'Π′ is an (αc,θc)(\alpha_c,\theta_c)(αc​,θc​)-coagulation of Π\PiΠ,

and the joint law of (Π,Π′)(\Pi,\Pi')(Π,Π′) defined instead by

  1. Π′\Pi'Π′ is an (α1,θ1)(\alpha_1,\theta_1)(α1​,θ1​) partition and Π\PiΠ is an (αf,θf)(\alpha_f,\theta_f)(αf​,θf​)-fragmentation of Π′\Pi'Π′.

These two joint laws are identical if and only if the parameters are of the form allowed in Theorem 12, that is

αf=α;θf=−α1=−ααc;θc=θ/α,θ1=θ.(64)\alpha_f=\alpha;\qquad \theta_f=-\alpha_1=-\alpha\alpha_c;\qquad \theta_c=\theta/\alpha,\qquad \theta_1=\theta.\tag{64}αf​=α;θf​=−α1​=−ααc​;θc​=θ/α,θ1​=θ.(64)

The "if" direction is Theorem 12 with β=αc\beta=\alpha_cβ=αc​; the "only if" direction shows that the parameters of Theorem 12 are the only ones within the two-parameter family for which the coagulation of an (α,θ)(\alpha,\theta)(α,θ) partition is undone by a fragmentation.

Formalization Note The left side quantifies over all probability laws μ,ν,ρ,κ\mu,\nu,\rho,\kappaμ,ν,ρ,κ on P∞\mathcal P_\inftyP∞​ with EPFs pα,θp_{\alpha,\theta}pα,θ​, pαc,θcp_{\alpha_c,\theta_c}pαc​,θc​​, pα1,θ1p_{\alpha_1,\theta_1}pα1​,θ1​​, pαf,θfp_{\alpha_f,\theta_f}pαf​,θf​​ (they exist by Lemma 9, so the quantifier is not vacuous) and states equality of the two joint laws exactly as in Theorem 12. In (64) the relation θc=θ/α\theta_c=\theta/\alphaθc​=θ/α is written multiplicatively, αθc=θ\alpha\theta_c=\thetaαθc​=θ, so that no division by α\alphaα occurs when α=0\alpha=0α=0 (allowed by PAR); for α>0\alpha>0α>0 the two forms coincide, and for α=0\alpha=0α=0 the page's θ/α\theta/\alphaθ/α is undefined. EPFs are in the cancelled form of the Setting module.

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

open MeasureTheory

theorem theorem_12_sharp (α θ αc θc α₁ θ₁ αf θf : ℝ)
    (hα0 : 0 ≤ α) (hα1 : α < 1) (hθ : -α < θ)
    (hαc0 : 0 ≤ αc) (hαc1 : αc < 1) (hθc : -αc < θc)
    (hα₁0 : 0 ≤ α₁) (hα₁1 : α₁ < 1) (hθ₁ : -α₁ < θ₁)
    (hαf0 : 0 ≤ αf) (hαf1 : αf < 1) (hθf : -αf < θf) :
    (∀ (μ ν ρ κ : Measure LambdaCoalescent.Rates.PInf) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν]
        [IsProbabilityMeasure ρ] [IsProbabilityMeasure κ],
        IsEPFLaw (pdEPF α θ) μ → IsEPFLaw (pdEPF αc θc) ν →
        IsEPFLaw (pdEPF α₁ θ₁) ρ → IsEPFLaw (pdEPF αf θf) κ →
        ∀ 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}) ↔
      (αf = α ∧ θf = -α₁ ∧ α₁ = α * αc ∧ α * θc = θ ∧ θ₁ = θ) := by sorry

end LambdaCoalescent.CoagFrag
Source
Pitman, Coalescents with multiple collisions, Ann. Probab. 27 (1999), p. 1898, proof of Theorem 12, definition of PAR and the italicized sharper form with (64)
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