Theorem 9.12 -- Rayleigh's monotonicity law
ProvedMarkovMixing.rayleigh_monotonicityLet and be two networks on the same finite vertex set — symmetric nonnegative conductance functions, each with strictly positive total conductance at every vertex and an irreducible associated walk . For distinct vertices , the effective resistance is defined through the voltage and the current as .
The theorem (Rayleigh's Monotonicity Law, Theorem 9.12 of Levin–Peres–Wilmer) asserts: if on every edge — resistances are only increased — then
Decreasing conductances can only increase effective resistance. Deceptively simple, this is one of the most-used facts of the theory: it lets one bound resistances in a complicated network by deleting edges (setting conductances to zero) or by comparison with a tractable subnetwork, and through the commute-time identity it transfers to monotonicity statements for hitting times.
import Definitions.Def_mm_network
namespace MarkovMixing
/-- **Theorem 9.12, Rayleigh's Monotonicity Law** (LPW): decreasing
conductances (increasing resistances) can only increase the effective
resistance: if `c' ≤ c` edgewise, then `R_c(a↔z) ≤ R_{c'}(a↔z)`. -/
theorem rayleigh_monotonicity {V : Type*} [Fintype V] [DecidableEq V]
(c c' : V → V → ℝ) (hc : IsConductance c) (hc' : IsConductance c')
(hpos : ∀ x : V, 0 < vertexConductance c x)
(hpos' : ∀ x : V, 0 < vertexConductance c' x)
(hirr : Irreducible (networkWalk c)) (hirr' : Irreducible (networkWalk c'))
(hle : ∀ x y : V, c' x y ≤ c x y) (a z : V) (haz : a ≠ z) :
effectiveResistance c a z ≤ effectiveResistance c' a z := by
sorry
end MarkovMixing