Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1C, proof of Proposition 2, p. 40 — φ(x) = ½{(φ(x)+φ(y)) − (φ(y)+φ(w)) + ⋯ + (φ(z)+φ(x))} along an odd closed path

Proved
DiaconisStroock.OddPaths.two_mul_eq_alternating_sum

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

identityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1path-system

Let x∈Xx\in Xx∈X and let σ=[v0,v1,…,vk]\sigma=[v_0,v_1,\dots,v_k]σ=[v0​,v1​,…,vk​] be a closed vertex sequence at xxx, i.e. v0=vk=xv_0=v_k=xv0​=vk​=x, with an odd number kkk of steps. Write ei=(vi,vi+1)e_i=(v_i,v_{i+1})ei​=(vi​,vi+1​) for its iii-th step, i=0,…,k−1i=0,\dots,k-1i=0,…,k−1, with initial point ei−=vie_i^-=v_iei−​=vi​ and end point ei+=vi+1e_i^+=v_{i+1}ei+​=vi+1​. Then for every function φ:X→R\varphi:X\to\mathbb Rφ:X→R,

2φ(x)=∑i=0k−1(−1)i(φ(ei−)+φ(ei+))=(φ(x)+φ(v1))−(φ(v1)+φ(v2))+⋯+(φ(vk−1)+φ(x)).2\varphi(x)=\sum_{i=0}^{k-1}(-1)^{i}\big(\varphi(e_i^-)+\varphi(e_i^+)\big) =(\varphi(x)+\varphi(v_1))-(\varphi(v_1)+\varphi(v_2))+\dots+(\varphi(v_{k-1})+\varphi(x)).2φ(x)=i=0∑k−1​(−1)i(φ(ei−​)+φ(ei+​))=(φ(x)+φ(v1​))−(φ(v1​)+φ(v2​))+⋯+(φ(vk−1​)+φ(x)).

This is the representation on which the proof of Proposition 2 rests: an odd closed path writes φ(x)\varphi(x)φ(x) as an alternating sum of the edge quantities φ(e−)+φ(e+)\varphi(e^-)+\varphi(e^+)φ(e−)+φ(e+), to which Cauchy–Schwarz is then applied. The sign (−1)i(-1)^{i}(−1)i is the paper's (−1)l(e)(-1)^{l(e)}(−1)l(e), with l(e)l(e)l(e) the distance of e−e^-e− from xxx along the path.

Formalization Note The page states φ(x)=12{… }\varphi(x)=\tfrac12\{\dots\}φ(x)=21​{…}; the statement is written with 2φ(x)2\varphi(x)2φ(x) on the left, which is the same claim without a division. No Markov chain enters: the identity holds for any closed sequence with an odd number of steps, whether or not its steps are edges.

Preamble
import Mathlib
import Definitions.Def_DiaconisStroock_Poincare_Paths
Formal statement
namespace DiaconisStroock.OddPaths

theorem two_mul_eq_alternating_sum {V : Type*} (x : V) (p : List V) (hhead : p.head? = some x)
    (hlast : p.getLast? = some x) (hodd : Odd (DiaconisStroock.Poincare.pathEdges p).length) :
    ∀ φ : V → ℝ,
      2 * φ x = ((DiaconisStroock.Poincare.pathEdges p).mapIdx fun i e => (-1 : ℝ) ^ i * (φ e.1 + φ e.2)).sum := by sorry

end DiaconisStroock.OddPaths
Source
Diaconis and Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991), p. 40, §1C, proof of Proposition 2 (display after (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