Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.14 — the double reverse polar

Proved
Disjunctive.Polarity.reverse_polar_involution

by Shuze Chen · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-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 S00=cl conv(S∪{0})S^{00} = \mathrm{cl}\,\mathrm{conv}(S \cup \{0\})S00=clconv(S∪{0}).

If 0∉cl conv(S)0 \notin \mathrm{cl}\,\mathrm{conv}(S)0∈/clconv(S), then

S##=cl conv(S)+cl cone(S),S^{\#\#} = \mathrm{cl}\,\mathrm{conv}(S) + \mathrm{cl}\,\mathrm{cone}(S),S##=clconv(S)+clcone(S),

the Minkowski sum of the closed convex hull of SSS and the closure of its conic hull. Unlike the ordinary polar's involution (which simply recovers SSS itself, up to closure and convexification), the reverse polar's double application recovers the hull together with its recession directions — the extra cl cone(S)\mathrm{cl}\,\mathrm{cone}(S)clcone(S) 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
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me