Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.7 (with dim aff_ℤ(I) ≥ 1 added), p. 26 — slicing an index set in a slab into finitely many pieces of lower rational dimension

Proved
MICPRep.Periodic.lemma_6_7

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

geometry-of-numbersmixed-integer-convex-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rational-affine-hull

Let l,u∈Zl, u \in \mathbb Zl,u∈Z and let I⊆RdI \subseteq \mathbb R^dI⊆Rd be convex with dim⁡affZ(I)≥1\dim \mathrm{aff}_{\mathbb Z}(I) \ge 1dimaffZ​(I)≥1,

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

Then there are invertible rational affine maps Ri:Rd→RdR_i : \mathbb R^d \to \mathbb R^dRi​:Rd→Rd, i∈[l,u]∩Zi \in [l, u] \cap \mathbb Zi∈[l,u]∩Z, such that

dim⁡affZ(Ri(I))≤dim⁡affZ(I)−1,⋃i=lu(Ri(I)∩Zd)=I∩Zd,Ri−1(z)=z  ∀z∈Ri(I)∩Zd.\dim \mathrm{aff}_{\mathbb Z}(R_i(I)) \le \dim \mathrm{aff}_{\mathbb Z}(I) - 1, \qquad \bigcup_{i=l}^u \bigl(R_i(I) \cap \mathbb Z^d\bigr) = I \cap \mathbb Z^d, \qquad R_i^{-1}(z) = z \ \ \forall z \in R_i(I) \cap \mathbb Z^d.dimaffZ​(Ri​(I))≤dimaffZ​(I)−1,i=l⋃u​(Ri​(I)∩Zd)=I∩Zd,Ri−1​(z)=z  ∀z∈Ri​(I)∩Zd.

The slices replace the naive slices {z∈I:z1=i}\{z \in I : z_1 = i\}{z∈I:z1​=i}, which need not stay rationally unbounded, in the induction step of Lemma 6.1.

Formalization Note The hypothesis dim⁡affZ(I)≥1\dim \mathrm{aff}_{\mathbb Z}(I) \ge 1dimaffZ​(I)≥1 is added: when the dimension is 000, (6.13a) forces I∩Zd={0}I \cap \mathbb Z^d = \{0\}I∩Zd={0}, some Ri(I)R_i(I)Ri​(I) must then contain an integer point, so its rational affine hull has dimension ≥0>−1\ge 0 > -1≥0>−1 and (6.14a) fails. Lemma 6.1 uses the lemma only when this dimension is at least 111. Dimensions are integers with dim⁡∅=−1\dim\emptyset = -1dim∅=−1 (slices without integer points have dimension −1-1−1). The maps are indexed by all of Z\mathbb ZZ and constrained only on [l,u][l,u][l,u].

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

open scoped ENNReal Matrix

/-- Lemma 6.7, p. 26, with `dim aff_ℤ(I) ≥ 1` added. -/
theorem lemma_6_7 {d : ℕ} (l u : ℤ) (I : Set (Fin d → ℝ)) (hI : Convex ℝ I)
    (h613a : (affZ I : Set (Fin d → ℝ)) = coordSubspace d (affDim (affZ I)))
    (h613b : IZ I ⊆ slab d l u) (hdim : 1 ≤ affDim (affZ I)) :
    ∃ (A : ℤ → Matrix (Fin d) (Fin d) ℚ) (b : ℤ → Fin d → ℚ),
      (∀ i ∈ Set.Icc l u, IsUnit (A i)) ∧
      (∀ i ∈ Set.Icc l u, affDim (affZ (ratAff (A i) (b i) '' I)) ≤ affDim (affZ I) - 1) ∧
      (⋃ i ∈ Set.Icc l u, ratAff (A i) (b i) '' I ∩ intLattice d) = I ∩ intLattice d ∧
      ∀ i ∈ Set.Icc l u, ∀ z ∈ ratAff (A i) (b i) '' I ∩ intLattice d,
        ratAffInv (A i) (b i) z = z := by sorry

end MICPRep.Periodic
Source
Lubin, Vielma, Zadik, Mixed-integer convex representability, arXiv:1706.05135v3, p. 26, Lemma 6.7 (with the hypothesis dim aff_ℤ(I) ≥ 1 added)
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