Corollary 7.5.9 — (CAV) implies (BOR)
ProvedSennottDP.BOR.bor_of_cavaverage-costmarkov-chainp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1
Assume the (CAV) assumptions hold for the distinguished state and the policy : is standard with positive recurrent class ; for every the set is finite; and for every there is a policy . Then the (BOR) assumptions hold, for , and some .
These conditions are easy to verify when the costs of 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.