Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(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(η) = ∅

Proved
HolleyLiggett.Duality.eq_2_4

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

branching-process-with-interferencedualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let AnA_nAn​ be the discrete-time branching process with interference determined by the finite sets {Ni,k}\{N_{i,k}\}{Ni,k​} (with Ni,0=∅N_{i,0}=\emptysetNi,0​=∅) and the distributions {fi}\{f_i\}{fi​} on a countable site set III. For every configuration η∈S\eta\in Sη∈S and every finite set F⊂IF\subset IF⊂I,

PF(A1∩C(η)=∅)=∑′∏i∈Ffi(ki),P_F(A_1\cap C(\eta)=\emptyset)=\sum{}'\prod_{i\in F}f_i(k_i),PF​(A1​∩C(η)=∅)=∑′i∈F∏​fi​(ki​),

where ∑′\sum'∑′ runs over the same sequences as in (2.3): those (ki)i∈F(k_i)_{i\in F}(ki​)i∈F​ with Ni,ki∩C(η)=∅N_{i,k_i}\cap C(\eta)=\emptysetNi,ki​​∩C(η)=∅ for every i∈Fi\in Fi∈F.

Together with (2.3) this proves the duality relation (1.7) for n=1n=1n=1.

Formalization Note. PF(A1∩C(η)=∅)=∑BPF(A1=B) 1[B∩C(η)=∅]P_F(A_1\cap C(\eta)=\emptyset)=\sum_{B}P_F(A_1=B)\,\mathbf 1[B\cap C(\eta)=\emptyset]PF​(A1​∩C(η)=∅)=∑B​PF​(A1​=B)1[B∩C(η)=∅] with the one-step probabilities PF(A1=B)P_F(A_1=B)PF​(A1​=B) 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
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me