Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Resistance is well defined; zero-resistance transitions are the feasible transitions of P0P^0P0 (p. 77)

Proved
YoungConventions.Perturbed.resistance_spec

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

markov-chainp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1perturbationstochastic-stability

Let P0P^0P0 be a Markov chain on a finite set XXX and (Pε)ε∈(0,a](P^\varepsilon)_{\varepsilon \in (0,a]}(Pε)ε∈(0,a]​ a regular perturbation of P0P^0P0. For all x,y∈Xx, y \in Xx,y∈X:

  1. the exponent rrr in condition (8) is unique: if ε−rPxyε\varepsilon^{-r}P^\varepsilon_{xy}ε−rPxyε​ and ε−r′Pxyε\varepsilon^{-r'}P^\varepsilon_{xy}ε−r′Pxyε​ both converge to finite positive limits, then r=r′r = r'r=r′;
  2. if Pxyε>0P^\varepsilon_{xy} > 0Pxyε​>0 for some ε∈(0,a]\varepsilon \in (0,a]ε∈(0,a], then (x,y)(x,y)(x,y) is an edge of GGG, i.e. Pxyε>0P^\varepsilon_{xy} > 0Pxyε​>0 for all sufficiently small ε>0\varepsilon > 0ε>0;
  3. if (x,y)(x,y)(x,y) is an edge of GGG, then the resistance r(x,y)r(x,y)r(x,y) satisfies (8);
  4. (x,y)(x,y)(x,y) is an edge of GGG with r(x,y)=0r(x, y) = 0r(x,y)=0 if and only if
Pxy0>0.P^0_{xy} > 0.Pxy0​>0.

Thus the transitions of zero resistance are exactly the transitions feasible under P0P^0P0, and the resistance r(x,y)r(x,y)r(x,y) is a well-defined weight on the edges of GGG.

Formalization Note Item 4 reads the paper's "r(x,y)=0r(x,y) = 0r(x,y)=0 iff Pxy0>0P^0_{xy} > 0Pxy0​>0" on the transitions where r(x,y)r(x,y)r(x,y) is defined (the edges of GGG); with item 2 it also gives Pxy0=0P^0_{xy} = 0Pxy0​=0 off the edges of GGG.

Preamble
import Mathlib
import Definitions.Def_YoungConventions_Perturbed_FiniteChain
import Definitions.Def_YoungConventions_Perturbed_RegularPerturbation

open Filter Topology
Formal statement
namespace YoungConventions.Perturbed

/-- Resistance is well defined, and zero resistance means feasible under `P⁰`
(Young 1993, Econometrica 61:57–84, Appendix, discussion of condition (8), p. 77, PDF p. 22).

For a regular perturbation `P^ε` of a Markov chain `P⁰` and all states `x, y`:
1. the exponent `r` of (8) is unique;
2. if `P^ε_{xy} > 0` for some `ε ∈ (0, a]`, then `(x, y)` is an edge of `G` (positive for all
   sufficiently small `ε`);
3. on an edge of `G`, `resistance P x y` is an exponent satisfying (8);
4. `(x, y)` is an edge of `G` of zero resistance iff `P⁰_{xy} > 0`.

**Formalization Note.** Item 4 is the paper's "r(x, y) = 0 if and only if P⁰_xy > 0", read on the
transitions for which `r(x, y)` is defined (the edges of `G`); together with item 2 it also gives
`P⁰_{xy} = 0` whenever `(x, y)` is not an edge of `G`. -/
theorem resistance_spec {X : Type*} [Fintype X] [DecidableEq X]
    (P0 : Matrix X X ℝ) (hP0 : P0 ∈ Matrix.rowStochastic ℝ X)
    (P : ℝ → Matrix X X ℝ) (a : ℝ) (hP : IsRegularPerturbation P0 P a) (x y : X) :
    (∀ r r' : ℝ, HasResistance P x y r → HasResistance P x y r' → r = r') ∧
    ((∃ ε ∈ Set.Ioc 0 a, 0 < P ε x y) → IsEdge P x y) ∧
    (IsEdge P x y → HasResistance P x y (resistance P x y)) ∧
    ((IsEdge P x y ∧ resistance P x y = 0) ↔ 0 < P0 x y) := by sorry

end YoungConventions.Perturbed
Source
Young (1993), The Evolution of Conventions, Econometrica 61:57–84, Appendix, discussion of condition (8), p. 77 (PDF p. 22)
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