Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 7.5.9 — (CAV) implies (BOR)

Proved
SennottDP.BOR.bor_of_cav

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 hold for the distinguished state zzz and the policy ddd: ddd is zzz standard with positive recurrent class RdR_dRd​; 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; and for every i∈S−Rdi\in S-R_di∈S−Rd​ there is a policy θi∈ℜ∗(z,i)\theta_i\in\Re^*(z,i)θi​∈ℜ∗(z,i). Then the (BOR) assumptions hold, for zzz, ddd and some ε>0\varepsilon>0ε>0.

These conditions are easy to verify when the costs of Δ\DeltaΔ are unbounded.

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.9, p. 148. If the (CAV) assumptions hold for the distinguished
state `z` and the `z` standard policy `d`, then the (BOR) assumptions hold (for `z`, `d` and
some `ε > 0`). -/
theorem bor_of_cav {S Act : Type} [Countable S] (M : SennottDP.Discounted.MDC S Act) (z : S)
    (d : RandStationaryPolicy M) (hCAV : 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. 148, Corollary 7.5.9
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