Lemma 2.3 — the bounding-hypercube center is the symmetry point
ProvedRobustPower.AdaptGap.lemma_2_3_centerconvex-geometryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
Let be a bounded set, symmetric about , and let and be its coordinatewise infimum and supremum. Then the center of its bounding hypercube is the point of symmetry, and if moreover , every is at most twice that center, coordinatewise:
This geometric statement identifies a scenario at the center of a symmetric uncertainty set and bounds every scenario by a multiple of it.
Formalization Note Boundedness is implicit on the page, where (2.5)–(2.6) are maxima and minima. The page states without , but the claim fails without it (, , ); in the paper is always a nonnegative uncertainty set, so that clause carries the hypothesis.
Preamble
import Mathlib import Definitions.Def_RobustPower_AdaptGap_SymmetricSets
Formal statement
namespace RobustPower.AdaptGap
/-- Lemma 2.3, p. 12: for a bounded set `S` symmetric about `u` (boundedness is implicit on the
page in the maxima and minima (2.5)–(2.6)), the centre of the bounding hypercube (2.7) is `u`.
If moreover `S ⊆ ℝⁿ₊` (the paper's setting, used by its proof; the printed second claim fails
for `S = [-1, 1]`), then `x ≤ 2 · x⁰` for all `x ∈ S`. -/
theorem lemma_2_3_center {ι : Type*} [Fintype ι] (S : Set (ι → ℝ))
(u : ι → ℝ) (hsym : RobustPower.StochGap.IsSymmetricAbout S u)
(hbdd : Bornology.IsBounded S) :
boxCenter S = u ∧
((∀ x ∈ S, 0 ≤ x) → ∀ x ∈ S, x ≤ (2 : ℝ) • boxCenter S) := by sorry
end RobustPower.AdaptGap
Source
Bertsimas & Goyal, On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems, authors' manuscript (MIT DSpace) of Math. Oper. Res. DOI 10.1287/moor.1090.0440, p. 12, Lemma 2.3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.