Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1C, proof of Proposition 2, pp. 40–41 — E(φ²) ≤ (ι/2)(E(φ²) + ⟨φ, Pφ⟩_π)

Proved
DiaconisStroock.OddPaths.inner_self_le_iota_mul

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

eigenvaluemarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1path-systempoincare-inequality

Let PPP be an irreducible transition matrix on a finite set XXX, reversible with respect to its stationary distribution π\piπ, and Q(x,y)=π(x)P(x,y)Q(x,y)=\pi(x)P(x,y)Q(x,y)=π(x)P(x,y). Let Σ=(σx)x∈X\Sigma=(\sigma_x)_{x\in X}Σ=(σx​)x∈X​ be a system of odd closed paths (each σx\sigma_xσx​ runs from xxx to xxx along edges with Q>0Q>0Q>0, has an odd number of edges and traverses no directed edge twice), and let ι=ι(Σ)\iota=\iota(\Sigma)ι=ι(Σ) be the quantity (1.7). Then for every φ:X→R\varphi:X\to\mathbb Rφ:X→R,

E(φ2)≤ι2(E(φ2)+⟨φ,Pφ⟩L2(π)),E(\varphi^2)\le\frac{\iota}{2}\Big(E(\varphi^2)+\langle\varphi,P\varphi\rangle_{L^2(\pi)}\Big),E(φ2)≤2ι​(E(φ2)+⟨φ,Pφ⟩L2(π)​),

where E(φ2)=∑xφ(x)2π(x)E(\varphi^2)=\sum_x\varphi(x)^2\pi(x)E(φ2)=∑x​φ(x)2π(x) and ⟨φ,Pφ⟩L2(π)=∑xφ(x)(Pφ)(x)π(x)\langle\varphi,P\varphi\rangle_{L^2(\pi)}=\sum_x\varphi(x)(P\varphi)(x)\pi(x)⟨φ,Pφ⟩L2(π)​=∑x​φ(x)(Pφ)(x)π(x).

This is the Poincaré-type inequality for the operator I+PI+PI+P that yields Proposition 2: applied to an eigenfunction it bounds the eigenvalue from below.

Formalization Note Aperiodicity, a hypothesis of Proposition 2, is not assumed: once a system of odd paths is given, the inequality holds without it (and the existence of such a system forces it).

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

theorem inner_self_le_iota_mul {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) :
    ∀ φ : V → ℝ,
      innerPi π φ φ ≤ iota P π S / 2 * (innerPi π φ φ + innerPi π φ (P.mulVec φ)) := by sorry

end DiaconisStroock.OddPaths
Source
Diaconis and Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991), pp. 40–41, §1C, proof of Proposition 2 (the displayed chain of inequalities), 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