Proof of Theorem 2, p. 188 — with C₂ bounded, the argmin multifunction is nonempty compact, measurable, with a measurable selection
ProvedStochConvexProg.FirstStage.argmin_selectionmeasurable-selectionmultifunctionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming
Suppose is bounded and fix . Let and, for , let be the set of at which the infimum of is attained ( for ). Then:
- for every , is a nonempty compact subset of ;
- is a measurable multifunction;
- there is a measurable with for every .
This produces the optimal recourse function whose existence is the attainment claim of Theorem 2.
Formalization Note This is the argmin multifunction of the proof of Theorem 2, not the feasible-recourse set (3.10); in Lean it is argminSet. Measurability of a multifunction is the published DupacovaWets.Consistency.IsMeasurableMultifunction.
Preamble
import Mathlib import Definitions.Def_StochConvexProg_FirstStage_Problem import Definitions.Def_DupacovaWets_Consistency_expect import Definitions.Def_StochConvexProg_FirstStage_FirstStage import Definitions.Def_DupacovaWets_Consistency_Multifunction open MeasureTheory
Formal statement
namespace StochConvexProg.FirstStage
/-- Proof of Theorem 2, p. 188: if `C₂` is bounded, then for each `x₁` the argmin multifunction
`Γ(s)` of `F₂(s, x₁, ·, 0)` is nonempty, compact and inside `C₂` for `s ∈ S′`, is measurable, and has a
measurable selection on `S′`. -/
theorem argmin_selection {S : Type*} [MeasurableSpace S] {σ : Measure S} [IsProbabilityMeasure σ]
{n₁ n₂ m₁ m₂ : ℕ} (pr : Problem S σ n₁ n₂ m₁ m₂) (hC₂ : Bornology.IsBounded pr.C₂) (x₁ : Fin n₁ → ℝ) :
(∀ s, (∃ x₂, pr.F₂ s x₁ x₂ 0 < ⊤) →
(pr.argminSet x₁ s).Nonempty ∧ IsCompact (pr.argminSet x₁ s) ∧
pr.argminSet x₁ s ⊆ pr.C₂) ∧
DupacovaWets.Consistency.IsMeasurableMultifunction (fun s => pr.argminSet x₁ s) ∧
∃ x₂ : S → (Fin n₂ → ℝ), Measurable x₂ ∧
∀ s, (∃ z, pr.F₂ s x₁ z 0 < ⊤) → x₂ s ∈ pr.argminSet x₁ s := by sorry
end StochConvexProg.FirstStage
Source
Rockafellar and Wets, Stochastic convex programming: basic duality, Pacific J. Math. 62(1) (1976), p. 188, proof of Theorem 2, first paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.