Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 9.10 -- Thomson's principle

Proved
MarkovMixing.thomson_principle

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

Let ccc be a network on a finite vertex set: a symmetric nonnegative conductance function with total conductance c(x)=∑yc(x,y)>0c(x)=\sum_yc(x,y)>0c(x)=∑y​c(x,y)>0 at every vertex, whose associated walk P(x,y)=c(x,y)/c(x)P(x,y)=c(x,y)/c(x)P(x,y)=c(x,y)/c(x) is irreducible. Fix distinct vertices a≠za\ne za=z. A flow from aaa to zzz is an antisymmetric edge function θ(x,y)=−θ(y,x)\theta(x,y)=-\theta(y,x)θ(x,y)=−θ(y,x) vanishing wherever ccc does, satisfying the node law ∑yθ(x,y)=0\sum_y\theta(x,y)=0∑y​θ(x,y)=0 at every vertex except aaa and zzz; its strength is the net flux ∑yθ(a,y)\sum_y\theta(a,y)∑y​θ(a,y) out of aaa, and a flow of strength one is a unit flow. The energy of a flow is

E(θ)=12∑x,yθ(x,y)2c(x,y),\mathcal E(\theta)=\frac12\sum_{x,y}\frac{\theta(x,y)^2}{c(x,y)},E(θ)=21​x,y∑​c(x,y)θ(x,y)2​,

each undirected edge counted once. The effective resistance R(a↔z)R(a\leftrightarrow z)R(a↔z) is defined through the voltage W(x)=Px{τa<τz}W(x)=\mathbb P_x\{\tau_a<\tau_z\}W(x)=Px​{τa​<τz​} and the current ∥I∥=∑yc(a,y)[W(a)−W(y)]\|I\|=\sum_yc(a,y)[W(a)-W(y)]∥I∥=∑y​c(a,y)[W(a)−W(y)] as R(a↔z)=∥I∥−1R(a\leftrightarrow z)=\|I\|^{-1}R(a↔z)=∥I∥−1.

The theorem (Thomson's Principle, Theorem 9.10 of Levin–Peres–Wilmer) asserts:

  1. R(a↔z)=inf⁡{E(θ):θ a unit flow from a to z}R(a\leftrightarrow z)=\inf\{\mathcal E(\theta):\theta\ \text{a unit flow from}\ a\ \text{to}\ z\}R(a↔z)=inf{E(θ):θ a unit flow from a to z};
  2. the infimum is attained — some unit flow (the current flow) has energy exactly R(a↔z)R(a\leftrightarrow z)R(a↔z).

Resistance is a variational quantity: any unit flow certifies an upper bound on it, which is the source of all flow-based hitting-time estimates.

Preamble
import Definitions.Def_mm_network
Formal statement
namespace MarkovMixing

/-- **Theorem 9.10, Thomson's Principle** (LPW): for a connected network,
the effective resistance is the minimal energy of a unit flow from `a` to
`z`, and the minimum is attained. -/
theorem thomson_principle {V : Type*} [Fintype V] [DecidableEq V]
    (c : V → V → ℝ) (hc : IsConductance c)
    (hpos : ∀ x : V, 0 < vertexConductance c x)
    (hirr : Irreducible (networkWalk c)) (a z : V) (haz : a ≠ z) :
    effectiveResistance c a z =
      sInf {r : ℝ | ∃ θ : V → V → ℝ,
        IsFlow c θ a z ∧ flowStrength θ a = 1 ∧ r = flowEnergy c θ} ∧
    ∃ θ : V → V → ℝ, IsFlow c θ a z ∧ flowStrength θ a = 1 ∧
      effectiveResistance c a z = flowEnergy 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.4, Theorem 9.10, p. 121

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me