Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(7.4), p. 981 — for μ = 1, λ_k = kλ: π₂ − π₁ = (1 + (2d − 1)λ) Σ' r(ξ, ξ ∪ x)(p_∞(ξ ∪ x) − π₂) ≤ (π₂ − π₁)(2d − 1)λ

Proved
HarrisContact.Extinction.eq_7_4

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

contact-processfirst-step-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1submodularity

Consider the contact process on ZdZ_dZd​ (d≥1d\ge1d≥1) with μ=1\mu=1μ=1 and λk=kλ\lambda_k=k\lambdaλk​=kλ, λ≥0\lambda\ge0λ≥0, let rrr be the transition matrix of its imbedded jump chain, and write π1=p∞({x})\pi_1=p_\infty(\{x\})π1​=p∞​({x}), π2=p∞(ξ)\pi_2=p_\infty(\xi)π2​=p∞​(ξ) for a pair of neighbours ξ={x,y}\xi=\{x,y\}ξ={x,y}. Then

π2−π1=(1+(2d−1)λ)∑′ r(ξ,ξ∪z) (p∞(ξ∪z)−π2)≤(π2−π1)(2d−1)λ,\pi_2-\pi_1=(1+(2d-1)\lambda)\sum{}'\,r(\xi,\xi\cup z)\,\bigl(p_\infty(\xi\cup z)-\pi_2\bigr)\le(\pi_2-\pi_1)(2d-1)\lambda,π2​−π1​=(1+(2d−1)λ)∑′r(ξ,ξ∪z)(p∞​(ξ∪z)−π2​)≤(π2​−π1​)(2d−1)λ,

where ∑′\sum'∑′ is taken over the sites z∼ξz\sim\xiz∼ξ outside ξ\xiξ adjacent to it.

The equality comes from the first-step equation (7.3) for the pair; the inequality uses the submodularity of Theorem 6.2 in the form p∞(ξ∪z)−π2≤π2−π1p_\infty(\xi\cup z)-\pi_2\le\pi_2-\pi_1p∞​(ξ∪z)−π2​≤π2​−π1​. Together with (7.2) it yields (2d−1)λ≥1(2d-1)\lambda\ge1(2d−1)λ≥1 whenever π1>0\pi_1>0π1​>0.

Formalization Note The survival probabilities lie in [0,1][0,1][0,1] and are converted to real numbers so that the differences are ordinary real subtraction. The statement is made for every site xxx and every neighbour yyy, so the page's π1\pi_1π1​ is p∞({x})p_\infty(\{x\})p∞​({x}) for the first site of the pair.

Preamble
import Mathlib
import Definitions.Def_HarrisContact_Extinction_Model

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

/-- (7.4) (p. 981): with μ = 1 and λ_k = kλ, for a pair of neighbours ξ = {x, y},
π₂ − π₁ = (1 + (2d − 1)λ) Σ'_{z ∼ ξ} r(ξ, ξ ∪ z)(p_∞(ξ ∪ z) − π₂) ≤ (π₂ − π₁)(2d − 1)λ. -/
theorem eq_7_4 {d : ℕ} (hd : 1 ≤ d) (l : ℝ) (hl : 0 ≤ l) :
    ∀ x y : Site d, ∑ i, |x i - y i| = 1 →
      (survInf 1 (fun k => (k : ℝ) * l) {x, y}).toReal
          - (survInf 1 (fun k => (k : ℝ) * l) {x}).toReal =
        (1 + (2 * (d : ℝ) - 1) * l) *
          ∑ z ∈ bdry ({x, y} : Config d),
            jump 1 (fun k => (k : ℝ) * l) {x, y} (insert z {x, y}) *
              ((survInf 1 (fun k => (k : ℝ) * l) (insert z {x, y})).toReal
                - (survInf 1 (fun k => (k : ℝ) * l) {x, y}).toReal) ∧
      (survInf 1 (fun k => (k : ℝ) * l) {x, y}).toReal
          - (survInf 1 (fun k => (k : ℝ) * l) {x}).toReal ≤
        ((survInf 1 (fun k => (k : ℝ) * l) {x, y}).toReal
          - (survInf 1 (fun k => (k : ℝ) * l) {x}).toReal) * ((2 * (d : ℝ) - 1) * l) := by sorry

end HarrisContact.Extinction
Source
Harris (Ann. Probab. 2, 1974), §7, proof of Theorem 7.1, (7.3)–(7.4), 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