Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1, p. 3 — Balas's sequential convexification theorem

Proved
BinaryExtForm.HypercubeRank.theorem_2_1

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

lift-and-projectp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polytopessequential-convexification

Let Q⊆RnQ \subseteq \mathbb R^nQ⊆Rn be a polytope and let HHH be a set of coordinates such that 0≤xi≤10 \le x_i \le 10≤xi​≤1 for every x∈Qx \in Qx∈Q and every i∈Hi \in Hi∈H (the paper's Q⊆[0,1]h×Rn−hQ \subseteq [0,1]^h \times \mathbb R^{n-h}Q⊆[0,1]h×Rn−h with H=[h]H = [h]H=[h]). For a coordinate iii write Qxi=conv⁡({x∈Q:xi=0}∪{x∈Q:xi=1})Q_{x_i} = \operatorname{conv}(\{x \in Q : x_i = 0\} \cup \{x \in Q : x_i = 1\})Qxi​​=conv({x∈Q:xi​=0}∪{x∈Q:xi​=1}). If i1,…,ihi_1, \dots, i_hi1​,…,ih​ lists every index of HHH exactly once, then

conv⁡{x∈Q:xi∈{0,1} ∀i∈H}=(((Qxi1)xi2)… )xih.\operatorname{conv}\{x \in Q : x_i \in \{0,1\}\ \forall i \in H\} = (((Q_{x_{i_1}})_{x_{i_2}})\dots)_{x_{i_h}}.conv{x∈Q:xi​∈{0,1} ∀i∈H}=(((Qxi1​​​)xi2​​​)…)xih​​​.

Convexifying the 0/1 variables one at a time, each exactly once and in any order, produces the 0/1 hull. In particular lpr⁡(Q)≤∣H∣\operatorname{lpr}(Q) \le |H|lpr(Q)≤∣H∣, so the lift-and-project rank is a genuine minimum.

Formalization Note. The paper convexifies x1,…,xhx_1, \dots, x_hx1​,…,xh​ in this order; the statement here allows any set HHH of 0/1 coordinates and any duplicate-free enumeration l of it (l.Nodup, l.toFinset = H). This matches the paper's remark on p. 3 that the order is irrelevant. IteratedSplit Q l applies the convexification steps left to right.

Preamble
import Mathlib
import Definitions.Def_BinaryExtForm_HypercubeRank_Model

open Disjunctive.HigherDim
Formal statement
namespace BinaryExtForm.HypercubeRank
theorem theorem_2_1 {n : ℕ} (Q : Set (Fin n → ℝ)) (H : Finset (Fin n)) (hQ : IsPolytope Q)
    (hQH : ∀ p ∈ Q, ∀ i ∈ H, 0 ≤ p i ∧ p i ≤ 1) (l : List (Fin n)) (hl : l.Nodup)
    (hlH : l.toFinset = H) :
    IteratedSplit Q l = intHull Q H := by sorry
end BinaryExtForm.HypercubeRank
Source
Aprile, Conforti, Di Summa, Binary extended formulations and sequential convexification, arXiv:2106.00354v1, p. 3, Theorem 2.1
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 22, 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