Theorem 5.2(c) (N) —
ProvedNegativeDP.OptEq.theorem52cbellman-operatordynamic-programmingnegative-dynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a Markov policy of a negative dynamic programming problem and its operator. For every sequence in ,
With (a) it shows that the class of functions conserved by is closed under countable suprema, which is used in Theorem 6.2.
The paper states Theorem 5.2 for the discounted, positive and negative cases; this item is the negative case. Formalization Note The family is indexed by (a countable family, so that ); each is a hypothesis.
Preamble
import Mathlib import Definitions.Def_DiscountedDP_Stationary_Model import Definitions.Def_DiscountedDP_Stationary_Return import Definitions.Def_DiscountedDP_Stationary_Operators import Definitions.Def_NegativeDP_OptEq_Model open MeasureTheory ProbabilityTheory Filter Topology open scoped ENNReal open DiscountedDP.Stationary (Hist Plan MarkovPlan stationary IsGenerated IsGeneratedPlan)
Formal statement
namespace NegativeDP.OptEq
variable {S A : Type*} [MeasurableSpace S] [StandardBorelSpace S] [Nonempty S]
[MeasurableSpace A] [StandardBorelSpace A] [Nonempty A]
/-- Strauch (1966), Theorem 5.2(c), p. 879, negative case: `U(supⱼ uⱼ) ≥ supⱼ Uuⱼ` for a
sequence `u₁, u₂, …` in `M(S)`. -/
theorem theorem52c (P : NegativeDP.Stationary.Problem S A) (π : MarkovPlan S A) (u : ℕ → S → EReal)
(hu : ∀ j, NegativeDP.Stationary.IsNegM (u j)) :
∀ s, ⨆ j, U P π (u j) s ≤ U P π (fun t => ⨆ j, u j t) s := by sorry
end NegativeDP.OptEq
Source
Strauch, Negative Dynamic Programming, Ann. Math. Statist. 37 (1966), p. 879, Theorem 5.2(c)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.