Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3B: the cut weight is at most η times cut flow

Proved
DiaconisStroock.CanonPaths.cut_weight_le

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

canonical-pathscongestioncutmarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a stochastic matrix on a finite state space, let π\piπ have nonnegative weights, and choose a positive-flow walk γxy\gamma_{xy}γxy​ for every distinct ordered pair. For any set SSS, the total weight of ordered pairs from SSS to its complement is bounded by congestion times the stationary flow out of SSS:

π(S)π(Sc)≤η Q(S×Sc),Q(S×Sc)=∑x∈S, y∉Sπ(x)P(x,y).\pi(S)\pi(S^{\mathrm c})\leq \eta\,Q(S\times S^{\mathrm c}), \qquad Q(S\times S^{\mathrm c})= \sum_{x\in S,\,y\notin S}\pi(x)P(x,y).π(S)π(Sc)≤ηQ(S×Sc),Q(S×Sc)=x∈S,y∈/S∑​π(x)P(x,y).

This is the complementary cut estimate in the proof of Proposition 7.

Formalization Note Stochasticity ensures nonnegative flow even on cut edges not used by the selected walks. The inequality itself does not require stationarity, reversibility, or the condition π(S)≤12\pi(S)\leq\tfrac12π(S)≤21​.

Preamble
import Mathlib
import Definitions.Def_mm_lower
import Definitions.Def_DiaconisStroock_CanonPaths_Eta
Formal statement
namespace DiaconisStroock.CanonPaths

open MarkovMixing

/-- The aggregate weight of paths leaving a cut is at most η times the stationary flow
across that cut (§3B, proof of Proposition 7, p. 54). -/
theorem cut_weight_le {V : Type*} [Fintype V] [DecidableEq V]
    (P : Matrix V V ℝ) (hP : IsStochastic P) (π : V → ℝ)
    (hπ0 : ∀ x, 0 ≤ π x) (Γ : V → V → List V) (hΓ : IsWalkSystem P π Γ)
    (S : Finset V) :
    (∑ x ∈ S, π x) * (∑ y ∈ Sᶜ, π y) ≤
      eta P π Γ * ∑ x ∈ S, ∑ y ∈ Sᶜ, edgeMeasure P π x y := by sorry

end DiaconisStroock.CanonPaths
Source
Diaconis and Stroock, Geometric bounds for eigenvalues of Markov chains, Ann. Appl. Probab. 1 (1991), p. 54, §3B, proof of Proposition 7; 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