Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 19 — a hyperplane is maximal Λ\LambdaΛ-free iff it is not a lattice subspace

Proved
MaxLatticeFree.Geometry.hyperplane_maxLambdaFree_iff

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

discrete-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 LLL be a linear subspace of VVV with dim⁡(L)=dim⁡(V)−1\dim(L)=\dim(V)-1dim(L)=dim(V)−1 and let v∈Vv\in Vv∈V. Then

v+L is a maximal Λ-free convex set of V  ⟺  L is not a Λ-subspace of V.v+L \text{ is a maximal } \Lambda\text{-free convex set of } V \iff L \text{ is not a } \Lambda\text{-subspace of } V .v+L is a maximal Λ-free convex set of V⟺L is not a Λ-subspace of V.

This settles the lower-dimensional case of Lovász's characterization (Theorem 10(ii)): an affine hyperplane of VVV is maximal exactly when its direction is irrational with respect to Λ\LambdaΛ.

Formalization Note dim⁡(L)=dim⁡(V)−1\dim(L)=\dim(V)-1dim(L)=dim(V)−1 is written dim⁡L+1=dim⁡V\dim L+1=\dim VdimL+1=dimV in natural numbers, which excludes V={0}V=\{0\}V={0}.

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

open Pointwise
Formal statement
namespace MaxLatticeFree.Geometry

theorem hyperplane_maxLambdaFree_iff {n : ℕ} (Λ : AddSubgroup (EuclideanSpace ℝ (Fin n)))
    (V : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hΛ : IsLatticeOf Λ V)
    (L : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hLV : L ≤ V)
    (hdim : Module.finrank ℝ L + 1 = Module.finrank ℝ V) (v : EuclideanSpace ℝ (Fin n)) (hv : v ∈ V) :
    IsMaxLambdaFree Λ V (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. 13, Lemma 19
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