Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10 — Lovász's characterization of maximal Λ\LambdaΛ-free convex sets of VVV

Proved
MaxLatticeFree.Geometry.lovasz_maxLambdaFree_iff

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

discrete-geometryinteger-programminglatticesp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Λ\LambdaΛ be a lattice of a linear space V⊆RnV\subseteq\mathbb R^nV⊆Rn with dim⁡V≥1\dim V\ge1dimV≥1. A set S⊆RnS\subseteq\mathbb R^nS⊆Rn is a maximal Λ\LambdaΛ-free convex set of VVV if and only if one of the following holds:

  1. SSS is a polyhedron in VVV of the form S=P+LS=P+LS=P+L where PPP is a polytope, LLL is a Λ\LambdaΛ-subspace of VVV,
dim⁡(S)=dim⁡(P)+dim⁡(L)=dim⁡(V),\dim(S)=\dim(P)+\dim(L)=\dim(V),dim(S)=dim(P)+dim(L)=dim(V),

no point of Λ\LambdaΛ lies in intV(S)\mathbf{int}_V(S)intV​(S), and every facet of SSS has a point of Λ\LambdaΛ in its relative interior; 2. SSS is an affine hyperplane of VVV of the form S=v+LS=v+LS=v+L, where v∈Vv\in Vv∈V, LLL is a linear subspace of VVV with dim⁡L=dim⁡V−1\dim L=\dim V-1dimL=dimV−1, and LLL is not a Λ\LambdaΛ-subspace of VVV.

For Λ=Zn∩V\Lambda=\mathbb Z^n\cap VΛ=Zn∩V this is Lovász's theorem (Theorem 2 of the paper): maximal lattice-free convex sets are cylinders over polytopes with a lattice point in the relative interior of every facet, or irrational hyperplanes.

Formalization Note The page does not state dim⁡V≥1\dim V\ge1dimV≥1; it is added because for V={0}V=\{0\}V={0} the only maximal Λ\LambdaΛ-free set is ∅\emptyset∅ (int{0}{0}={0}∋0\mathbf{int}_{\{0\}}\{0\}=\{0\}\ni 0int{0}​{0}={0}∋0), which satisfies neither case. "SSS is a polyhedron" is read as a polyhedron in VVV, because a maximal Λ\LambdaΛ-free set of VVV lies in VVV. "Its interior" is intV\mathbf{int}_VintV​, as fixed on p. 10. S=P+LS=P+LS=P+L is the Minkowski sum.

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_affDim
import Definitions.Def_MaxLatticeFree_Geometry_Polyhedron

open Pointwise
Formal statement
namespace MaxLatticeFree.Geometry

theorem lovasz_maxLambdaFree_iff {n : ℕ} (Λ : AddSubgroup (EuclideanSpace ℝ (Fin n)))
    (V : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hΛ : IsLatticeOf Λ V) (hV : 0 < Module.finrank ℝ V)
    (S : Set (EuclideanSpace ℝ (Fin n))) :
    IsMaxLambdaFree Λ V S ↔
      (IsPolyhedronIn V S ∧
        ∃ (P : Set (EuclideanSpace ℝ (Fin n))) (L : Submodule ℝ (EuclideanSpace ℝ (Fin n))),
          IsPolytope P ∧ IsLambdaSubspace Λ V L ∧ S = P + (L : Set (EuclideanSpace ℝ (Fin n))) ∧
          affDim S = affDim P + (Module.finrank ℝ L : ℤ) ∧
          affDim P + (Module.finrank ℝ L : ℤ) = (Module.finrank ℝ V : ℤ) ∧
          (Λ : Set (EuclideanSpace ℝ (Fin n))) ∩ intW (V : Set (EuclideanSpace ℝ (Fin n))) S = ∅ ∧
          ∀ F : Set (EuclideanSpace ℝ (Fin n)), IsFacet S F → ∃ x ∈ Λ, x ∈ relint F) ∨
      (∃ v ∈ V, ∃ L : Submodule ℝ (EuclideanSpace ℝ (Fin n)), L ≤ V ∧
        Module.finrank ℝ L + 1 = Module.finrank ℝ V ∧
        S = 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. 8, Theorem 10 (proof pp. 13–15)
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