Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition C.4.6 — on a positive recurrent class, convergence of π, of m_zz and of m_iG are equivalent, and then so are those of J, c_zz and c_iG

Disproved
SennottDP.ChainASM.as_class_convergence_equivalences

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

approximating-sequenceaverage-costmarkov-chainp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let (ΓN)(\Gamma_N)(ΓN​) be an approximating sequence for the Markov chain with costs Γ\GammaΓ on a denumerable state space SSS, and let RRR be a positive recurrent class of Γ\GammaΓ. Then the following are equivalent:

  1. πi(N)→πi\pi_i(N)\to\pi_iπi​(N)→πi​ for i∈Ri\in Ri∈R;
  2. mzz(N)→mzzm_{zz}(N)\to m_{zz}mzz​(N)→mzz​ for some z∈Rz\in Rz∈R;
  3. miG(N)→miGm_{iG}(N)\to m_{iG}miG​(N)→miG​ for any nonempty finite subset GGG of RRR and i∈Ri\in Ri∈R.

Assume that any (and hence all) of these hold. Then the following are equivalent:

  1. J(i)(N)→JRJ(i)(N)\to J_RJ(i)(N)→JR​ for i∈Ri\in Ri∈R;
  2. czz(N)→czzc_{zz}(N)\to c_{zz}czz​(N)→czz​ for some z∈Rz\in Rz∈R;
  3. ciG(N)→ciGc_{iG}(N)\to c_{iG}ciG​(N)→ciG​ for any nonempty finite subset GGG of RRR and i∈Ri\in Ri∈R.

Here JR=∑j∈RπjC(j)J_R=\sum_{j\in R}\pi_jC(j)JR​=∑j∈R​πj​C(j) is the (possibly infinite) average cost on RRR. The result reduces convergence of steady state probabilities and average costs on a class to convergence of the first passage moments to a single state.

Formalization Note All limits are in [0,∞][0,\infty][0,∞]; the equivalences are stated with List.TFAE.

Preamble
import Mathlib
import Definitions.Def_SennottDP_ChainASM_MarkovChain
import Definitions.Def_SennottDP_ChainASM_ApproxSeq
open scoped ENNReal NNReal
open Filter Topology
open Classical
Formal statement
namespace SennottDP.ChainASM

theorem as_class_convergence_equivalences {S : Type*} [Countable S] [Infinite S]
    (Γ : MC S) (AS : ApproxSeq Γ) (R : Set S) (hR : Γ.IsPosRecClass R) :
    List.TFAE
      [∀ i ∈ R, Tendsto (fun N => AS.steadyStateN N i) atTop (𝓝 (Γ.steadyState i)),
       ∃ z ∈ R, Tendsto (fun N => AS.meanPassageN {z} N z) atTop
         (𝓝 (Γ.meanPassage {z} z)),
       ∀ G : Finset S, G.Nonempty → (↑G : Set S) ⊆ R → ∀ i ∈ R,
         Tendsto (fun N => AS.meanPassageN (↑G : Set S) N i) atTop
           (𝓝 (Γ.meanPassage (↑G : Set S) i))] ∧
    ((∀ i ∈ R, Tendsto (fun N => AS.steadyStateN N i) atTop (𝓝 (Γ.steadyState i))) →
      List.TFAE
        [∀ i ∈ R, Tendsto (fun N => AS.avgCostN N i) atTop (𝓝 (Γ.classAvgCost R)),
         ∃ z ∈ R, Tendsto (fun N => AS.passageCostN {z} N z) atTop
           (𝓝 (Γ.passageCost {z} z)),
         ∀ G : Finset S, G.Nonempty → (↑G : Set S) ⊆ R → ∀ i ∈ R,
           Tendsto (fun N => AS.passageCostN (↑G : Set S) N i) atTop
             (𝓝 (Γ.passageCost (↑G : Set S) i))]) := by sorry

end SennottDP.ChainASM
Source
Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999), p. 305, Proposition C.4.6
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 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