Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 90 — for fully supported problems, ℓ* = ℓ*_d with probability 1

Proved
ScenarioApproach.EmpiricalCosts.worstCost_eq_empiricalCost_d_of_fullySupported

by mikedeng1 · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1scenario-approachsupport-constraints

Let ℓ(ν,δ)\ell(\nu,\delta)ℓ(ν,δ), ν∈Rd−1\nu\in\mathbb R^{d-1}ν∈Rd−1, be convex in ν\nuν for every δ\deltaδ, let the scenario program min⁡νmax⁡iℓ(ν,δi)\min_\nu\max_i\ell(\nu,\delta_i)minν​maxi​ℓ(ν,δi​) have a unique solution for every sample size m≥1m\ge1m≥1 and every sample, and let the problem be fully supported. Let ν∗\nu^*ν∗ be the solution with N≥dN\ge dN≥d scenarios drawn independently from P\mathbb PP, ℓ∗=max⁡iℓ(ν∗,δi)\ell^*=\max_i\ell(\nu^*,\delta_i)ℓ∗=maxi​ℓ(ν∗,δi​) its optimal value and ℓd∗\ell^*_dℓd∗​ its ddd-th empirical cost. Then

ℓ∗=ℓd∗with probability 1.\ell^*=\ell^*_d\qquad\text{with probability }1 .ℓ∗=ℓd∗​with probability 1.

In words: in a fully supported problem at least ddd scenarios attain the worst-case cost at the solution. In general only ℓ∗≥ℓd∗\ell^*\ge\ell^*_dℓ∗≥ℓd∗​ holds.

Formalization Note ν∈\nu\inν∈ EuclideanSpace ℝ (Fin n), d=n+1d=n+1d=n+1. "With probability 1" is ∀ᵐ with respect to the product measure PN\mathbb P^NPN. Existence and uniqueness is required for every m≥1m\ge1m≥1, and measurability of ℓ\ellℓ and of the solution map is assumed, as in the other theorems of this mission.

Preamble
import Mathlib
import Definitions.Def_ScenarioApproach_EmpiricalCosts_scenarioProgram
import Definitions.Def_ScenarioApproach_EmpiricalCosts_empiricalCost
import Definitions.Def_ScenarioApproach_EmpiricalCosts_supportConstraint
Formal statement
namespace ScenarioApproach.EmpiricalCosts

/-- p. 90: for fully supported problems (Definition 5.4), `ℓ* = ℓ*_d` with probability 1, where
`ℓ* = max_i ℓ(ν*, δᵢ)` is the optimal value of the scenario program (1.4) with `ν ∈ ℝ^n`,
`d = n + 1`, and `ℓ*_d` is its `d`-th empirical cost. -/
theorem worstCost_eq_empiricalCost_d_of_fullySupported
    {n N : ℕ} {Δ : Type*} [MeasurableSpace Δ]
    (P : MeasureTheory.Measure Δ) [MeasureTheory.IsProbabilityMeasure P]
    (ℓ : EuclideanSpace ℝ (Fin n) → Δ → ℝ)
    -- standing assumption (p. 6): `ℓ(ν, δ)` is convex in `ν` for every `δ`
    (hconv : ∀ δ, ConvexOn ℝ Set.univ fun ν => ℓ ν δ)
    -- measurability, glossed over in the book (p. 6, footnote 1; p. 33)
    (hmeas : Measurable (Function.uncurry ℓ))
    -- Assumption 3.6 for (1.4): existence and uniqueness for every `m ≥ 1` and every sample
    (hexu : ∀ m : ℕ, 1 ≤ m → ∀ ω : Fin m → Δ, ∃! ν, IsSolution ℓ ω ν)
    -- Definition 5.4 for (1.4)
    (hfs : FullySupported P ℓ)
    -- `νstar ω` is the solution `ν*` of the scenario program with the `N` scenarios `ω`
    (νstar : (Fin N → Δ) → EuclideanSpace ℝ (Fin n))
    (hνstar : ∀ ω, IsSolution ℓ ω (νstar ω)) (hνstar_meas : Measurable νstar)
    (hN : n + 1 ≤ N) :
    ∀ᵐ ω ∂(MeasureTheory.Measure.pi fun _ : Fin N => P),
      worstCost ℓ ω (νstar ω) = empiricalCost ℓ ω (νstar ω) (n + 1) := by sorry

end ScenarioApproach.EmpiricalCosts
Source
Campi & Garatti, Introduction to the Scenario Approach, SIAM/MOS 2018, DOI 10.1137/1.9781611975444, p. 90 (sentence after Definition 8.3); Definition 5.4, p. 58
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

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