Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.23, p. 14 — every d-hypercube binarization has rank at least that of the logarithmic binarization

Proved
BinaryExtForm.HypercubeRank.theorem_4_23

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

binarizationhypercubelift-and-projectp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let B⊆R×[0,1]dB \subseteq \mathbb R \times [0,1]^dB⊆R×[0,1]d be a ddd-hypercube binarization (its vertices project bijectively onto {0,1}d\{0,1\}^d{0,1}d and have the xxx-values 0,1,…,2d−10, 1, \dots, 2^d - 10,1,…,2d−1), let BL=BL(d)B^L = B^L(d)BL=BL(d) be the logarithmic binarization {(x,y)∈R×[0,1]d:x=∑i=1d2i−1yi}\{(x,y) \in \mathbb R \times [0,1]^d : x = \sum_{i=1}^d 2^{i-1} y_i\}{(x,y)∈R×[0,1]d:x=∑i=1d​2i−1yi​}, and let α1,…,αℓ∈{0,…,2d−2}\alpha_1, \dots, \alpha_\ell \in \{0, \dots, 2^d - 2\}α1​,…,αℓ​∈{0,…,2d−2}. Then

rk⁡B(α1,…,αℓ)≥rk⁡BL(α1,…,αℓ).\operatorname{rk}_B(\alpha_1, \dots, \alpha_\ell) \ge \operatorname{rk}_{B^L}(\alpha_1, \dots, \alpha_\ell).rkB​(α1​,…,αℓ​)≥rkBL​(α1​,…,αℓ​).

Here 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))) for points αj<xˉj<αj+1\alpha_j < \bar x^j < \alpha_j + 1αj​<xˉj<αj​+1 (Definition 4.7): the least number of convexifications of yyy-variables that removes all points of BBB with xxx strictly between αj\alpha_jαj​ and αj+1\alpha_j + 1αj​+1.

Among all binarizations whose vertices form a ddd-dimensional hypercube with distinct integer xxx-values, the logarithmic binarization needs the fewest sequential convexification steps to eliminate any prescribed family of fractional xxx-ranges.

Formalization Note. The fractional points are chosen independently for BBB (xbar) and for BLB^LBL (xbarL), each with αj<xˉj<αj+1\alpha_j < \bar x^j < \alpha_j + 1αj​<xˉj<αj​+1; the statement holds for every such choice, so no lemma on the independence of rk⁡\operatorname{rk}rk from the choice is needed. The range {0,…,2d−2}\{0,\dots,2^d-2\}{0,…,2d−2} is written αj+2≤2d\alpha_j + 2 \le 2^dαj​+2≤2d. No hypothesis is added to the page's; ℓ=0\ell = 0ℓ=0 is allowed.

Preamble
import Mathlib
import Definitions.Def_BinaryExtForm_HypercubeRank_Model
Formal statement
namespace BinaryExtForm.HypercubeRank
theorem theorem_4_23 {d ℓ : ℕ} (B : Set (Fin (d + 1) → ℝ)) (hB : IsHypercubeBinarization d B)
    (α : Fin ℓ → ℕ) (hα : ∀ j, α j + 2 ≤ 2 ^ d)
    (xbar xbarL : Fin ℓ → ℝ)
    (hx : ∀ j, (α j : ℝ) < xbar j ∧ xbar j < α j + 1)
    (hxL : ∀ j, (α j : ℝ) < xbarL j ∧ xbarL j < α j + 1) :
    rk (BL d) xbarL ≤ rk B xbar := by sorry
end BinaryExtForm.HypercubeRank
Source
Aprile, Conforti, Di Summa, Binary extended formulations and sequential convexification, arXiv:2106.00354v1, p. 14, Theorem 4.23
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