(2.5), p. 647 — first-step decomposition of the b.p.i.: P_F(A_{n+1} ∩ C(η) = ∅) = Σ P_{⋃ N_{i,k_i}}(A_n ∩ C(η) = ∅) ∏ f_i(k_i)
ProvedHolleyLiggett.Duality.eq_2_5branching-process-with-interferencedualitymarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be the discrete-time branching process with interference determined by (with ) and on a countable site set . For every , every configuration and every finite ,
the sum over all sequences of nonnegative integers. The factor is the probability that the particle at each chooses the set at the first step.
This conditions on the first step of the b.p.i.; it is the b.p.i. half of the induction step in the proof of Theorem (1.6).
Formalization Note. The -step probabilities of the b.p.i. are defined by the last-step recursion , so this first-step identity is a genuine statement (it is the Chapman–Kolmogorov equation), not an unfolding of the definition.
Preamble
import Mathlib import Definitions.Def_HolleyLiggett_Duality_Setting
Formal statement
namespace HolleyLiggett.Duality
open MeasureTheory ProbabilityTheory
open scoped ENNReal NNReal
/-- (2.5): `P_F(A_{n+1} ∩ C(η) = ∅) = Σ P_{⋃_{i∈F} N_{i,k_i}}(A_n ∩ C(η) = ∅) P(X_{i,1} = k_i ∀ i ∈ F)`,
the sum over all sequences `(k_i)_{i∈F}`. -/
theorem eq_2_5 {I : Type*} [Countable I] [DecidableEq I] (N : I → ℕ → Finset I)
(hN0 : ∀ i, N i 0 = ∅) (f : I → PMF ℕ)
(n : ℕ) (η : Config I) (F : Finset I) :
dualProb N f (n + 1) F η =
∑' k : (↥F → ℕ),
dualProb N f n (Finset.univ.biUnion (fun i : ↥F => N i (k i))) η * ∏ i : ↥F, f i (k i) := by sorry
end HolleyLiggett.Duality
Source
Holley and Liggett, Ergodic theorems for weakly interacting infinite systems and the voter model, Ann. Probab. 3 (1975), p. 647, (2.5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.