Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 7.5.10 — (CAV*) implies (CAV), hence (BOR)

Proved
SennottDP.BOR.cav_of_irreducible_standard

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

average-costmarkov-chainp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Assume the (CAV*) assumptions: (CAV1) there is a standard policy ddd — zzz standard for a state zzz — whose positive recurrent class is all of SSS, Rd=SR_d=SRd​=S; (CAV2) for every U>0U>0U>0 the set DU={i∣C(i,a)≤U for some a}D_U=\{i\mid C(i,a)\le U\text{ for some }a\}DU​={i∣C(i,a)≤U for some a} is finite. Then the (CAV) assumptions hold for zzz and ddd, and hence (BOR) is valid for zzz, ddd and some ε>0\varepsilon>0ε>0.

Formalization Note "Standard" is read as "zzz standard for some state zzz"; the conclusion is stated for that same zzz.

Preamble
import Mathlib
import Definitions.Def_SennottDP_BOR_Assumptions

open scoped ENNReal NNReal
open Filter Topology
Formal statement
namespace SennottDP.BOR

/-- Sennott (1999), Corollary 7.5.10, p. 149. Assume (CAV*): (CAV*1) there is a standard policy
`d` (here: `z` standard for the state `z`) with `R_d = S`; (CAV*2) for every `U > 0` the set
`D_U = {i | C(i,a) ≤ U for some a}` is finite. Then the (CAV) assumptions hold, and hence (BOR)
is valid (for `z`, `d` and some `ε > 0`). -/
theorem cav_of_irreducible_standard {S Act : Type} [Countable S] (M : SennottDP.Discounted.MDC S Act) (z : S)
    (d : RandStationaryPolicy M) (hd : IsZStandard d.toPolicy z)
    (hR : recClass M d z = Set.univ)
    (hD : ∀ U : ℝ, 0 < U → (lowCostSet M (ENNReal.ofReal U)).Finite) :
    CAVAssumptions M z d ∧ ∃ ε : ℝ, BORAssumptions M z d ε := by sorry

end SennottDP.BOR
Source
Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999), p. 149, Corollary 7.5.10
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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