Proposition 3.1, proof — balls of radius about the cover
ProvedPolyhedralSOC.LowerBound.covering_claimconvex-geometrycovering-numbersp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and let be a finite set such that
- the convex hull of contains the closed unit Euclidean ball , and
- every satisfies .
Then the closed Euclidean balls of radius centred at the cover the sphere : for every with there is an with
Applied to the vertices of the slice (which satisfies ), this is the geometric heart of the lower bound: a polytope sandwiched between two nearby balls must have vertices close to every point of the outer sphere.
Preamble
import Mathlib import Definitions.Def_PolyhedralSOC_Shared_LorentzCone
Formal statement
namespace PolyhedralSOC.LowerBound
/-- Ben-Tal & Nemirovski, *On Polyhedral Approximations of the Second-Order Cone*,
Math. Oper. Res. 26(2):193–205 (2001), Proposition 3.1, proof, p. 202 (PDF p. 10):
"We claim that the N Euclidean balls B_i centered at y_i of the radius √(2ε(1+ε)) cover the
boundary of (1+ε)B." Stated for the points `y_i` as a finite set `S ⊆ ℝ^k` whose convex hull
contains the unit Euclidean ball `B` and which lies in `(1 + ε)B` (the two properties of `G`
the proof uses): every `y` with `‖y‖₂ = 1 + ε` lies in the closed Euclidean ball of radius
`√(2ε(1+ε))` about some point of `S`. -/
theorem covering_claim {k : ℕ} {ε : ℝ} (hε : 0 < ε) (S : Finset (Fin k → ℝ))
(hB : {y : Fin k → ℝ | Shared.eucNorm y ≤ 1} ⊆ convexHull ℝ (S : Set (Fin k → ℝ)))
(hS : ∀ s ∈ S, Shared.eucNorm s ≤ 1 + ε) :
∀ y : Fin k → ℝ, Shared.eucNorm y = 1 + ε →
∃ s ∈ S, Shared.eucNorm (y - s) ≤ Real.sqrt (2 * ε * (1 + ε)) := by sorry
end PolyhedralSOC.LowerBound
Source
Ben-Tal & Nemirovski, On Polyhedral Approximations of the Second-Order Cone, Math. Oper. Res. 26(2):193–205 (2001), p. 202, Proposition 3.1, proof ("We claim that the N Euclidean balls B_i centered at y_i of the radius √(2ε(1+ε)) cover the boundary of (1+ε)B")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.