Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1.6 -- the period is constant on an irreducible chain

Proved
MarkovMixing.period_eq_of_irreducible

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

markov-chainsmixing-timesprobability

For a stochastic irreducible matrix PPP on a finite state space, all states have the same period: gcd⁡{t≥1:Pt(x,x)>0}=gcd⁡{t≥1:Pt(y,y)>0}\gcd\{t\ge1:P^t(x,x)>0\}=\gcd\{t\ge1:P^t(y,y)>0\}gcd{t≥1:Pt(x,x)>0}=gcd{t≥1:Pt(y,y)>0} for all x,yx,yx,y. (The period is encoded as the largest common divisor of the return-time set, which equals the gcd when the return set is nonempty -- as irreducibility and stochasticity guarantee.) This makes the period of the chain well defined.

Preamble
import Definitions.Def_mm_basic
Formal statement
namespace MarkovMixing

/-- **Lemma 1.6** (LPW): for an irreducible chain, all states have the same
period, so the period of the chain is well defined. -/
theorem period_eq_of_irreducible {V : Type*} [Fintype V] [DecidableEq V]
    (P : Matrix V V ℝ) (hP : IsStochastic P) (hirr : Irreducible P) (x y : V) :
    period P x = period P y := 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 1.3, Lemma 1.6, p. 8

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