Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition C.5.2 — an ATAS sending excess probability to a finite set is conforming

Proved
SennottDP.ChainASM.atas_excess_to_finite_set_conforming

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

approximating-sequencemarkov-chainp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1truncation

Let Γ\GammaΓ be a zzz standard Markov chain with costs on a denumerable state space SSS, and let GGG be a finite nonempty subset of SSS. Let (ΓN)(\Gamma_N)(ΓN​) be an augmentation type approximating sequence whose augmentation distributions send the excess probability to GGG:

Pij(N)=Pij+∑r∈S−SNPir qj(i,r,N),∑j∈Gqj(i,r,N)=1.P_{ij}(N)=P_{ij}+\sum_{r\in S-S_N}P_{ir}\,q_j(i,r,N),\qquad \sum_{j\in G}q_j(i,r,N)=1 .Pij​(N)=Pij​+r∈S−SN​∑​Pir​qj​(i,r,N),j∈G∑​qj​(i,r,N)=1.

Then the ATAS is conforming: for large NNN each ΓN\Gamma_NΓN​ is unichain with zzz in its positive recurrent class, and miz(N)→mizm_{iz}(N)\to m_{iz}miz​(N)→miz​, ciz(N)→cizc_{iz}(N)\to c_{iz}ciz​(N)→ciz​ for all iii. Moreover, if GGG is contained in the positive recurrent class RRR of Γ\GammaΓ, the ATAS is also conforming on RRR: πi(N)→πi\pi_i(N)\to\pi_iπi​(N)→πi​ and J(i)(N)→JRJ(i)(N)\to J_RJ(i)(N)→JR​ for i∈Ri\in Ri∈R.

Truncating a countable chain to finite state spaces and returning the truncated probability to a fixed finite set is the construction the book uses to compute average-cost optimal policies for queueing models; this result guarantees that the truncated chains' first passage moments, steady state probabilities and average costs converge.

Formalization Note RRR is the communicating class of zzz, which for a zzz standard chain is its positive recurrent class (Proposition C.2.6). The augmentation distributions are a function q(N,i,r,j)=qj(i,r,N)q(N,i,r,j)=q_j(i,r,N)q(N,i,r,j)=qj​(i,r,N); the excess condition sums over G∩SNG\cap S_NG∩SN​.

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 atas_excess_to_finite_set_conforming {S : Type*} [Countable S] [Infinite S]
    (Γ : MC S) (z : S) (hz : Γ.IsZStandard z) (G : Finset S) (hG : G.Nonempty)
    (AS : ApproxSeq Γ) (q : ℕ → S → S → S → ℝ≥0∞) (hq : AS.IsATASWith q)
    (hexcess : AS.SendsExcessTo q (↑G : Set S)) :
    AS.IsConforming z ∧
      ((↑G : Set S) ⊆ Γ.commClass z → AS.IsConformingOn (Γ.commClass z)) := by sorry

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