Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 4.8, p. 11 — rk_B is the optimum of the set covering problem on the α_j-edges of sk(B)

Proved
BinaryExtForm.HypercubeRank.observation_4_8

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

binarizationlift-and-projectp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1set-covering

Let B⊆[0,k]×[0,1]dB \subseteq [0,k] \times [0,1]^dB⊆[0,k]×[0,1]d be a natural binarization of xxx in the range {0,…,k}\{0, \dots, k\}{0,…,k}, let α1,…,αℓ∈{0,…,k−1}\alpha_1, \dots, \alpha_\ell \in \{0, \dots, k-1\}α1​,…,αℓ​∈{0,…,k−1} and let αj<xˉj<αj+1\alpha_j < \bar x^j < \alpha_j + 1αj​<xˉj<αj​+1 for j∈[ℓ]j \in [\ell]j∈[ℓ]. Then rk⁡B(α1,…,αℓ)=lpr⁡(conv⁡(⋃jB(xˉj)))\operatorname{rk}_B(\alpha_1, \dots, \alpha_\ell) = \operatorname{lpr}(\operatorname{conv}(\bigcup_j B(\bar x^j)))rkB​(α1​,…,αℓ​)=lpr(conv(⋃j​B(xˉj))) is the optimum value of the set covering problem whose constraint rows are the indicator vectors of the αj\alpha_jαj​-edges (j∈[ℓ]j \in [\ell]j∈[ℓ]) of the skeleton sk⁡(B)\operatorname{sk}(B)sk(B):

rk⁡B(α1,…,αℓ)=min⁡{∣Z∣:Z⊆[d], Z meets the support of the indicator vector of every αj-edge}.\operatorname{rk}_B(\alpha_1, \dots, \alpha_\ell) = \min\{|Z| : Z \subseteq [d],\ Z \text{ meets the support of the indicator vector of every } \alpha_j\text{-edge}\}.rkB​(α1​,…,αℓ​)=min{∣Z∣:Z⊆[d], Z meets the support of the indicator vector of every αj​-edge}.

The rank of a natural binarization therefore depends only on the edge structure of BBB and on which edges cross the levels αj\alpha_jαj​.

Formalization Note. Only the second sentence of Observation 4.8 is formalized. Its first sentence, identifying rk⁡B\operatorname{rk}_BrkB​ with the rank of a property of a binary extended formulation satisfying the hypotheses of Theorem 4.6, is not stated, since this mission does not formalize binary extended formulations or Theorem 4.6, and Theorem 4.23 does not use it. The indicator entry ti=1t_i = 1ti​=1 is encoded as "not (yiu=yiv=0y^u_i = y^v_i = 0yiu​=yiv​=0 or yiu=yiv=1y^u_i = y^v_i = 1yiu​=yiv​=1)". The rank is stated for the chosen points xˉj\bar x^jxˉj (Definition 4.7). The hypothesis B⊆[0,k]×[0,1]dB \subseteq [0,k] \times [0,1]^dB⊆[0,k]×[0,1]d is the paper's.

Preamble
import Mathlib
import Definitions.Def_BinaryExtForm_HypercubeRank_Model
Formal statement
namespace BinaryExtForm.HypercubeRank
theorem observation_4_8 {d k ℓ : ℕ} (B : Set (Fin (d + 1) → ℝ)) (hB : IsBinarization d k B)
    (hN : IsNatural B) (hBk : ∀ p ∈ B, 0 ≤ p 0 ∧ p 0 ≤ k) (α : Fin ℓ → ℕ) (hα : ∀ j, α j < k)
    (xbar : Fin ℓ → ℝ) (hx : ∀ j, (α j : ℝ) < xbar j ∧ xbar j < α j + 1) :
    rk B xbar = sInf {c : ℕ | ∃ Z : Finset (Fin d), Z.card = c ∧
      ∀ u v, (∃ j, IsAlphaEdge B (α j) u v) → ∃ i ∈ Z, indicator u v i} := by sorry
end BinaryExtForm.HypercubeRank
Source
Aprile, Conforti, Di Summa, Binary extended formulations and sequential convexification, arXiv:2106.00354v1, p. 11, Observation 4.8 (second sentence); Definition 4.7, α-edge and indicator vector on p. 10
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