Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 2.3, p. 4 — binary points of a binarization are unique per y and are vertices

Proved
BinaryExtForm.HypercubeRank.observation_2_3

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

binarizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polytopes

Let B⊆R×[0,1]dB \subseteq \mathbb R \times [0,1]^dB⊆R×[0,1]d be a binarization of the variable xxx in the range {0,…,k}\{0, \dots, k\}{0,…,k}. Then for every y∈{0,1}dy \in \{0,1\}^dy∈{0,1}d:

  1. there is at most one xxx with (x,y)∈B(x, y) \in B(x,y)∈B;
  2. if such an xxx exists, then x∈{0,…,k}x \in \{0, \dots, k\}x∈{0,…,k} and (x,y)(x, y)(x,y) is a vertex of BBB.

So every 0/10/10/1 vector yyy encodes at most one value of xxx, that value lies in the range, and the corresponding binary point is a vertex of BBB.

Formalization Note. Points are p : Fin (d+1) → ℝ with xxx = p 0. Part 1 says: if p,q∈Bp, q \in Bp,q∈B, ppp has binary yyy-part and qqq has the same yyy-part, then qqq and ppp have the same xxx.

Preamble
import Mathlib
import Definitions.Def_BinaryExtForm_HypercubeRank_Model
Formal statement
namespace BinaryExtForm.HypercubeRank
theorem observation_2_3 {d k : ℕ} (B : Set (Fin (d + 1) → ℝ)) (hB : IsBinarization d k B) :
    (∀ p ∈ B, ∀ q ∈ B, IsBinaryY p → yproj q = yproj p → q 0 = p 0) ∧
    (∀ p ∈ B, IsBinaryY p → (∃ m : ℕ, m ≤ k ∧ p 0 = m) ∧ p ∈ Set.extremePoints ℝ B) := by sorry
end BinaryExtForm.HypercubeRank
Source
Aprile, Conforti, Di Summa, Binary extended formulations and sequential convexification, arXiv:2106.00354v1, p. 4, Observation 2.3
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