Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.2, p. 27 β€” int 𝒩 = 𝒩 βŠ† β„›β€² βŠ† β„› for the separating functional

Proved
BootRobust.Optimality.N_subset_disapp

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

disappointmentdistributionally-robust-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let R:DnΓ—Dnβ†’(βˆ’βˆž,+∞]R:\mathcal D_n\times\mathcal D_n\to(-\infty,+\infty]R:Dn​×Dn​→(βˆ’βˆž,+∞], DtrD_{\rm tr}Dtr​, r∈Rr\in\mathbb Rr∈R, a loss G:ΞΉβ†’RG:\iota\to\mathbb RG:ΞΉβ†’R and a∈Ra\in\mathbb Ra∈R be given, and let NβŠ†Dn\mathcal N\subseteq\mathcal D_nNβŠ†Dn​ be open in Dn\mathcal D_nDn​. Suppose

ED[G]≀aΒ Β wheneverΒ D∈Dn,Β R(D,Dtr)≀r,a<EDβ€²[G]Β Β forΒ allΒ Dβ€²βˆˆN.\mathbb E_D[G]\le a\ \text{ whenever } D\in\mathcal D_n,\ R(D,D_{\rm tr})\le r,\qquad a<\mathbb E_{D'}[G]\ \text{ for all } D'\in\mathcal N.ED​[G]≀aΒ Β wheneverΒ D∈Dn​,Β R(D,Dtr​)≀r,a<ED′​[G]Β Β forΒ allΒ Dβ€²βˆˆN.

Then int N=N{\rm int}\,\mathcal N=\mathcal NintN=N (interior relative to Dn\mathcal D_nDn​) and

NβŠ†R={D∈Dn:Β ED[G]>sup⁑Dβ€²βˆˆDn,Β R(Dβ€²,Dtr)≀rEDβ€²[G]},\mathcal N\subseteq\mathcal R=\Big\{D\in\mathcal D_n:\ \mathbb E_D[G]>\sup_{D'\in\mathcal D_n,\ R(D',D_{\rm tr})\le r}\mathbb E_{D'}[G]\Big\},NβŠ†R={D∈Dn​:Β ED​[G]>Dβ€²βˆˆDn​,Β R(Dβ€²,Dtr​)≀rsup​ED′​[G]},

the disappointment set of the nominal formulation with cost estimator D↦ED[G]D\mapsto\mathbb E_D[G]D↦ED​[G].

This places the separating neighbourhood inside the disappointment set, so a lower bound on the bootstrap probability of N\mathcal NN is one for R\mathcal RR.

Formalization Note The supremum is taken in the extended reals.

Preamble
import Mathlib
import Definitions.Def_BootRobust_Optimality_Setting
Formal statement
namespace BootRobust.Optimality

/-- B.2, p. 27: if `𝔼_D[G] ≀ a < 𝔼_{D'}[G]` for every `D` in the `R`-ball of radius `r` around `D_tr`
and every `D'` in a relatively open set `N`, then `int N = N` (interior relative to `π’Ÿβ‚™`) and `N` lies
in the disappointment set `β„›` of the nominal formulation with cost estimator `D ↦ 𝔼_D[G]`. -/
theorem N_subset_disapp {ΞΉ : Type*} [Fintype ΞΉ] [DecidableEq ΞΉ]
    (R : (ΞΉ β†’ ℝ) β†’ (ΞΉ β†’ ℝ) β†’ EReal) (Dtr : ΞΉ β†’ ℝ) (r : ℝ)
    (N : Set (ΞΉ β†’ ℝ)) (hN : relOpen N) (G : ΞΉ β†’ ℝ) (a : ℝ)
    (hball : βˆ€ D ∈ stdSimplex ℝ ΞΉ, R D Dtr ≀ (r : EReal) β†’ βˆ‘ i, D i * G i ≀ a)
    (hNsep : βˆ€ D' ∈ N, a < βˆ‘ i, D' i * G i) :
    relInt N = N ∧ N βŠ† linDisapp R Dtr r G := by sorry

end BootRobust.Optimality
Source
Bertsimas and Van Parys, Bootstrap robust prescriptive analytics, arXiv:1711.09974v2, B.2 (proof of Proposition 1), p. 27, "Hence, int N = N βŠ† Rβ€² …"
Human review
  • Endorsed by Shuze Chen Β· Oct 8, 2026

    Confirmed by the moderator at approval.

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