Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition C.4.9 — a conforming AS has π_i(N) → π_i for all i and constant average costs J(N) → J_R

Proved
SennottDP.ChainASM.conforming_steady_state_avg_cost

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

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

Let Γ\GammaΓ be a zzz standard Markov chain with costs on a denumerable state space SSS, and let (ΓN)(\Gamma_N)(ΓN​) be a conforming approximating sequence. Let RRR be the positive recurrent class of Γ\GammaΓ containing zzz and JRJ_RJR​ its average cost. Then:

  1. πi(N)→πi\pi_i(N)\to\pi_iπi​(N)→πi​ for all i∈Si\in Si∈S;
  2. J(N)→JRJ(N)\to J_RJ(N)→JR​, where J(N)J(N)J(N) is the constant average cost on ΓN\Gamma_NΓN​ for N≥N∗N\ge N^*N≥N∗:
J(i)(N)=J(N)  for i∈SN and N large,lim⁡N→∞J(N)=JR.J(i)(N)=J(N)\ \text{ for } i\in S_N \text{ and } N \text{ large},\qquad \lim_{N\to\infty}J(N)=J_R.J(i)(N)=J(N)  for i∈SN​ and N large,N→∞lim​J(N)=JR​.

Conformity thus delivers exactly what an approximation scheme is used for: the steady state distribution and the average cost of the finite chains converge to those of Γ\GammaΓ.

Formalization Note The positive recurrent class containing zzz is written as the communicating class of zzz (for a zzz standard chain it is positive recurrent, Proposition C.2.6). Part 2 is stated as the existence of a sequence J(N)J(N)J(N) that equals J(i)(N)J(i)(N)J(i)(N) for every i∈SNi\in S_Ni∈SN​ for all sufficiently large NNN and converges to JRJ_RJR​.

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 conforming_steady_state_avg_cost {S : Type*} [Countable S] [Infinite S]
    (Γ : MC S) (z : S) (hz : Γ.IsZStandard z) (AS : ApproxSeq Γ)
    (hconf : AS.IsConforming z) :
    (∀ i : S, Tendsto (fun N => AS.steadyStateN N i) atTop (𝓝 (Γ.steadyState i))) ∧
    ∃ Jc : ℕ → ℝ≥0∞, (∀ᶠ N in atTop, ∀ i ∈ AS.SN N, AS.avgCostN N i = Jc N) ∧
      Tendsto Jc atTop (𝓝 (Γ.classAvgCost (Γ.commClass z))) := by sorry

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