Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.1 — each (P_s) attains its minimum, α̂ = min over 𝒞 of F is attained, equals E{α_s}, and bounds min (P) below

Proved
ProgHedging.Convex.proposition_3_1

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1progressive-hedgingstochastic-programming

Under the standing assumptions, each scenario subproblem (Ps)(P_s)(Ps​) — minimize fsf_sfs​ over CsC_sCs​ — has an optimal solution, hence a finite optimal value αs=min⁡(Ps)\alpha_s=\min(P_s)αs​=min(Ps​). Moreover the value

α^=min⁡X∈CF(X)\hat\alpha=\min_{X\in\mathcal C}F(X)α^=X∈Cmin​F(X)

is attained, and for any choice of optimal solutions xsx_sxs​ of (Ps)(P_s)(Ps​),

α^=E{αs}=∑s∈Spsfs(xs).\hat\alpha=E\{\alpha_s\}=\sum_{s\in S}p_s f_s(x_s).α^=E{αs​}=s∈S∑​ps​fs​(xs​).

Finally α^≤min⁡(P)\hat\alpha\le\min(P)α^≤min(P), the optimal value of (P) (which is +∞+\infty+∞ if (P) is infeasible).

This identifies the trivial lower bound obtained by solving the scenarios separately, the starting point X0X^0X0 suggested for the algorithm.

Formalization Note. α^\hat\alphaα^ is the EReal infimum of FFF over C\mathcal CC; its attainment is part of the statement. αs\alpha_sαs​ is written as fs(xs)f_s(x_s)fs​(xs​) for an arbitrary family of minimizers.

Preamble
import Mathlib
import Definitions.Def_ProgHedging_Convex_Problem
import Definitions.Def_ProgHedging_Convex_Duality
open scoped RealInnerProductSpace Pointwise Topology
open Filter
Formal statement
namespace ProgHedging.Convex

/-- Proposition 3.1, pp. 10–11. Each scenario subproblem `(P_s)` attains its minimum; the value
`α̂ = min_{X ∈ 𝒞} F(X)` is attained and equals `E{α_s}` with `α_s = min (P_s)`; and `α̂ ≤ min (P)`. -/
theorem proposition_3_1 {S : Type*} [Fintype S] {n T : ℕ} (pr : Problem S n T) :
    (∀ s, ∃ x ∈ pr.C s, ∀ z ∈ pr.C s, pr.f s x ≤ pr.f s z) ∧
    (∃ X ∈ pr.adm, ((pr.F X : ℝ) : EReal) = pr.alphaHat) ∧
    (∀ xs : S → EuclideanSpace ℝ (Fin n),
      (∀ s, xs s ∈ pr.C s ∧ ∀ z ∈ pr.C s, pr.f s (xs s) ≤ pr.f s z) →
        pr.alphaHat = ((∑ s, pr.p s * pr.f s (xs s) : ℝ) : EReal)) ∧
    pr.alphaHat ≤ pr.minP := by sorry

end ProgHedging.Convex
Source
Rockafellar and Wets, Scenarios and policy aggregation in optimization under uncertainty, IIASA Working Paper WP-87-119 (1987), pp. 10–11, Proposition 3.1, (3.2)–(3.3)
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