Lemma 13 — bounded full-dimensional maximal -free sets are polytopes with lattice points on facets
ProvedMaxLatticeFree.Geometry.bounded_maxLambdaFree_isPolytopediscrete-geometrylatticesp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice of a linear space . Let be a maximal -free convex set of (interior taken relative to ) that is bounded and satisfies . Then
This is the bounded, full-dimensional case of the "only if" direction of Lovász's characterization (Theorem 10); the unbounded case is reduced to it by projecting out the lineality space.
Preamble
import Mathlib import Definitions.Def_MaxLatticeFree_Geometry_IsLatticeOf import Definitions.Def_MaxLatticeFree_Geometry_intW import Definitions.Def_MaxLatticeFree_Geometry_IsLambdaFree import Definitions.Def_MaxLatticeFree_Geometry_affDim import Definitions.Def_MaxLatticeFree_Geometry_Polyhedron
Formal statement
namespace MaxLatticeFree.Geometry
theorem bounded_maxLambdaFree_isPolytope {n : ℕ} (Λ : AddSubgroup (EuclideanSpace ℝ (Fin n)))
(V : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hΛ : IsLatticeOf Λ V)
(S : Set (EuclideanSpace ℝ (Fin n))) (hS : IsMaxLambdaFree Λ V S) (hbdd : Bornology.IsBounded S)
(hdim : affDim S = (Module.finrank ℝ V : ℤ)) :
IsPolytope S ∧ ∀ F : Set (EuclideanSpace ℝ (Fin n)), IsFacet S F → ∃ x ∈ Λ, x ∈ relint F := by sorry
end MaxLatticeFree.Geometry
Source
Basu, Conforti, Cornuéjols, Zambelli, Maximal lattice-free convex sets in linear subspaces, arXiv:1701.06543v1, p. 11, Lemma 13
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.