Lemma 18 — a non-lattice subspace has lattice points arbitrarily close to it
ProvedMaxLatticeFree.Geometry.exists_lattice_point_near_subspacediophantine-approximationdiscrete-geometrylatticesp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice of a linear space and let be a linear subspace of that is not a -subspace of . Then for every there exists
This is the approximation property that makes an irrational hyperplane maximal lattice-free (Lemma 19): a slab around it, however thin, contains lattice points in its interior.
Preamble
import Mathlib import Definitions.Def_MaxLatticeFree_Geometry_IsLatticeOf import Definitions.Def_MaxLatticeFree_Geometry_IsLambdaSubspace
Formal statement
namespace MaxLatticeFree.Geometry
theorem exists_lattice_point_near_subspace {n : ℕ} (Λ : AddSubgroup (EuclideanSpace ℝ (Fin n)))
(V : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hΛ : IsLatticeOf Λ V)
(L : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hLV : L ≤ V) (hL : ¬ IsLambdaSubspace Λ V L)
(ε : ℝ) (hε : 0 < ε) :
∃ y ∈ Λ, y ∉ L ∧ Metric.infDist y (L : Set (EuclideanSpace ℝ (Fin n))) < ε := 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 18
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.