Lemma 34, p. 1897 — Π² is a p-coagulation of Π¹ with law p₁ iff P(Π¹_n = π¹, Π²_n = π²) = p₁(a₁,…,a_K) p(j₁,…,j_k)
ProvedLambdaCoalescent.CoagFrag.lemma_34Let 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 -coagulation of for (the kernel -COAG of Definition 5). Equivalently, for every measurable ,
- For every and every pair , of partitions of such that refines , with and ,
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 " is meaningful only almost surely, so condition (i) is stated as the equality of the joint law of with the law of under , through (outer) measures of preimages of measurable sets; the clause " has law " is kept as on the page. "Exchangeable with distribution " is IsEPFLaw p₁ μ₁ for a probability measure μ₁. The random partitions are measurable maps . As on the page, (62) is required only for refining pairs; that the other pairs have probability follows from the total mass. Refinement is Mathlib's order on equivalence relations (: every -relation is a -relation). and are multisets (, are symmetric). Labels are 0-based (see the Setting module).
import Mathlib import Definitions.Def_LambdaCoalescent_CoagFrag_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.