Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 — β₁ ≤ 1 − 1/κ for reversible chains

Proved
DiaconisStroock.Poincare.proposition_1

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

eigenvaluemarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poincare-inequalityspectral-gap

Let PPP be an irreducible transition matrix on a finite state space XXX with at least two states, reversible with respect to its stationary probability distribution π\piπ. For every choice Γ\GammaΓ of one edge-simple path γxy\gamma_{xy}γxy​ for each ordered pair x≠yx\ne yx=y, let κ(Γ)\kappa(\Gamma)κ(Γ) be the directed-edge congestion in (1.5). If β1\beta_1β1​ is the second largest eigenvalue of PPP, then

β1≤1−1κ(Γ).\beta_1\le 1-\frac{1}{\kappa(\Gamma)}.β1​≤1−κ(Γ)1​.

This is the paper's first geometric bound on a Markov chain eigenvalue: a path system with low congestion yields a quantitative spectral gap.

Formalization Note The hypothesis ∣X∣≥2|X|\ge2∣X∣≥2 makes β1\beta_1β1​ exist. The path system is universally quantified, as the paper says “for any choice of Γ\GammaΓ.”

Preamble
import Mathlib
import Definitions.Def_mm_spectral
import Definitions.Def_DiaconisStroock_Poincare_Kappa
Formal statement
namespace DiaconisStroock.Poincare

open MarkovMixing

/-- Proposition 1 (Poincaré inequality), p. 37, with κ defined by (1.5). -/
theorem proposition_1 {V : Type*} [Fintype V] [DecidableEq V]
    (P : Matrix V V ℝ) (hP : IsStochastic P) (hirr : MarkovMixing.Irreducible P)
    (π : V → ℝ) (hπ : IsStationary P π) (hrev : DetailedBalance P π)
    (hV : 2 ≤ Fintype.card V) (Γ : V → V → List V) (hΓ : IsPathSystem P π Γ) :
    lambdaTwo P ≤ 1 - 1 / kappa P π Γ := by sorry

end DiaconisStroock.Poincare
Source
Diaconis and Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991), p. 37, Proposition 1 and (1.5), 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