Corollary 2.15 — the hull as an intersection of double polars
ProvedDisjunctive.Polarity.hull_eq_polar_inter_reverse_polarconvex-hulldisjunctive-programmingpolarity
This is Corollary 2.15 of Balas's Disjunctive Programming, combining the ordinary polar's involution identity with Theorem 2.14's reverse-polar involution.
For any with :
This gives a second, purely polarity-based route to the closed convex hull, complementing the lifting-and-projection route of Theorem 2.1. When is a disjunctive set , the hypothesis is a normalization that can always be arranged without changing the underlying optimization problem, not a genuine restriction.
Formalization Note. Polar (Polar S) is ; ReversePolar (ReversePolar S) is
.
Preamble
import Mathlib import Definitions.Def_Disjunctive_Polarity_Polars
Formal statement
namespace Disjunctive.Polarity
/-- Corollary 2.15 (Balas §2.4, p. 33): for any `S` with `0 ∉ cl conv S`, the closed convex hull
of `S` equals the intersection of its ordinary double polar and its reverse double polar. -/
theorem hull_eq_polar_inter_reverse_polar {n : ℕ} (S : Set (Fin n → ℝ))
(h0 : 0 ∉ closure (convexHull ℝ S)) :
closure (convexHull ℝ S) = Polar (Polar S) ∩ ReversePolar (ReversePolar S) := by sorry
end Disjunctive.Polarity
Source
Balas, Disjunctive Programming, Springer 2018, DOI 10.1007/978-3-030-00148-3, p. 33, Corollary 2.15
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.