§1C, proof of Proposition 2, p. 40 — φ(x) = ½{(φ(x)+φ(y)) − (φ(y)+φ(w)) + ⋯ + (φ(z)+φ(x))} along an odd closed path
ProvedDiaconisStroock.OddPaths.two_mul_eq_alternating_sumidentityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1path-system
Let and let be a closed vertex sequence at , i.e. , with an odd number of steps. Write for its -th step, , with initial point and end point . Then for every function ,
This is the representation on which the proof of Proposition 2 rests: an odd closed path writes as an alternating sum of the edge quantities , to which Cauchy–Schwarz is then applied. The sign is the paper's , with the distance of from along the path.
Formalization Note The page states ; the statement is written with 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.