Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — with C₂ bounded, j = J, inf Q = inf P, the same first-stage minimizers, and the infimum over ℒ^∞ recourses is attained

Proved
StochConvexProg.FirstStage.theorem_2

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

first-stage-problemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1recoursestochastic-programming

Consider the two-stage stochastic convex program under its standing assumptions, and suppose the second-stage constraint set C2C_2C2​ is bounded. Then the conclusions of Theorem 1 hold:

  1. j(x1)=J(x1)=inf⁡x2∈Ln2∞f(x1,x2)j(x_1)=J(x_1)=\inf_{x_2\in\mathcal L^\infty_{n_2}}f(x_1,x_2)j(x1​)=J(x1​)=infx2​∈Ln2​∞​​f(x1​,x2​) for every x1∈Rn1x_1\in\mathbb R^{n_1}x1​∈Rn1​ (3.8);
  2. inf⁡Q=inf⁡P\inf\mathbf Q=\inf\mathbf PinfQ=infP;
  3. x1x_1x1​ gives the minimum in the intrinsic first-stage problem Q\mathbf QQ if and only if it gives the minimum in the first-stage problem induced by P\mathbf PP;

and moreover

  1. for each x1∈Rn1x_1\in\mathbb R^{n_1}x1​∈Rn1​ the infimum in (3.8) is attained: there is x2∈Ln2∞x_2\in\mathcal L^\infty_{n_2}x2​∈Ln2​∞​ with
f(x1,x2)=inf⁡x2′∈Ln2∞f(x1,x2′).f(x_1,x_2)=\inf_{x_2'\in\mathcal L^\infty_{n_2}}f(x_1,x_2').f(x1​,x2​)=x2′​∈Ln2​∞​inf​f(x1​,x2′​).

Thus when C2C_2C2​ is bounded, restricting recourse to essentially bounded measurable functions loses no generality, and an optimal recourse function exists for every first-stage decision.

Formalization Note "Gives the minimum" is "≤\le≤ the value at every other point". J(x1)J(x_1)J(x1​) is the EReal infimum over all of Ln2∞\mathcal L^\infty_{n_2}Ln2​∞​ (Lp (Fin n₂ → ℝ) ⊤ σ).

Preamble
import Mathlib
import Definitions.Def_StochConvexProg_FirstStage_Problem
import Definitions.Def_DupacovaWets_Consistency_expect
import Definitions.Def_StochConvexProg_FirstStage_FirstStage

open MeasureTheory
Formal statement
namespace StochConvexProg.FirstStage

/-- Theorem 2, p. 187: if `C₂` is bounded, the conclusions of Theorem 1 hold (`j = J`, `inf Q = inf P`,
the same first-stage minimizers), and the infimum in (3.8) is attained for each `x₁` by some
`x₂ ∈ ℒ^∞_{n₂}`. -/
theorem theorem_2 {S : Type*} [MeasurableSpace S] {σ : Measure S} [IsProbabilityMeasure σ]
    {n₁ n₂ m₁ m₂ : ℕ} (pr : Problem S σ n₁ n₂ m₁ m₂) (hC₂ : Bornology.IsBounded pr.C₂) :
    (∀ x₁, pr.j x₁ = pr.J x₁) ∧ pr.infQ = pr.infP ∧
      (∀ x₁, (∀ x₁', pr.j x₁ ≤ pr.j x₁') ↔ (∀ x₁', pr.J x₁ ≤ pr.J x₁')) ∧
      (∀ x₁, ∃ x₂ : Lp (Fin n₂ → ℝ) ⊤ σ, pr.f (x₁, x₂) = pr.J x₁) := by sorry

end StochConvexProg.FirstStage
Source
Rockafellar and Wets, Stochastic convex programming: basic duality, Pacific J. Math. 62(1) (1976), p. 187, Theorem 2 (with Theorem 1, p. 186)
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