Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.2 — every modified scenario subproblem has an optimal solution, unique in the convex case

Proved
ProgHedging.Convex.proposition_3_2

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

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

Let s∈Ss\in Ss∈S, x^,w∈Rn\hat x,w\in\mathbb R^nx^,w∈Rn and r>0r>0r>0. The modified scenario subproblem

(P^s(x^,w,r))minimize fs(x)+x⋅w+12r ∣x−x^∣2 over x∈Cs(\hat P_s(\hat x,w,r))\qquad \text{minimize } f_s(x)+x\cdot w+\tfrac12 r\,|x-\hat x|^2 \text{ over } x\in C_s(P^s​(x^,w,r))minimize fs​(x)+x⋅w+21​r∣x−x^∣2 over x∈Cs​

has at least one optimal solution (so a finite optimal value). In the convex case its optimal solution is unique.

The subproblems (Psν)(P^\nu_s)(Psν​) of the progressive hedging algorithm are of this form, so this is what makes Step 2 of the algorithm well defined.

Formalization Note. "Finite optimal value" is automatic for a real-valued objective with a minimizer, so it is not stated separately.

Preamble
import Mathlib
import Definitions.Def_ProgHedging_Convex_Problem

open scoped RealInnerProductSpace Pointwise Topology
open Filter
Formal statement
namespace ProgHedging.Convex

/-- Proposition 3.2, p. 11. For `r > 0`, every modified scenario subproblem
`(P̂_s(x̂, w, r))  minimize f_s(x) + x·w + ½ r |x − x̂|²  over x ∈ C_s`
has an optimal solution (hence a finite optimal value); in the convex case it is unique. -/
theorem proposition_3_2 {S : Type*} [Fintype S] {n T : ℕ} (pr : Problem S n T) (s : S)
    (xhat w : EuclideanSpace ℝ (Fin n)) {r : ℝ} (hr : 0 < r) :
    (∃ x ∈ pr.C s, ∀ z ∈ pr.C s, pr.subObj s xhat w r x ≤ pr.subObj s xhat w r z) ∧
    (pr.ConvexCase → ∀ x ∈ pr.C s, ∀ x' ∈ pr.C s,
      (∀ z ∈ pr.C s, pr.subObj s xhat w r x ≤ pr.subObj s xhat w r z) →
      (∀ z ∈ pr.C s, pr.subObj s xhat w r x' ≤ pr.subObj s xhat w r z) → x = x') := by sorry

end ProgHedging.Convex
Source
Rockafellar and Wets, Scenarios and policy aggregation in optimization under uncertainty, IIASA Working Paper WP-87-119 (1987), p. 11, Proposition 3.2, (3.4); (P̂_s(x̂, w, r)) defined p. 7
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