Ising on the cycle: mixing at every temperature
ProvedMarkovMixing.ising_cycleThe Ising model on the -cycle puts spins on (each residue adjacent to its two neighbours) with Gibbs distribution at inverse temperature , and its Glauber dynamics re-samples a uniformly chosen site from the conditional distribution. For a tolerance , the mixing time is the first with , where . Set
which is positive for every .
The theorem (Theorem 15.4 of Levin–Peres–Wilmer) asserts: for any fixed and any margin there is an such that for all ,
On the cycle the dynamics mixes in steps at every temperature — no phase transition in one dimension, in sharp contrast to the complete graph of the companion theorems. The upper bound is the even-degree case of the high-temperature theorem (every vertex of the cycle has degree , so the condition always holds); the lower bound runs Wilson's method (Mission VII) with a Fourier-mode eigenfunction.
import Definitions.Def_mm_ising import Mathlib.Analysis.SpecialFunctions.Log.Basic
namespace MarkovMixing
/-- **Theorem 15.4** (LPW): for the Glauber dynamics of the Ising model on
the `n`-cycle at any `β > 0`, with `c_O(β) = 1 − tanh(2β)`, the mixing time
is `n log n` up to constants:
`(1+o(1)) n log n/(2c_O) ≤ t_mix(ε) ≤ (1+o(1)) n log n/c_O`. -/
theorem ising_cycle (β : ℝ) (hβ : 0 < β) (ε : ℝ) (hε : 0 < ε) (hε1 : ε < 1)
(δ : ℝ) (hδ : 0 < δ) :
∃ N : ℕ, ∀ n : ℕ, N ≤ n → ∀ inst : NeZero n,
(mixingTime (glauber (isingDist (cycleGraph n) β))
(isingDist (cycleGraph n) β) ε : ℝ) ≤
(1 + δ) * n * Real.log n / (1 - Real.tanh (2 * β)) ∧
(1 - δ) * n * Real.log n / (2 * (1 - Real.tanh (2 * β))) ≤
(mixingTime (glauber (isingDist (cycleGraph n) β))
(isingDist (cycleGraph n) β) ε : ℝ) := by
sorry
end MarkovMixing