Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, proof of Theorem 7.1, p. 981 — for μ = 1, λ_k = kλ: (2d − 1)λ ≥ 1 if π₁ > 0

Proved
HarrisContact.Extinction.pi1_pos_imp

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

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

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, and let π1=p∞({x})\pi_1=p_\infty(\{x\})π1​=p∞​({x}) be the probability that the process started from a single site xxx survives forever. If π1>0\pi_1>0π1​>0, then

(2d−1)λ≥1.(2d-1)\lambda\ge1 .(2d−1)λ≥1.

Equivalently, if (2d−1)λ<1(2d-1)\lambda<1(2d−1)λ<1 the process started from one site dies out almost surely. This is the conclusion of the proof of Theorem 7.1 in the normalized linear case, before the reduction by comparison and time scaling.

Formalization Note 2d−12d-12d−1 is computed in the reals as 2d−12d-12d−1 with d≥1d\ge1d≥1, which agrees with the natural-number difference.

Preamble
import Mathlib
import Definitions.Def_HarrisContact_Extinction_Model

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

/-- §7, last sentence of the proof of Theorem 7.1 (p. 981): with μ = 1 and λ_k = kλ,
(2d − 1)λ ≥ 1 if π₁ > 0. -/
theorem pi1_pos_imp {d : ℕ} (hd : 1 ≤ d) (l : ℝ) (hl : 0 ≤ l) :
    ∀ x : Site d, 0 < survInf 1 (fun k => (k : ℝ) * l) {x} → 1 ≤ (2 * (d : ℝ) - 1) * l := by sorry

end HarrisContact.Extinction
Source
Harris (Ann. Probab. 2, 1974), §7, proof of Theorem 7.1, p. 981 ("(2d − 1)λ ≧ 1 if π₁ > 0")
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