Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1.7 -- a positive power of an irreducible aperiodic chain

Proved
MarkovMixing.exists_pow_pos

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

markov-chainsmixing-timesprobability

If the stochastic matrix PPP is irreducible and aperiodic, then there is an integer r>0r>0r>0 such that every entry of PrP^rPr is strictly positive: Pr(x,y)>0P^r(x,y)>0Pr(x,y)>0 for all states x,yx,yx,y. This is the number-theoretic heart of the Convergence Theorem.

Preamble
import Definitions.Def_mm_basic
Formal statement
namespace MarkovMixing

/-- **Proposition 1.7** (LPW): if `P` is irreducible and aperiodic, then some
power of `P` has all entries strictly positive. -/
theorem exists_pow_pos {V : Type*} [Fintype V] [DecidableEq V]
    (P : Matrix V V ℝ) (hP : IsStochastic P) (hirr : Irreducible P)
    (hap : Aperiodic P) :
    ∃ r : ℕ, 0 < r ∧ ∀ x y : V, 0 < (P ^ r) x 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, Proposition 1.7, 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