Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3B: the bottleneck constant satisfies h ≥ 1/(2η)

Proved
DiaconisStroock.CanonPaths.bottleneckStar_ge

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

bottleneckcanonical-pathsmarkov-chainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a finite irreducible reversible Markov chain with at least two states and stationary distribution π\piπ. For a chosen positive-flow walk γxy\gamma_{xy}γxy​ between every distinct ordered pair, write η\etaη for the directed-edge congestion in (3.2). Let hhh be the minimum of Q(S×Sc)/π(S)Q(S\times S^{\mathrm c})/\pi(S)Q(S×Sc)/π(S) over nonempty SSS with π(S)≤12\pi(S)\leq\tfrac12π(S)≤21​. Then

h≥12η.h\geq\frac{1}{2\eta}.h≥2η1​.

This converts a bound on chosen walk congestion into a lower bound on the chain's bottleneck constant.

Formalization Note The two-state hypothesis gives meaning to the second eigenvalue used by the surrounding proposition and ensures a nonempty positive-flow edge family. Equal-endpoint walks do not enter η\etaη.

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

open MarkovMixing

/-- Canonical-path congestion bounds the bottleneck constant from below
(§3B, proof of Proposition 7, p. 54). -/
theorem bottleneckStar_ge {V : Type*} [Fintype V] [DecidableEq V]
    (hV : 2 ≤ Fintype.card V) (P : Matrix V V ℝ) (hP : IsStochastic P)
    (hirr : MarkovMixing.Irreducible P) (π : V → ℝ) (hπ : IsStationary P π)
    (hrev : DetailedBalance P π) (Γ : V → V → List V)
    (hΓ : IsWalkSystem P π Γ) :
    1 / (2 * eta P π Γ) ≤ bottleneckStar P π := 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