Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.3, p. 25, paragraph after the proof of Theorem 3 — z*(ξ̄)′ξ̄ > 0 implies z′ξ̄ ≥ z*(ξ̄)′ξ̄ > 0 for all z ∈ 𝒵

Proved
PDScenRed.Mean.pos_on_Z

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

p2o-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} 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ξ. If v∈Rdv\in\mathbb R^dv∈Rd satisfies z∗(v)′v>0z^*(v)'v>0z∗(v)′v>0, then every feasible decision has positive cost under vvv:

z′v  ≥  z∗(v)′v  >  0for all z∈Z.z'v \;\ge\; z^*(v)'v \;>\; 0 \qquad \text{for all } z\in\mathcal Z.z′v≥z∗(v)′v>0for all z∈Z.

The paper applies this with v=ξˉv=\bar\xiv=ξˉ​ and Assumption 5b: every decision, in particular every z∗(ξ)z^*(\xi)z∗(ξ), has z′ξˉ>0z'\bar\xi>0z′ξˉ​>0, so the second clipping in L(ξ,ξˉ)L(\xi,\bar\xi)L(ξ,ξˉ​) is inactive.

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

theorem pos_on_Z {d r : ℕ} (P : Matrix (Fin r) (Fin d) ℝ) (qv : Fin r → ℝ)
    (zsel : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d))
    (hsel : ∀ ξ, zsel ξ ∈ SmartPTO.Fisher.Wstar (polytope P qv) ξ)
    (v : EuclideanSpace ℝ (Fin d)) (hv : 0 < ⟪zsel v, v⟫_ℝ) :
    ∀ z ∈ polytope P qv, ⟪zsel v, v⟫_ℝ ≤ ⟪z, v⟫_ℝ ∧ 0 < ⟪z, v⟫_ℝ := 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, paragraph after the proof of Theorem 3, second 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