Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

All states of a recurrent class of P0P^0P0 have the same potential γ\gammaγ (p. 80)

Proved
YoungConventions.Perturbed.potential_const_on_class

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

arborescencemarkov-chainp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-stability

Let (Pε)ε∈(0,a](P^\varepsilon)_{\varepsilon \in (0,a]}(Pε)ε∈(0,a]​ be a regular perturbation of the Markov chain P0P^0P0 on the finite set XXX. If xxx and yyy belong to the same recurrent communication class of P0P^0P0, then

γ(x)=γ(y),\gamma(x) = \gamma(y),γ(x)=γ(y),

where γ\gammaγ is the potential (9).

Together with Lemma 1 this shows that stochastic stability is a property of whole recurrent classes.

Preamble
import Mathlib
import Definitions.Def_YoungConventions_Perturbed_FiniteChain
import Definitions.Def_YoungConventions_Perturbed_InTree
import Definitions.Def_YoungConventions_Perturbed_RegularPerturbation
import Definitions.Def_YoungConventions_Perturbed_StochasticPotential

open Filter Topology Finset
Formal statement
namespace YoungConventions.Perturbed

/-- All states of a recurrent class have the same potential (Young 1993, Econometrica 61:57–84,
Appendix, p. 80, PDF p. 25).

Let `P^ε` be a regular perturbation of the Markov chain `P⁰`. If `x` and `y` lie in the same
recurrent communication class `C` of `P⁰`, then `γ(x) = γ(y)`, with `γ` the potential (9). -/
theorem potential_const_on_class {X : Type*} [Fintype X] [DecidableEq X] [Nonempty X]
    (P0 : Matrix X X ℝ) (hP0 : P0 ∈ Matrix.rowStochastic ℝ X)
    (P : ℝ → Matrix X X ℝ) (a : ℝ) (hP : IsRegularPerturbation P0 P a)
    (C : Finset X) (hC : C ∈ recurrentClasses P0) (x y : X) (hx : x ∈ C) (hy : y ∈ C) :
    statePotential P x = statePotential P y := by sorry

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