Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.21, p. 14 — f_{B^L}(α) is the number of trailing 1's of (α)_2, the largest t with 2^t | α + 1

Proved
BinaryExtForm.HypercubeRank.lemma_4_21

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

binarizationbinary-expansionhypercubep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let BL=BL(d)B^L = B^L(d)BL=BL(d) be the logarithmic binarization and α∈{0,…,2d−2}\alpha \in \{0, \dots, 2^d - 2\}α∈{0,…,2d−2}. Write (α)2∈{0,1}d(\alpha)_2 \in \{0,1\}^d(α)2​∈{0,1}d for the reverse of the base-2 expansion of α\alphaα, so that position iii holds the coefficient of 2i−12^{i-1}2i−1. Then:

  1. fBL(α)f_{B^L}(\alpha)fBL​(α) is the largest number of 111's in (α)2(\alpha)_2(α)2​ that are not preceded by any 000, i.e. the length of the initial run of 111's of (α)2(\alpha)_2(α)2​;
  2. equivalently, fBL(α)f_{B^L}(\alpha)fBL​(α) is the largest ttt such that 2t2^t2t divides α+1\alpha + 1α+1.

Formalization Note. Positions are indexed from 000, position mmm holding bit α.testBit m. Part 1 is stated as the number of positions m<dm < dm<d such that bits 0,…,m0, \dots, m0,…,m of α\alphaα are all 111, which is the length of the initial run of 111's. Part 2 is IsGreatest {t | 2 ^ t ∣ α + 1}. The single level α\alphaα is the one-element family ![α].

Preamble
import Mathlib
import Definitions.Def_BinaryExtForm_HypercubeRank_Model
Formal statement
namespace BinaryExtForm.HypercubeRank
theorem lemma_4_21 {d : ℕ} (α : ℕ) (hα : α + 2 ≤ 2 ^ d) :
    fB (BL d) ![α] = Set.ncard {m : ℕ | m < d ∧ ∀ m' ≤ m, α.testBit m' = true} ∧
    IsGreatest {t : ℕ | 2 ^ t ∣ α + 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, Lemma 4.21 ((α)_2 defined on p. 12)
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