Lemma 19 — a hyperplane is maximal -free iff it is not a lattice subspace
ProvedMaxLatticeFree.Geometry.hyperplane_maxLambdaFree_iffdiscrete-geometrylatticesp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice of a linear space . Let be a linear subspace of with and let . Then
This settles the lower-dimensional case of Lovász's characterization (Theorem 10(ii)): an affine hyperplane of is maximal exactly when its direction is irrational with respect to .
Formalization Note is written in natural numbers, which excludes .
Preamble
import Mathlib import Definitions.Def_MaxLatticeFree_Geometry_IsLatticeOf import Definitions.Def_MaxLatticeFree_Geometry_IsLambdaSubspace import Definitions.Def_MaxLatticeFree_Geometry_intW import Definitions.Def_MaxLatticeFree_Geometry_IsLambdaFree open Pointwise
Formal statement
namespace MaxLatticeFree.Geometry
theorem hyperplane_maxLambdaFree_iff {n : ℕ} (Λ : AddSubgroup (EuclideanSpace ℝ (Fin n)))
(V : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hΛ : IsLatticeOf Λ V)
(L : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hLV : L ≤ V)
(hdim : Module.finrank ℝ L + 1 = Module.finrank ℝ V) (v : EuclideanSpace ℝ (Fin n)) (hv : v ∈ V) :
IsMaxLambdaFree Λ V (v +ᵥ (L : Set (EuclideanSpace ℝ (Fin n)))) ↔ ¬ IsLambdaSubspace Λ V L := by sorry
end MaxLatticeFree.Geometry
Source
Basu, Conforti, Cornuéjols, Zambelli, Maximal lattice-free convex sets in linear subspaces, arXiv:1701.06543v1, p. 13, Lemma 19
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.