Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9, pp. 1876–1877 — for 0 ≤ α < 1, θ > −α an exchangeable random partition with EPF p_{α,θ} of (15) exists

Proved
LambdaCoalescent.CoagFrag.lemma_9_exists

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

ewens-sampling-formulaexchangeable-partitionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-dirichlet

Let 0≤α<10\le\alpha<10≤α<1 and θ>−α\theta>-\alphaθ>−α (condition (14)). For n1,…,nk≥1n_1,\dots,n_k\ge1n1​,…,nk​≥1 with n=n1+⋯+nkn=n_1+\dots+n_kn=n1​+⋯+nk​, let

pα,θ(n1,…,nk)=[θ/α]k[θ]n∏i=1k−[−α]ni,[x]m=∏i=1m(x+i−1),p_{\alpha,\theta}(n_1,\dots,n_k)=\frac{[\theta/\alpha]_k}{[\theta]_n}\prod_{i=1}^{k}-[-\alpha]_{n_i},\qquad [x]_m=\prod_{i=1}^{m}(x+i-1),pα,θ​(n1​,…,nk​)=[θ]n​[θ/α]k​​i=1∏k​−[−α]ni​​,[x]m​=i=1∏m​(x+i−1),

with the factors of θ\thetaθ and α\alphaα cancelled before evaluation when α=0\alpha=0α=0 or θ=0\theta=0θ=0. Then there is a probability measure μ\muμ on the space P∞\mathcal P_\inftyP∞​ of partitions of N\mathbb NN such that for every nnn and every partition {B1,…,Bk}\{B_1,\dots,B_k\}{B1​,…,Bk​} of [n][n][n],

μ{π∈P∞:Rnπ={B1,…,Bk}}=pα,θ(∣B1∣,…,∣Bk∣).\mu\{\pi\in\mathcal P_\infty: R_n\pi=\{B_1,\dots,B_k\}\}=p_{\alpha,\theta}(|B_1|,\dots,|B_k|).μ{π∈P∞​:Rn​π={B1​,…,Bk​}}=pα,θ​(∣B1​∣,…,∣Bk​∣).

In words: an exchangeable random partition of N\mathbb NN with EPF (15), an (α,θ)(\alpha,\theta)(α,θ) partition, exists.

This is the existence part of Lemma 9, the two-parameter family of exchangeable partitions (Ewens' family for α=0\alpha=0α=0). It guarantees that the hypotheses of Theorem 12, four laws with prescribed (α,θ)(\alpha,\theta)(α,θ) EPFs, can be met.

Formalization Note Only the existence of a law with EPF (15) is formalized. The rest of Lemma 9 (the block frequencies in order of least elements are strictly positive, sum to 111 and have the stick-breaking form (12) with independent beta(1−α,θ+nα)(1-\alpha,\theta+n\alpha)(1−α,θ+nα) factors (13), and the converse) is not stated. Lemma 9 is cited by the paper from [32], [33]. The EPF is the cancelled form fixed in the Setting module.

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

open MeasureTheory

theorem lemma_9_exists (α θ : ℝ) (hα0 : 0 ≤ α) (hα1 : α < 1) (hθ : -α < θ) :
    ∃ μ : Measure LambdaCoalescent.Rates.PInf, IsProbabilityMeasure μ ∧ IsEPFLaw (pdEPF α θ) μ := by sorry

end LambdaCoalescent.CoagFrag
Source
Pitman, Coalescents with multiple collisions, Ann. Probab. 27 (1999), pp. 1876–1877, Lemma 9, (14), (15), and the paragraph after it
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