Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.18, p. 13 — rk_B counts the types i whose cut δ(V^i_0) meets some δ(V_{α_j})

Proved
BinaryExtForm.HypercubeRank.lemma_4_18

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

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

Let BBB be a ddd-hypercube binarization with hypercube graph G(B)G(B)G(B), let α1,…,αℓ∈{0,…,2d−2}\alpha_1, \dots, \alpha_\ell \in \{0, \dots, 2^d - 2\}α1​,…,αℓ​∈{0,…,2d−2} and choose αj<xˉj<αj+1\alpha_j < \bar x^j < \alpha_j + 1αj​<xˉj<αj​+1. Then

rk⁡B(α1,…,αℓ)=∣{i:δ(V0i)∩⋃j=1ℓδ(Vαj)≠∅}∣,\operatorname{rk}_B(\alpha_1, \dots, \alpha_\ell) = \Big|\Big\{i : \delta(V^i_0) \cap \bigcup_{j=1}^\ell \delta(V_{\alpha_j}) \ne \emptyset\Big\}\Big|,rkB​(α1​,…,αℓ​)=​{i:δ(V0i​)∩j=1⋃ℓ​δ(Vαj​​)=∅}​,

where V0iV^i_0V0i​ is the set of vertices with yi=0y_i = 0yi​=0, VαV_\alphaVα​ the set of vertices with x≤αx \le \alphax≤α, and δ(U)\delta(U)δ(U) the cut of G(B)G(B)G(B) (edges with exactly one end in UUU).

So the rank of a hypercube binarization counts the coordinate directions iii in which some edge of the hypercube graph crosses one of the levels αj\alpha_jαj​.

Formalization Note. The set on the right is {i : Fin d | typeHit B α i}: there are vertices u,vu, vu,v of BBB whose yyy-parts differ exactly in component iii, with xu≤αjx^u \le \alpha_jxu≤αj​ and xv≥αj+1x^v \ge \alpha_j + 1xv≥αj​+1 for some jjj. The range αj∈{0,…,2d−2}\alpha_j \in \{0,\dots,2^d-2\}αj​∈{0,…,2d−2} is written αj+2≤2d\alpha_j + 2 \le 2^dαj​+2≤2d, avoiding natural-number subtraction. The rank is stated for the chosen points xˉj\bar x^jxˉj (Definition 4.7). Components are indexed from 000.

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