§1B, proof of Proposition 1 — path Cauchy–Schwarz inequality
ProvedDiaconisStroock.Poincare.sq_sub_le_qLength_mulcauchy-schwarzmarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1path-system
For a walk from to along positive- edges of a finite stochastic chain, with , any real function satisfies
This is the per-path Cauchy–Schwarz inequality displayed in the proof of Proposition 1.
Formalization Note The inequality holds for walks even when an edge repeats; repeated traversals are counted in both sums. The full path system later requires edge-simple paths.
Preamble
import Mathlib import Definitions.Def_DiaconisStroock_Poincare_Paths
Formal statement
namespace DiaconisStroock.Poincare
open MarkovMixing
/-- The per-path Cauchy–Schwarz step in the proof of Proposition 1, p. 38. -/
theorem sq_sub_le_qLength_mul {V : Type*} [Fintype V] [DecidableEq V]
(P : Matrix V V ℝ) (hP : IsStochastic P) (π : V → ℝ)
(x y : V) (p : List V) (hp : IsWalk P π x y p) (φ : V → ℝ) :
(φ y - φ x) ^ 2 ≤ qLength P π p *
((pathEdges p).map fun e =>
edgeMeasure P π e.1 e.2 * (φ e.2 - φ e.1) ^ 2).sum := by sorry
end DiaconisStroock.Poincare
Source
Diaconis and Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991), p. 38, §1B, proof of Proposition 1, second and third display lines, https://doi.org/10.1214/aoap/1177005980
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.