Lemma 35, p. 1898 — Π¹ is a p̂-fragmentation of Π² with law p₂ iff P(Π¹_n = π¹, Π²_n = π²) = ∏ p̂(a_{i,1},…,a_{i,j_i}) p₂(b₁,…,b_k)
ProvedLambdaCoalescent.CoagFrag.lemma_35Let be two random partitions of on a probability space , with restrictions to . Let and be EPFs of exchangeable laws and on . The following are equivalent.
- has law , and given , is distributed as the fragmentation of whose restriction to the -th block of is that of , for independent with law (the kernel -FRAG of Definition 11). Equivalently, for every measurable ,
- For every and every pair , of partitions of such that refines , obtained by breaking each into blocks of sizes ,
This is the fragmentation analogue of Lemma 34; together they reduce Theorem 12 to an identity between EPFs.
Formalization Note As in Lemma 34, condition (i) is the equality of joint laws through (outer) measures of preimages of measurable sets, with the clause " has law " kept. The fragmenting partitions are one sample from the infinite product (Measure.infinitePi), so they are independent and identically distributed; is Lean's Γ (m-1), applied to the block of 0-based index in order of least elements. (63) is required only for refining pairs, as on the page. The nested sizes are a multiset of multisets, and being symmetric.
import Mathlib import Definitions.Def_LambdaCoalescent_CoagFrag_Setting
namespace LambdaCoalescent.CoagFrag
open MeasureTheory
theorem lemma_35 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(X₁ X₂ : Ω → LambdaCoalescent.Rates.PInf) (hX₁ : Measurable X₁) (hX₂ : Measurable X₂)
(p₂ phat : Multiset ℕ → ℝ) (μ₂ νhat : Measure LambdaCoalescent.Rates.PInf)
[IsProbabilityMeasure μ₂] [IsProbabilityMeasure νhat]
(hμ₂ : IsEPFLaw p₂ μ₂) (hνhat : IsEPFLaw phat νhat) :
(P.map X₂ = μ₂ ∧
∀ S : Set (LambdaCoalescent.Rates.PInf × LambdaCoalescent.Rates.PInf), MeasurableSet S →
P {ω | (X₁ ω, X₂ ω) ∈ S} =
(μ₂.prod (Measure.infinitePi (fun _ : ℕ => νhat))) {y | (frag y.1 y.2, y.1) ∈ S}) ↔
∀ (n : ℕ) (π₁ π₂ : Setoid (Fin n)), π₁ ≤ π₂ →
P.real {ω | restrict n (X₁ ω) = π₁ ∧ restrict n (X₂ ω) = π₂} =
((fragSizes π₁ π₂).map phat).prod * p₂ (blockSizes π₂) := by sorry
end LambdaCoalescent.CoagFrag
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.