Theorem 2.14 — the double reverse polar
ProvedDisjunctive.Polarity.reverse_polar_involutionconvex-hulldisjunctive-programmingpolarity
This is Theorem 2.14 of Balas's Disjunctive Programming: the involution property of the reverse polar, in sharp contrast to the ordinary polar's .
If , then
the Minkowski sum of the closed convex hull of and the closure of its conic hull. Unlike the ordinary polar's involution (which simply recovers itself, up to closure and convexification), the reverse polar's double application recovers the hull together with its recession directions — the extra summand accounts for the unbounded directions the reverse-polar construction cannot see from a single application.
Formalization Note. + is the Minkowski sum (open Pointwise); ConeHull is the finite
nonnegative-combination conic hull.
Preamble
import Mathlib import Definitions.Def_Disjunctive_Polarity_Polars
Formal statement
namespace Disjunctive.Polarity
open Pointwise
/-- Theorem 2.14 (Balas §2.4, p. 32): if `0 ∉ cl conv S`, the double reverse polar `S##` equals
the Minkowski sum of the closed convex hull of `S` and the closure of its conic hull. -/
theorem reverse_polar_involution {n : ℕ} (S : Set (Fin n → ℝ))
(h0 : 0 ∉ closure (convexHull ℝ S)) :
ReversePolar (ReversePolar S) = closure (convexHull ℝ S) + closure (ConeHull S) := by sorry
end Disjunctive.Polarity
Source
Balas, Disjunctive Programming, Springer 2018, DOI 10.1007/978-3-030-00148-3, p. 32, Theorem 2.14
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.