Proposition 3.1, proof —
ProvedPolyhedralSOC.LowerBound.ball_sandwichp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedral-approximationsecond-order-cone
Let and let be a polyhedral -approximation of . Let
and let be the closed unit Euclidean ball of . Then
This is the entry point of the lower-bound argument: the slice of the approximating polyhedral cone is squeezed between two concentric Euclidean balls whose radii differ by the factor .
Formalization Note The page writes "polyhedral approximation" at this point, a misprint for .
Preamble
import Mathlib import Definitions.Def_PolyhedralSOC_Shared_LorentzCone import Definitions.Def_PolyhedralSOC_Shared_IsPolyhedralApprox import Definitions.Def_PolyhedralSOC_LowerBound_ProofObjects
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):
"Since Π(·) is a polyhedral ε approximation of L^k, the set G contains the unit k-dimensional
Euclidean ball B and is contained in the ball (1+ε)B" (the page prints "α" for "ε"), where
`G = {y | Π(y, 1, u) ≥ 0 for some u}`. -/
theorem ball_sandwich {k p q : ℕ} {ε : ℝ} (hε : 0 < ε)
(P : (Fin k → ℝ) × ℝ × (Fin p → ℝ) →ₗ[ℝ] (Fin q → ℝ))
(hP : Shared.IsPolyhedralApprox k p q ε P) :
{y : Fin k → ℝ | Shared.eucNorm y ≤ 1} ⊆ sliceG P ∧
sliceG P ⊆ {y : Fin k → ℝ | Shared.eucNorm y ≤ 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 ("the set G contains the unit k-dimensional Euclidean ball B and is contained in the ball (1+ε)B")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.