Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.3, p. 9 — the vertices of a fractional slice B(f) lie on the α-edges of B

Proved
BinaryExtForm.HypercubeRank.lemma_4_3

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

binarizationfacesp2o-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 natural binarization of xxx in the range {0,…,k}\{0, \dots, k\}{0,…,k}, let α∈{0,…,k−1}\alpha \in \{0, \dots, k-1\}α∈{0,…,k−1} and let α<f<α+1\alpha < f < \alpha + 1α<f<α+1. Write B(f)={(x,y)∈B:x=f}B(f) = \{(x,y) \in B : x = f\}B(f)={(x,y)∈B:x=f}. Then the vertex set V(B(f))V(B(f))V(B(f)) consists of exactly one point (x~,y~)(\tilde x, \tilde y)(x~,y~​) in the relative interior of each 111-dimensional face of BBB whose endpoints (xu,yu)(x^u, y^u)(xu,yu) and (xv,yv)(x^v, y^v)(xv,yv) satisfy xu≤αx^u \le \alphaxu≤α and xv≥α+1x^v \ge \alpha + 1xv≥α+1:

V(B(f))={(x~,y~):(x~,y~)∈relint⁡[u,v], x~=f, [u,v] an edge of B, xu≤α, xv≥α+1},V(B(f)) = \{(\tilde x,\tilde y) : (\tilde x,\tilde y) \in \operatorname{relint}[u,v],\ \tilde x = f,\ [u,v] \text{ an edge of } B,\ x^u \le \alpha,\ x^v \ge \alpha+1\},V(B(f))={(x~,y~​):(x~,y~​)∈relint[u,v], x~=f, [u,v] an edge of B, xu≤α, xv≥α+1},

and each such edge contains exactly one point with x=fx = fx=f in its relative interior.

The lemma describes the fractional vertices whose removal the rank of a binarization measures.

Formalization Note. An edge is Hirsch.Adj B u v (the segment [u,v][u,v][u,v] is an extreme subset of BBB, u≠vu \ne vu=v), and its relative interior is openSegment ℝ u v. The statement is the set equality together with the uniqueness of the point at height x=fx = fx=f on each such edge.

Preamble
import Mathlib
import Definitions.Def_BinaryExtForm_HypercubeRank_Model
Formal statement
namespace BinaryExtForm.HypercubeRank
theorem lemma_4_3 {d k : ℕ} (B : Set (Fin (d + 1) → ℝ)) (hB : IsBinarization d k B)
    (hN : IsNatural B) (α : ℕ) (hα : α < k) (f : ℝ) (hf₁ : (α : ℝ) < f) (hf₂ : f < α + 1) :
    Set.extremePoints ℝ (slice B f) =
      {p | ∃ u v, Hirsch.Adj B u v ∧ u 0 ≤ α ∧ (α : ℝ) + 1 ≤ v 0 ∧
        p ∈ openSegment ℝ u v ∧ p 0 = f} ∧
    ∀ u v, Hirsch.Adj B u v → u 0 ≤ α → (α : ℝ) + 1 ≤ v 0 →
      ∃! p, p ∈ openSegment ℝ u v ∧ p 0 = f := by sorry
end BinaryExtForm.HypercubeRank
Source
Aprile, Conforti, Di Summa, Binary extended formulations and sequential convexification, arXiv:2106.00354v1, p. 9, Lemma 4.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