Claim 2 in the proof of Theorem 10 — the lineality space is a -subspace
ProvedMaxLatticeFree.Geometry.unbounded_maxLambdaFree_linSpace_isLambdaSubspacediscrete-geometrylatticesp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice of a linear space and let be a maximal -free convex set of with that is unbounded. Let be the lineality space of . Then
Together with Lemma 17 this lets the proof of Theorem 10 project onto , where is a bounded maximal lattice-free set for a lattice, and apply Lemma 13.
Formalization Note The hypotheses are the standing context of Claim 2 on pp. 13–14. The conclusion states that the set of lineality directions is (the carrier of) a submodule that is a -subspace.
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 import Definitions.Def_MaxLatticeFree_Geometry_recCone import Definitions.Def_MaxLatticeFree_Geometry_affDim
Formal statement
namespace MaxLatticeFree.Geometry
theorem unbounded_maxLambdaFree_linSpace_isLambdaSubspace {n : ℕ} (Λ : AddSubgroup (EuclideanSpace ℝ (Fin n)))
(V : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hΛ : IsLatticeOf Λ V)
(S : Set (EuclideanSpace ℝ (Fin n))) (hS : IsMaxLambdaFree Λ V S)
(hdim : affDim S = (Module.finrank ℝ V : ℤ)) (hunbdd : ¬ Bornology.IsBounded S) :
∃ L : Submodule ℝ (EuclideanSpace ℝ (Fin n)), (L : Set (EuclideanSpace ℝ (Fin n))) = linSpace S ∧ 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. 14, Claim 2 in the proof of Theorem 10
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.