Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.7, p. 975 — mt(ξ)≤∣ξ∣ e(2dΛ−μ)tm_t(\xi) \le |\xi|\,e^{(2d\Lambda-\mu)t}mt​(ξ)≤∣ξ∣e(2dΛ−μ)t

Proved
HarrisContact.MeanSize.lemma_4_7

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

contact-processexpected-sizep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (ξt)(\xi_t)(ξt​) be the contact process on ZdZ_dZd​ with death rate μ≥0\mu\ge0μ≥0 and birth rates λ0=0,λ1,…,λ2d≥0\lambda_0=0,\lambda_1,\dots,\lambda_{2d}\ge0λ0​=0,λ1​,…,λ2d​≥0, and let mt(ξ)m_t(\xi)mt​(ξ) be the expected number of occupied sites at time ttt when the process starts from the finite set ξ\xiξ. Put Λ=max⁡0≤i≤2dλi\Lambda=\max_{0\le i\le 2d}\lambda_iΛ=max0≤i≤2d​λi​. Then for every finite ξ\xiξ and every t≥0t\ge 0t≥0,

mt(ξ)≤∣ξ∣ e(2dΛ−μ)t.m_t(\xi)\le |\xi|\,e^{(2d\Lambda-\mu)t}.mt​(ξ)≤∣ξ∣e(2dΛ−μ)t.

This crude bound shows in particular that mt(ξ)m_t(\xi)mt​(ξ) is finite and bounded on every finite time interval, which is what makes the integrals of mtm_tmt​ in the proof of Theorem 7.6 meaningful.

Formalization Note The standing hypotheses of the contact process (Harris, §2(b), p. 971; §3, p. 972) are written as binders: d≥1d \ge 1d≥1, μ≥0\mu \ge 0μ≥0, λ0=0\lambda_0 = 0λ0​=0 and λk≥0\lambda_k \ge 0λk​≥0 for 0≤k≤2d0 \le k \le 2d0≤k≤2d. Rates λk\lambda_kλk​ with k>2dk > 2dk>2d never enter the model, and no hypothesis mentions them. The process is the countable-state chain on finite configurations of §4 (p. 975), with transition function the minimal solution PtP_tPt​ of the backward equations for the rates (4.4)–(4.5); mt(ξ)=∑ηPt(ξ,η) ∣η∣m_t(\xi)=\sum_\eta P_t(\xi,\eta)\,|\eta|mt​(ξ)=∑η​Pt​(ξ,η)∣η∣ is an extended nonnegative real, so a divergent sum is +∞+\infty+∞, never 000. Λ\LambdaΛ is the maximum of λ0,…,λ2d\lambda_0,\dots,\lambda_{2d}λ0​,…,λ2d​ (a finite maximum, nonnegative since λ0=0\lambda_0=0λ0​=0). The paper's proof goes through the Markov property of the infinite-volume process; the statement is unchanged.

Preamble
import Mathlib
import Definitions.Def_HarrisContact_Extinction_Model
open MeasureTheory Filter Topology
open scoped ENNReal NNReal
Formal statement
namespace HarrisContact.MeanSize

/-- Harris (Ann. Probab. 2, 1974), Lemma 4.7, p. 975: for a contact process started from a finite
set `ξ`, `m_t(ξ) ≤ |ξ| e^{(2dΛ − μ)t}` for `t ≥ 0`, where `Λ = max_{0 ≤ i ≤ 2d} λ_i`. -/
theorem lemma_4_7 {d : ℕ} (hd : 1 ≤ d) (μ : ℝ) (lam : ℕ → ℝ) (hμ : 0 ≤ μ) (h0 : lam 0 = 0)
    (hlam : ∀ k, k ≤ 2 * d → 0 ≤ lam k)
    (t : ℝ) (ht : 0 ≤ t) (ξ : HarrisContact.Extinction.Config d) :
    HarrisContact.Extinction.meanSize μ lam t ξ ≤ (ξ.card : ℝ≥0∞) *
      ENNReal.ofReal (Real.exp ((2 * (d : ℝ) * (Finset.range (2 * d + 1)).sup' (by simp) lam - μ) * t)) := by sorry
end HarrisContact.MeanSize
Source
Harris (Ann. Probab. 2, 1974), Lemma 4.7, p. 975
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