Proof of Lemma 18 — adjacent restrictions suffice for consistency
ProvedLambdaCoalescent.Rates.consistent_of_succcoalescentexchangeable-partitionlambda-coalescentmarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let for every . Suppose that, for every , every starting partition of , every target partition of , and every , restricting the -label chain gives the same time- transition probability as the -label chain. Then the chains are consistent under every restriction from with :
with the initial states related by restriction. This reduces the consistency check in Lemma 18 to adjacent sizes.
Formalization Note The hypothesis and conclusion use semigroup transition probabilities from every starting state. These determine the full finite-dimensional laws of the Markov chains.
Preamble
import Definitions.Def_LambdaCoalescent_Rates_Setting
Formal statement
namespace LambdaCoalescent.Rates
open MeasureTheory
/-- Proof of Lemma 18, p. 1882: checking one added label suffices. -/
theorem consistent_of_succ (lam : ℕ → ℕ → ℝ)
(hlam : ∀ b k, 2 ≤ k → k ≤ b → 0 ≤ lam b k)
(hsucc : ∀ (n : ℕ) (π : Setoid (Fin (n + 1))) (σ : Setoid (Fin n))
(t : ℝ), 0 ≤ t →
(∑ π' : Setoid (Fin (n + 1)),
if restrictLE (Nat.le_succ n) π' = σ then
NormedSpace.exp (t • rateMatrix lam (n + 1)) π π' else 0) =
NormedSpace.exp (t • rateMatrix lam n)
(restrictLE (Nat.le_succ n) π) σ) :
Consistent lam := by sorry
end LambdaCoalescent.Rates
Source
Pitman, Coalescents with multiple collisions, Ann. Probab. 27 (1999), p. 1882, proof of Lemma 18, “it suffices to consider m = n + 1”
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.