Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 16 — adding the span of the recession cone preserves Λ\LambdaΛ-freeness

Proved
MaxLatticeFree.Geometry.lambdaFree_add_span_recCone

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-geometrydiscrete-geometrylatticesp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Λ\LambdaΛ be a lattice of a linear space V⊆RnV\subseteq\mathbb R^nV⊆Rn, let SSS be a Λ\LambdaΛ-free convex set of VVV, and let C=rec⁡(S)C=\operatorname{rec}(S)C=rec(S) be its recession cone. Then the Minkowski sum

S+⟨C⟩={ s+c∣s∈S, c∈⟨C⟩ }S+\langle C\rangle=\{\,s+c \mid s\in S,\ c\in\langle C\rangle\,\}S+⟨C⟩={s+c∣s∈S, c∈⟨C⟩}

is again a Λ\LambdaΛ-free convex set of VVV, where ⟨C⟩\langle C\rangle⟨C⟩ is the linear span of CCC.

Consequently a maximal Λ\LambdaΛ-free convex set of VVV equals S+⟨C⟩S+\langle C\rangleS+⟨C⟩, so its recession cone is a linear space.

Formalization Note "Λ\LambdaΛ-free" carries no explicit ambient space on the page; by the standing assumption of §2.2 it is relative to VVV.

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
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me