Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 2.2, p. 4 — the lift-and-project rank is the optimum of a set covering problem

Proved
BinaryExtForm.HypercubeRank.observation_2_2

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

lift-and-projectp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polytopesset-covering

Let Q⊆RnQ \subseteq \mathbb R^nQ⊆Rn be a polytope whose coordinates in HHH lie in [0,1][0,1][0,1]. Let VFV_FVF​ be the set of vertices of QQQ having at least one fractional coordinate (a value outside {0,1}\{0,1\}{0,1}) among the coordinates in HHH, and let AQA_QAQ​ be the 0/10/10/1 matrix whose rows are the incidence vectors of the fractional supports {i∈H:0<vi<1}\{i \in H : 0 < v_i < 1\}{i∈H:0<vi​<1} of the vertices v∈VFv \in V_Fv∈VF​. Then

lpr⁡(Q)=min⁡{1z:AQz≥1, z∈{0,1}H}.\operatorname{lpr}(Q) = \min\{\mathbf 1 z : A_Q z \ge \mathbf 1,\ z \in \{0,1\}^H\}.lpr(Q)=min{1z:AQ​z≥1, z∈{0,1}H}.

Equivalently, lpr⁡(Q)\operatorname{lpr}(Q)lpr(Q) is the minimum size of a set Z⊆HZ \subseteq HZ⊆H that contains, for every vertex of QQQ with a fractional coordinate in HHH, at least one of its fractional coordinates.

This turns the convexification count into a purely combinatorial hitting-set problem on the vertex set of QQQ; the rank of a binarization is analysed through it.

Formalization Note. z∈{0,1}Hz \in \{0,1\}^Hz∈{0,1}H is a subset Z⊆HZ \subseteq HZ⊆H and 1z=∣Z∣\mathbf 1 z = |Z|1z=∣Z∣; duplicate rows of AQA_QAQ​ do not change the problem, so it is stated vertex by vertex. Z=HZ = HZ=H is always feasible, so the sInf on the right is a true minimum. As in lpr, HHH is any set of coordinates instead of the first hhh.

Preamble
import Mathlib
import Definitions.Def_BinaryExtForm_HypercubeRank_Model
Formal statement
namespace BinaryExtForm.HypercubeRank
theorem observation_2_2 {n : ℕ} (Q : Set (Fin n → ℝ)) (H : Finset (Fin n)) (hQ : IsPolytope Q)
    (hQH : ∀ p ∈ Q, ∀ i ∈ H, 0 ≤ p i ∧ p i ≤ 1) :
    lpr Q H = sInf {c : ℕ | ∃ Z : Finset (Fin n), Z ⊆ H ∧ Z.card = c ∧
      ∀ v ∈ Set.extremePoints ℝ Q, (∃ i ∈ H, v i ≠ 0 ∧ v i ≠ 1) →
        ∃ i ∈ Z, v i ≠ 0 ∧ v i ≠ 1} := by sorry
end BinaryExtForm.HypercubeRank
Source
Aprile, Conforti, Di Summa, Binary extended formulations and sequential convexification, arXiv:2106.00354v1, pp. 3–4, Observation 2.2 (with the definitions of V_F, F and A_Q on pp. 3–4)
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