Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition C.4.3 — steady state probabilities along an AS: zero limits off positive recurrent states, subsequential limits bπ on a class

Proved
SennottDP.ChainASM.as_steady_state_limits

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

approximating-sequencemarkov-chainp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1steady-state

Let (ΓN)(\Gamma_N)(ΓN​) be an approximating sequence for the Markov chain Γ\GammaΓ on a denumerable state space SSS, and write πi(N)\pi_i(N)πi​(N) for the steady state probability of iii in ΓN\Gamma_NΓN​ (set to 000 for i∉SNi\notin S_Ni∈/SN​). Then:

  1. If i∈Si\in Si∈S is transient or null recurrent, then lim⁡N→∞πi(N)=πi=0\lim_{N\to\infty}\pi_i(N)=\pi_i=0limN→∞​πi​(N)=πi​=0.
  2. Let RRR be a positive recurrent class of Γ\GammaΓ. Given a sequence NrN_rNr​, there exist a subsequence NsN_sNs​ of NrN_rNr​ and a constant bbb with 0≤b≤10\le b\le 10≤b≤1 such that
lim⁡s→∞πi(Ns)=b πi,i∈R.\lim_{s\to\infty}\pi_i(N_s)=b\,\pi_i,\qquad i\in R.s→∞lim​πi​(Ns​)=bπi​,i∈R.

The constant bbb measures how much of the steady state mass of the class RRR survives the approximation; b=1b=1b=1 for all sequences is equivalent to πi(N)→πi\pi_i(N)\to\pi_iπi​(N)→πi​ on RRR.

Formalization Note "Transient or null recurrent" is encoded as "not positive recurrent", i.e. mii=∞m_{ii}=\inftymii​=∞. The sequence NrN_rNr​ is a strictly increasing sequence of indices and the subsequence is Ns=Nr(s)N_s=N_{r(s)}Ns​=Nr(s)​ for a strictly increasing r(⋅)r(\cdot)r(⋅).

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_steady_state_limits {S : Type*} [Countable S] [Infinite S]
    (Γ : MC S) (AS : ApproxSeq Γ) :
    (∀ i : S, ¬ Γ.PosRecurrent i →
      Tendsto (fun N => AS.steadyStateN N i) atTop (𝓝 (Γ.steadyState i)) ∧
        Γ.steadyState i = 0) ∧
    (∀ R : Set S, Γ.IsPosRecClass R → ∀ Nr : ℕ → ℕ, StrictMono Nr →
      ∃ φ : ℕ → ℕ, StrictMono φ ∧ ∃ b : ℝ≥0∞, b ≤ 1 ∧
        ∀ i ∈ R, Tendsto (fun s => AS.steadyStateN (Nr (φ s)) i) atTop
          (𝓝 (b * Γ.steadyState i))) := by sorry

end SennottDP.ChainASM
Source
Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999), p. 303, Proposition C.4.3
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