Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.1, p. 981 — a contact process with (2d − 1)λ_k < kμ, k = 1, …, 2d, dies out: p_∞(ξ) = 0 for finite ξ

Proved
HarrisContact.Extinction.theorem_7_1

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

contact-processextinctionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let {ξt}\{\xi_t\}{ξt​} be a contact process on ZdZ_dZd​, d≥1d\ge1d≥1: each infected site recovers at rate μ≥0\mu\ge0μ≥0, and each healthy site with kkk infected neighbours becomes infected at rate λk≥0\lambda_k\ge0λk​≥0, with λ0=0\lambda_0=0λ0​=0. Suppose

(2d−1)λk<kμ,k=1,2,…,2d.(2d-1)\lambda_k<k\mu,\qquad k=1,2,\dots,2d .(2d−1)λk​<kμ,k=1,2,…,2d.

Then for every finite initial set ξ⊂Zd\xi\subset Z_dξ⊂Zd​,

p∞(ξ)=lim⁡t→∞Pξ{ξt≠∅}=0,p_\infty(\xi)=\lim_{t\to\infty}P_\xi\{\xi_t\neq\varnothing\}=0,p∞​(ξ)=t→∞lim​Pξ​{ξt​=∅}=0,

that is, the process dies out almost surely.

This is Harris's sufficient condition for extinction of the contact process; for the linear case λk=kλ\lambda_k=k\lambdaλk​=kλ, μ=1\mu=1μ=1 it reads (2d−1)λ<1(2d-1)\lambda<1(2d−1)λ<1. In the linear case it bounds the critical infection rate of the contact process from below by 1/(2d−1)1/(2d-1)1/(2d−1).

Formalization Note The process is the countable-state chain on finite subsets with rates (4.4)–(4.5), and p∞(ξ)=inf⁡t≥0(1−Pt(ξ,∅))p_\infty(\xi)=\inf_{t\ge0}\bigl(1-P_t(\xi,\varnothing)\bigr)p∞​(ξ)=inft≥0​(1−Pt​(ξ,∅)) in [0,∞][0,\infty][0,∞], where PtP_tPt​ is the minimal transition function; so the conclusion is absorption at ∅\varnothing∅, not loss of mass. The condition is imposed for k=1,…,2dk=1,\dots,2dk=1,…,2d, the only indices that occur, and 2d−12d-12d−1 is the real number 2d−12d-12d−1. With k=1k=1k=1 the condition forces μ>0\mu>0μ>0.

Preamble
import Mathlib
import Definitions.Def_HarrisContact_Extinction_Model

open MeasureTheory Filter Topology
open scoped ENNReal NNReal
Formal statement
namespace HarrisContact.Extinction

/-- Theorem 7.1 (p. 981): if (2d − 1)λ_k < kμ for k = 1, …, 2d, then p_∞(ξ) = 0 for every
finite ξ. -/
theorem theorem_7_1 {d : ℕ} (hd : 1 ≤ d) (μ : ℝ) (lam : ℕ → ℝ) (hμ : 0 ≤ μ) (h0 : lam 0 = 0)
    (hlam : ∀ k, k ≤ 2 * d → 0 ≤ lam k)
    (hsub : ∀ k : ℕ, 1 ≤ k → k ≤ 2 * d → (2 * (d : ℝ) - 1) * lam k < k * μ) :
    ∀ ξ : Config d, survInf μ lam ξ = 0 := by sorry

end HarrisContact.Extinction
Source
Harris (Ann. Probab. 2, 1974), Theorem 7.1, p. 981
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