Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.8), p. 40 — ½Σ_{x,y}(φ(x)+φ(y))²Q(x,y) = E(φ²) + ⟨φ, Pφ⟩_π

Proved
DiaconisStroock.OddPaths.eq_1_8

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

dirichlet-formidentitymarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a transition matrix on a finite set XXX and π\piπ a stationary distribution of PPP, and write Q(x,y)=π(x)P(x,y)Q(x,y)=\pi(x)P(x,y)Q(x,y)=π(x)P(x,y). For every function φ:X→R\varphi:X\to\mathbb Rφ:X→R,

12∑x,y∈X(φ(x)+φ(y))2Q(x,y)=E(φ2)+⟨φ,Pφ⟩L2(π),\frac12\sum_{x,y\in X}\big(\varphi(x)+\varphi(y)\big)^2Q(x,y)=E(\varphi^2)+\langle\varphi,P\varphi\rangle_{L^2(\pi)},21​x,y∈X∑​(φ(x)+φ(y))2Q(x,y)=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) is the expectation under π\piπ, (Pφ)(x)=∑yP(x,y)φ(y)(P\varphi)(x)=\sum_yP(x,y)\varphi(y)(Pφ)(x)=∑y​P(x,y)φ(y), and ⟨f,g⟩L2(π)=∑xf(x)g(x)π(x)\langle f,g\rangle_{L^2(\pi)}=\sum_xf(x)g(x)\pi(x)⟨f,g⟩L2(π)​=∑x​f(x)g(x)π(x).

This identity converts the sum over edges produced by the path argument into the quadratic form E(φ2)+⟨φ,Pφ⟩E(\varphi^2)+\langle\varphi,P\varphi\rangleE(φ2)+⟨φ,Pφ⟩, which equals (1+β)E(φ2)(1+\beta)E(\varphi^2)(1+β)E(φ2) on an eigenfunction with eigenvalue β\betaβ.

Formalization Note Only stochasticity of PPP and stationarity of π\piπ are assumed; reversibility and irreducibility, standing assumptions of the paper, are not needed for this identity and are omitted, which makes the statement more general.

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

theorem eq_1_8 {V : Type*} [Fintype V] [DecidableEq V] (P : Matrix V V ℝ) (hP : IsStochastic P)
    (π : V → ℝ) (hπ : IsStationary P π) :
    ∀ φ : V → ℝ, 2⁻¹ * ∑ x, ∑ y, (φ x + φ y) ^ 2 * edgeMeasure P π x y =
      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), p. 40, proof of Proposition 2, (1.8), 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