Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, display before Theorem 7.1, p. 981 — p_∞ = Σ r⁽ⁿ⁾(x, η) p_∞(η) ≤ p_∞ 𝓔_x|ξ_(n)|

Proved
HarrisContact.Extinction.first_step_display

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

contact-processharmonic-functionjump-chainp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let {ξt}\{\xi_t\}{ξt​} be a subadditive contact process on ZdZ_dZd​: d≥1d\ge1d≥1, μ≥0\mu\ge0μ≥0, λ0=0\lambda_0=0λ0​=0, λ1,…,λ2d≥0\lambda_1,\dots,\lambda_{2d}\ge0λ1​,…,λ2d​≥0, and pt(ξ∪η)≤pt(ξ)+pt(η)p_t(\xi\cup\eta)\le p_t(\xi)+p_t(\eta)pt​(ξ∪η)≤pt​(ξ)+pt​(η) for all finite ξ,η\xi,\etaξ,η and t≥0t\ge0t≥0 (5.3). Let r(n)r^{(n)}r(n) be the nnn-step transition matrix of its imbedded jump chain. Writing p∞p_\inftyp∞​ for p∞({x})p_\infty(\{x\})p∞​({x}), for every site xxx and n≥1n\ge1n≥1,

p∞=∑η∈Ξ0r(n)({x},η) p∞(η)≤p∞∑η∈Ξ0r(n)({x},η)∣η∣.p_\infty=\sum_{\eta\in\Xi_0}r^{(n)}(\{x\},\eta)\,p_\infty(\eta)\le p_\infty\sum_{\eta\in\Xi_0}r^{(n)}(\{x\},\eta)|\eta|.p∞​=η∈Ξ0​∑​r(n)({x},η)p∞​(η)≤p∞​η∈Ξ0​∑​r(n)({x},η)∣η∣.

The display is the paper's first-step identity and subadditivity bound. If the expected size of the embedded chain is less than 111 for some nnn, it forces p∞=0p_\infty=0p∞​=0.

Formalization Note Both clauses use the page's subadditivity hypothesis, a singleton initial set, and n≥1n\ge1n≥1. Values are in [0,∞][0,\infty][0,∞].

Preamble
import Mathlib
import Definitions.Def_HarrisContact_Extinction_Model

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

/-- §7, display before Theorem 7.1 (p. 981): for a subadditive process and n ≥ 1,
p_∞(x) is harmonic for r^{(n)} and is at most p_∞(x) 𝓔_x |ξ_{(n)}|. -/
theorem first_step_display {d : ℕ} (hd : 1 ≤ d) (μ : ℝ) (lam : ℕ → ℝ) (hμ : 0 ≤ μ)
    (h0 : lam 0 = 0) (hlam : ∀ k, k ≤ 2 * d → 0 ≤ lam k)
    (hsubadd : ∀ t : ℝ, 0 ≤ t → ∀ ξ η : Config d,
      surv μ lam t (ξ ∪ η) ≤ surv μ lam t ξ + surv μ lam t η) :
    ∀ (n : ℕ), 1 ≤ n → ∀ x : Site d,
      (survInf μ lam {x} =
          ∑' η : Config d, ENNReal.ofReal (jumpPow μ lam n {x} η) * survInf μ lam η) ∧
        survInf μ lam {x} ≤
          survInf μ lam {x} *
            ∑' η : Config d, ENNReal.ofReal (jumpPow μ lam n {x} η) * (η.card : ℝ≥0∞) := by sorry

end HarrisContact.Extinction
Source
Harris (Ann. Probab. 2, 1974), §7, display preceding Theorem 7.1, p. 981 ("For subadditive processes … for each n = 1, 2, ⋯")
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