Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 12.1 -- basic spectral facts for stochastic matrices

Proved
MarkovMixing.eigenvalue_basic

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

markov-chainsmixing-timesprobability

Let PPP be a stochastic matrix on a finite state space VVV (nonnegative entries, rows summing to one). A real number λ\lambdaλ is an eigenvalue of PPP when there is a nonzero function f:V→Rf:V\to\mathbb Rf:V→R — an eigenfunction — with Pf=λfPf=\lambda fPf=λf, where (Pf)(x)=∑yP(x,y)f(y)(Pf)(x)=\sum_yP(x,y)f(y)(Pf)(x)=∑y​P(x,y)f(y). Recall that PPP is irreducible when every state can reach every other in some number of steps, and aperiodic when the return times to each state have greatest common divisor one.

The theorem (Lemma 12.1 of Levin–Peres–Wilmer) asserts:

  1. every eigenvalue of PPP satisfies ∣λ∣≤1|\lambda|\le1∣λ∣≤1;
  2. if PPP is irreducible, every function with Pf=fPf=fPf=f is constant — the eigenspace of the eigenvalue 111 is one-dimensional;
  3. if PPP is irreducible and aperiodic, then −1-1−1 is not an eigenvalue of PPP.

These are the basic facts that position the spectrum inside [−1,1][-1,1][−1,1] with 111 a simple eigenvalue and −1-1−1 excluded, so that the spectral gap of an irreducible aperiodic chain is genuinely positive — the starting point of the spectral theory of Chapters 12–13.

Preamble
import Definitions.Def_mm_spectral
Formal statement
namespace MarkovMixing

/-- **Lemma 12.1** (LPW): (i) every eigenvalue of a transition matrix has
`|λ| ≤ 1`; (ii) for an irreducible chain the eigenfunctions of eigenvalue `1`
are the constants; (iii) an irreducible aperiodic chain does not have `−1`
as an eigenvalue. -/
theorem eigenvalue_basic {V : Type*} [Fintype V] [DecidableEq V]
    (P : Matrix V V ℝ) (hP : IsStochastic P) :
    (∀ lam : ℝ, IsEigenvalue P lam → |lam| ≤ 1) ∧
    (Irreducible P → ∀ f : V → ℝ, P.mulVec f = f → ∀ x y : V, f x = f y) ∧
    (Irreducible P → Aperiodic P → ¬IsEigenvalue P (-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 12.1, Lemma 12.1, p. 153

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