Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.3, proof of Theorem 3, p. 25, first paragraph — ζ ↦ L(ξ, ζ) is convex

Proved
PDScenRed.Mean.lossL_convex

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

convexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scenario-reduction

Let Z={z∈R+d:Pz≤q}\mathcal Z = \{z\in\mathbb R^d_+ : Pz\le q\}Z={z∈R+d​:Pz≤q} be a nonempty bounded polytope, let z∗:Rd→Rdz^*:\mathbb R^d\to\mathbb R^dz∗:Rd→Rd be any map, and fix ξ∈Rd\xi\in\mathbb R^dξ∈Rd. Then the function

ζ⟼L(ξ,ζ)=max⁡{max⁡z∈Zz′(ξ−2ζ), 0}+2max⁡{z∗(ξ)′ζ, 0}\zeta \longmapsto L(\xi,\zeta) = \max\Big\{\max_{z\in\mathcal Z} z'(\xi - 2\zeta),\, 0\Big\} + 2\max\{ z^*(\xi)'\zeta,\, 0\}ζ⟼L(ξ,ζ)=max{z∈Zmax​z′(ξ−2ζ),0}+2max{z∗(ξ)′ζ,0}

is convex on Rd\mathbb R^dRd.

Convexity in the reduced scenario ζ\zetaζ is what makes the upper-bound problem (16) a convex programme, and it is the reason a zero subgradient certifies optimality in the proof of Theorem 3.

Formalization Note No property of z∗z^*z∗ is needed: for fixed ξ\xiξ, z∗(ξ)z^*(\xi)z∗(ξ) is a constant vector. The paper's Z\mathcal ZZ is nonempty and compact (§1); the polytope is closed, so boundedness is the stated hypothesis.

Preamble
import Mathlib
import Definitions.Def_PDScenRed_Mean_Setting
open scoped InnerProductSpace
open MeasureTheory
Formal statement
namespace PDScenRed.Mean

theorem lossL_convex {d r : ℕ} (P : Matrix (Fin r) (Fin d) ℝ) (qv : Fin r → ℝ)
    (hne : (polytope P qv).Nonempty) (hbdd : Bornology.IsBounded (polytope P qv))
    (zsel : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d))
    (ξ : EuclideanSpace ℝ (Fin d)) :
    ConvexOn ℝ Set.univ (fun ζ => lossL (polytope P qv) zsel ξ ζ) := by sorry

end PDScenRed.Mean
Source
Bertsimas & Mundru, Optimization-based Scenario Reduction for Data-Driven Two-stage Stochastic Optimization, author manuscript (MIT DSpace), p. 25, §4.3, proof of Theorem 3, first paragraph, last sentence
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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