Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.3, proof of Theorem 3, p. 25, display — L(ξ, ζ) ≤ (‖ξ‖₁ + 4‖ζ‖₁) max_{z∈𝒵} ‖z‖_∞

Proved
PDScenRed.Mean.lossL_le

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

integrabilityp2o-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 and let z∗:Rd→Rdz^*:\mathbb R^d\to\mathbb R^dz∗:Rd→Rd be a selection of minimizers, z∗(ξ)∈arg⁡min⁡z∈Zz′ξz^*(\xi)\in\arg\min_{z\in\mathcal Z} z'\xiz∗(ξ)∈argminz∈Z​z′ξ for every ξ\xiξ. Let BBB be a bound on the coordinates of the feasible decisions, ∣zi∣≤B|z_i|\le B∣zi​∣≤B for every z∈Zz\in\mathcal Zz∈Z and every iii (for instance B=max⁡z∈Z∥z∥∞B=\max_{z\in\mathcal Z}\|z\|_\inftyB=maxz∈Z​∥z∥∞​). Then for all ξ,ζ∈Rd\xi,\zeta\in\mathbb R^dξ,ζ∈Rd,

L(ξ,ζ)≤∣max⁡z∈Zz′(ξ−2ζ)∣+2∣ζ′z∗(ξ)∣≤(∥ξ−2ζ∥1+2∥ζ∥1)B≤(∥ξ∥1+4∥ζ∥1)B,\begin{aligned} L(\xi,\zeta) &\le \Big|\max_{z\in\mathcal Z} z'(\xi-2\zeta)\Big| + 2|\zeta' z^*(\xi)| \\ &\le \big(\|\xi-2\zeta\|_1 + 2\|\zeta\|_1\big) B \\ &\le \big(\|\xi\|_1 + 4\|\zeta\|_1\big) B, \end{aligned}L(ξ,ζ)​≤​z∈Zmax​z′(ξ−2ζ)​+2∣ζ′z∗(ξ)∣≤(∥ξ−2ζ∥1​+2∥ζ∥1​)B≤(∥ξ∥1​+4∥ζ∥1​)B,​

where ∥v∥1=∑i∣vi∣\|v\|_1 = \sum_i |v_i|∥v∥1​=∑i​∣vi​∣.

This is the bound the proof uses to see that E[L(ξ,ζ)]\mathbb E[L(\xi,\zeta)]E[L(ξ,ζ)] is finite whenever E[ξ]\mathbb E[\xi]E[ξ] is finite, and that differentiation can be moved inside the expectation.

Formalization Note The three inequalities of the display are stated as three conjuncts. The paper's max⁡z∈Z∥z∥∞\max_{z\in\mathcal Z}\|z\|_\inftymaxz∈Z​∥z∥∞​ is replaced by any upper bound BBB of it, which is equivalent: the case B=max⁡z∈Z∥z∥∞B=\max_{z\in\mathcal Z}\|z\|_\inftyB=maxz∈Z​∥z∥∞​ is included, and every larger BBB makes the right-hand sides larger.

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

theorem lossL_le {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))
    (hsel : ∀ ξ, zsel ξ ∈ SmartPTO.Fisher.Wstar (polytope P qv) ξ)
    (B : ℝ) (hB : ∀ z ∈ polytope P qv, ∀ i, |z i| ≤ B) :
    ∀ ξ ζ : EuclideanSpace ℝ (Fin d),
      lossL (polytope P qv) zsel ξ ζ ≤
          |SmartPTO.Fisher.xi (polytope P qv) (ξ - (2 : ℝ) • ζ)| + 2 * |⟪ζ, zsel ξ⟫_ℝ| ∧
        |SmartPTO.Fisher.xi (polytope P qv) (ξ - (2 : ℝ) • ζ)| + 2 * |⟪ζ, zsel ξ⟫_ℝ| ≤
          (∑ i, |(ξ - (2 : ℝ) • ζ) i| + 2 * ∑ i, |ζ i|) * B ∧
        (∑ i, |(ξ - (2 : ℝ) • ζ) i| + 2 * ∑ i, |ζ i|) * B ≤
          (∑ i, |ξ i| + 4 * ∑ i, |ζ i|) * B := 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, second paragraph, displayed chain
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