Lemma 18 — consistency iff adjacent merger rates add
ProvedLambdaCoalescent.Rates.lemma_18_consistent_iffcoalescentexchangeable-partitionlambda-coalescentmarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be the rate for each unordered -tuple of blocks to merge when there are blocks, for . The associated finite coalescent chains are consistent under restriction exactly when
This local identity is the rate-level criterion behind the existence characterization in Theorem 1.
Formalization Note Consistency is expressed by equality of the finite chains’ semigroup transition probabilities after restriction, for all times and initial states.
Preamble
import Definitions.Def_LambdaCoalescent_Rates_Setting
Formal statement
namespace LambdaCoalescent.Rates
/-- Lemma 18, p. 1882, equivalence (22). -/
theorem lemma_18_consistent_iff (lam : ℕ → ℕ → ℝ)
(hlam : ∀ b k, 2 ≤ k → k ≤ b → 0 ≤ lam b k) :
Consistent lam ↔
∀ b k, 2 ≤ k → k ≤ b →
lam b k = lam (b + 1) k + lam (b + 1) (k + 1) := by sorry
end LambdaCoalescent.Rates
Source
Pitman, Coalescents with multiple collisions, Ann. Probab. 27 (1999), p. 1882, Lemma 18, eq. (22)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.