Theorem 7.6, p. 982 — if then
ProvedHarrisContact.MeanSize.theorem_7_6Let be the contact process on , : each occupied site becomes vacant at rate , and a vacant site with occupied neighbours becomes occupied at rate , where and for . Let be the expected number of occupied sites at time when the process starts from the finite set . If
then for every finite ,
The total expected occupation time of all sites is finite: in this subcritical regime the process not only dies out but does so fast enough on average. With Lemma 4.11 it gives (Remark 7.12).
Formalization Note The standing hypotheses of the contact process (Harris, §2(b), p. 971; §3, p. 972) are written as binders: , , and for . Rates with never enter the model, and no hypothesis mentions them. The hypothesis is implicit in the paper's ratio and is added explicitly: in Lean , so without it the rate condition would hold for every at , where the process never shrinks and the conclusion is false. is the real number . The process is the countable-state chain on finite configurations of §4 (p. 975), with transition function the minimal solution of the backward equations for the rates (4.4)–(4.5); is an extended nonnegative real, so a divergent sum is , never . The integral is the Lebesgue integral of a -valued function over , so a divergent integral is .
import Mathlib import Definitions.Def_HarrisContact_Extinction_Model open MeasureTheory Filter Topology open scoped ENNReal NNReal
namespace HarrisContact.MeanSize
/-- Harris (Ann. Probab. 2, 1974), Theorem 7.6, p. 982: if `λ_k/μ < k/(2d − 1)` for `k = 1, …, 2d`, then
`∫_0^∞ m_t(ξ) dt < ∞` for every finite `ξ`. -/
theorem theorem_7_6 {d : ℕ} (hd : 1 ≤ d) (μ : ℝ) (lam : ℕ → ℝ) (hμ : 0 < μ) (h0 : lam 0 = 0)
(hlam : ∀ k, k ≤ 2 * d → 0 ≤ lam k)
(hsub : ∀ k : ℕ, 1 ≤ k → k ≤ 2 * d → lam k / μ < k / (2 * (d : ℝ) - 1)) :
∀ ξ : HarrisContact.Extinction.Config d, ∫⁻ t in Set.Ioi (0 : ℝ), HarrisContact.Extinction.meanSize μ lam t ξ < ∞ := by sorry
end HarrisContact.MeanSize
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.