§7, display before Theorem 7.1, p. 981 — p_∞ = Σ r⁽ⁿ⁾(x, η) p_∞(η) ≤ p_∞ 𝓔_x|ξ_(n)|
ProvedHarrisContact.Extinction.first_step_displaycontact-processharmonic-functionjump-chainp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a subadditive contact process on : , , , , and for all finite and (5.3). Let be the -step transition matrix of its imbedded jump chain. Writing for , for every site and ,
The display is the paper's first-step identity and subadditivity bound. If the expected size of the embedded chain is less than for some , it forces .
Formalization Note Both clauses use the page's subadditivity hypothesis, a singleton initial set, and . Values are in .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.