Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2, p. 188 — with C₂ bounded, the argmin multifunction is nonempty compact, measurable, with a measurable selection

Proved
StochConvexProg.FirstStage.argmin_selection

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

measurable-selectionmultifunctionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

Suppose C2C_2C2​ is bounded and fix x1∈Rn1x_1\in\mathbb R^{n_1}x1​∈Rn1​. Let S′={s∈S∣∃x2, F2(s,x1,x2,0)<+∞}S'=\{s\in S\mid \exists x_2,\ F_2(s,x_1,x_2,0)<+\infty\}S′={s∈S∣∃x2​, F2​(s,x1​,x2​,0)<+∞} and, for s∈S′s\in S's∈S′, let Γ(s)\Gamma(s)Γ(s) be the set of x2∈Rn2x_2\in\mathbb R^{n_2}x2​∈Rn2​ at which the infimum q(s,x1)q(s,x_1)q(s,x1​) of F2(s,x1,⋅,0)F_2(s,x_1,\cdot,0)F2​(s,x1​,⋅,0) is attained (Γ(s)=∅\Gamma(s)=\emptysetΓ(s)=∅ for s∉S′s\notin S's∈/S′). Then:

  1. for every s∈S′s\in S's∈S′, Γ(s)\Gamma(s)Γ(s) is a nonempty compact subset of C2C_2C2​;
  2. Γ\GammaΓ is a measurable multifunction;
  3. there is a measurable x2:S→Rn2x_2:S\to\mathbb R^{n_2}x2​:S→Rn2​ with x2(s)∈Γ(s)x_2(s)\in\Gamma(s)x2​(s)∈Γ(s) for every s∈S′s\in S's∈S′.

This produces the optimal recourse function whose existence is the attainment claim of Theorem 2.

Formalization Note This Γ\GammaΓ 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
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me