Corollary 10.8 -- the resistance triangle inequality
ProvedMarkovMixing.resistance_triangleLet be a network on a finite vertex set: a symmetric nonnegative conductance function with total conductance at every vertex, whose associated walk is irreducible. For distinct vertices, the effective resistance is defined through the voltage and the current as .
The theorem (Corollary 10.8 of Levin–Peres–Wilmer) asserts that effective resistance satisfies the triangle inequality: for pairwise distinct vertices ,
Together with symmetry and positivity this makes a genuine metric on the vertices of a connected network — the resistance metric. In the book it is a direct consequence of the commute time identity, which converts the claim into the sub-additivity of round-trip times through the intermediate vertex .
import Definitions.Def_mm_network
namespace MarkovMixing
/-- **Corollary 10.8** (LPW): effective resistance satisfies the triangle
inequality `R(a↔c) ≤ R(a↔b) + R(b↔c)`. -/
theorem resistance_triangle {V : Type*} [Fintype V] [DecidableEq V]
(c : V → V → ℝ) (hc : IsConductance c)
(hpos : ∀ x : V, 0 < vertexConductance c x)
(hirr : Irreducible (networkWalk c)) (a b z : V)
(hab : a ≠ b) (hbz : b ≠ z) (haz : a ≠ z) :
effectiveResistance c a z ≤
effectiveResistance c a b + effectiveResistance c b z := by
sorry
end MarkovMixing
Read-back
What the Lean code literally says, in plain math · claude-fable-5
Read-back: resistance_triangle
Let be a finite type (with decidable equality), and let be a function satisfying the bundled hypothesis "is a conductance": for all and for all . (Nothing forbids nonzero self-conductances , and need not be nonzero anywhere beyond what the other hypotheses force.) Write for the total conductance at a vertex ; the theorem assumes for every . Define the transition matrix of the "network walk" by (real division, so this is the usual random-walk matrix under the positivity assumption). The theorem further assumes is "irreducible" in the following sense: for every pair there exists a natural number with — note is allowed, and is the identity matrix, so the diagonal case is automatically satisfied by . Given two designated vertices , the "voltage" at is defined as , where is the sum, over all length- vertex sequences with , of the path weight , restricted to sequences that end at , avoid at every index before the last one, and avoid at every index including index (so this is a probability that the walk started at hits strictly before ; in particular , and the infinite series is Lean's tsum, which takes the value if the series fails to be summable). The "current strength" from to is , and the "effective resistance" is defined as the multiplicative inverse — with the Lean convention that , so if the current strength vanishes the effective resistance is by fiat rather than infinite. Under all of the above hypotheses, and for three vertices assumed pairwise distinct (, , ), the theorem asserts the triangle inequality
i.e. the effective resistance (as defined above, via the inverse of current strength) between and is at most the sum of the effective resistances between and and between and . The inequality is non-strict, and nothing beyond the stated hypotheses (symmetry and nonnegativity of , strictly positive vertex conductances, irreducibility of the walk, pairwise distinctness of ) is assumed.
Confirmed by the mission captain (proposal self-audit).