Lemma 6.4 (with F ∩ ℤᵈ ≠ ∅ added), p. 25 — a unimodular U maps a rational affine subspace onto ℝᵏ × {0}ᵈ⁻ᵏ
ProvedMICPRep.Periodic.lemma_6_4Let be a rational affine subspace of dimension that contains an integer point, and let () be its direction. Then there are and a unimodular with
Furthermore, if for some with , then and can be chosen so that in addition .
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 is added: as printed the lemma fails for , 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). is taken with the dot product, is the unit vector of the coordinate with -based index , and is Finset.univ.gcd.
import Mathlib import Definitions.Def_MICPRep_Periodic_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.