Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.3 — 𝒞 is nonempty and closed, F is locally Lipschitz, and the level sets of F on 𝒞 are compact

Proved
ProgHedging.Convex.proposition_3_3

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

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

In problem (P), the admissible set C={X∣X(s)∈Cs ∀s}\mathcal C=\{X\mid X(s)\in C_s\ \forall s\}C={X∣X(s)∈Cs​ ∀s} is nonempty and closed, the objective F(X)=∑spsfs(X(s))F(X)=\sum_s p_sf_s(X(s))F(X)=∑s​ps​fs​(X(s)) is locally Lipschitz continuous on the policy space E\mathcal EE, and every level set

{X∈C∣F(X)≤α},α∈R,\{X\in\mathcal C\mid F(X)\le\alpha\},\qquad \alpha\in\mathbb R,{X∈C∣F(X)≤α},α∈R,

is compact.

This transfers the standing assumptions on the scenario data to the full problem, and yields existence of optimal solutions of (P) whenever it is feasible.

Formalization Note. The printed statement breaks off after "all level sets of the form (3.8)" without a predicate; its proof ends "It follows that any set (3.8) is compact", which is the reading formalized. Local Lipschitz continuity and compactness use Mathlib's (product) topology on policies, which in finite dimension is the topology of the paper's norm.

Preamble
import Mathlib
import Definitions.Def_ProgHedging_Convex_Problem

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

/-- Proposition 3.3, p. 13 (with the conclusion of its proof: the level sets are compact).
The feasible set `𝒞` of (P) is nonempty and closed, `F` is locally Lipschitz on `ℰ`, and every level
set `{X ∈ 𝒞 | F(X) ≤ α}` is compact. -/
theorem proposition_3_3 {S : Type*} [Fintype S] {n T : ℕ} (pr : Problem S n T) :
    pr.adm.Nonempty ∧ IsClosed pr.adm ∧ LocallyLipschitz pr.F ∧
    ∀ α : ℝ, IsCompact {X | X ∈ pr.adm ∧ pr.F 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. 13, Proposition 3.3, (3.8), and its proof
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