Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.5, p. 25 — flatness dichotomy: an integer point in relint(I_ℤ), or after a lattice-preserving rational map I_ℤ lies in a slab l ≤ z₁ ≤ u

Proved
MICPRep.Periodic.lemma_6_5

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

flatnessgeometry-of-numbersp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rational-affine-hull

Let I⊆RdI \subseteq \mathbb R^dI⊆Rd be a (not necessarily full-dimensional) convex set with I∩Zd≠∅I \cap \mathbb Z^d \neq \emptysetI∩Zd=∅. Then either IZI_{\mathbb Z}IZ​ has an integer point in its relative interior, or there are an invertible rational affine map R:Rd→RdR : \mathbb R^d \to \mathbb R^dR:Rd→Rd with R(Zd)=R−1(Zd)=ZdR(\mathbb Z^d) = R^{-1}(\mathbb Z^d) = \mathbb Z^dR(Zd)=R−1(Zd)=Zd and integers l,ul, ul,u such that

R(I)Z⊆{z∈Rd:l≤z1≤u},affZ(R(I))=Rdim⁡(IZ)×{0}d−dim⁡(IZ).R(I)_{\mathbb Z} \subseteq \{z \in \mathbb R^d : l \le z_1 \le u\}, \qquad \mathrm{aff}_{\mathbb Z}(R(I)) = \mathbb R^{\dim(I_{\mathbb Z})} \times \{0\}^{d - \dim(I_{\mathbb Z})}.R(I)Z​⊆{z∈Rd:l≤z1​≤u},affZ​(R(I))=Rdim(IZ​)×{0}d−dim(IZ​).

It is a variant of Khintchine's flatness theorem and drives the induction on dimension in the proof of Lemma 6.1.

Formalization Note dim⁡(IZ)\dim(I_{\mathbb Z})dim(IZ​) is the integer-valued dimension of aff(IZ)\mathrm{aff}(I_{\mathbb Z})aff(IZ​); the relative interior is Mathlib's intrinsicInterior. z1z_1z1​ is the coordinate with 000-based index 000; for d=0d = 0d=0 the slab is all of R0\mathbb R^0R0, and the first alternative holds anyway.

Preamble
import Mathlib
import Definitions.Def_MICPRep_Periodic_Setting
Formal statement
namespace MICPRep.Periodic

open scoped ENNReal Matrix

/-- Lemma 6.5, p. 25. -/
theorem lemma_6_5 {d : ℕ} (I : Set (Fin d → ℝ)) (hI : Convex ℝ I)
    (hZ : (I ∩ intLattice d).Nonempty) :
    (intrinsicInterior ℝ (IZ I) ∩ intLattice d).Nonempty ∨
    ∃ (A : Matrix (Fin d) (Fin d) ℚ) (b : Fin d → ℚ), IsUnit A ∧
      ratAff A b '' intLattice d = intLattice d ∧
      ratAff A b ⁻¹' intLattice d = intLattice d ∧
      ∃ l u : ℤ, IZ (ratAff A b '' I) ⊆ slab d l u ∧
        (affZ (ratAff A b '' I) : Set (Fin d → ℝ)) = coordSubspace d (setDim (IZ I)) := by sorry

end MICPRep.Periodic
Source
Lubin, Vielma, Zadik, Mixed-integer convex representability, arXiv:1706.05135v3, p. 25, Lemma 6.5
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 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