Rank- even unimodular lattices and full integral isometry
DefinitionNiemeier_Lattices24The definition bundle models lattices on by symmetric integer Gram matrices that are positive definite over , have even squared norm on every integral vector and determinant . It defines the integral pairing, full integral isometry and its quotient, roots of squared norm , rootlessness and complete-family/classification predicates. The classification is a proposition to prove, with no assumed representative list or completeness certificate.
import Mathlib.LinearAlgebra.Matrix.PosDef
import Mathlib.LinearAlgebra.Matrix.BilinearForm
import Mathlib.LinearAlgebra.BilinearForm.IsometryEquiv
import Mathlib.LinearAlgebra.Matrix.Determinant.Basic
/-! Mathlib-only definitions for the local Niemeier mission proposal.
The Gram matrix records the integral pairing B; squared norm is B(x,x),
not half that value. No classification theorem is assumed here.
-/
set_option autoImplicit false
namespace Niemeier
abbrev Coordinates := Fin 24 → ℤ
/-- A based rank-24 integral lattice. Positive definiteness is over ℝ.
Unimodularity uses determinant +1, appropriate for a positive Gram matrix.
Evenness is required on every integral vector, with squared norm B(x,x). -/
structure EvenUnimodularLattice24 where
gram : Matrix (Fin 24) (Fin 24) ℤ
symmetric : gram.IsSymm
positive : (gram.map (Int.castRingHom ℝ)).PosDef
even : ∀ x : Coordinates, Even (gram.toBilin' x x)
unimodular : gram.det = 1
namespace EvenUnimodularLattice24
abbrev pairing (L : EvenUnimodularLattice24) : LinearMap.BilinForm ℤ Coordinates :=
L.gram.toBilin'
/-- Integral, full isometry, with no orientation or determinant +1 restriction. -/
def Isometric (L K : EvenUnimodularLattice24) : Prop :=
L.pairing.Equivalent K.pairing
instance isometrySetoid : Setoid EvenUnimodularLattice24 where
r := Isometric
iseqv := ⟨fun L => LinearMap.BilinForm.Equivalent.refl L.pairing,
fun h => LinearMap.BilinForm.Equivalent.symm h,
fun h h' => LinearMap.BilinForm.Equivalent.trans h h'⟩
/-- Roots are actual integral vectors of squared norm 2. -/
def Roots (L : EvenUnimodularLattice24) :=
{x : Coordinates // L.pairing x x = 2}
/-- The rootless member of the classification is the Leech isometry class. -/
def Rootless (L : EvenUnimodularLattice24) : Prop :=
∀ x : Coordinates, L.pairing x x ≠ 2
end EvenUnimodularLattice24
/-- The quotient forgets the chosen integral basis. -/
abbrev IsometryClass := Quotient EvenUnimodularLattice24.isometrySetoid
/-- A complete family of 24 pairwise nonisometric lattices. -/
def CompleteFamily (C : Fin 24 → EvenUnimodularLattice24) : Prop :=
(∀ i j, (C i).Isometric (C j) ↔ i = j) ∧
∀ L : EvenUnimodularLattice24, ∃! i : Fin 24, L.Isometric (C i)
/-- Main target: 24 classes, with index 0 the unique rootless class.
The other 23 classes have roots. This is a proposition to prove, not a certificate
field supplied as an assumption about candidates. Concrete named Gram models
and identification with the classical root-system table are further obligations. -/
def ClassificationStatement : Prop :=
∃ C : Fin 24 → EvenUnimodularLattice24,
CompleteFamily C ∧ ∀ i : Fin 24, (C i).Rootless ↔ i = 0
end Niemeier
Read-back
What the Lean code literally says, in plain math · Codex independent sub-agent (inherited session model)
The coordinate module is , with coordinates indexed by .
A lattice in this statement consists of a integer matrix that is symmetric, whose entrywise image over is positive definite, such that is an even integer for every , and such that .
For each such lattice with matrix , its pairing is the integer bilinear form on .
Two such lattices and are called isometric if their pairings are equivalent: there exists an invertible -linear map such that for all .
The specified equivalence relation on these lattices is isometry; its reflexivity, symmetry and transitivity are those of equivalence of bilinear forms.
For each such lattice , its roots form the set of vectors satisfying .
A lattice is rootless if, for every , .
The set of isometry classes is the quotient of the set of these lattices by the specified isometry relation.
A family of these lattices is complete if both of the following hold: for every , is isometric to if and only if ; and for every such lattice , there exists exactly one for which is isometric to .
The classification proposition says that there exists a family of these lattices such that is isometric to if and only if for every pair of indices, every such lattice is isometric to for exactly one index , and, for every , is rootless if and only if . Here rootless means that no has .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.