Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Ising on the cycle: nlog⁡nn\log nnlogn mixing at every temperature

Proved
MarkovMixing.ising_cycle

by Shuze Chen · Aug 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainsmixing-timesprobability

The Ising model on the nnn-cycle puts spins ±1\pm1±1 on Zn\mathbb Z_nZn​ (each residue adjacent to its two neighbours) with Gibbs distribution π(σ)∝exp⁡(β∑{v,w}∈Eσ(v)σ(w))\pi(\sigma)\propto\exp\bigl(\beta\sum_{\{v,w\}\in E}\sigma(v)\sigma(w)\bigr)π(σ)∝exp(β∑{v,w}∈E​σ(v)σ(w)) at inverse temperature β>0\beta>0β>0, and its Glauber dynamics re-samples a uniformly chosen site from the conditional distribution. For a tolerance ε\varepsilonε, the mixing time tmix(ε)t_{\mathrm{mix}}(\varepsilon)tmix​(ε) is the first ttt with max⁡σ∥Pt(σ,⋅)−π∥TV≤ε\max_\sigma\|P^t(\sigma,\cdot)-\pi\|_{TV}\le\varepsilonmaxσ​∥Pt(σ,⋅)−π∥TV​≤ε, where ∥μ−ν∥TV=max⁡A∣μ(A)−ν(A)∣\|\mu-\nu\|_{TV}=\max_A|\mu(A)-\nu(A)|∥μ−ν∥TV​=maxA​∣μ(A)−ν(A)∣. Set

cO(β)=1−tanh⁡(2β),c_O(\beta)=1-\tanh(2\beta),cO​(β)=1−tanh(2β),

which is positive for every β\betaβ.

The theorem (Theorem 15.4 of Levin–Peres–Wilmer) asserts: for any fixed 0<ε<10<\varepsilon<10<ε<1 and any margin δ>0\delta>0δ>0 there is an NNN such that for all n≥Nn\ge Nn≥N,

(1−δ) nlog⁡n2 cO(β)  ≤  tmix(ε)  ≤  (1+δ) nlog⁡ncO(β).\frac{(1-\delta)\,n\log n}{2\,c_O(\beta)}\;\le\;t_{\mathrm{mix}}(\varepsilon)\;\le\;\frac{(1+\delta)\,n\log n}{c_O(\beta)}.2cO​(β)(1−δ)nlogn​≤tmix​(ε)≤cO​(β)(1+δ)nlogn​.

On the cycle the dynamics mixes in nlog⁡nn\log nnlogn 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 222, so the condition (Δ/2)tanh⁡(2β)=tanh⁡(2β)<1(\Delta/2)\tanh(2\beta)=\tanh(2\beta)<1(Δ/2)tanh(2β)=tanh(2β)<1 always holds); the lower bound runs Wilson's method (Mission VII) with a Fourier-mode eigenfunction.

Preamble
import Definitions.Def_mm_ising
import Mathlib.Analysis.SpecialFunctions.Log.Basic
Formal statement
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
Source
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.3, Theorem 15.4, Eq. (15.10), p. 204

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me