Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Curie--Weiss: fast mixing for α<1\alpha<1α<1

Proved
MarkovMixing.ising_complete_graph_fast

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

markov-chainsmixing-timesprobability

The Curie–Weiss model is the Ising model on the complete graph KnK_nKn​: spins ±1\pm1±1 on nnn vertices, every pair interacting, with Gibbs distribution π(σ)∝exp⁡(β∑{v,w}σ(v)σ(w))\pi(\sigma)\propto\exp\bigl(\beta\sum_{\{v,w\}}\sigma(v)\sigma(w)\bigr)π(σ)∝exp(β∑{v,w}​σ(v)σ(w)) at inverse temperature β=α/n\beta=\alpha/nβ=α/n — the 1/n1/n1/n scaling that makes the total interaction per site of constant order, with α\alphaα the effective temperature parameter. The Glauber dynamics re-samples a uniformly chosen site from the conditional distribution; 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)∣.

The theorem (Theorem 15.3(i) of Levin–Peres–Wilmer) asserts: for every n≥2n\ge2n≥2, every 0<α<10<\alpha<10<α<1, and every 0<ε<10<\varepsilon<10<ε<1,

tmix(ε)  ≤  ⌈n (log⁡n+log⁡(1/ε))1−α⌉.t_{\mathrm{mix}}(\varepsilon)\;\le\;\Bigl\lceil\frac{n\,\bigl(\log n+\log(1/\varepsilon)\bigr)}{1-\alpha}\Bigr\rceil.tmix​(ε)≤⌈1−αn(logn+log(1/ε))​⌉.

Below the critical value α=1\alpha=1α=1 the mean-field dynamics mixes in order nlog⁡nn\log nnlogn steps. The proof is one line from the high-temperature theorem of this mission: on KnK_nKn​ the degree is n−1n-1n−1 and (n−1)tanh⁡(α/n)≤α(n-1)\tanh(\alpha/n)\le\alpha(n−1)tanh(α/n)≤α. The companion theorem shows that above α=1\alpha=1α=1 the same dynamics needs exponentially many steps — the dynamical phase transition.

Preamble
import Definitions.Def_mm_ising
import Mathlib.Analysis.SpecialFunctions.Log.Basic
Formal statement
namespace MarkovMixing

/-- **Theorem 15.3(i)** (LPW): for the Glauber dynamics of the Ising model
on the complete graph on `n` vertices at `β = α/n` with `α < 1`,
`t_mix(ε) ≤ ⌈n(log n + log(1/ε))/(1−α)⌉` (the ceiling absorbs integer
rounding). -/
theorem ising_complete_graph_fast (n : ℕ) (hn : 2 ≤ n)
    (α : ℝ) (hα0 : 0 < α) (hα : α < 1) (ε : ℝ) (hε : 0 < ε) (hε1 : ε < 1) :
    (mixingTime (glauber (isingDist (⊤ : SimpleGraph (Fin n)) (α / n)))
        (isingDist (⊤ : SimpleGraph (Fin n)) (α / n)) ε : ℝ) ≤
      ⌈(n : ℝ) * (Real.log n + Real.log (1 / ε)) / (1 - α)⌉₊ := 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.2, Theorem 15.3(i), Eq. (15.8), p. 203

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