The Ising model is statistical mechanics' fruit fly: spins on the vertices of a graph, neighbours preferring to agree, a single parameter — the inverse temperature — tuning the strength of that preference. Chapter 15 of Levin–Peres–Wilmer, Markov Chains and Mixing Times (AMS, 2009) studies the Glauber dynamics for this model and exhibits, on concrete graphs, the phenomenon that made mixing times a subject: a dynamical phase transition. At high temperature (small ) the dynamics mixes in steps on any bounded-degree graph; on the complete graph the same dynamics passes, as crosses an explicit threshold, from mixing to exponentially slow mixing. The chapter also introduces two comparison tools of independent value — the sensitivity of the spectral gap to edge removal, and the block dynamics comparison — and the Kenyon–Mossel–Peres bound for trees, all formalized in this mission.
Spin configurations on a finite graph with vertex set of size and maximum degree are functions assigning to each vertex (encoded over Booleans, ). The Ising model at inverse temperature is the Gibbs distribution
each edge counted once, the normalizing partition function. The Glauber dynamics for picks a uniform vertex and re-samples its spin from conditioned on all other spins — concretely, the new spin at is with probability where is the sum of the neighbouring spins.
The yardsticks are as in the earlier missions: is the total variation distance, , and . From Mission VII: an eigenvalue of a chain is a real with for some nonzero ; is the largest eigenvalue , the spectral gap is , the largest over eigenvalues , and the relaxation time is .
Theorem 15.1, the high-temperature fast-mixing theorem: if then the Glauber dynamics on any graph satisfies
together with its refinement for graphs with all degrees even, where the condition relaxes to .
The results. Theorem 15.1 is the standard fast-mixing criterion for Glauber dynamics, and the model application of the path-coupling technique of Mission VIII. Theorem 15.3 exhibits, in the cleanest possible setting, the correspondence between the static phase transition of the mean-field Ising model and the dynamical transition of its Glauber dynamics — the phenomenon at the heart of Markov-chain approaches to statistical physics. The tree bound of Kenyon–Mossel–Peres and the block-dynamics comparison are the standard tools for spatially structured spin systems; block dynamics in particular is the engine of recursive gap bounds on trees and lattices.
Formalizing them. Nothing about the Ising model, Gibbs distributions, or Glauber dynamics exists in Mathlib. The Gibbs-distribution layer (weights, partition functions, conditional single-site laws with their closed forms) is foundational for any future formalization of statistical mechanics; the phase-transition theorem 15.3(ii) would be, to our knowledge, the first formalized instance of exponentially slow mixing driven by an energy barrier.
The high-temperature theorem is path coupling (Mission VIII) plus the tanh lemma: the one-site coupling of two adjacent configurations contracts the Hamming metric at rate , and every analytic input is in Lemma 15.2 — which is why that elementary lemma is a milestone of its own. The slow-mixing half of Theorem 15.3 runs through the bottleneck bound of Mission IV: the magnetization performs a one-dimensional walk in a double-well free-energy landscape, and the bottleneck at zero magnetization has exponentially small stationary mass — a large-deviations estimate carried out with binomial coefficients. The cycle's lower bound needs Wilson's method (Mission VII) with an explicit eigenfunction. The tree and block theorems are exercises in the comparison technology of Mission VII (Dirichlet forms, canonical paths through block updates); their constants are crude but the inductive structure is delicate. Everything sits on the subtlety that the state space has size , so all "polynomial" bounds are polynomial in , not in the size of the state space.
The Gibbs distribution is defined by explicit finite sums (weight over partition function, total division); no positivity side conditions are needed since the weights are exponentials. The Glauber dynamics is the generic single-site heat bath of Mission II applied to the Ising distribution, so the closed form is a provable lemma, not a definition. Asymptotic statements (, "for sufficiently large ") are rendered with explicit quantifiers and a free precision parameter ; the phase-transition constants are existentially quantified. The tree is encoded as words of length over an alphabet of size ; the block dynamics re-samples a uniformly chosen block from the conditional Gibbs distribution, with the convention that a conditioning of zero mass yields a zero row (total division), which the theorems' hypotheses exclude on the support. The even-degree refinement of the goal is stated as a second conjunct with its own hypothesis.
namespace MarkovMixing
/-- **Theorem 15.1** (LPW), the capstone of Chapter 15: fast mixing of the
Ising Glauber dynamics at high temperature. On a graph with `n` vertices
and maximal degree `Δ`:
(i) if `Δ tanh β < 1`, then with `c(β) = 1 − Δ tanh β`,
`t_mix(ε) ≤ ⌈n(log n + log(1/ε))/c(β)⌉`;
(ii) if every vertex has even degree and `(Δ/2) tanh 2β < 1`, then the same
bound holds with `c_e(β) = 1 − (Δ/2) tanh 2β`. -/
theorem ising_high_temperature {Vv : Type*} [Fintype Vv] [DecidableEq Vv]
[Nonempty Vv] (G : SimpleGraph Vv) [DecidableRel G.Adj]
(β : ℝ) (hβ : 0 < β) (ε : ℝ) (hε : 0 < ε) (hε1 : ε < 1) :
((G.maxDegree : ℝ) * Real.tanh β < 1 →
(mixingTime (glauber (isingDist G β)) (isingDist G β) ε : ℝ) ≤
⌈(Fintype.card Vv : ℝ) *
(Real.log (Fintype.card Vv) + Real.log (1 / ε)) /
(1 - (G.maxDegree : ℝ) * Real.tanh β)⌉₊) ∧
((∀ v : Vv, Even (G.degree v)) →
((G.maxDegree : ℝ) / 2) * Real.tanh (2 * β) < 1 →
(mixingTime (glauber (isingDist G β)) (isingDist G β) ε : ℝ) ≤
⌈(Fintype.card Vv : ℝ) *
(Real.log (Fintype.card Vv) + Real.log (1 / ε)) /
(1 - ((G.maxDegree : ℝ) / 2) * Real.tanh (2 * β))⌉₊) := by
sorry
end MarkovMixingLet be a graph on vertices with maximum degree . The Ising model at inverse temperature puts spins on the vertices with Gibbs distribution , and its Glauber dynamics picks a uniform vertex and re-samples its spin from conditioned on the other spins. For a tolerance , the mixing time is the first with , where is the total variation distance.
The theorem (Theorem 15.1 of Levin–Peres–Wilmer, the capstone of Chapter 15) asserts, for every :
At high temperature the Glauber dynamics mixes in order steps on any graph — the fundamental fast-mixing criterion for spin systems. The proof is path coupling (Mission VIII) with the one-site coupling whose disagreement probability the tanh lemma controls; since , condition 1 holds in particular whenever .
No open leaves. Every sub-goal is proved or awaiting decomposition.