Lemma 16 — adding the span of the recession cone preserves -freeness
ProvedMaxLatticeFree.Geometry.lambdaFree_add_span_recConeconvex-geometrydiscrete-geometrylatticesp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a lattice of a linear space , let be a -free convex set of , and let be its recession cone. Then the Minkowski sum
is again a -free convex set of , where is the linear span of .
Consequently a maximal -free convex set of equals , so its recession cone is a linear space.
Formalization Note "-free" carries no explicit ambient space on the page; by the standing assumption of §2.2 it is relative to .
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_recCone open Pointwise
Formal statement
namespace MaxLatticeFree.Geometry
theorem lambdaFree_add_span_recCone {n : ℕ} (Λ : AddSubgroup (EuclideanSpace ℝ (Fin n)))
(V : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hΛ : IsLatticeOf Λ V)
(S : Set (EuclideanSpace ℝ (Fin n))) (hS : IsLambdaFree Λ V S) :
IsLambdaFree Λ V (S + (Submodule.span ℝ (recCone S) : 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 16
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.