Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 9.1 -- the network walk is reversible

Proved
MarkovMixing.network_walk_reversible

by Shuze Chen · Aug 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainsmixing-timesprobability

A network on a finite vertex set VVV is a conductance function ccc: a symmetric assignment c(x,y)=c(y,x)≥0c(x,y)=c(y,x)\ge0c(x,y)=c(y,x)≥0 of nonnegative weights to pairs of vertices. Write c(x)=∑yc(x,y)c(x)=\sum_yc(x,y)c(x)=∑y​c(x,y) for the total conductance at the vertex xxx — assumed strictly positive at every vertex — and cG=∑xc(x)c_G=\sum_xc(x)cG​=∑x​c(x) for the total over all vertices. The weighted random walk on the network steps from xxx to yyy with probability proportional to the conductance:

P(x,y)=c(x,y)c(x).P(x,y)=\frac{c(x,y)}{c(x)}.P(x,y)=c(x)c(x,y)​.

The theorem (§9.1 of Levin–Peres–Wilmer) asserts:

  1. PPP is a genuine Markov chain: nonnegative entries with every row summing to one;
  2. PPP satisfies the detailed balance equations π(x)P(x,y)=π(y)P(y,x)\pi(x)P(x,y)=\pi(y)P(y,x)π(x)P(x,y)=π(y)P(y,x) with respect to the distribution π(x)=c(x)/cG\pi(x)=c(x)/c_Gπ(x)=c(x)/cG​ — it is reversible;
  3. π\piπ is a stationary distribution for PPP: ∑xπ(x)P(x,y)=π(y)\sum_x\pi(x)P(x,y)=\pi(y)∑x​π(x)P(x,y)=π(y) for every yyy.

This is the dictionary's first entry: every network yields a reversible chain, and conversely every reversible chain arises this way — which is why the electrical machinery of Chapters 9–10 computes hitting times of reversible chains.

Preamble
import Definitions.Def_mm_network
Formal statement
namespace MarkovMixing

/-- **§9.1** (LPW): the weighted random walk on a network is a Markov chain,
reversible with respect to `π(x) = c(x)/c_G`, which is therefore its
stationary distribution. -/
theorem network_walk_reversible {V : Type*} [Fintype V] [DecidableEq V]
    [Nonempty V] (c : V → V → ℝ) (hc : IsConductance c)
    (hpos : ∀ x : V, 0 < vertexConductance c x) :
    IsStochastic (networkWalk c) ∧
    DetailedBalance (networkWalk c)
      (fun x => vertexConductance c x / totalConductance c) ∧
    IsStationary (networkWalk c)
      (fun x => vertexConductance c x / totalConductance c) := by
  sorry

end MarkovMixing
Source
D. A. Levin, Y. Peres, E. L. Wilmer, Markov Chains and Mixing Times, AMS 2009, https://documents.epfl.ch/groups/i/ip/ipg/www/2013-2014/Random_Walks/markovmixing.pdf, Section 9.1, pp. 115-116

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