Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(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)

Proved
HolleyLiggett.Duality.eq_2_5

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

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

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

PF(An+1∩C(η)=∅)=∑(ki)i∈FP⋃i∈FNi,ki(An∩C(η)=∅) ∏i∈Ffi(ki),P_F(A_{n+1}\cap C(\eta)=\emptyset)=\sum_{(k_i)_{i\in F}}P_{\bigcup_{i\in F}N_{i,k_i}}(A_n\cap C(\eta)=\emptyset)\,\prod_{i\in F}f_i(k_i),PF​(An+1​∩C(η)=∅)=(ki​)i∈F​∑​P⋃i∈F​Ni,ki​​​(An​∩C(η)=∅)i∈F∏​fi​(ki​),

the sum over all sequences (ki)i∈F(k_i)_{i\in F}(ki​)i∈F​ of nonnegative integers. The factor ∏i∈Ffi(ki)\prod_{i\in F}f_i(k_i)∏i∈F​fi​(ki​) is the probability that the particle at each i∈Fi\in Fi∈F chooses the set Ni,kiN_{i,k_i}Ni,ki​​ 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 nnn-step probabilities of the b.p.i. are defined by the last-step recursion PF(An+1=B)=∑GPF(An=G)Q~(G,B)P_F(A_{n+1}=B)=\sum_G P_F(A_n=G)\tilde Q(G,B)PF​(An+1​=B)=∑G​PF​(An​=G)Q~​(G,B), 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
  • 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