Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1C, proof of Proposition 2, p. 41 — every eigenvalue β of P satisfies β ≥ −1 + 2/ι

Proved
DiaconisStroock.OddPaths.eigenvalue_ge

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

eigenvaluemarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1path-system

Let PPP be an irreducible transition matrix on a finite set XXX, reversible with respect to its stationary distribution π\piπ, let Σ\SigmaΣ be a system of odd closed paths and ι=ι(Σ)\iota=\iota(\Sigma)ι=ι(Σ) the quantity (1.7). Then every real eigenvalue β\betaβ of PPP (a real β\betaβ with Pφ=βφP\varphi=\beta\varphiPφ=βφ for some nonzero real φ\varphiφ) satisfies

β≥−1+2ι.\beta\ge-1+\frac{2}{\iota}.β≥−1+ι2​.

This is the sentence that closes the proof of Proposition 2: dividing the inequality E(φ2)≤ι2(E(φ2)+⟨φ,Pφ⟩)E(\varphi^2)\le\frac{\iota}{2}(E(\varphi^2)+\langle\varphi,P\varphi\rangle)E(φ2)≤2ι​(E(φ2)+⟨φ,Pφ⟩) by E(φ2)E(\varphi^2)E(φ2) for an eigenfunction gives a lower bound on any eigenvalue of PPP.

Formalization Note Aperiodicity is not assumed, as in the previous milestone. Eigenvalues are real eigenvalues with real eigenfunctions; for a reversible chain all eigenvalues are of this kind.

Preamble
import Mathlib
import Definitions.Def_mm_spectral
import Definitions.Def_DiaconisStroock_OddPaths_Iota
open MarkovMixing
Formal statement
namespace DiaconisStroock.OddPaths

theorem eigenvalue_ge {V : Type*} [Fintype V] [DecidableEq V] (P : Matrix V V ℝ)
    (hP : IsStochastic P) (hirr : MarkovMixing.Irreducible P) (π : V → ℝ) (hπ : IsStationary P π)
    (hrev : DetailedBalance P π) (S : V → List V) (hS : IsOddPathSystem P π S) :
    ∀ β : ℝ, IsEigenvalue P β → -1 + 2 / iota P π S ≤ β := by sorry

end DiaconisStroock.OddPaths
Source
Diaconis and Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991), p. 41, §1C, end of the proof of Proposition 2, https://doi.org/10.1214/aoap/1177005980
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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