Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 10 — ℙᴺ{V(x*_N) > ε(s*_N)} ≤ γ* with γ* the value of (10)

Proved
WaitJudge.Convex.theorem_1

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

moment-problemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scenario-optimizationsupport-constraintswait-and-judge

Let x∈Rdx\in\mathbb R^dx∈Rd be the optimization variable, c∈Rdc\in\mathbb R^dc∈Rd a cost vector, X⊆Rd\mathcal X\subseteq\mathbb R^dX⊆Rd a convex domain, and Xδ⊆Rd\mathcal X_\delta\subseteq\mathbb R^dXδ​⊆Rd convex constraint sets indexed by δ\deltaδ in a probability space (Δ,F,P)(\Delta,\mathcal F,\mathbb P)(Δ,F,P). Ties are broken by minimising convex functions t1,…,tpt_1,\dots,t_pt1​,…,tp​ in succession. Let δ(1),…,δ(N)\delta^{(1)},\dots,\delta^{(N)}δ(1),…,δ(N) be an i.i.d. sample with N>dN>dN>d, let xN∗x^*_NxN∗​ be the solution of the scenario program

min⁡x∈XcTxsubject to x∈⋂i=1NXδ(i),\min_{x\in\mathcal X}c^{\mathsf T}x\quad\text{subject to } x\in\bigcap_{i=1}^N\mathcal X_{\delta^{(i)}},x∈Xmin​cTxsubject to x∈i=1⋂N​Xδ(i)​,

let sN∗s^*_NsN∗​ be its number of support constraints, and let V(x)=P{δ:x∉Xδ}V(x)=\mathbb P\{\delta: x\notin\mathcal X_\delta\}V(x)=P{δ:x∈/Xδ​} be the violation.

Let ϵ(k)\epsilon(k)ϵ(k), k=0,1,…,dk=0,1,\dots,dk=0,1,…,d, be any [0,1][0,1][0,1]-valued function. Under Assumptions 1 and 2,

PN{V(xN∗)>ϵ(sN∗)} ≤ γ∗,\mathbb P^N\{V(x^*_N)>\epsilon(s^*_N)\}\ \le\ \gamma^*,PN{V(xN∗​)>ϵ(sN∗​)} ≤ γ∗,

where γ∗\gamma^*γ∗ is the value of the variational problem (10):

γ∗=inf⁡ξ∈Cd[0,1]ξ(1)subject to1k!dkdtkξ(t)≥(Nk)tN−k 1[0,1−ϵ(k))(t),  t∈[0,1], k=0,1,…,d.\gamma^*=\inf_{\xi\in C^d[0,1]}\xi(1)\quad\text{subject to}\quad\frac1{k!}\frac{\mathrm d^k}{\mathrm dt^k}\xi(t)\ge\binom Nk t^{N-k}\,\mathbf 1_{[0,1-\epsilon(k))}(t),\ \ t\in[0,1],\ k=0,1,\dots,d.γ∗=ξ∈Cd[0,1]inf​ξ(1)subject tok!1​dtkdk​ξ(t)≥(kN​)tN−k1[0,1−ϵ(k))​(t),  t∈[0,1], k=0,1,…,d.

The theorem lets the user observe the number of support constraints after solving and then certify the solution at the level ϵ(sN∗)\epsilon(s^*_N)ϵ(sN∗​), with a confidence that holds uniformly over all convex problems and all distributions.

Formalization Note Assumption 1 is required for every sample (as on the page), Assumption 2 almost surely. The measurability the paper takes for granted (footnote 1) is assumed as two hypotheses: the set {(x,δ):x∈Xδ}\{(x,\delta):x\in\mathcal X_\delta\}{(x,δ):x∈Xδ​} is measurable and every solution map ω↦xm∗(ω)\omega\mapsto x^*_m(\omega)ω↦xm∗​(ω) is Borel measurable. N>dN>dN>d is the paper's standing assumption (p. 2). The probability is compared with γ∗\gamma^*γ∗ through ofReal\mathrm{ofReal}ofReal; γ∗∈[0,1]\gamma^*\in[0,1]γ∗∈[0,1].

Preamble
import Mathlib
import Definitions.Def_ScenarioApproach_Generalization_violation
import Definitions.Def_WaitJudge_Convex_Setting

open MeasureTheory ScenarioApproach.Generalization
Formal statement
namespace WaitJudge.Convex

theorem theorem_1 {d p : ℕ} {Δ : Type*} [MeasurableSpace Δ] (P : Measure Δ) [IsProbabilityMeasure P]
    (c : E d) (X : Set (E d)) (Xδ : Δ → Set (E d)) (tb : Fin p → E d → ℝ)
    (hX : Convex ℝ X) (hXδ : ∀ δ, Convex ℝ (Xδ δ))
    (htb : ∀ j, ConvexOn ℝ Set.univ (tb j))
    (hA1 : Assumption1 c X Xδ tb) (hA2 : Assumption2 c X Xδ tb P)
    (hmeas : MeasurabilityPins c X Xδ tb)
    (N : ℕ) (hN : d < N) (ε : ℕ → ℝ) (hε : ∀ k ≤ d, 0 ≤ ε k ∧ ε k ≤ 1) :
    (Measure.pi fun _ : Fin N => P) {ω | ε (sstar c X Xδ tb ω) < violation P Xδ (xstar c X Xδ tb ω)} ≤ ENNReal.ofReal (gammaStar N d ε) := by sorry

end WaitJudge.Convex
Source
Campi & Garatti, Wait-and-judge scenario optimization, Math. Program. (2018), doi:10.1007/s10107-016-1056-9 (accepted manuscript), PDF p. 10, Theorem 1 and (10); setting PDF pp. 2–4, 8–9
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