(2.4), p. 647 — one step of the b.p.i.: P_F(A₁ ∩ C(η) = ∅) = Σ′ ∏_{i∈F} f_i(k_i) over N_{i,k_i} ∩ C(η) = ∅
ProvedHolleyLiggett.Duality.eq_2_4branching-process-with-interferencedualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be the discrete-time branching process with interference determined by the finite sets (with ) and the distributions on a countable site set . For every configuration and every finite set ,
where runs over the same sequences as in (2.3): those with for every .
Together with (2.3) this proves the duality relation (1.7) for .
Formalization Note. with the one-step probabilities of the chain with transition function (1.4). The right side is written out in full, not by reference to (2.3).
Preamble
import Mathlib import Definitions.Def_HolleyLiggett_Duality_Setting
Formal statement
namespace HolleyLiggett.Duality
open MeasureTheory ProbabilityTheory
open scoped ENNReal NNReal
open Classical in
/-- (2.4): `P_F(A_1 ∩ C(η) = ∅) = Σ′ ∏_{i∈F} f_i(k_i)`, the sum over the same sequences as in (2.3). -/
theorem eq_2_4 {I : Type*} [Countable I] [DecidableEq I] (N : I → ℕ → Finset I)
(hN0 : ∀ i, N i 0 = ∅) (f : I → PMF ℕ)
(η : Config I) (F : Finset I) :
dualProb N f 1 F η =
∑' k : (↥F → ℕ),
(if ∀ i : ↥F, Disjoint (N i (k i) : Set I) (occupied η) then ∏ i : ↥F, f i (k i) else 0) := 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.4)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.