Proposition 7.2.4 — (SEN) does not depend on the choice of distinguished state
ProvedSennottDP.SEN.prop_7_2_4_sen_any_stateaverage-costp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1sen-assumptions
Assume that the (SEN) assumptions hold for a distinguished state (with some function and constant ). Then for every other state the (SEN) assumptions also hold with as the distinguished state, for some nonnegative finite function and some nonnegative finite constant :
Verifying (SEN) therefore only requires a convenient choice of reference state.
Preamble
import Mathlib import Definitions.Def_SennottDP_SEN_Assumptions
Formal statement
namespace SennottDP.SEN
/-- Sennott (1999), Proposition 7.2.4, p. 137: assume that the (SEN) assumptions hold for a
distinguished state `z` (with some function `Mf` in (SEN2) and constant `L` in (SEN3)). Then
(SEN) holds if `z` is replaced by any other state `x`: there are a function `Mx` and a constant
`Lx` for which (SEN1)–(SEN3) hold with distinguished state `x`. -/
theorem prop_7_2_4_sen_any_state {S : Type} [Countable S] {Act : Type} (M : SennottDP.Discounted.MDC S Act) (z : S)
(Mf : S → ℝ) (L : ℝ) (hSEN : SENAssumptions M z Mf L) (x : S) :
∃ (Mx : S → ℝ) (Lx : ℝ), SENAssumptions M x Mx Lx := by sorry
end SennottDP.SEN
Source
Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999), p. 137, Proposition 7.2.4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.