Lemma 17 — projecting a lattice along a lattice subspace gives a lattice
ProvedMaxLatticeFree.Geometry.lattice_map_orthogonalProjectiondiscrete-geometrylatticesp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice of a linear space and let be a -subspace of . Let be the orthogonal projection of onto the orthogonal complement . Then
The hypothesis that has a basis in is essential: projecting along an irrational line gives a dense subgroup of the orthogonal line. The lemma lets the proof of Theorem 10 pass from an unbounded set to the bounded set in the lower-dimensional space .
Formalization Note The paper writes ; this is the image of under the orthogonal projection onto , formalized as the image of under Lᗮ.starProjection.
Preamble
import Mathlib import Definitions.Def_MaxLatticeFree_Geometry_IsLatticeOf import Definitions.Def_MaxLatticeFree_Geometry_IsLambdaSubspace
Formal statement
namespace MaxLatticeFree.Geometry
theorem lattice_map_orthogonalProjection {n : ℕ} (Λ : AddSubgroup (EuclideanSpace ℝ (Fin n)))
(V : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hΛ : IsLatticeOf Λ V)
(L : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hL : IsLambdaSubspace Λ V L) :
IsLatticeOf (Λ.map (Lᗮ.starProjection : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n)).toLinearMap.toAddMonoidHom)
(Lᗮ ⊓ V) := by sorry
end MaxLatticeFree.Geometry
Source
Basu, Conforti, Cornuéjols, Zambelli, Maximal lattice-free convex sets in linear subspaces, arXiv:1701.06543v1, p. 12, Lemma 17 (citing Barvinok, A Course in Convexity, p. 284, problem 3)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.