Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2.15 — the hull as an intersection of double polars

Proved
Disjunctive.Polarity.hull_eq_polar_inter_reverse_polar

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

convex-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 SSS with 0∉cl conv(S)0 \notin \mathrm{cl}\,\mathrm{conv}(S)0∈/clconv(S):

cl conv(S)=S00∩S##.\mathrm{cl}\,\mathrm{conv}(S) = S^{00} \cap S^{\#\#}.clconv(S)=S00∩S##.

This gives a second, purely polarity-based route to the closed convex hull, complementing the lifting-and-projection route of Theorem 2.1. When SSS is a disjunctive set FFF, the hypothesis 0∉cl conv(F)0 \notin \mathrm{cl}\,\mathrm{conv}(F)0∈/clconv(F) is a normalization that can always be arranged without changing the underlying optimization problem, not a genuine restriction.

Formalization Note. Polar (Polar S) is S00S^{00}S00; ReversePolar (ReversePolar S) is S##S^{\#\#}S##.

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
  • 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