Proposition 5.15 — the minimax model satisfies I, I.1, I.2 or D, D.2, with scalar α
ProvedBertsekasShreve.Monotone.prop5_15_minimax_assumptionsLet be a set, , , and . Consider an abstract monotone dynamic programming model on , with constraint sets such that is nonempty for every , , whose mapping is the minimax mapping
(sums with ) and whose terminal function is for all .
- If
then Assumptions I, I.1 and I.2 are satisfied, with the scalar in I.2 equal to . 2. If
then Assumptions D and D.2 are satisfied, with the scalar in D.2 equal to .
Assumption D.1 is absent from part 2: without further hypotheses the supremum does not commute with decreasing limits, which is why only part of the chapter's theory applies to minimax control under D.
Formalization Note Part 1 is stated for every MonotoneDP.Increase.Model and part 2 for every MonotoneDP.Decrease.Model whose fields are H = BertsekasShreve.FiniteHorizon.minimaxH Wset g f α (the shared definition of Section 2.3.5's mapping, sum taken with badd, i.e. ) and Jbar ≡ 0; such models exist because the mapping is monotone in . The section's standing assumptions and are explicit hypotheses.
import Mathlib import Definitions.Def_MonotoneDP_Increase_Model import Definitions.Def_MonotoneDP_Increase_Assumptions import Definitions.Def_MonotoneDP_Decrease_Model import Definitions.Def_MonotoneDP_Decrease_Assumptions import Definitions.Def_BertsekasShreve_FiniteHorizon_SpecificModels
namespace BertsekasShreve.Monotone
/-- Bertsekas & Shreve (1996), p. 90, Proposition 5.15: for the minimax mapping
`H(x, u, J) = sup_{w ∈ W(x, u)} {g(x, u, w) + α J[f(x, u, w)]}` of Section 2.3.5 (with `α > 0` and
`W(x, u)` nonempty for `x ∈ S`, `u ∈ U(x)`, the standing assumptions of that section) and
`J₀ ≡ 0`:
(a) if `0 ≤ g(x, u, w)` for all `x ∈ S`, `u ∈ U(x)`, `w ∈ W`, then I, I.1 and I.2 hold, the scalar
in I.2 being `α`;
(b) if `g(x, u, w) ≤ 0` for all `x ∈ S`, `u ∈ U(x)`, `w ∈ W`, then D and D.2 hold, the scalar in
D.2 being `α`. -/
theorem prop5_15_minimax_assumptions {S C W : Type*}
(Wset : S → C → Set W) (g : S → C → W → EReal) (f : S → C → W → S) (α : ℝ) (hα : 0 < α) :
(∀ m : MonotoneDP.Increase.Model S C, m.H = BertsekasShreve.FiniteHorizon.minimaxH Wset g f α → m.Jbar = (fun _ => 0) →
(∀ x : S, ∀ u ∈ m.U x, (Wset x u).Nonempty) →
(∀ x : S, ∀ u ∈ m.U x, ∀ w : W, 0 ≤ g x u w) →
m.AssumptionI ∧ m.AssumptionI1 ∧ m.AssumptionI2 α) ∧
(∀ m : MonotoneDP.Decrease.Model S C, m.H = BertsekasShreve.FiniteHorizon.minimaxH Wset g f α → m.Jbar = (fun _ => 0) →
(∀ x : S, ∀ u ∈ m.U x, (Wset x u).Nonempty) →
(∀ x : S, ∀ u ∈ m.U x, ∀ w : W, g x u w ≤ 0) →
m.AssumptionD ∧ m.AssumptionD2 α) := by sorry
end BertsekasShreve.Monotone
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.