Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 18 — a non-lattice subspace has lattice points arbitrarily close to it

Proved
MaxLatticeFree.Geometry.exists_lattice_point_near_subspace

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

diophantine-approximationdiscrete-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 and let LLL be a linear subspace of VVV that is not a Λ\LambdaΛ-subspace of VVV. Then for every ε>0\varepsilon>0ε>0 there exists

y∈Λ∖Lwithdist⁡(y,L)<ε.y\in\Lambda\setminus L \quad\text{with}\quad \operatorname{dist}(y,L)<\varepsilon .y∈Λ∖Lwithdist(y,L)<ε.

This is the approximation property that makes an irrational hyperplane v+Lv+Lv+L maximal lattice-free (Lemma 19): a slab around it, however thin, contains lattice points in its interior.

Preamble
import Mathlib
import Definitions.Def_MaxLatticeFree_Geometry_IsLatticeOf
import Definitions.Def_MaxLatticeFree_Geometry_IsLambdaSubspace
Formal statement
namespace MaxLatticeFree.Geometry

theorem exists_lattice_point_near_subspace {n : ℕ} (Λ : AddSubgroup (EuclideanSpace ℝ (Fin n)))
    (V : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hΛ : IsLatticeOf Λ V)
    (L : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hLV : L ≤ V) (hL : ¬ IsLambdaSubspace Λ V L)
    (ε : ℝ) (hε : 0 < ε) :
    ∃ y ∈ Λ, y ∉ L ∧ Metric.infDist y (L : 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 18
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