Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 17 — projecting a lattice along a lattice subspace gives a lattice

Proved
MaxLatticeFree.Geometry.lattice_map_orthogonalProjection

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 and let LLL be a Λ\LambdaΛ-subspace of VVV. Let π\piπ be the orthogonal projection of Rn\mathbb R^nRn onto the orthogonal complement L⊥L^\perpL⊥. Then

π(Λ)={π(y)∣y∈Λ}  is a lattice of the linear space L⊥∩V.\pi(\Lambda)=\{\pi(y)\mid y\in\Lambda\}\ \text{ is a lattice of the linear space } L^\perp\cap V .π(Λ)={π(y)∣y∈Λ}  is a lattice of the linear space L⊥∩V.

The hypothesis that LLL has a basis in Λ\LambdaΛ is essential: projecting Z2\mathbb Z^2Z2 along an irrational line gives a dense subgroup of the orthogonal line. The lemma lets the proof of Theorem 10 pass from an unbounded set P+LP+LP+L to the bounded set PPP in the lower-dimensional space L⊥∩VL^\perp\cap VL⊥∩V.

Formalization Note The paper writes proj⁡L⊥(S)={v∈L⊥∣v+w∈S for some w∈L}\operatorname{proj}_{L^\perp}(S)=\{v\in L^\perp\mid v+w\in S \text{ for some } w\in L\}projL⊥​(S)={v∈L⊥∣v+w∈S for some w∈L}; this is the image of SSS under the orthogonal projection onto L⊥L^\perpL⊥, formalized as the image of Λ\LambdaΛ under Lᗮ.starProjection.

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

theorem lattice_map_orthogonalProjection {n : ℕ} (Λ : AddSubgroup (EuclideanSpace ℝ (Fin n)))
    (V : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hΛ : IsLatticeOf Λ V)
    (L : Submodule ℝ (EuclideanSpace ℝ (Fin n))) (hL : IsLambdaSubspace Λ V L) :
    IsLatticeOf (Λ.map (Lᗮ.starProjection : EuclideanSpace ℝ (Fin n) →L[ℝ] EuclideanSpace ℝ (Fin n)).toLinearMap.toAddMonoidHom)
      (Lᗮ ⊓ V) := 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 17 (citing Barvinok, A Course in Convexity, p. 284, problem 3)
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