B.2, p. 27 β inf_{Dβ² β π©} B(Dβ², D_tr) < r for an open π© β D with B(D, D_tr) = r
ProvedBootRobust.Optimality.inf_N_ltconvexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relative-entropy
Let with having all coordinates positive, and suppose with . Let be open in with . Then
Combined with Sanov's lower bound (31) and the inclusion , this gives the strict rate inequality of Proposition 1.
Formalization Note The infimum is taken in the extended reals. The hypothesis is a disclosed addition: for the strict inequality is false since . In Proposition 1 it holds automatically, because forces while contradicts on .
Preamble
import Mathlib import Definitions.Def_BootRobust_Optimality_Setting
Formal statement
namespace BootRobust.Optimality
/-- B.2, p. 27: if `B(D, D_tr) = r > 0` and `N` is a relatively open subset of `πβ` containing `D`,
then `inf_{D' β N} B(D', D_tr) < r`. -/
theorem inf_N_lt {ΞΉ : Type*} [Fintype ΞΉ] [DecidableEq ΞΉ]
(D Dtr : ΞΉ β β) (hD : D β stdSimplex β ΞΉ) (hDtr : Dtr β stdSimplex β ΞΉ)
(hDtrpos : β i, 0 < Dtr i) (r : β) (hB : BootRobust.Perf.bootDist D Dtr = (r : EReal)) (hr : 0 < r)
(N : Set (ΞΉ β β)) (hN : relOpen N) (hDN : D β N) :
β¨
D' β N, BootRobust.Perf.bootDist D' Dtr < (r : EReal) := 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, indeed we have β¦"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.