Proposition 7.7.1 — (SEN) implies (H*), and (H*) implies (H)
ProvedSennottDP.SEN.prop_7_7_1_sen_hstar_haverage-costp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1sen-assumptions
Let be a distinguished state. The three assumption sets are nested:
Precisely: if (SEN) holds with the function in (SEN2) and the constant in (SEN3), then (H*) holds with the same and the constant function ; and if (H*) holds with functions and , then (H) holds with the same and .
The (H) assumptions weaken (SEN3) by allowing the lower bound on to be a function, at the price of the integrability conditions (H4)–(H5); (H*5) is a sufficient condition for (H5) that is easier to check.
Preamble
import Mathlib import Definitions.Def_SennottDP_SEN_Assumptions
Formal statement
namespace SennottDP.SEN
/-- Sennott (1999), Proposition 7.7.1, p. 158: (SEN) ⇒ (H*) ⇒ (H). With the witnesses made
explicit: if (SEN) holds for `z` with function `Mf` and constant `L`, then (H*) holds for `z`
with `Mf` and the constant function `L(·) = L`; and if (H*) holds for `z` with functions `Mf`,
`Lf`, then (H) holds for `z` with the same `Mf`, `Lf`. -/
theorem prop_7_7_1_sen_hstar_h {S : Type} [Countable S] {Act : Type} (M : SennottDP.Discounted.MDC S Act) (z : S) :
(∀ (Mf : S → ℝ) (L : ℝ), SENAssumptions M z Mf L → HStarAssumptions M z Mf (fun _ => L)) ∧
∀ Mf Lf : S → ℝ, HStarAssumptions M z Mf Lf → HAssumptions M z Mf Lf := by sorry
end SennottDP.SEN
Source
Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999), p. 158, Proposition 7.7.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.