Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.2.1 -- the Metropolis chain for a symmetric base chain

Proved
MarkovMixing.metropolis_stationary

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

markov-chainsmixing-timesprobability

Let Ψ\PsiΨ be a symmetric stochastic matrix on a finite state space VVV (a proposal chain with Ψ(x,y)=Ψ(y,x)\Psi(x,y)=\Psi(y,x)Ψ(x,y)=Ψ(y,x)), and let π\piπ be a strictly positive probability distribution on VVV. The Metropolis chain for this pair moves as follows: from the current state xxx it proposes a state yyy with probability Ψ(x,y)\Psi(x,y)Ψ(x,y), accepts the proposal with probability min⁡(1,π(y)/π(x))\min\bigl(1,\pi(y)/\pi(x)\bigr)min(1,π(y)/π(x)), and stays at xxx if the proposal is rejected.

The theorem asserts three things about this chain: it is a genuine Markov chain (its transition matrix has nonnegative entries and rows summing to one); it satisfies the detailed balance equations π(x) M(x,y)=π(y) M(y,x)\pi(x)\,M(x,y)=\pi(y)\,M(y,x)π(x)M(x,y)=π(y)M(y,x) for all states x,yx,yx,y, i.e. it is reversible with respect to π\piπ; and π\piπ is a stationary distribution for it, meaning ∑xπ(x) M(x,y)=π(y)\sum_x \pi(x)\,M(x,y)=\pi(y)∑x​π(x)M(x,y)=π(y) for every yyy — running the chain one step from π\piπ returns π\piπ. This is the construction of §3.2.1 of Levin–Peres–Wilmer: a recipe turning any symmetric proposal mechanism into a chain with a prescribed stationary distribution.

Preamble
import Definitions.Def_mm_mcmc
Formal statement
namespace MarkovMixing

/-- **§3.2.1** (LPW): the Metropolis chain for a positive target distribution
`π` and a symmetric stochastic base chain `Ψ` is a Markov chain, reversible
with respect to `π`, with stationary distribution `π`. -/
theorem metropolis_stationary {V : Type*} [Fintype V] [DecidableEq V]
    (Ψ : Matrix V V ℝ) (hΨ : IsStochastic Ψ) (hsymm : ∀ x y : V, Ψ x y = Ψ y x)
    (π : V → ℝ) (hπ : IsDist π) (hpos : ∀ x : V, 0 < π x) :
    IsStochastic (metropolis Ψ π) ∧
    DetailedBalance (metropolis Ψ π) π ∧
    IsStationary (metropolis Ψ π) π := 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 3.2.1, pp. 37-39

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me