Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Propositions 2.12 and 2.14 -- random walks on finite groups

Proved
MarkovMixing.group_walk_uniform_stationary

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

markov-chainsmixing-timesprobability

The random walk on a finite group GGG with increment distribution μ\muμ (step from aaa to hahaha with probability μ(h)\mu(h)μ(h)) is a Markov chain for which the uniform distribution on GGG is stationary; and if μ\muμ is symmetric (μ(g−1)=μ(g)\mu(g^{-1})=\mu(g)μ(g−1)=μ(g)), the walk is reversible with respect to the uniform distribution.

Preamble
import Definitions.Def_mm_basic
Formal statement
namespace MarkovMixing

/-- **Propositions 2.12 and 2.14** (LPW): the random walk on a finite group
with increment distribution `μ` is a Markov chain for which the uniform
distribution is stationary; if `μ` is symmetric (`μ(g) = μ(g⁻¹)`), the walk is
moreover reversible. -/
theorem group_walk_uniform_stationary {G : Type*} [Group G] [Fintype G]
    [DecidableEq G] (μ : G → ℝ) (hμ : IsDist μ) :
    IsStochastic (groupWalk μ) ∧
    IsStationary (groupWalk μ) (uniformDist G) ∧
    ((∀ g : G, μ g⁻¹ = μ g) → DetailedBalance (groupWalk μ) (uniformDist G)) := 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 2.6, Propositions 2.12 and 2.14, pp. 28-29

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