(7.4), p. 981 — for μ = 1, λ_k = kλ: π₂ − π₁ = (1 + (2d − 1)λ) Σ' r(ξ, ξ ∪ x)(p_∞(ξ ∪ x) − π₂) ≤ (π₂ − π₁)(2d − 1)λ
ProvedHarrisContact.Extinction.eq_7_4contact-processfirst-step-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1submodularity
Consider the contact process on () with and , , let be the transition matrix of its imbedded jump chain, and write , for a pair of neighbours . Then
where is taken over the sites outside adjacent to it.
The equality comes from the first-step equation (7.3) for the pair; the inequality uses the submodularity of Theorem 6.2 in the form . Together with (7.2) it yields whenever .
Formalization Note The survival probabilities lie in and are converted to real numbers so that the differences are ordinary real subtraction. The statement is made for every site and every neighbour , so the page's is for the first site of the pair.
Preamble
import Mathlib import Definitions.Def_HarrisContact_Extinction_Model open MeasureTheory Filter Topology open scoped ENNReal NNReal
Formal statement
namespace HarrisContact.Extinction
/-- (7.4) (p. 981): with μ = 1 and λ_k = kλ, for a pair of neighbours ξ = {x, y},
π₂ − π₁ = (1 + (2d − 1)λ) Σ'_{z ∼ ξ} r(ξ, ξ ∪ z)(p_∞(ξ ∪ z) − π₂) ≤ (π₂ − π₁)(2d − 1)λ. -/
theorem eq_7_4 {d : ℕ} (hd : 1 ≤ d) (l : ℝ) (hl : 0 ≤ l) :
∀ x y : Site d, ∑ i, |x i - y i| = 1 →
(survInf 1 (fun k => (k : ℝ) * l) {x, y}).toReal
- (survInf 1 (fun k => (k : ℝ) * l) {x}).toReal =
(1 + (2 * (d : ℝ) - 1) * l) *
∑ z ∈ bdry ({x, y} : Config d),
jump 1 (fun k => (k : ℝ) * l) {x, y} (insert z {x, y}) *
((survInf 1 (fun k => (k : ℝ) * l) (insert z {x, y})).toReal
- (survInf 1 (fun k => (k : ℝ) * l) {x, y}).toReal) ∧
(survInf 1 (fun k => (k : ℝ) * l) {x, y}).toReal
- (survInf 1 (fun k => (k : ℝ) * l) {x}).toReal ≤
((survInf 1 (fun k => (k : ℝ) * l) {x, y}).toReal
- (survInf 1 (fun k => (k : ℝ) * l) {x}).toReal) * ((2 * (d : ℝ) - 1) * l) := by sorry
end HarrisContact.Extinction
Source
Harris (Ann. Probab. 2, 1974), §7, proof of Theorem 7.1, (7.3)–(7.4), p. 981
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.