Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4.22, p. 14 — f_{B^L}(α_1,…,α_ℓ) = max{t : 2^t divides α_j + 1 for all j}

Proved
BinaryExtForm.HypercubeRank.corollary_4_22

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

binarizationdivisibilityhypercubep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let BL=BL(d)B^L = B^L(d)BL=BL(d) be the logarithmic binarization with hypercube graph G(BL)G(B^L)G(BL), and let α1,…,αℓ∈{0,…,2d−2}\alpha_1, \dots, \alpha_\ell \in \{0, \dots, 2^d - 2\}α1​,…,αℓ​∈{0,…,2d−2} with ℓ≥1\ell \ge 1ℓ≥1. Then

fBL(α1,…,αℓ)=max⁡{t:2t divides αj+1 ∀j∈[ℓ]}.f_{B^L}(\alpha_1, \dots, \alpha_\ell) = \max\{t : 2^t \text{ divides } \alpha_j + 1 \ \forall j \in [\ell]\}.fBL​(α1​,…,αℓ​)=max{t:2t divides αj​+1 ∀j∈[ℓ]}.

Together with Corollary 4.19 this gives the explicit formula rk⁡BL(α1,…,αℓ)=d−max⁡{t:2t∣αj+1 ∀j}\operatorname{rk}_{B^L}(\alpha_1,\dots,\alpha_\ell) = d - \max\{t : 2^t \mid \alpha_j + 1\ \forall j\}rkBL​(α1​,…,αℓ​)=d−max{t:2t∣αj​+1 ∀j}, and together with Lemma 4.20 it shows that BLB^LBL maximizes fBf_BfB​ among hypercube binarizations.

Formalization Note. The hypothesis ℓ≥1\ell \ge 1ℓ≥1 (0 < ℓ) is added: for ℓ=0\ell = 0ℓ=0 every ttt qualifies, so the maximum does not exist, while fBL()=df_{B^L}() = dfBL​()=d. The maximum is stated with IsGreatest, not sSup, so it is asserted to exist. αj+2≤2d\alpha_j + 2 \le 2^dαj​+2≤2d encodes the range.

Preamble
import Mathlib
import Definitions.Def_BinaryExtForm_HypercubeRank_Model
Formal statement
namespace BinaryExtForm.HypercubeRank
theorem corollary_4_22 {d ℓ : ℕ} (hℓ : 0 < ℓ) (α : Fin ℓ → ℕ) (hα : ∀ j, α j + 2 ≤ 2 ^ d) :
    IsGreatest {t : ℕ | ∀ j, 2 ^ t ∣ α j + 1} (fB (BL d) α) := by sorry
end BinaryExtForm.HypercubeRank
Source
Aprile, Conforti, Di Summa, Binary extended formulations and sequential convexification, arXiv:2106.00354v1, p. 14, Corollary 4.22
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