The tanh contraction lemma
ProvedMarkovMixing.ising_tanh_lemmamarkov-chainsmixing-timesprobability
Fix an inverse temperature and consider the function
which measures how much the conditional probability of a spin under the Ising Glauber dynamics moves when the neighbourhood field increases from to (the heat-bath update at a site with neighbouring spin sum chooses with probability ).
The theorem (Lemma 15.2 of Levin–Peres–Wilmer) asserts four elementary properties:
- is even: for every real ;
- is non-increasing on : implies ;
- for every real — the value at is the global maximum;
- over odd integers the sharper bound holds: for every odd — the value at is the maximum among odd integers.
These four inequalities are the entire analytic content of the high-temperature theorem: in the one-site coupling of two adjacent configurations, the probability that the updated site disagrees is controlled by evaluated at the neighbouring spin sum, which for a graph with all degrees even is an odd integer — whence the two conditions and of the goal theorem.
Preamble
import Definitions.Def_mm_ising
Formal statement
namespace MarkovMixing
/-- **Lemma 15.2** (LPW): the function
`ϕ(x) = tanh(β(x+1)) − tanh(β(x−1))` is even, is decreasing on `[0,∞)`,
is bounded by `ϕ(0) = 2 tanh β`, and on odd integers is bounded by
`ϕ(1) = tanh 2β`. -/
theorem ising_tanh_lemma (β : ℝ) (hβ : 0 < β) :
(∀ x : ℝ, Real.tanh (β * (-x + 1)) - Real.tanh (β * (-x - 1)) =
Real.tanh (β * (x + 1)) - Real.tanh (β * (x - 1))) ∧
(∀ x y : ℝ, 0 ≤ x → x ≤ y →
Real.tanh (β * (y + 1)) - Real.tanh (β * (y - 1)) ≤
Real.tanh (β * (x + 1)) - Real.tanh (β * (x - 1))) ∧
(∀ x : ℝ, Real.tanh (β * (x + 1)) - Real.tanh (β * (x - 1)) ≤
2 * Real.tanh β) ∧
∀ k : ℤ, Odd k →
Real.tanh (β * (k + 1)) - Real.tanh (β * (k - 1)) ≤
Real.tanh (2 * β) := by
sorry
end MarkovMixingSource
D. A. Levin, Y. Peres, E. L. Wilmer, Markov Chains and Mixing Times, AMS 2009, https://documents.epfl.ch/groups/i/ip/ipg/www/2013-2014/Random_Walks/markovmixing.pdf, Section 15.1, Lemma 15.2, Eqs. (15.3)-(15.4), p. 202