Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.4 (with F ∩ ℤᵈ ≠ ∅ added), p. 25 — a unimodular U maps a rational affine subspace onto ℝᵏ × {0}ᵈ⁻ᵏ

Proved
MICPRep.Periodic.lemma_6_4

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

geometry-of-numbersp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rational-affine-hullunimodular-matrix

Let F⊆RdF \subseteq \mathbb R^dF⊆Rd be a rational affine subspace of dimension kkk that contains an integer point, and let L=F−zL = F - zL=F−z (z∈Fz \in Fz∈F) be its direction. Then there are c∈Zd∩Fc \in \mathbb Z^d \cap Fc∈Zd∩F and a unimodular U∈Zd×dU \in \mathbb Z^{d\times d}U∈Zd×d with

UL=U(F−c)=Rk×{0}d−k,(UT)−1L⊥={0}k×Rd−k.UL = U(F - c) = \mathbb R^k \times \{0\}^{d-k}, \qquad (U^{\mathsf T})^{-1}L^\perp = \{0\}^k \times \mathbb R^{d-k}.UL=U(F−c)=Rk×{0}d−k,(UT)−1L⊥={0}k×Rd−k.

Furthermore, if F=rRF = r\mathbb RF=rR for some r∈Zd∖{0}r \in \mathbb Z^d\setminus\{0\}r∈Zd∖{0} with gcd⁡(r1,…,rd)=1\gcd(r_1,\dots,r_d) = 1gcd(r1​,…,rd​)=1, then ccc and UUU can be chosen so that in addition U−1e(1)=rU^{-1}e(1) = rU−1e(1)=r.

This is the standard alignment of a lattice subspace with a coordinate subspace by a lattice-preserving change of basis; Lemmas 6.5, 6.11 and 6.12 use it.

Formalization Note The hypothesis F∩Zd≠∅F \cap \mathbb Z^d \neq \emptysetF∩Zd=∅ is added: as printed the lemma fails for F={z:z1=1/2}F = \{z : z_1 = 1/2\}F={z:z1​=1/2}, a rational affine subspace without integer points, and every use in the paper has one. Unimodular means a unit of the integer matrix ring (Definition 6.4). L⊥L^\perpL⊥ is taken with the dot product, e(1)e(1)e(1) is the unit vector of the coordinate with 000-based index 000, and gcd⁡\gcdgcd is Finset.univ.gcd.

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

open scoped ENNReal Matrix

/-- Lemma 6.4, p. 25, with `F ∩ ℤᵈ ≠ ∅` added. -/
theorem lemma_6_4 {d k : ℕ} (F : AffineSubspace ℝ (Fin d → ℝ))
    (hF : IsRationalAffineSubspace F) (hdim : affDim F = (k : ℤ))
    (hFZ : ((F : Set (Fin d → ℝ)) ∩ intLattice d).Nonempty) :
    (∃ c ∈ intLattice d ∩ (F : Set (Fin d → ℝ)), ∃ U : Matrix (Fin d) (Fin d) ℤ,
      IsUnimodular U ∧
      intMatVec U '' (F.direction : Set (Fin d → ℝ)) = coordSubspace d k ∧
      (fun z => intMatVec U (z - c)) '' (F : Set (Fin d → ℝ)) = coordSubspace d k ∧
      (fun w => ((U.map (fun m : ℤ => (m : ℝ)))ᵀ)⁻¹ *ᵥ w) ''
          {w : Fin d → ℝ | ∀ v ∈ F.direction, w ⬝ᵥ v = 0} =
        {z : Fin d → ℝ | ∀ i : Fin d, (i.val : ℤ) < k → z i = 0}) ∧
    ∀ r : Fin d → ℤ, r ≠ 0 → Finset.univ.gcd r = 1 →
      (F : Set (Fin d → ℝ)) = {z | ∃ t : ℝ, z = t • (fun i => (r i : ℝ))} →
      ∃ c ∈ intLattice d ∩ (F : Set (Fin d → ℝ)), ∃ U : Matrix (Fin d) (Fin d) ℤ,
        IsUnimodular U ∧
        intMatVec U '' (F.direction : Set (Fin d → ℝ)) = coordSubspace d k ∧
        (fun z => intMatVec U (z - c)) '' (F : Set (Fin d → ℝ)) = coordSubspace d k ∧
        (fun w => ((U.map (fun m : ℤ => (m : ℝ)))ᵀ)⁻¹ *ᵥ w) ''
            {w : Fin d → ℝ | ∀ v ∈ F.direction, w ⬝ᵥ v = 0} =
          {z : Fin d → ℝ | ∀ i : Fin d, (i.val : ℤ) < k → z i = 0} ∧
        ∀ i : Fin d, i.val = 0 →
          (U.map (fun m : ℤ => (m : ℝ)))⁻¹ *ᵥ Pi.single i 1 = fun j => (r j : ℝ) := by sorry

end MICPRep.Periodic
Source
Lubin, Vielma, Zadik, Mixed-integer convex representability, arXiv:1706.05135v3, p. 25, Lemma 6.4 (with the hypothesis F ∩ ℤᵈ ≠ ∅ 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