LeanBridge Blueprint

8.4. Lattices🔗

This section lists the LMFDB definitions in the category lattice. Each definition links back to its LMFDB knowl. It also lists the knowls about the LMFDB's data on this subject that have mathematical content, from the categories dq and rcs.

Definition8.4.1
uses 1used by 0XL∃∀N

Source of lattice data. (LMFDB)

The database contains lattice data (Gram matrices) from the Catalogue of Lattices, maintained by Gabriele Nebe and Neil J.A. Sloane. The Catalogue contains some tables compiled by other authors, which are cited individually in the LMFDB. For lattices of class number one, completeness of the data is confirmed by a calculation of Kirschmer and Lorch (, , ).

Additional data was computed in Magma and PARI using code written by Anna Haensch and Samuele Anni. This code is available from Github.

For solutions of the lattice packing problem in dimensions up to 8, the sphere packing problem in dimensions up to 2, the kissing number problem in dimensions up to 3, and the lattice kissing number problem in dimensions up to 9, see Conway-Sloane . The other known solutions of the sphere packing problem are due to Ferguson and Hales in dimension 3 , Viazovska in dimension 8 (, ) and Cohn, Kumar, Miller, Radchenko, and Viazovska in dimension 24 (, ). The other known solutions of the kissing number problem are due to Musin in dimension 4 , Levenshtein in dimension 8 , and Odlyzko and Sloane in dimension 24 .

Depends on: Definition 8.4.23

Definition8.4.2
Statement uses 6
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Additively indecomposable lattice. (LMFDB)

A positive definite integral lattice L is additively indecomposable if it cannot be written as a sum of two nonzero positive semi-definite integral lattices.

Every additively indecomposable lattice is (orthogonally) indecomposable, though the converse is not true in general. However, every unimodular (orthogonally) indecomposable lattice is additively indecomposable.

The only additively indecomposable integral lattices of rank up to 8 are \Z, E_6, E_7, and E_8, proven by Mordell and Ko.

Depends on: Definition 8.4.9 Definition 8.4.12 Definition 8.4.36 Definition 8.4.40 Definition 8.4.45 Definition 8.4.58

Definition8.4.3
uses 0used by 0✓L∃∀N

Algebraic lattice. (LMFDB)

A lattice is called algebraic if it can be realized as a free \mathbb{Z}-module in an algebraic number field.

Lean code for Definition8.4.3●5 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Algebraic.lean
    complete
    def TauCeti.IntegralLattice.IsAlgebraic.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    def TauCeti.IntegralLattice.IsAlgebraic.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    An integral lattice `L` is **algebraic** (LMFDB `lattice.algebraic`) if it can be realized as
    a free `ℤ`-module of full rank in a number field `K` with its Minkowski form: there is an injective
    `ℤ`-linear map `f : L → K` whose image spans `K` over `ℚ` and which carries the form `B` of `L` to
    the Minkowski form, `B(x, y) = ⟨σ(f x), σ(f y)⟩` for the canonical embedding `σ` of `K` in
    `ℝ^{[K : ℚ]}`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Algebraic.lean
    complete
    def NumberField.minkowskiForm.{u_1} (K : Type u_1) [Field K] [NumberField K]
      (x y : K) : ℝ
    def NumberField.minkowskiForm.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      (x y : K) : ℝ
    The **Minkowski form** `(x, y) ↦ ⟨σ(x), σ(y)⟩` of a number field `K`, where `σ` is the
    canonical embedding of `K` in `ℝ^{r₁} × ℂ^{r₂}`, a Euclidean space of dimension `[K : ℚ]`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Algebraic.lean
    complete
    theorem NumberField.minkowskiForm_eq_sum.{u_1} (K : Type u_1) [Field K]
      [NumberField K] (x y : K) :
      NumberField.minkowskiForm K x y =
        ∑ w,
            (NumberField.InfinitePlace.embedding_of_isReal ⋯) x *
              (NumberField.InfinitePlace.embedding_of_isReal ⋯) y +
          ∑ w, ((↑w).embedding y * (starRingEnd ℂ) ((↑w).embedding x)).re
    theorem NumberField.minkowskiForm_eq_sum.{u_1}
      (K : Type u_1) [Field K] [NumberField K]
      (x y : K) :
      NumberField.minkowskiForm K x y =
        ∑ w,
            (NumberField.InfinitePlace.embedding_of_isReal
                  ⋯)
                x *
              (NumberField.InfinitePlace.embedding_of_isReal
                  ⋯)
                y +
          ∑ w,
            ((↑w).embedding y *
                (starRingEnd ℂ)
                  ((↑w).embedding x)).re
    **The Minkowski form is `∑_{w real} w(x) w(y) + ∑_{w complex} Re(w(y) w̄(x))`**, with `w(x)`
    the image of `x` under the embedding chosen for the infinite place `w`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Algebraic.lean
    complete
    theorem TauCeti.IntegralLattice.IsAlgebraic.isPosDef.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] {L : TauCeti.IntegralLattice V}
      (hL : L.IsAlgebraic) : L.IsPosDef
    theorem TauCeti.IntegralLattice.IsAlgebraic.isPosDef.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      (hL : L.IsAlgebraic) : L.IsPosDef
    **An algebraic lattice is positive definite.** 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Algebraic.lean
    complete
    theorem TauCeti.IntegralLattice.isAlgebraic_unitLattice_unit :
      (TauCeti.IntegralLattice.unitLattice Unit).IsAlgebraic
    theorem TauCeti.IntegralLattice.isAlgebraic_unitLattice_unit :
      (TauCeti.IntegralLattice.unitLattice
          Unit).IsAlgebraic
    **The lattice `ℤ` with the form `(x, y) ↦ xy`, Tau Ceti's `unitLattice Unit`, is algebraic**,
    realized as `ℤ ⊆ ℚ`. 
Definition8.4.4
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.17
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Arithmetic lattice. (LMFDB)

A lattice is called arithmetic if it is similar to an integral lattice.

Depends on: Definition 8.4.9 Definition 8.4.52

Lean code for Definition8.4.4●6 declarations
  • defdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/ArithmeticBilinear.lean
    complete
    def LinearMap.BilinForm.IsArithmeticLattice.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℝ V] (B : LinearMap.BilinForm ℝ V)
      (L : Submodule ℤ V) : Prop
    def LinearMap.BilinForm.IsArithmeticLattice.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℝ V]
      (B : LinearMap.BilinForm ℝ V)
      (L : Submodule ℤ V) : Prop
    A lattice `L` in a real quadratic space `(V, B)` is **arithmetic** (LMFDB `lattice.arithmetic`)
    if `c B(L, L) ⊆ ℤ` for some real `c > 0`. This is the knowl's definition, similarity to an integral
    lattice (`LinearMap.BilinForm.isArithmeticLattice_iff`,
    `LinearMap.BilinForm.IsSimilarLattice.isArithmeticLattice`), and for a real inner product space it
    is `ZLattice.IsArithmetic` (`LinearMap.BilinForm.isArithmeticLattice_innerₗ_iff`). 
  • defdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/ArithmeticBilinear.lean
    complete
    def LinearMap.BilinForm.IsIntegralLattice.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℝ V] (B : LinearMap.BilinForm ℝ V)
      (L : Submodule ℤ V) : Prop
    def LinearMap.BilinForm.IsIntegralLattice.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℝ V]
      (B : LinearMap.BilinForm ℝ V)
      (L : Submodule ℤ V) : Prop
    A `ℤ`-submodule `L` of a real vector space with a bilinear form `B` is an **integral** lattice
    (LMFDB `lattice.definition`) if `B(L, L) ⊆ ℤ`. The knowl's lattices are moreover finitely generated
    and discrete, in a finite-dimensional space with a nonsingular symmetric form. 
  • defdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/ArithmeticBilinear.lean
    complete
    def LinearMap.BilinForm.IsSimilarLattice.{u_1, u_2} {V : Type u_1}
      {W : Type u_2} [AddCommGroup V] [Module ℝ V] [AddCommGroup W]
      [Module ℝ W] (B : LinearMap.BilinForm ℝ V) (L : Submodule ℤ V)
      (B' : LinearMap.BilinForm ℝ W) (M : Submodule ℤ W) : Prop
    def LinearMap.BilinForm.IsSimilarLattice.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℝ V]
      [AddCommGroup W] [Module ℝ W]
      (B : LinearMap.BilinForm ℝ V)
      (L : Submodule ℤ V)
      (B' : LinearMap.BilinForm ℝ W)
      (M : Submodule ℤ W) : Prop
    A lattice `L` in a real quadratic space `(V, B)` is **similar** (LMFDB `lattice.similarity`) to
    a lattice `M` in `(W, B')` if `L` is isometric to `αM` for a real constant `α ≠ 0`: some `ℤ`-linear
    bijection `e : L → αM` satisfies `B'(e x, e y) = B(x, y)` (LMFDB `lattice.isometry` asks for
    `Q(e x) = Q(x)`, the same for a linear bijection, `B` being recovered from `Q` by polarisation). 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/ArithmeticBilinear.lean
    complete
    theorem LinearMap.BilinForm.isArithmeticLattice_iff.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℝ V] {B : LinearMap.BilinForm ℝ V}
      {L : Submodule ℤ V} [TopologicalSpace V] [ContinuousConstSMul ℝ V]
      (hL : L.FG) [DiscreteTopology ↥L] :
      B.IsArithmeticLattice L ↔
        ∃ K,
          K.FG ∧
            DiscreteTopology ↥K ∧
              B.IsIntegralLattice K ∧ B.IsSimilarLattice L B K
    theorem LinearMap.BilinForm.isArithmeticLattice_iff.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℝ V]
      {B : LinearMap.BilinForm ℝ V}
      {L : Submodule ℤ V} [TopologicalSpace V]
      [ContinuousConstSMul ℝ V] (hL : L.FG)
      [DiscreteTopology ↥L] :
      B.IsArithmeticLattice L ↔
        ∃ K,
          K.FG ∧
            DiscreteTopology ↥K ∧
              B.IsIntegralLattice K ∧
                B.IsSimilarLattice L B K
    **A lattice is arithmetic exactly when it is similar to an integral lattice** (LMFDB
    `lattice.arithmetic`): a finitely generated discrete `ℤ`-submodule `L` satisfies `c B(L, L) ⊆ ℤ`
    for some real `c > 0` exactly when it is similar to a finitely generated discrete `ℤ`-submodule `K`
    of the same space with `B(K, K) ⊆ ℤ`, which can be taken to be `√c L`. An integral lattice in any
    other real quadratic space works as well
    (`LinearMap.BilinForm.IsSimilarLattice.isArithmeticLattice`). 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/ArithmeticBilinear.lean
    complete
    theorem LinearMap.BilinForm.IsSimilarLattice.isArithmeticLattice.{u_1, u_2}
      {V : Type u_1} {W : Type u_2} [AddCommGroup V] [Module ℝ V]
      [AddCommGroup W] [Module ℝ W] {B : LinearMap.BilinForm ℝ V}
      {L : Submodule ℤ V} {B' : LinearMap.BilinForm ℝ W} {M : Submodule ℤ W}
      (h : B.IsSimilarLattice L B' M) (hM : B'.IsIntegralLattice M) :
      B.IsArithmeticLattice L
    theorem LinearMap.BilinForm.IsSimilarLattice.isArithmeticLattice.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℝ V]
      [AddCommGroup W] [Module ℝ W]
      {B : LinearMap.BilinForm ℝ V}
      {L : Submodule ℤ V}
      {B' : LinearMap.BilinForm ℝ W}
      {M : Submodule ℤ W}
      (h : B.IsSimilarLattice L B' M)
      (hM : B'.IsIntegralLattice M) :
      B.IsArithmeticLattice L
    **A lattice similar to an integral lattice is arithmetic** (LMFDB `lattice.arithmetic`), the
    integral lattice lying in any real quadratic space: if `L` is isometric to `αM` with `M` integral,
    then `α⁻² B(L, L) ⊆ ℤ`. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/ArithmeticBilinear.lean
    complete
    theorem LinearMap.BilinForm.isArithmeticLattice_of_apply_self_eq.{u_1, u_2}
      {V : Type u_1} {W : Type u_2} [AddCommGroup V] [Module ℝ V]
      [AddCommGroup W] [Module ℝ W] {B : LinearMap.BilinForm ℝ V}
      {L : Submodule ℤ V} {B' : LinearMap.BilinForm ℝ W} {M : Submodule ℤ W}
      (hB : LinearMap.IsSymm B) (hM : B'.IsIntegralLattice M) {α : ℝ}
      (σ : ↥L → ↥(α • M))
      (hσ : ∀ (x : ↥L), (B' ↑(σ x)) ↑(σ x) = (B ↑x) ↑x) :
      B.IsArithmeticLattice L
    theorem LinearMap.BilinForm.isArithmeticLattice_of_apply_self_eq.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℝ V]
      [AddCommGroup W] [Module ℝ W]
      {B : LinearMap.BilinForm ℝ V}
      {L : Submodule ℤ V}
      {B' : LinearMap.BilinForm ℝ W}
      {M : Submodule ℤ W}
      (hB : LinearMap.IsSymm B)
      (hM : B'.IsIntegralLattice M) {α : ℝ}
      (σ : ↥L → ↥(α • M))
      (hσ :
        ∀ (x : ↥L),
          (B' ↑(σ x)) ↑(σ x) = (B ↑x) ↑x) :
      B.IsArithmeticLattice L
    **A lattice with a norm-preserving map to a scaled integral lattice is arithmetic** (LMFDB
    `lattice.arithmetic`, with `lattice.similarity` and `lattice.isometry` read literally): if `B` is
    symmetric, `M` is integral and some map `σ : L → αM`, `α ∈ ℝ`, linear or not, satisfies
    `B'(σ x, σ x) = B(x, x)`, then `L` is arithmetic, since `B(x, x) ∈ α² ℤ` on `L` and
    `2 B(x, y) = B(x + y, x + y) - B(x, x) - B(y, y)`. 
Definition8.4.5
Statement uses 3
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 8.4.20
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Automorphism group of an integral lattice. (LMFDB)

The automorphism group of an integral lattice L is the group of isometries from L to itself. For a positive definite lattice, this is a finite group.

Tau Ceti Review: TauCeti.IntegralLattice.Isometry, TauCeti.IntegralLattice.specialOrthogonalGroup, TauCeti.IntegralLattice.IsPosDef.finite_isometry.

Depends on: Definition 8.4.9 Definition 8.4.28 Definition 8.4.45

Lean code for Definition8.4.5●4 declarations
  • defdefined in TauCeti/LinearAlgebra/BilinearForm/Isometry.lean
    complete
    def TauCeti.BilinForm.isometryGroup.{u_1, u_2} {R : Type u_1} {M : Type u_2}
      [CommSemiring R] [AddCommMonoid M] [Module R M]
      (B : LinearMap.BilinForm R M) : Subgroup (M ≃ₗ[R] M)
    def TauCeti.BilinForm.isometryGroup.{u_1, u_2}
      {R : Type u_1} {M : Type u_2}
      [CommSemiring R] [AddCommMonoid M]
      [Module R M]
      (B : LinearMap.BilinForm R M) :
      Subgroup (M ≃ₗ[R] M)
    The isometry group `Aut(M, B)` of a bilinear form `B` on `M`: the linear automorphisms of `M`
    that preserve `B`.
    
    For a finite free `ℤ`-module `V` carrying an integral form `Q` this is the arithmetic group
    `Aut(V, Q)`; when `Q` is preserved by monodromy, a variation of Hodge structure has its monodromy
    representation land in this group and act on the complexification through
    `TauCeti.BilinForm.isometryGroupBaseChange`. 
  • structure(extends 7, 8 fields)defined in TauCeti/LinearAlgebra/IntegralLattice/Isometry/Basic.lean
    complete
    structure TauCeti.IntegralLattice.Isometry.{u, v} {V : Type u} {W : Type v}
      [AddCommGroup V] [Module ℚ V] [AddCommGroup W] [Module ℚ W]
      (L : TauCeti.IntegralLattice V) (M : TauCeti.IntegralLattice W) :
      Type (max u v)
    structure TauCeti.IntegralLattice.Isometry.{u, v}
      {V : Type u} {W : Type v}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) :
      Type (max u v)
    An isometry of integral lattices is an isometry of their ambient rational bilinear spaces
    which maps the first carrier onto the second. 
    • L.form.IsometryEquiv M.form
    toFun : V → W
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    3. LinearMap
    4. AddHom
    map_add' : ∀ (x y : V), (↑self.toLinearEquiv).toFun (x + y) = (↑self.toLinearEquiv).toFun x + (↑self.toLinearEquiv).toFun y
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    3. LinearMap
    4. AddHom
    map_smul' : ∀ (m : ℚ) (x : V), (↑self.toLinearEquiv).toFun (m • x) = (RingHom.id ℚ) m • (↑self.toLinearEquiv).toFun x
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    3. LinearMap
    invFun : W → V
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    left_inv : Function.LeftInverse self.invFun (↑self.toLinearEquiv).toFun
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    right_inv : Function.RightInverse self.invFun (↑self.toLinearEquiv).toFun
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    map_app' : ∀ (n m : V), (M.form ((↑self.toLinearEquiv).toFun n)) ((↑self.toLinearEquiv).toFun m) = (L.form n) m
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    map_carrier : Submodule.map (↑(LinearEquiv.restrictScalars ℤ self.toLinearEquiv)) L.carrier = M.carrier
    The ambient equivalence maps the source lattice carrier onto the target carrier. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Isometry/Group.lean
    complete
    def TauCeti.IntegralLattice.specialOrthogonalGroup.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      Subgroup (L.Isometry L)
    def TauCeti.IntegralLattice.specialOrthogonalGroup.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Subgroup (L.Isometry L)
    The special isometry group `SO(L)`: the subgroup of the isometry group `O(L) = Isometry L L`
    of self-isometries of determinant one. 
  • theoremdefined in TauCeti/LinearAlgebra/IntegralLattice/PosDef/Finite.lean
    complete
    theorem TauCeti.IntegralLattice.IsPosDef.finite_isometry.{u, u_1} {V : Type u}
      [AddCommGroup V] [Module ℚ V] {L : TauCeti.IntegralLattice V}
      {W : Type u_1} [AddCommGroup W] [Module ℚ W]
      {M : TauCeti.IntegralLattice W} (hM : M.IsPosDef) :
      Finite (L.Isometry M)
    theorem TauCeti.IntegralLattice.IsPosDef.finite_isometry.{u,
        u_1}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      {W : Type u_1} [AddCommGroup W]
      [Module ℚ W]
      {M : TauCeti.IntegralLattice W}
      (hM : M.IsPosDef) :
      Finite (L.Isometry M)
    **The isometry group of a positive definite lattice is finite.** More generally, there are only
    finitely many isometries into a positive definite lattice. 
Definition8.4.6
Statement uses 3
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.30
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Class number of an integral lattice. (LMFDB)

For an integral lattice, L, the number of isometry classes in the genus of L is the class number of L.

Depends on: Definition 8.4.9 Definition 8.4.21 Definition 8.4.28

Definition8.4.7
Statement uses 3
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Conway symbol. (LMFDB)

The Conway genus symbol of an integral lattice L is an invariant of the genus of L. It is given in the form \text{I}_{r,s}(\cdots) or \text{II}_{r,s}(\cdots) where the Roman numeral \text{I} or \text{II} indicates the type of L, and (r,s) is the signature of L.

For a complete description of the Conway symbol, see Conway-Sloane, Chapter 15.

Depends on: Definition 8.4.9 Definition 8.4.21 Definition 8.4.51

Lean code for Definition8.4.7●6 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusSymbolSign.lean
    complete
    def TauCeti.IntegralLattice.conwayGenusSymbolSigned.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] : TauCeti.IntegralLattice.ConwayGenusSymbolSigned
    def TauCeti.IntegralLattice.conwayGenusSymbolSigned.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] :
      TauCeti.IntegralLattice.ConwayGenusSymbolSigned
    The type, signature, Jordan ranks, signs at the odd primes and dyadic types of a nondegenerate
    integral lattice `L`: the part of its **Conway genus symbol** (LMFDB `lattice.conway_genus_symbol`)
    formalised here. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusSymbolSign.lean
    complete
    theorem TauCeti.IntegralLattice.SameGenus.conwayGenusSymbolSigned_eq.{u_1, u_2}
      {V : Type u_1} {W : Type u_2} [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W] {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W} [L.IsNondegenerate]
      [M.IsNondegenerate] (h : L.SameGenus M) :
      L.conwayGenusSymbolSigned = M.conwayGenusSymbolSigned
    theorem TauCeti.IntegralLattice.SameGenus.conwayGenusSymbolSigned_eq.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W}
      [L.IsNondegenerate] [M.IsNondegenerate]
      (h : L.SameGenus M) :
      L.conwayGenusSymbolSigned =
        M.conwayGenusSymbolSigned
    **The type, signature, Jordan ranks, signs at the odd primes and dyadic types are genus
    invariants.** 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusSymbolCanonical.lean
    complete
    def TauCeti.IntegralLattice.compartmentOddities.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] : List (ZMod 8)
    def TauCeti.IntegralLattice.compartmentOddities.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] : List (ZMod 8)
    The **oddities of the compartments** of the canonical `2`-adic symbol (LMFDB
    `lattice.conway_genus_symbol`) of a nondegenerate integral lattice `L`, in increasing order of
    scale: the total oddity of each compartment after oddity fusion and sign walking, computed from the
    chosen dyadic Jordan splitting as in Conway and Sloane, §7.5–7.6, and Sage's
    `canonical_2_adic_reduction`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusSymbolCanonical.lean
    complete
    def TauCeti.IntegralLattice.trainSigns.{u_1} {V : Type u_1} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) [L.IsNondegenerate] :
      List ℤ
    def TauCeti.IntegralLattice.trainSigns.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] : List ℤ
    The **signs of the trains** of the canonical `2`-adic symbol (LMFDB
    `lattice.conway_genus_symbol`) of a nondegenerate integral lattice `L`, in increasing order of
    scale: the product of the signs of the constituents of each train, which sign walking carries to
    its first constituent. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusSymbolGaussSum.lean
    complete
    theorem TauCeti.IntegralLattice.SameGenus.compartmentOddities_eq.{u_1, u_2}
      {V : Type u_1} {W : Type u_2} [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W] {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W} [L.IsNondegenerate]
      [M.IsNondegenerate] (h : L.SameGenus M) :
      L.compartmentOddities = M.compartmentOddities
    theorem TauCeti.IntegralLattice.SameGenus.compartmentOddities_eq.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W}
      [L.IsNondegenerate] [M.IsNondegenerate]
      (h : L.SameGenus M) :
      L.compartmentOddities =
        M.compartmentOddities
    **The oddities of the compartments of the canonical `2`-adic symbol are genus invariants**, so
    that the whole canonical `2`-adic symbol is (LMFDB `lattice.conway_genus_symbol`). 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusSymbolStopSign.lean
    complete
    theorem TauCeti.IntegralLattice.SameGenus.trainSigns_eq.{u_1, u_2}
      {V : Type u_1} {W : Type u_2} [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W] {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W} [L.IsNondegenerate]
      [M.IsNondegenerate] (h : L.SameGenus M) : L.trainSigns = M.trainSigns
    theorem TauCeti.IntegralLattice.SameGenus.trainSigns_eq.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W}
      [L.IsNondegenerate] [M.IsNondegenerate]
      (h : L.SameGenus M) :
      L.trainSigns = M.trainSigns
    **The signs of the trains of the canonical `2`-adic symbol are genus invariants.** Lattices in
    the same genus have the same signs of the trains: the sign of each train is the quotient of the
    sign products below the stops that bound it, which are genus invariants. 
Definition8.4.8
uses 1used by 0XL∃∀N

Covering radius. (LMFDB)

Covering radius (also known as inhomogeneous minimum) of a convex \boldsymbol 0-symmetric set K in \mathbb{R}^n with respect to a full-rank lattice L \subset \mathbb{R}^n is \mu = \min \{ t > 0 : \bigcup_{\boldsymbol x \in L} (\boldsymbol x + tK) = \mathbb{R}^n \}. Covering radius satisfies Jarnik's inequality:

\frac{1}{2} \lambda_n \leq \mu \leq \frac{1}{2} \sum_{i=1}^n \lambda_i \leq \frac{n}{2} \lambda_n,

where \lambda_1,\dots,\lambda_n are the successive minima of K with respect to L. The covering radius of the unit ball with respect to L is called the covering radius of L.

Depends on: Definition 8.4.55

Definition8.4.9
uses 1
Used by 42
Reverse dependency previews
Preview
Definition 3.6.13
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Integral Lattice. (LMFDB)

Let V be an n-dimensional vector space over a topological field F (with \text{char}(F) \neq 2) equipped with a nonsingular symmetric bilinear map B:V\times V\rightarrow F and associated quadratic map Q(v):=B(v,v). The pair (V,Q) is a quadratic space. Fixing a basis, \{v_1,...,v_n\} for V, the space (V,Q) has an associated quadratic form, that is, a homogeneous degree 2 polynomial, given by

f(x_1,...,x_n)=\sum_{i,j}B(v_i,v_j)x_ix_j,

where B(v_i,v_j)=B(v_j,v_i) since B is symmetric. It is often helpful to think of a quadratic space in terms of its Gram matrix representation.

Let R denote a subring of F. An R-lattice is a finitely generated R-module which is a discrete subset of V endowed with the same bilinear map B. In the special case when F=\mathbb{R}, a lattice is simply a \mathbb{Z}-lattice, L, which is called integral if B(L,L)\subseteq \mathbb{Z}.

For example, letting B(v,w)=v\cdot w, the standard inner product, Euclidean n-space can be thought of as the quadratic space (\mathbb{R}^n, \cdot). In this case, the space (\mathbb{R}^n, \cdot) contains the integral lattice \mathbb{Z}^n as a discrete subset endowed with the standard inner product.

Currently, all the lattices in the database are nondegenerate, integral, and have signature (n_+, n_-) with n_+ \ge n_-.

Depends on: Definition 8.4.23

Lean code for Definition8.4.9●6 definitions
  • structure(2 fields)defined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RealLattice.lean
    complete
    structure LinearMap.BilinForm.IsQuadraticSpace.{u_1, u_2} {F : Type u_1}
      {V : Type u_2} [Field F] [AddCommGroup V] [Module F V]
      (B : LinearMap.BilinForm F V) : Prop
    structure LinearMap.BilinForm.IsQuadraticSpace.{u_1,
        u_2}
      {F : Type u_1} {V : Type u_2} [Field F]
      [AddCommGroup V] [Module F V]
      (B : LinearMap.BilinForm F V) : Prop
    A **quadratic space** (LMFDB `lattice.definition`) `(V, Q)`: a vector space `V` with a
    nonsingular symmetric bilinear form `B`, whose quadratic map is `Q(v) = B(v, v)`
    (`LinearMap.BilinMap.toQuadraticMap`). 
    isSymm : B.IsSymm
    nondegenerate : B.Nondegenerate
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RealLattice.lean
    complete
    def LinearMap.BilinForm.gramPolynomial.{u_1, u_2, u_3} {F : Type u_1}
      {V : Type u_2} [Field F] [AddCommGroup V] [Module F V]
      (B : LinearMap.BilinForm F V) {ι : Type u_3} [Fintype ι]
      (v : Module.Basis ι F V) : MvPolynomial ι F
    def LinearMap.BilinForm.gramPolynomial.{u_1,
        u_2, u_3}
      {F : Type u_1} {V : Type u_2} [Field F]
      [AddCommGroup V] [Module F V]
      (B : LinearMap.BilinForm F V)
      {ι : Type u_3} [Fintype ι]
      (v : Module.Basis ι F V) :
      MvPolynomial ι F
    The **quadratic form** (LMFDB `lattice.definition`) of a bilinear form `B` in a basis
    `v₁, …, vₙ`: the homogeneous polynomial `f(x₁, …, xₙ) = ∑ᵢⱼ B(vᵢ, vⱼ) xᵢ xⱼ` of degree `2`
    (`LinearMap.BilinForm.isHomogeneous_gramPolynomial`), whose value at `x` is
    `Q(x₁ v₁ + ⋯ + xₙ vₙ)` (`LinearMap.BilinForm.eval_gramPolynomial`). 
  • structure(2 fields)defined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RealLattice.lean
    complete
    structure Submodule.IsDiscreteLattice.{u_1, u_2} {R : Type u_1} {V : Type u_2}
      [Semiring R] [AddCommMonoid V] [Module R V] [TopologicalSpace V]
      (L : Submodule R V) : Prop
    structure Submodule.IsDiscreteLattice.{u_1, u_2}
      {R : Type u_1} {V : Type u_2}
      [Semiring R] [AddCommMonoid V]
      [Module R V] [TopologicalSpace V]
      (L : Submodule R V) : Prop
    An **`R`-lattice** (LMFDB `lattice.definition`) in a topological module `V`: a finitely
    generated `R`-submodule of `V` that is a discrete subset of `V`. The knowl's `V` is a vector space
    over a topological field `F` with its natural topology, and `R` a subring of `F`. 
    fg : L.FG
    discreteTopology : DiscreteTopology ↥L
  • defdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/ArithmeticBilinear.lean
    complete
    def LinearMap.BilinForm.IsIntegralLattice.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℝ V] (B : LinearMap.BilinForm ℝ V)
      (L : Submodule ℤ V) : Prop
    def LinearMap.BilinForm.IsIntegralLattice.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℝ V]
      (B : LinearMap.BilinForm ℝ V)
      (L : Submodule ℤ V) : Prop
    A `ℤ`-submodule `L` of a real vector space with a bilinear form `B` is an **integral** lattice
    (LMFDB `lattice.definition`) if `B(L, L) ⊆ ℤ`. The knowl's lattices are moreover finitely generated
    and discrete, in a finite-dimensional space with a nonsingular symmetric form. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RealLattice.lean
    complete
    def LinearMap.BilinForm.ratModelIsometry.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℝ V] {B : LinearMap.BilinForm ℝ V}
      {L : Submodule ℤ V} (hB : B.IsSymm) (hL : B.IsIntegralLattice L)
      (hfg : L.FG) :
      (B.integralForm L hL).IsometryEquiv
        (LinearMap.BilinForm.ratModel hB hL hfg).integralForm
    def LinearMap.BilinForm.ratModelIsometry.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℝ V]
      {B : LinearMap.BilinForm ℝ V}
      {L : Submodule ℤ V} (hB : B.IsSymm)
      (hL : B.IsIntegralLattice L)
      (hfg : L.FG) :
      (B.integralForm L hL).IsometryEquiv
        (LinearMap.BilinForm.ratModel hB hL
            hfg).integralForm
    The **isometry between an integral lattice and its rational model**: the identification of `L`
    with the carrier `1 ⊗ L` of `LinearMap.BilinForm.ratModel` carries the integral form of `L` to that
    of its rational model. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RealLattice.lean
    complete
    def TauCeti.IntegralLattice.realisationIsometry.{u_1} {W : Type u_1}
      [AddCommGroup W] [Module ℚ W] (L₀ : TauCeti.IntegralLattice W) :
      (LinearMap.BilinForm.ratModel ⋯ ⋯ ⋯).Isometry L₀
    def TauCeti.IntegralLattice.realisationIsometry.{u_1}
      {W : Type u_1} [AddCommGroup W]
      [Module ℚ W]
      (L₀ : TauCeti.IntegralLattice W) :
      (LinearMap.BilinForm.ratModel ⋯ ⋯
            ⋯).Isometry
        L₀
    **Every Tau Ceti integral lattice is the rational model of an integral lattice of a
    nonsingular real quadratic space** (LMFDB `lattice.definition`): for the chosen basis of `L₀`, with
    Gram matrix `G`, the lattice `ℤ^ι ⊕ 0` (`Matrix.gramRealLattice`) of the real quadratic space
    `Matrix.gramRealForm G`, nonsingular (`Matrix.isQuadraticSpace_gramRealForm`), is a finitely
    generated, discrete (`Matrix.isDiscreteLattice_gramRealLattice`) integral lattice whose rational
    model is isometric to `L₀`. With `LinearMap.BilinForm.ratModelIsometry`, Tau Ceti's integral
    lattices are, up to isometry, exactly the integral lattices of nonsingular real quadratic spaces, of
    any signature, degenerate or not. 
Definition8.4.10
Statement uses 5
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.19
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Density of an integral lattice. (LMFDB)

The density of a positive definite integral lattice L of rank n is the density of the lattice-centered sphere packing in \mathbb{R}^n.

The volume of a sphere in dimension n is

V_n = \frac{\pi^{n/2}}{(n/2)!} = \frac{2^n \pi^{(n-1)/2}((n-1)/2)!}{n!},

where the first form is most useful when n is even and the second form most useful when n is odd. Suppose that L has Gram matrix G and minimum 2\rho. Then the density of L is

\Delta = \frac{V_n \rho^n}{\sqrt{\det G}}

while the center density of L is

\delta = \frac{\Delta}{V_n} = \frac{\rho^n}{\sqrt{\det G}}.

The lattice packing problem of dimension n is to find the positive definite lattices of rank n which maximize the density. In general, these may not be solutions of the sphere packing problem, which asks for the maximum density of a sphere packing in which the centers of the spheres need not form an integral lattice.

Depends on: Definition 8.4.9 Definition 8.4.12 Definition 8.4.23 Definition 8.4.34 Definition 8.4.45

Lean code for Definition8.4.10●9 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Density.lean
    complete
    def TauCeti.IntegralLattice.density.{u_1} {V : Type u_1} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℝ
    def TauCeti.IntegralLattice.density.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℝ
    The **density** `Δ = V_n ρⁿ / √(det G)` (LMFDB `lattice.density`) of a positive definite
    integral lattice `L` of rank `n`, with packing radius `ρ` and Gram matrix `G`, `V_n` being the
    volume of the unit ball of `ℝⁿ`: the volume of a ball of radius `ρ` divided by the covolume of `L`
    (`density_eq_volume_div_covolume`). 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Density.lean
    complete
    def TauCeti.IntegralLattice.centerDensity.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℝ
    def TauCeti.IntegralLattice.centerDensity.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℝ
    The **centre density** `δ = ρⁿ / √(det G)` (LMFDB `lattice.density`) of a positive definite
    integral lattice `L` of rank `n`, with packing radius `ρ` and Gram matrix `G`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Density.lean
    complete
    def TauCeti.IntegralLattice.latticePackingDensity (n : ℕ) : ENNReal
    def TauCeti.IntegralLattice.latticePackingDensity
      (n : ℕ) : ENNReal
    The **lattice packing density** in dimension `n` (LMFDB `lattice.density`, the lattice packing
    problem): the largest density of a positive definite integral lattice of rank `n`, a supremum in
    `ℝ≥0∞`. It is taken over the lattices of `ℚⁿ`, which is no restriction
    (`density_le_latticePackingDensity`). 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Density.lean
    complete
    def EuclideanSpace.spherePackingDensity (n : ℕ) : ENNReal
    def EuclideanSpace.spherePackingDensity
      (n : ℕ) : ENNReal
    The **sphere packing density** of `ℝⁿ` (LMFDB `lattice.density`, the sphere packing problem):
    the largest density of a packing of balls of the same radius `r` with pairwise disjoint interiors,
    that is centred at points at distance at least `2r` from each other, which need not form a lattice;
    a supremum in `ℝ≥0∞`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/PackingDensity.lean
    complete
    theorem TauCeti.IntegralLattice.packingDensity_range_eq_density.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      {L : TauCeti.IntegralLattice V} [Nontrivial ↥L.carrier]
      (hL : L.IsPosDef) {n : ℕ}
      {φ : ↥L.carrier →ₗ[ℤ] EuclideanSpace ℝ (Fin n)}
      (hφ :
        ∀ (x y : ↥L.carrier), inner ℝ (φ x) (φ y) = ↑((L.integralForm x) y))
      (hspan : Submodule.span ℝ (Set.range ⇑φ) = ⊤) :
      EuclideanSpace.packingDensity (Set.range ⇑φ) L.packingRadius =
        ENNReal.ofReal L.density
    theorem TauCeti.IntegralLattice.packingDensity_range_eq_density.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      [Nontrivial ↥L.carrier]
      (hL : L.IsPosDef) {n : ℕ}
      {φ :
        ↥L.carrier →ₗ[ℤ]
          EuclideanSpace ℝ (Fin n)}
      (hφ :
        ∀ (x y : ↥L.carrier),
          inner ℝ (φ x) (φ y) =
            ↑((L.integralForm x) y))
      (hspan :
        Submodule.span ℝ (Set.range ⇑φ) = ⊤) :
      EuclideanSpace.packingDensity
          (Set.range ⇑φ) L.packingRadius =
        ENNReal.ofReal L.density
    **The density of a positive definite lattice `L` is the density of its sphere packing** (LMFDB
    `lattice.density`): the upper limit, here a limit, of the proportion of large balls covered by the
    balls of radius `ρ` centred at the points of a realization of `L` in `ℝⁿ`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/PackingDensity.lean
    complete
    theorem TauCeti.IntegralLattice.tendsto_volume_iUnion_ball_inter_ball_div.{u_1,
        u_2}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      {L : TauCeti.IntegralLattice V} {E : Type u_2} [NormedAddCommGroup E]
      [InnerProductSpace ℝ E] {φ : ↥L.carrier →ₗ[ℤ] E}
      [FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
      [Nontrivial ↥L.carrier] (hL : L.IsPosDef)
      (hφ :
        ∀ (x y : ↥L.carrier), inner ℝ (φ x) (φ y) = ↑((L.integralForm x) y))
      (hspan : Submodule.span ℝ (Set.range ⇑φ) = ⊤) :
      Filter.Tendsto
        (fun R =>
          MeasureTheory.volume
              ((⋃ x ∈ Set.range ⇑φ, Metric.ball x L.packingRadius) ∩
                Metric.ball 0 R) /
            MeasureTheory.volume (Metric.ball 0 R))
        Filter.atTop (nhds (ENNReal.ofReal L.density))
    theorem TauCeti.IntegralLattice.tendsto_volume_iUnion_ball_inter_ball_div.{u_1,
        u_2}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      {E : Type u_2} [NormedAddCommGroup E]
      [InnerProductSpace ℝ E]
      {φ : ↥L.carrier →ₗ[ℤ] E}
      [FiniteDimensional ℝ E]
      [MeasurableSpace E] [BorelSpace E]
      [Nontrivial ↥L.carrier]
      (hL : L.IsPosDef)
      (hφ :
        ∀ (x y : ↥L.carrier),
          inner ℝ (φ x) (φ y) =
            ↑((L.integralForm x) y))
      (hspan :
        Submodule.span ℝ (Set.range ⇑φ) = ⊤) :
      Filter.Tendsto
        (fun R =>
          MeasureTheory.volume
              ((⋃ x ∈ Set.range ⇑φ,
                  Metric.ball x
                    L.packingRadius) ∩
                Metric.ball 0 R) /
            MeasureTheory.volume
              (Metric.ball 0 R))
        Filter.atTop
        (nhds (ENNReal.ofReal L.density))
    **The proportion of the ball `B(0, R)` covered by the sphere packing of a positive definite
    lattice `L` tends to the density of `L`** (LMFDB `lattice.density`), as `R → ∞`: the packing of the
    balls of radius `ρ`, half the length of a shortest nonzero vector, centred at the points of a
    realization of `L` in Euclidean space. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/PackingDensity.lean
    complete
    theorem EuclideanSpace.unitBallVolume_two_mul_add_one (k : ℕ) :
      EuclideanSpace.unitBallVolume (2 * k + 1) =
        2 ^ (2 * k + 1) * Real.pi ^ k * ↑k.factorial /
          ↑(2 * k + 1).factorial
    theorem EuclideanSpace.unitBallVolume_two_mul_add_one
      (k : ℕ) :
      EuclideanSpace.unitBallVolume
          (2 * k + 1) =
        2 ^ (2 * k + 1) * Real.pi ^ k *
            ↑k.factorial /
          ↑(2 * k + 1).factorial
    **`V_{2k+1} = 2^{2k+1} π^k k! / (2k+1)!`** (LMFDB `lattice.density`): the knowl's formula for
    the volume of the unit ball in odd dimension. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/PackingDensity.lean
    complete
    theorem TauCeti.IntegralLattice.latticePackingDensity_le_spherePackingDensity
      {n : ℕ} (hn : n ≠ 0) :
      TauCeti.IntegralLattice.latticePackingDensity n ≤
        EuclideanSpace.spherePackingDensity n
    theorem TauCeti.IntegralLattice.latticePackingDensity_le_spherePackingDensity
      {n : ℕ} (hn : n ≠ 0) :
      TauCeti.IntegralLattice.latticePackingDensity
          n ≤
        EuclideanSpace.spherePackingDensity n
    **The lattice packing density is at most the sphere packing density** in positive dimension
    (LMFDB `lattice.density`): lattice packings are sphere packings. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Density.lean
    complete
    def TauCeti.IntegralLattice.IsDensestLattice.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    def TauCeti.IntegralLattice.IsDensestLattice.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    A positive definite integral lattice `L` **solves the lattice packing problem** (LMFDB
    `lattice.density`) in its dimension `n` if its density is the largest density of a positive
    definite lattice of rank `n`. 
Definition8.4.11
Statement uses 4
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.4.25
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Determinant of an integral lattice. (LMFDB)

For an integral lattice L, the determinant of L is defined as the determinant of the Gram matrix associated to any basis of L.

If L is positive definite of rank n, then the determinant of L is also the square of the volume of the fundamental parallelotope of the Euclidean embedding of L in \R^n.

Tau Ceti Review: TauCeti.IntegralLattice.determinant, TauCeti.IntegralLattice.gramDet.

Depends on: Definition 8.4.9 Definition 8.4.12 Definition 8.4.23 Definition 8.4.45

Lean code for Definition8.4.11●2 definitions
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Gram.lean
    complete
    def TauCeti.IntegralLattice.determinant.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℤ
    def TauCeti.IntegralLattice.determinant.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℤ
    The basis-independent signed determinant of an integral lattice. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Gram.lean
    complete
    def TauCeti.IntegralLattice.gramDet.{u, v} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) {ι : Type v} [Fintype ι]
      [DecidableEq ι] (e : Module.Basis ι ℤ ↥L.carrier) : ℤ
    def TauCeti.IntegralLattice.gramDet.{u, v}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      {ι : Type v} [Fintype ι] [DecidableEq ι]
      (e : Module.Basis ι ℤ ↥L.carrier) : ℤ
    The signed determinant of the Gram matrix in a carrier basis. 
Definition8.4.12
uses 1
Used by 10
Reverse dependency previews
Preview
Definition 8.4.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Rank of an integral lattice. (LMFDB)

The rank of an integral lattice is the rank of its underlying free \Z-module.

Tau Ceti Review: Module.finrank, TauCeti.IntegralLattice.finrank_carrier.

Depends on: Definition 8.4.9

Lean code for Definition8.4.12●2 declarations
  • defdefined in Mathlib/LinearAlgebra/Dimension/Finrank.lean
    complete
    def Module.finrank.{u_1, u_2} (R : Type u_1) (M : Type u_2) [Semiring R]
      [AddCommMonoid M] [Module R M] : ℕ
    def Module.finrank.{u_1, u_2} (R : Type u_1)
      (M : Type u_2) [Semiring R]
      [AddCommMonoid M] [Module R M] : ℕ
    The rank of a module as a natural number.
    
    For a finite-dimensional vector space `V` over a field `k`, `Module.finrank k V` is equal to
    the dimension of `V` over `k`.
    
    For a general module `M` over a ring `R`, `Module.finrank R M` is defined to be the supremum of the
    cardinalities of the `R`-linearly independent subsets of `M`, if this supremum is finite. It is
    defined by convention to be `0` if this supremum is infinite. See `Module.rank` for a
    cardinal-valued version where infinite rank modules have rank an infinite cardinal.
    
    Note that if `R` is not a field then there can exist modules `M` with `¬(Module.Finite R M)` but
    `finrank R M ≠ 0`. For example `ℚ` has `finrank` equal to `1` over `ℤ`, because the nonempty
    `ℤ`-linearly independent subsets of `ℚ` are precisely the nonzero singletons. 
  • theoremdefined in TauCeti/LinearAlgebra/IntegralLattice/Basic.lean
    complete
    theorem TauCeti.IntegralLattice.finrank_carrier.{u} {V : Type u}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      Module.finrank ℤ ↥L.carrier = Module.finrank ℚ V
    theorem TauCeti.IntegralLattice.finrank_carrier.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Module.finrank ℤ ↥L.carrier =
        Module.finrank ℚ V
    The `ℤ`-finrank of the carrier of an integral lattice equals the `ℚ`-finrank of the ambient
    space. 
Definition8.4.13
Statement uses 6
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Discriminant of an integral lattice. (LMFDB)

For an integral lattice L, the discriminant D of L is defined as the determinant of the Gram matrix associated to any basis of L.

There are several different conventions for the term "discriminant" in the literature; we give them different names here for clarity. The definition we take above is used in Cassels' *Rational Quadratic Forms* and Conway-Sloane's *Sphere Packings, Lattices and Groups*.

  • The Witt discriminant of L is the quantity (-1)^{\binom{n}{2}} D. This choice makes the Witt discriminant of the hyperbolic plane U equal to 1 so that the Witt discriminant is stable under adding copies of U. It also simplifies the connection with Clifford algebras: using this definition, the center of the even Clifford algebra associated to the lattice will be the quadratic étale algebra generated by the square root of the Witt discriminant. This convention is used in Milnor–Husemoller's *Symmetric Bilinear Forms* and Lam's *Introduction to Quadratic Forms over Fields*.

  • The absolute discriminant of L is the quantity \lvert D \rvert. This removes the sign ambiguity completely, and is used in Minkowski's *Geometrie der Zahlen* and Schmidt's *Diophantine Approximations*.

  • The geometric discriminant of L is the quantity \sqrt{\lvert D \rvert}. For positive definite lattices of rank n, the geometric discriminant is the covolume of any embedding of the lattice as a subgroup of \mathbb{R}^n, ie the volume of a fundamental parallelotope. Borevich and Shafarevich's *Number Theory* uses this definition.

  • The quadratic discriminant of L is the quantity 2^{-n}D. While we define the quadratic form associated to L to be Q(\mathbf{v}) = \langle \mathbf{v}, \mathbf{v} \rangle, some authors scale by \frac{1}{2} so that integer valued quadratic forms can be obtained from integer matrices. Doing so leads to the extra factor of 2^{-n}. This convention is used in Dickson's *History of the Theory of Numbers, Vol. II* and Serre's *Course in Arithmetic*.

  • The half discriminant of L is 2^{-n}D when n is even and 2^{-n-1}D when n is odd. This gives better behavior upon reduction to characteristic 2. See Voight's *Quaternion Algebras* and Milnor–Husemoller's *Symmetric Bilinear Forms*.

  • The 2-adic unit discriminant of L is the the quantity 2^{-v_2(D)} D \pmod{8}. This is used in the 2-adic classification of quadratic spaces, and gives the 2-adic square class of the odd part of the discriminant. It is defined in O'Meara's *Introduction to Quadratic Forms* and Earnest–Hsia's *2-adic Quadratic Forms*.

Depends on: Definition 8.4.9 Definition 8.4.12 Definition 8.4.23 Definition 8.4.27 Definition 8.4.46 Definition 8.4.48

Definition8.4.14
Statement uses 6
Statement dependency previews
Preview
Definition 8.3.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.20
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Discriminant group. (LMFDB)

For an integral lattice L with associated bilinear form B, the discriminant group is the finite abelian group L^\vee / L, where L^\vee is the dual lattice of L.

The discriminant group is trivial if and only if L is self-dual (i.e. unimodular).

The discriminant group L^\vee/L is equipped with a torsion bilinear form:

B_L\colon L^\vee/L\times L^\vee/L\to \mathbb{Q}/\mathbb{Z},\, (u+L, v+L)\mapsto B(u,v)+\mathbb{Z}.

If the integral lattice L is even, the group L^\vee/L is moreover equipped with a torsion quadratic form:

Q_L\colon L^\vee/L\to\mathbb{Q}/2\mathbb{Z},\, u+L\mapsto B(u,u)+2\mathbb{Z}.

For a set of generators \{u_1+L,\ldots, u_r+L\} of L^\vee/L, one can represent the form Q_L (resp. B_L if L is odd) by a Gram matrix M: The diagonal entries of M are given by rational representatives of Q_L(u_i+L)\in\mathbb{Q}/2\mathbb{Z} (resp. of B_L(u_i+L, u_i+L)\in\mathbb{Q}/\mathbb{Z}) for all 1\leq i\leq r, and the off-diagonal entries are given by rational representatives of B_L(u_i+L, u_j+L)\in\mathbb{Q}/\mathbb{Z} for all i\neq j.

The isometry class of the pair (L^\vee/L, Q_L) as a finite abelian group equipped with a torsion quadratic form (resp. of the pair (L^\vee/L, B_L) as a finite abelian group equipped with a torsion bilinear form, if L is odd) is uniquely determined by the genus of L. Its isometry class is thus an intrinsic invariant of the genus, and together with the signature they uniquely determine the genus of L.

Depends on: Definition 8.3.5 Definition 8.4.9 Definition 8.4.15 Definition 8.4.21 Definition 8.4.41 Definition 8.4.51

Definition8.4.15
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Dual lattice. (LMFDB)

For an integral lattice, L, its dual is the set L^\#=\{\vec{v}\in \Q L:B(\vec{v},L)\subseteq \mathbb{Z}\}. There is a unique rescaling of the bilinear map B for which L^\# is a primitive integral lattice; we will refer to the resulting integral lattice as the rescaled dual of L.

Tau Ceti Review: TauCeti.IntegralLattice.dualCarrier.

Depends on: Definition 8.4.9 Definition 8.4.47

Lean code for Definition8.4.15●5 declarations
  • abbrevdefined in TauCeti/LinearAlgebra/IntegralLattice/Dual/Basic.lean
    complete
    abbrev TauCeti.IntegralLattice.dualCarrier.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : Submodule ℤ V
    abbrev TauCeti.IntegralLattice.dualCarrier.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Submodule ℤ V
    The dual carrier of an integral lattice:
    `x` belongs to it exactly when `L.form x y` is integral for every `y ∈ L`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Dual.lean
    complete
    def TauCeti.IntegralLattice.rescaledDual.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] : TauCeti.IntegralLattice V
    def TauCeti.IntegralLattice.rescaledDual.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] :
      TauCeti.IntegralLattice V
    The **rescaled dual** (LMFDB `lattice.dual`) of a nondegenerate integral lattice `L` with
    bilinear form `B`: the dual `L^#` with the form `n • B`, where `n` is the dual scale, the least
    positive integer for which `n • B` is integral on `L^#`. When `L` is nonzero this is the unique
    positive rescaling of `B` for which `L^#` is a primitive integral lattice
    (`scaleIdeal_rescaledDual`, `eq_rescaledDual`). 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Dual.lean
    complete
    def TauCeti.IntegralLattice.dualScale.{u_1} {V : Type u_1} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℕ
    def TauCeti.IntegralLattice.dualScale.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℕ
    The **dual scale** of an integral lattice `L` with bilinear form `B`: the nonnegative generator
    `n` of the ideal of the integers `N` for which `N • B` is integral on the dual `L^#`. It is positive
    when `L` is nondegenerate (`dualScale_pos`), and then the least positive such integer. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Dual.lean
    complete
    theorem TauCeti.IntegralLattice.scaleIdeal_rescaledDual.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] [Nontrivial ↥L.carrier] :
      L.rescaledDual.scaleIdeal = ⊤
    theorem TauCeti.IntegralLattice.scaleIdeal_rescaledDual.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate]
      [Nontrivial ↥L.carrier] :
      L.rescaledDual.scaleIdeal = ⊤
    **The rescaled dual of a nonzero nondegenerate lattice is primitive**: its scale ideal is
    `ℤ`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Dual.lean
    complete
    theorem TauCeti.IntegralLattice.eq_rescaledDual.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] [Nontrivial ↥L.carrier]
      {M : TauCeti.IntegralLattice V} (hcarrier : M.carrier = L.dualCarrier)
      {c : ℚ} (hc : 0 < c) (hform : M.form = c • L.form)
      (hM : M.scaleIdeal = ⊤) : M = L.rescaledDual
    theorem TauCeti.IntegralLattice.eq_rescaledDual.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate]
      [Nontrivial ↥L.carrier]
      {M : TauCeti.IntegralLattice V}
      (hcarrier : M.carrier = L.dualCarrier)
      {c : ℚ} (hc : 0 < c)
      (hform : M.form = c • L.form)
      (hM : M.scaleIdeal = ⊤) :
      M = L.rescaledDual
    **The rescaled dual is the only primitive integral lattice obtained from the dual by a
    positive rescaling of the form.** 
Definition8.4.16
Statement uses 4
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Euclidean basis of a lattice. (LMFDB)

Let L be a positive definite integral lattice of rank n with Gram matrix G = (g_{ij}). A Euclidean basis for L is a collection of vectors v_1, \dots, v_n \in \R^n such that

\langle v_i, v_j \rangle = g_{ij},

for all i, j. Equivalently, if B denotes the matrix whose rows are v_i, then G = BB^T. This gives an explicit realization of the lattice L \hookrightarrow \R^n as a discrete lattice in \R^n, with respect to the usual dot product norm.

Tau Ceti Review: Matrix.gram, TauCeti.IntegralLattice.gramMatrix, TauCeti.IntegralLattice.IsPosDef.exists_realization.

Depends on: Definition 8.4.9 Definition 8.4.12 Definition 8.4.23 Definition 8.4.45

Lean code for Definition8.4.16●3 declarations
  • defdefined in Mathlib/Analysis/InnerProductSpace/GramMatrix.lean
    complete
    def Matrix.gram.{u_1, u_2, u_5} {E : Type u_1} {n : Type u_2} (𝕜 : Type u_5)
      [Inner 𝕜 E] (v : n → E) : Matrix n n 𝕜
    def Matrix.gram.{u_1, u_2, u_5} {E : Type u_1}
      {n : Type u_2} (𝕜 : Type u_5)
      [Inner 𝕜 E] (v : n → E) : Matrix n n 𝕜
    The entries of a Gram matrix are inner products of vectors in an inner product space. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Gram.lean
    complete
    def TauCeti.IntegralLattice.gramMatrix.{u, v} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) {ι : Type v}
      (e : Module.Basis ι ℤ ↥L.carrier) : Matrix ι ι ℤ
    def TauCeti.IntegralLattice.gramMatrix.{u, v}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      {ι : Type v}
      (e : Module.Basis ι ℤ ↥L.carrier) :
      Matrix ι ι ℤ
    The integral Gram matrix of a carrier basis. 
  • theoremdefined in TauCeti/LinearAlgebra/IntegralLattice/PosDef/Covolume.lean
    complete
    theorem TauCeti.IntegralLattice.IsPosDef.exists_realization.{u} {V : Type u}
      [AddCommGroup V] [Module ℚ V] {L : TauCeti.IntegralLattice V}
      (hL : L.IsPosDef) :
      ∃ φ,
        (∀ (x y : ↥L.carrier),
            inner ℝ (φ x) (φ y) = ↑((L.integralForm x) y)) ∧
          Submodule.span ℝ (Set.range ⇑φ) = ⊤
    theorem TauCeti.IntegralLattice.IsPosDef.exists_realization.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      (hL : L.IsPosDef) :
      ∃ φ,
        (∀ (x y : ↥L.carrier),
            inner ℝ (φ x) (φ y) =
              ↑((L.integralForm x) y)) ∧
          Submodule.span ℝ (Set.range ⇑φ) = ⊤
    **A positive definite lattice has a realization.** A positive definite integral lattice of
    rank `n` has a `ℤ`-linear map to `ℝⁿ` carrying its integral form to the inner product, whose
    image spans `ℝⁿ`. 
Definition8.4.17
Statement uses 4
Statement dependency previews
Preview
Definition 8.4.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.19
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Eutactic lattice. (LMFDB)

A lattice L in \mathbb{R}^n is called eutactic if there exist positive real numbers c_1,\dots,c_m such that for every v \in \mathbb{R}^n, the inner product

(v,v) = \sum_{j=1}^n c_j (v,x_j)^2,

where the sum is over all the minimal vectors of L. A eutactic lattice is well-rounded, and there are only finitely many similarity classes of eutactic lattices in each dimension n \geq 2. A lattice is called strongly eutactic if the eutaxy coefficients c_1 = \dots = c_m. Strongly eutactic lattices are arithmetic.

Depends on: Definition 8.4.4 Definition 8.4.33 Definition 8.4.52 Definition 8.4.59

Definition8.4.18
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Even sublattice. (LMFDB)

The even sublattice of an integral lattice L is the sublattice of L spanned by vectors of even length.

An integral lattice L is even exactly when it is equal to its even sublattice.

In general, the even sublattice L_0 of an integral lattice L has index at most equal to 2.

Tau Ceti Review: TauCeti.IntegralLattice.evenSublattice, TauCeti.IntegralLattice.evenSubmodule.

Depends on: Definition 8.4.9 Definition 8.4.41

Lean code for Definition8.4.18●6 declarations
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Characteristic/EvenSublattice.lean
    complete
    def TauCeti.IntegralLattice.evenSublattice.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      TauCeti.IntegralLattice V
    def TauCeti.IntegralLattice.evenSublattice.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      TauCeti.IntegralLattice V
    The canonical even sublattice in the original rational ambient space. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Characteristic/EvenSublattice.lean
    complete
    def TauCeti.IntegralLattice.evenSubmodule.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : Submodule ℤ ↥L.carrier
    def TauCeti.IntegralLattice.evenSubmodule.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Submodule ℤ ↥L.carrier
    The submodule of lattice vectors with even integral norm, defined as the norm-parity kernel. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Sublattice.lean
    complete
    theorem TauCeti.IntegralLattice.span_setOf_even_integralNorm.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Submodule.span ℤ {x | Even (L.integralNorm x)} = L.evenSubmodule
    theorem TauCeti.IntegralLattice.span_setOf_even_integralNorm.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Submodule.span ℤ
          {x | Even (L.integralNorm x)} =
        L.evenSubmodule
    **The vectors of even norm generate Tau Ceti's even submodule**, which consists of them. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/EvenSublattice.lean
    complete
    theorem TauCeti.IntegralLattice.isEven_iff_evenSublattice_eq.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : L.IsEven ↔ L.evenSublattice = L
    theorem TauCeti.IntegralLattice.isEven_iff_evenSublattice_eq.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      L.IsEven ↔ L.evenSublattice = L
    **An integral lattice is even exactly when it is equal to its even sublattice** (LMFDB
    `lattice.even_sublattice`), Tau Ceti's `TauCeti.IntegralLattice.evenSublattice`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/EvenSublattice.lean
    complete
    theorem TauCeti.IntegralLattice.isEven_iff_evenSubmodule_eq_top.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : L.IsEven ↔ L.evenSubmodule = ⊤
    theorem TauCeti.IntegralLattice.isEven_iff_evenSubmodule_eq_top.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      L.IsEven ↔ L.evenSubmodule = ⊤
    **An integral lattice is even exactly when all its vectors have even norm**, that is, when Tau
    Ceti's `TauCeti.IntegralLattice.evenSubmodule` is the whole carrier. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/EvenSublattice.lean
    complete
    theorem TauCeti.IntegralLattice.natCard_quotient_evenSubmodule_le_two.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Nat.card (↥L.carrier ⧸ L.evenSubmodule) ≤ 2
    theorem TauCeti.IntegralLattice.natCard_quotient_evenSubmodule_le_two.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Nat.card
          (↥L.carrier ⧸ L.evenSubmodule) ≤
        2
    **The even sublattice of an integral lattice `L` has index at most `2` in `L`** (LMFDB
    `lattice.even_sublattice`): index `1` if `L` is even, `2` otherwise. This is Tau Ceti main's
    `relIndex_evenSublattice_le_two`, not at the pin. 
Definition8.4.19
Statement uses 3
Statement dependency previews
Preview
Definition 8.4.10
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Extreme lattice. (LMFDB)

A lattice L in \mathbb{R}^n is called extreme if it is a local maximum of the packing density function in \mathbb{R}^n. A theorem of Voronoi asserts that a lattice is extreme if and only if it is perfect and eutactic.

Depends on: Definition 8.4.10 Definition 8.4.17 Definition 8.4.42

Definition8.4.20
Statement uses 3
Statement dependency previews
Preview
Definition 8.4.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Festi-Veniani index of a lattice. (LMFDB)

For an integral lattice L, the Festi--Veniani index of L is the index of the automorphism group of L in the automorphism group of the discriminant group L^\vee/L.

Tau Ceti Review: TauCeti.IntegralLattice.discriminantQuadraticMap, TauCeti.IntegralLattice.Isometry.discriminantGroupEquiv.

Depends on: Definition 8.4.5 Definition 8.4.9 Definition 8.4.14

Lean code for Definition8.4.20●11 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/FestiVenianiForm.lean
    complete
    def TauCeti.IntegralLattice.discriminantFormIndex.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℕ
    def TauCeti.IntegralLattice.discriminantFormIndex.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℕ
    The **Festi–Veniani index** (LMFDB `lattice.festi_veniani_index`) of an integral lattice `L` in
    the sense of Festi and Veniani: the index `[O(q_L) : O^♯(L)]` of the image of the automorphism group
    `O(L)` of `L` in the isometry group `O(q_L)` of its discriminant form, or `0` if it is infinite. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/FestiVenianiForm.lean
    complete
    def TauCeti.IntegralLattice.discriminantFormIsometries.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      Subgroup (L.DiscriminantGroup ≃ₗ[ℤ] L.DiscriminantGroup)
    def TauCeti.IntegralLattice.discriminantFormIsometries.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Subgroup
        (L.DiscriminantGroup ≃ₗ[ℤ]
          L.DiscriminantGroup)
    The **isometry group** `O(q_L)` (LMFDB `lattice.festi_veniani_index`) of the discriminant form
    of an integral lattice `L`: the automorphisms of the discriminant group `A_L = L^∨ / L` that
    preserve the discriminant bilinear form `b_L` and, if `L` is even, the discriminant quadratic form
    `q_L`. For an even lattice this is Festi and Veniani's `O(L^♯)`
    (`TauCeti.IntegralLattice.mem_discriminantFormIsometries_iff_of_isEven`); for an odd one, the
    isometry group of `b_L`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/FestiVenianiForm.lean
    complete
    def TauCeti.IntegralLattice.discriminantFormAction.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      L.Isometry L →* ↥L.discriminantFormIsometries
    def TauCeti.IntegralLattice.discriminantFormAction.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      L.Isometry L →*
        ↥L.discriminantFormIsometries
    The **homomorphism** `O(L) → O(q_L)` (LMFDB `lattice.festi_veniani_index`) from the automorphism
    group of an integral lattice `L` to the isometry group of its discriminant form: an isometry `e` of
    `L` acts on `A_L` by `u + L ↦ e(u) + L`. Its image is Festi and Veniani's `O^♯(L)`. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Discriminant/Quadratic.lean
    complete
    def TauCeti.IntegralLattice.discriminantQuadraticMap.{u} {V : Type u}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V)
      (hL : L.IsEven) : QuadraticMap ℤ L.DiscriminantGroup (AddCircle 1)
    def TauCeti.IntegralLattice.discriminantQuadraticMap.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      (hL : L.IsEven) :
      QuadraticMap ℤ L.DiscriminantGroup
        (AddCircle 1)
    The discriminant quadratic map of an even integral lattice, in the half-norm convention.
    
    The definition does not require nondegeneracy; that hypothesis is needed only to make the
    discriminant group finite and hence package it as a `FiniteQuadraticModule`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/FestiVenianiForm.lean
    complete
    theorem TauCeti.IntegralLattice.mem_discriminantFormIsometries_iff_of_isEven.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) (hL : L.IsEven)
      (f : L.DiscriminantGroup ≃ₗ[ℤ] L.DiscriminantGroup) :
      f ∈ L.discriminantFormIsometries ↔
        ∀ (x : L.DiscriminantGroup),
          (L.discriminantQuadraticMap hL) (f x) =
            (L.discriminantQuadraticMap hL) x
    theorem TauCeti.IntegralLattice.mem_discriminantFormIsometries_iff_of_isEven.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      (hL : L.IsEven)
      (f :
        L.DiscriminantGroup ≃ₗ[ℤ]
          L.DiscriminantGroup) :
      f ∈ L.discriminantFormIsometries ↔
        ∀ (x : L.DiscriminantGroup),
          (L.discriminantQuadraticMap hL)
              (f x) =
            (L.discriminantQuadraticMap hL) x
    **For an even lattice, `O(q_L)` is the group of automorphisms of `A_L` that preserve the
    discriminant quadratic form `q_L`**: they preserve its polar form `b_L`. This is Festi and Veniani's
    `O(L^♯)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/FestiVenianiForm.lean
    complete
    theorem TauCeti.IntegralLattice.discriminantFormIndex_ne_zero.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) [L.IsNondegenerate] :
      L.discriminantFormIndex ≠ 0
    theorem TauCeti.IntegralLattice.discriminantFormIndex_ne_zero.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] :
      L.discriminantFormIndex ≠ 0
    **The Festi–Veniani index of a nondegenerate lattice is finite.** 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/FestiVenianiForm.lean
    complete
    theorem TauCeti.IntegralLattice.festiVenianiIndex_eq_discriminantFormIndex_mul_index.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      L.festiVenianiIndex =
        L.discriminantFormIndex * L.discriminantFormIsometries.index
    theorem TauCeti.IntegralLattice.festiVenianiIndex_eq_discriminantFormIndex_mul_index.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      L.festiVenianiIndex =
        L.discriminantFormIndex *
          L.discriminantFormIsometries.index
    **The literal Festi–Veniani index `[Aut(A_L) : im O(L)]` is the Festi–Veniani index
    `[O(q_L) : im O(L)]` times `[Aut(A_L) : O(q_L)]`.** 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/FestiVeniani.lean
    complete
    def TauCeti.IntegralLattice.festiVenianiIndex.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℕ
    def TauCeti.IntegralLattice.festiVenianiIndex.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℕ
    The **Festi–Veniani index** (LMFDB `lattice.festi_veniani_index`) of an integral lattice `L`:
    the index of the image of its automorphism group `O(L)` in the automorphism group of its
    discriminant group `L^∨ / L`, or `0` if the index is infinite. The LMFDB takes all group
    automorphisms of `L^∨ / L`; Festi and Veniani take the isometries of the discriminant form instead. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/FestiVeniani.lean
    complete
    def TauCeti.IntegralLattice.discriminantGroupAction.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      L.Isometry L →* L.DiscriminantGroup ≃ₗ[ℤ] L.DiscriminantGroup
    def TauCeti.IntegralLattice.discriminantGroupAction.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      L.Isometry L →*
        L.DiscriminantGroup ≃ₗ[ℤ]
          L.DiscriminantGroup
    The **action** of the automorphism group `O(L)` of an integral lattice `L` (LMFDB
    `lattice.automorphism_group`) on its discriminant group `L^∨ / L` (LMFDB
    `lattice.discriminant_group`): an isometry `e` of `L` acts by
    `TauCeti.IntegralLattice.Isometry.discriminantGroupEquiv`, `u + L ↦ e(u) + L`. The automorphisms
    of the abelian group `L^∨ / L` are its `ℤ`-linear automorphisms. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/FestiVeniani.lean
    complete
    theorem TauCeti.IntegralLattice.festiVenianiIndex_ne_zero.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] : L.festiVenianiIndex ≠ 0
    theorem TauCeti.IntegralLattice.festiVenianiIndex_ne_zero.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] :
      L.festiVenianiIndex ≠ 0
    **The Festi–Veniani index of a nondegenerate lattice is finite.** 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Discriminant/Group.lean
    complete
    def TauCeti.IntegralLattice.Isometry.discriminantGroupEquiv.{u, v}
      {V : Type u} [AddCommGroup V] [Module ℚ V] {W : Type v}
      [AddCommGroup W] [Module ℚ W] {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W} (e : L.Isometry M) :
      L.DiscriminantGroup ≃ₗ[ℤ] M.DiscriminantGroup
    def TauCeti.IntegralLattice.Isometry.discriminantGroupEquiv.{u,
        v}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V] {W : Type v}
      [AddCommGroup W] [Module ℚ W]
      {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W}
      (e : L.Isometry M) :
      L.DiscriminantGroup ≃ₗ[ℤ]
        M.DiscriminantGroup
    An integral-lattice isometry induces a linear equivalence of discriminant groups. 
Definition8.4.21
uses 1
Used by 5
Reverse dependency previews
Preview
Definition 8.4.6
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Genus of an integral lattice. (LMFDB)

For an integral lattice, L with underlying quadratic space V, the genus of L is the set of all lattices M on V, such that M_p\cong L_p for all primes p.

Tau Ceti Review: TauCeti.IntegralLattice.SameGenus, TauCeti.IntegralLattice.localIntegralForm.

Depends on: Definition 8.4.9

Lean code for Definition8.4.21●6 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RealLattice.lean
    complete
    def LinearMap.BilinForm.genus.{u_1} {V : Type u_1} [AddCommGroup V]
      [Module ℝ V] (B : LinearMap.BilinForm ℝ V) (L : Submodule ℤ V)
      [TopologicalSpace V] (hL : B.IsIntegralLattice L) :
      Set (Submodule ℤ V)
    def LinearMap.BilinForm.genus.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℝ V]
      (B : LinearMap.BilinForm ℝ V)
      (L : Submodule ℤ V) [TopologicalSpace V]
      (hL : B.IsIntegralLattice L) :
      Set (Submodule ℤ V)
    The **genus** (LMFDB `lattice.genus`) of an integral lattice `L` in a real quadratic space
    `(V, B)`: the set of the lattices `M` on `V`, finitely generated, discrete and spanning `V`, whose
    localisations `M_p = ℤ_p ⊗ M` are isometric to `L_p` for every prime `p`, each carrying the
    `ℤ_p`-bilinear extension of its form. `M_p` is a quadratic `ℤ_p`-module, as `L_p` is, only when
    the form of `M` takes `ℤ_p`-integral values, so `M` is integral
    (`LinearMap.BilinForm.IsIntegralLattice`), and `M_p` carries the base change of its integral
    form. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RealLattice.lean
    complete
    def LinearMap.BilinForm.integralForm.{u_1} {V : Type u_1} [AddCommGroup V]
      [Module ℝ V] (B : LinearMap.BilinForm ℝ V) (L : Submodule ℤ V)
      (hL : B.IsIntegralLattice L) : LinearMap.BilinForm ℤ ↥L
    def LinearMap.BilinForm.integralForm.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℝ V]
      (B : LinearMap.BilinForm ℝ V)
      (L : Submodule ℤ V)
      (hL : B.IsIntegralLattice L) :
      LinearMap.BilinForm ℤ ↥L
    The **integral form** of an integral lattice `L` in a real quadratic space `(V, B)`: the
    restriction of `B` to `L`, as a `ℤ`-valued bilinear form, `B(L, L) ⊆ ℤ`
    (`LinearMap.BilinForm.IsIntegralLattice`). 
  • structure(2 fields)defined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RealLattice.lean
    complete
    structure Submodule.IsDiscreteLattice.{u_1, u_2} {R : Type u_1} {V : Type u_2}
      [Semiring R] [AddCommMonoid V] [Module R V] [TopologicalSpace V]
      (L : Submodule R V) : Prop
    structure Submodule.IsDiscreteLattice.{u_1, u_2}
      {R : Type u_1} {V : Type u_2}
      [Semiring R] [AddCommMonoid V]
      [Module R V] [TopologicalSpace V]
      (L : Submodule R V) : Prop
    An **`R`-lattice** (LMFDB `lattice.definition`) in a topological module `V`: a finitely
    generated `R`-submodule of `V` that is a discrete subset of `V`. The knowl's `V` is a vector space
    over a topological field `F` with its natural topology, and `R` a subring of `F`. 
    fg : L.FG
    discreteTopology : DiscreteTopology ↥L
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RealLattice.lean
    complete
    theorem LinearMap.BilinForm.equivalent_localIntegralForm_ratModel_of_mem_genus.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℝ V]
      {B : LinearMap.BilinForm ℝ V} {L : Submodule ℤ V} [TopologicalSpace V]
      (hB : B.IsSymm) (hL : B.IsIntegralLattice L) (hfg : L.FG)
      {M : Submodule ℤ V} (h : M ∈ B.genus L hL) (p : ℕ)
      [Fact (Nat.Prime p)] :
      ((LinearMap.BilinForm.ratModel hB ⋯ ⋯).localIntegralForm p).Equivalent
        ((LinearMap.BilinForm.ratModel hB hL hfg).localIntegralForm p)
    theorem LinearMap.BilinForm.equivalent_localIntegralForm_ratModel_of_mem_genus.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℝ V]
      {B : LinearMap.BilinForm ℝ V}
      {L : Submodule ℤ V} [TopologicalSpace V]
      (hB : B.IsSymm)
      (hL : B.IsIntegralLattice L)
      (hfg : L.FG) {M : Submodule ℤ V}
      (h : M ∈ B.genus L hL) (p : ℕ)
      [Fact (Nat.Prime p)] :
      ((LinearMap.BilinForm.ratModel hB ⋯
                ⋯).localIntegralForm
            p).Equivalent
        ((LinearMap.BilinForm.ratModel hB hL
              hfg).localIntegralForm
          p)
    **The rational models of lattices of the same genus are locally isometric** (LMFDB
    `lattice.genus`): if `M` lies in the genus of `L`, the integral localisations of their rational
    models are isometric at every prime, the local half of Tau Ceti's
    `TauCeti.IntegralLattice.SameGenus`. 
  • defdefined in TauCeti/NumberTheory/IntegralLattice/Genus.lean
    complete
    def TauCeti.IntegralLattice.SameGenus.{u_1, u_2} {V : Type u_1}
      {W : Type u_2} [AddCommGroup V] [Module ℚ V] [AddCommGroup W]
      [Module ℚ W] (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) : Prop
    def TauCeti.IntegralLattice.SameGenus.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) : Prop
    Two integral lattices have the same genus if their signatures agree and their integral
    local forms are isometric at every prime. No nondegeneracy assumption is imposed. 
  • defdefined in TauCeti/NumberTheory/IntegralLattice/Localization/Basic.lean
    complete
    def TauCeti.IntegralLattice.localIntegralForm.{u} {V : Type u}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) (p : ℕ)
      [Fact (Nat.Prime p)] : LinearMap.BilinForm ℤ_[p] (L.LocalCarrier p)
    def TauCeti.IntegralLattice.localIntegralForm.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) (p : ℕ)
      [Fact (Nat.Prime p)] :
      LinearMap.BilinForm ℤ_[p]
        (L.LocalCarrier p)
    The integral form of an integral lattice, base-changed from `ℤ` to `ℤ_p`.  This is built from
    the integral form on the carrier, not from the rational form on the ambient space. 
Definition8.4.22
uses 0used by 0✓L∃∀N

Label of a genus of lattices. (LMFDB)

Label is in the format r.s.d.j_1.j_2....j_k.x, where

  • r is the rank of the lattices

  • s is the signature (n_+ - n_-)

  • d is the absolute value of the determinant

  • If p_1, \ldots , p_k are the primes whose squares divide d (p_i^2 \mid d), then j_1, \ldots ,j_k are corresponding rank decompositions of their Jordan forms, omitting the first, encoded in base 62 (digits 0-9, then lowercase a-z, then uppercase A-Z). For example, if the pairs of (valuation, rank) appearing in the decomposition are (3, 1), (4,10), (6,37), it will be encoded as 01a0B.

  • The last component of the label, x, is a hexadecimal string whose bits represent the local data. Let n_2 be the number of non-zero blocks in the Jordan decomposition at 2. The least n_2 bits specify the types (I or II) of the non-zero blocks at 2. From these, once can deduce the compartments and trains in the local symbol at 2, let c, t be their numbers. The next 3c bits represent the oddities of the compartments, with every 3 bits giving an oddity mod 8. The next t bits represent the signs of the trains. Finally, for every other prime p dividing d, in increasing order, if there are n_p non-zero blocks in the Jordan decomposition at p, we add n_p bits representing the signs of these blocks.

Lean code for Definition8.4.22●6 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusLabelLMFDB.lean
    complete
    def TauCeti.IntegralLattice.lmfdbGenusLabel.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] : String
    def TauCeti.IntegralLattice.lmfdbGenusLabel.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] : String
    The **label of the genus** (LMFDB `lattice.genus_label`) of a nondegenerate integral lattice
    `L`, `r.s.d.j₁.⋯.jₖ.x`, as the LMFDB computes it: the encoding
    `TauCeti.IntegralLattice.GenusLabelData.lmfdbLabel` of its rank, signature, absolute determinant,
    Jordan ranks, signs at the odd primes, dyadic types, and the oddities of the compartments and the
    signs of the trains of its canonical `2`-adic symbol. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusLabelLMFDB.lean
    complete
    def TauCeti.IntegralLattice.GenusLabelData.lmfdbLabel
      (D : TauCeti.IntegralLattice.GenusLabelData) : String
    def TauCeti.IntegralLattice.GenusLabelData.lmfdbLabel
      (D :
        TauCeti.IntegralLattice.GenusLabelData) :
      String
    The **label of a genus** (LMFDB `lattice.genus_label`), `r.s.d.j₁.⋯.jₖ.x`, as the LMFDB
    computes it: the rank, the signature `n₊ - n₋`, the absolute determinant, the rank codes
    `lmfdbRankCode` at the primes `p` with `p ^ 2 ∣ d`, and the lowercase hexadecimal expansion of the
    number with binary digits `labelBits`, from the least significant. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusLabelLMFDB.lean
    complete
    def TauCeti.IntegralLattice.GenusLabelData.lmfdbRankCode
      (D : TauCeti.IntegralLattice.GenusLabelData) (p : ℕ) : String
    def TauCeti.IntegralLattice.GenusLabelData.lmfdbRankCode
      (D :
        TauCeti.IntegralLattice.GenusLabelData)
      (p : ℕ) : String
    The **rank code** at `p` in the label of a genus (LMFDB `lattice.genus_label`): the base `62`
    digits of the ranks `n_v` of the Jordan constituents of scale `p ^ v`, `1 ≤ v ≤ m`, where `m` is the
    largest scale exponent of a nonzero constituent. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusLabel.lean
    complete
    def TauCeti.IntegralLattice.GenusLabelData.labelBits
      (D : TauCeti.IntegralLattice.GenusLabelData) : List Bool
    def TauCeti.IntegralLattice.GenusLabelData.labelBits
      (D :
        TauCeti.IntegralLattice.GenusLabelData) :
      List Bool
    The bits of the last component of the label (LMFDB `lattice.genus_label`), from the least
    significant: the types of the nonzero dyadic constituents (`1` for type `I`), the oddities of the
    compartments (three bits each), the signs of the trains, and the signs of the nonzero constituents
    at the odd primes dividing `d`, increasing (`1` for the sign `-1`). 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusLabelLMFDB.lean
    complete
    theorem TauCeti.IntegralLattice.SameGenus.lmfdbGenusLabel_eq.{u_1, u_2}
      {V : Type u_1} {W : Type u_2} [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W] {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W} [L.IsNondegenerate]
      [M.IsNondegenerate] (h : L.SameGenus M) :
      L.lmfdbGenusLabel = M.lmfdbGenusLabel
    theorem TauCeti.IntegralLattice.SameGenus.lmfdbGenusLabel_eq.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W}
      [L.IsNondegenerate] [M.IsNondegenerate]
      (h : L.SameGenus M) :
      L.lmfdbGenusLabel = M.lmfdbGenusLabel
    **The label of the genus is a genus invariant** (LMFDB `lattice.genus_label`): lattices in the
    same genus have the same label. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/GenusLabelLMFDB.lean
    complete
    theorem TauCeti.IntegralLattice.lmfdbGenusLabel_eq_canonicalGenusLabel_iff.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      {L : TauCeti.IntegralLattice V} [L.IsNondegenerate] :
      L.lmfdbGenusLabel = L.canonicalGenusLabel ↔
        Squarefree L.determinant.natAbs
    theorem TauCeti.IntegralLattice.lmfdbGenusLabel_eq_canonicalGenusLabel_iff.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      [L.IsNondegenerate] :
      L.lmfdbGenusLabel =
          L.canonicalGenusLabel ↔
        Squarefree L.determinant.natAbs
    **The label `canonicalGenusLabel` is the LMFDB label exactly for a squarefree determinant**:
    when the square of a prime divides the determinant, its rank codes lack the rank `n₁`. 
Definition8.4.23
uses 0
Used by 18
Reverse dependency previews
Preview
Definition 8.4.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Gram matrix. (LMFDB)

Fixing a basis \{v_1,...,v_n\} for a space V, the Gram matrix is the n\times n symmetric matrix given by [B(v_i,v_j)]. Similarly, if we fix a basis \{w_1,...,w_n\} for a lattice L, then it is also a basis for V, and the Gram matrix for L is given by [B(w_i,w_j)].

For example, given the integral lattice \mathbb{Z}^3 on the Euclidean space \mathbb{R}^3, in the standard basis \{e_1,e_2,e_3\} the lattice (and hence the space) has a Gram matrix

\begin{bmatrix} 1 & 0 & 0\\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}.

Although Gram matrices are only unique up to a choice of basis, each lattice in the database is identified by a single Gram matrix. By entering a Gram matrix, G, into the search field, the database will return an isometric lattice whose Gram matrix, A, is equivalent to G via conjugation by some transition matrix, T (that is, A=T^tGT), provided the lattice is in the database.

{% if BETA %}

Lattices in the database are presented in Minkowski reduced form. That is, for an n-dimensional lattice, L, the gram matrix, A, is given in a basis \{v_1,...,v_n\} such that for each j\leq n

{v_j}^{*t}\cdot A\cdot {v_j}^*\geq v_j^t \cdot A\cdot v_j

where v_j^* runs through all vectors with which v_1,...v_{j-1} can be extended to a basis. Minkowski reduction is not unique, but when n\leq 4, the diagonal entries of a Minkowski reduced Gram matrix are precisely the successive minima of the lattice L [MR1096467].

{% endif %}

Definition8.4.24
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Group order of an integral lattice. (LMFDB)

The group order of an integral lattice is the size of its automorphism group.

Tau Ceti Review: TauCeti.IntegralLattice.Isometry.

Depends on: Definition 8.4.5 Definition 8.4.9

Lean code for Definition8.4.24●1 definition
  • structure(extends 7, 8 fields)defined in TauCeti/LinearAlgebra/IntegralLattice/Isometry/Basic.lean
    complete
    structure TauCeti.IntegralLattice.Isometry.{u, v} {V : Type u} {W : Type v}
      [AddCommGroup V] [Module ℚ V] [AddCommGroup W] [Module ℚ W]
      (L : TauCeti.IntegralLattice V) (M : TauCeti.IntegralLattice W) :
      Type (max u v)
    structure TauCeti.IntegralLattice.Isometry.{u, v}
      {V : Type u} {W : Type v}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) :
      Type (max u v)
    An isometry of integral lattices is an isometry of their ambient rational bilinear spaces
    which maps the first carrier onto the second. 
    • L.form.IsometryEquiv M.form
    toFun : V → W
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    3. LinearMap
    4. AddHom
    map_add' : ∀ (x y : V), (↑self.toLinearEquiv).toFun (x + y) = (↑self.toLinearEquiv).toFun x + (↑self.toLinearEquiv).toFun y
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    3. LinearMap
    4. AddHom
    map_smul' : ∀ (m : ℚ) (x : V), (↑self.toLinearEquiv).toFun (m • x) = (RingHom.id ℚ) m • (↑self.toLinearEquiv).toFun x
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    3. LinearMap
    invFun : W → V
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    left_inv : Function.LeftInverse self.invFun (↑self.toLinearEquiv).toFun
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    right_inv : Function.RightInverse self.invFun (↑self.toLinearEquiv).toFun
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    map_app' : ∀ (n m : V), (M.form ((↑self.toLinearEquiv).toFun n)) ((↑self.toLinearEquiv).toFun m) = (L.form n) m
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    map_carrier : Submodule.map (↑(LinearEquiv.restrictScalars ℤ self.toLinearEquiv)) L.carrier = M.carrier
    The ambient equivalence maps the source lattice carrier onto the target carrier. 
Definition8.4.25
Statement uses 5
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Hermite number. (LMFDB)

The Hermite number of a positive definite integral lattice L, with absolute determinant d, is given by

\frac{m(L)}{d^{\frac{1}{n}}},

where n is the rank of L, and m(L) denotes the minimum of L.

Tau Ceti Review: TauCeti.IntegralLattice.discriminant, TauCeti.IntegralLattice.minimum.

Depends on: Definition 8.4.9 Definition 8.4.11 Definition 8.4.12 Definition 8.4.33 Definition 8.4.45

Lean code for Definition8.4.25●2 definitions
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Gram.lean
    complete
    def TauCeti.IntegralLattice.discriminant.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℕ
    def TauCeti.IntegralLattice.discriminant.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℕ
    The nonnegative discriminant of an integral lattice is the absolute value of its signed
    determinant. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/PosDef/Minimum.lean
    complete
    def TauCeti.IntegralLattice.minimum.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℕ
    def TauCeti.IntegralLattice.minimum.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℕ
    The minimum `min L` of an integral lattice: the least natural number that is the integral norm
    of a nonzero lattice vector, and `0` if there is none. For a positive definite lattice of positive
    rank this is the least norm of a nonzero vector, and it is positive. 
Definition8.4.26
Statement uses 4
Statement dependency previews
Preview
Definition 3.5.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

History of Lattices. (LMFDB)

Integral lattices have a deep connection to the objects in the LMFDB in that every lattice, L, has an associated theta series, \Theta_L, which is a holomorphic modular form of half-integral weight. Specifically, the theta series are a type of Siegel modular form, first introduced by Siegel in the 1930's . Later, in 1973, Shimura developed a partial correspondence lifting half-integral weight theta series to full integral weight series , allowing lattices to be studied using the full analytic machinery of modular forms.

The Representation Problem ------------------

The lattice L, with associated quadratic map Q, is said to represent an integer n if the equation Q(v)=n is solvable for v in L. The representation problem, or the determination of the number of ways a certain integer can be represented by a given lattice, is one of the classical problems in integral lattices. To this end, the theta series is a valuable tool, in that the n^{th} Fourier coefficients of \Theta_L counts the number of representations of n by L.

Classically, sums of squares are one interesting class of lattices; the sums of two squares (2.1.2.1.1), three squares (3.1.2.1.1), and four squares (4.1.2.1.1) all appear in the database. These lattices can all be considered as discrete subsets of Euclidean space, and their associated bilinear map is just the standard inner product. Originally studied by Euler, Legendre, Gauss, Lagrange, and Jacobi, the number of ways an integer can be represented by sums of two, three, or four squares is well known.

In the 1920's, Hasse proved that an integer is represented by a quadratic form provided that it is represented locally by the form at every prime. In the case of indefinite lattices there is more or less an integral analogue of Hasse's result described by Hsai, Shao, and Xu in . In the definite case a direct integral analogue of Hasse's local-global result does not exists for lattices, although in several cases there is an asymptotic version; a summary of these results is given by Schulze-Pillot in .

Given the Siegel correspondence, many of the results in the preceding paragraph rely on a careful melding of the analytic machinery of theta series, and the algebraic techniques of lattices.

Lattices and Codes ------------------ There is also an important connection between lattices and codes described by Ebeling in . Given a finite commutative ring, R, a code, C, is an R-submodule of R^n. A code C is related uniquely to a lattice L_C via Construction A, described by Nebe, Rains, and Sloane in . Many of the concepts of lattices theory have analogues in coding theory, for example the theta series of a lattice is a modular form invariant under the action of a certain Siegel modular group, this corresponds directly to the weight enumerator of a code which is a polynomial invariant under the action of the so-called Clifford-Weil group.

As an example, the 8-dimensional root lattice E_8 (8.1.1.1.1) corresponds to the well-known Hamming code, an error-correcting code over the finite field \mathbb{F}_2. In addition, the 24-dimensional Leech lattice (24.1.1.24.1) corresponds to the Golay code.

Depends on: Definition 8.4.9 Definition 8.4.57 Definition 3.6.19 Definition 3.5.1

Definition8.4.27
Statement uses 9
Statement dependency previews
Preview
Definition 1.1.27
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Hyperbolic plane. (LMFDB)

The hyperbolic plane U is the integral lattice with Gram matrix

\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}.

Over a field with characteristic not 2, every nondegenerate indefinite quadratic space is isometric to a direct sum of a definite quadratic space and some number of copies of the hyperbolic plane. A version also holds for even unimodular lattices, which can be written as U^{\oplus r} \oplus E_8^{\oplus s} or U^{\oplus r} \oplus E_8(-1)^{\oplus s}. But this direct sum decomposition does not hold for lattices.

Depends on: Definition 8.4.9 Definition 8.4.23 Definition 8.4.28 Definition 8.4.36 Definition 8.4.41 Definition 8.4.51 Definition 8.4.58 Definition 1.1.27 Definition 1.1.30

Definition8.4.28
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 8.4.5
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Isometries between integral lattices. (LMFDB)

Two integral lattices, L and L', are isometric if there exists a map \sigma:L\rightarrow L' such that Q(\vec{v})=Q(\sigma(\vec{v})) for all \vec{v}\in L. If this is the case, we say L\cong L'. The set of all lattices M such that M\cong L is called the isometry class (or simply the class) of L.

If L and L' have associated Gram matrices G and G', then L\cong L' implies that G=T\cdot G'\cdot T^t for some T\in GL_n(\mathbb{Z}).

Tau Ceti Review: TauCeti.IntegralLattice.Isometry, QuadraticMap.IsometryEquiv, QuadraticMap.Equivalent, TauCeti.IntegralLattice.Isometry.ofGramMatrixEq.

Depends on: Definition 8.4.9 Definition 8.4.23

Lean code for Definition8.4.28●4 definitions
  • structure(extends 7, 8 fields)defined in TauCeti/LinearAlgebra/IntegralLattice/Isometry/Basic.lean
    complete
    structure TauCeti.IntegralLattice.Isometry.{u, v} {V : Type u} {W : Type v}
      [AddCommGroup V] [Module ℚ V] [AddCommGroup W] [Module ℚ W]
      (L : TauCeti.IntegralLattice V) (M : TauCeti.IntegralLattice W) :
      Type (max u v)
    structure TauCeti.IntegralLattice.Isometry.{u, v}
      {V : Type u} {W : Type v}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) :
      Type (max u v)
    An isometry of integral lattices is an isometry of their ambient rational bilinear spaces
    which maps the first carrier onto the second. 
    • L.form.IsometryEquiv M.form
    toFun : V → W
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    3. LinearMap
    4. AddHom
    map_add' : ∀ (x y : V), (↑self.toLinearEquiv).toFun (x + y) = (↑self.toLinearEquiv).toFun x + (↑self.toLinearEquiv).toFun y
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    3. LinearMap
    4. AddHom
    map_smul' : ∀ (m : ℚ) (x : V), (↑self.toLinearEquiv).toFun (m • x) = (RingHom.id ℚ) m • (↑self.toLinearEquiv).toFun x
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    3. LinearMap
    invFun : W → V
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    left_inv : Function.LeftInverse self.invFun (↑self.toLinearEquiv).toFun
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    right_inv : Function.RightInverse self.invFun (↑self.toLinearEquiv).toFun
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    2. LinearEquiv
    map_app' : ∀ (n m : V), (M.form ((↑self.toLinearEquiv).toFun n)) ((↑self.toLinearEquiv).toFun m) = (L.form n) m
    Inherited from
    1. LinearMap.BilinForm.IsometryEquiv
    map_carrier : Submodule.map (↑(LinearEquiv.restrictScalars ℤ self.toLinearEquiv)) L.carrier = M.carrier
    The ambient equivalence maps the source lattice carrier onto the target carrier. 
  • structure(extends 6, 7 fields)defined in Mathlib/LinearAlgebra/QuadraticForm/IsometryEquiv.lean
    complete
    structure QuadraticMap.IsometryEquiv.{u_2, u_5, u_6, u_9} {R : Type u_2}
      {M₁ : Type u_5} {M₂ : Type u_6} {N : Type u_9} [CommSemiring R]
      [AddCommMonoid M₁] [AddCommMonoid M₂] [AddCommMonoid N] [Module R M₁]
      [Module R M₂] [Module R N] (Q₁ : QuadraticMap R M₁ N)
      (Q₂ : QuadraticMap R M₂ N) : Type (max u_5 u_6)
    structure QuadraticMap.IsometryEquiv.{u_2, u_5, u_6,
        u_9}
      {R : Type u_2} {M₁ : Type u_5}
      {M₂ : Type u_6} {N : Type u_9}
      [CommSemiring R] [AddCommMonoid M₁]
      [AddCommMonoid M₂] [AddCommMonoid N]
      [Module R M₁] [Module R M₂] [Module R N]
      (Q₁ : QuadraticMap R M₁ N)
      (Q₂ : QuadraticMap R M₂ N) :
      Type (max u_5 u_6)
    An isometric equivalence between two quadratic spaces `M₁, Q₁` and `M₂, Q₂` over a ring `R`,
    is a linear equivalence between `M₁` and `M₂` that commutes with the quadratic forms. 
    • M₁ ≃ₗ[R] M₂
    toFun : M₁ → M₂
    Inherited from
    1. LinearEquiv
    2. LinearMap
    3. AddHom
    map_add' : ∀ (x y : M₁), (↑self.toLinearEquiv).toFun (x + y) = (↑self.toLinearEquiv).toFun x + (↑self.toLinearEquiv).toFun y
    Inherited from
    1. LinearEquiv
    2. LinearMap
    3. AddHom
    map_smul' : ∀ (m : R) (x : M₁), (↑self.toLinearEquiv).toFun (m • x) = (RingHom.id R) m • (↑self.toLinearEquiv).toFun x
    Inherited from
    1. LinearEquiv
    2. LinearMap
    invFun : M₂ → M₁
    Inherited from
    1. LinearEquiv
    left_inv : Function.LeftInverse self.invFun (↑self.toLinearEquiv).toFun
    Inherited from
    1. LinearEquiv
    right_inv : Function.RightInverse self.invFun (↑self.toLinearEquiv).toFun
    Inherited from
    1. LinearEquiv
    map_app' : ∀ (m : M₁), Q₂ ((↑self.toLinearEquiv).toFun m) = Q₁ m
  • defdefined in Mathlib/LinearAlgebra/QuadraticForm/IsometryEquiv.lean
    complete
    def QuadraticMap.Equivalent.{u_2, u_5, u_6, u_9} {R : Type u_2}
      {M₁ : Type u_5} {M₂ : Type u_6} {N : Type u_9} [CommSemiring R]
      [AddCommMonoid M₁] [AddCommMonoid M₂] [AddCommMonoid N] [Module R M₁]
      [Module R M₂] [Module R N] (Q₁ : QuadraticMap R M₁ N)
      (Q₂ : QuadraticMap R M₂ N) : Prop
    def QuadraticMap.Equivalent.{u_2, u_5, u_6,
        u_9}
      {R : Type u_2} {M₁ : Type u_5}
      {M₂ : Type u_6} {N : Type u_9}
      [CommSemiring R] [AddCommMonoid M₁]
      [AddCommMonoid M₂] [AddCommMonoid N]
      [Module R M₁] [Module R M₂] [Module R N]
      (Q₁ : QuadraticMap R M₁ N)
      (Q₂ : QuadraticMap R M₂ N) : Prop
    Two quadratic forms over a ring `R` are equivalent
    if there exists an isometric equivalence between them:
    a linear equivalence that transforms one quadratic form into the other. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Gram.lean
    complete
    def TauCeti.IntegralLattice.Isometry.ofGramMatrixEq.{u, v, w} {V : Type u}
      [AddCommGroup V] [Module ℚ V] {W : Type w} [AddCommGroup W]
      [Module ℚ W] {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W} {ι : Type v}
      (b : Module.Basis ι ℤ ↥L.carrier) (b' : Module.Basis ι ℤ ↥M.carrier)
      (h : L.gramMatrix b = M.gramMatrix b') : L.Isometry M
    def TauCeti.IntegralLattice.Isometry.ofGramMatrixEq.{u,
        v, w}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V] {W : Type w}
      [AddCommGroup W] [Module ℚ W]
      {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W}
      {ι : Type v}
      (b : Module.Basis ι ℤ ↥L.carrier)
      (b' : Module.Basis ι ℤ ↥M.carrier)
      (h : L.gramMatrix b = M.gramMatrix b') :
      L.Isometry M
    **Lattices with bases of equal Gram matrices are isometric.** The isometry carries the `i`-th
    vector of the first basis to the `i`-th vector of the second; this is the converse of
    `TauCeti.IntegralLattice.Isometry.gramMatrix_carrierBasisEquiv`. 
Definition8.4.29
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.12
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Kissing number. (LMFDB)

The kissing number of a lattice, L, is the number of vectors of minimal length. The vectors in the list of minimal length vectors are normalized, so the kissing number will always be twice as large as the number of vectors in this list.

The lattice kissing number problem in dimension n is to find the lattices of dimension n which maximize the kissing number. In general, these may not be solutions of the general kissing number problem, which asks for the maximum number of spheres with non-overlapping interiors in dimension n which are all tangent to a single sphere.

Depends on: Definition 8.4.12 Definition 8.4.33

Definition8.4.30
Statement uses 4
Statement dependency previews
Preview
Definition 8.4.6
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

LMFDB label of an integral lattice. (LMFDB)

The label of a lattice is given by

dimension.determinant.level.class_number.N

where N is a counter enumerating lattices for which the first four parameters are identical. If the class number is not available, then the corresponding field is set to 0.

Depends on: Definition 8.4.6 Definition 8.4.11 Definition 8.4.12 Definition 8.4.31

Definition8.4.31
Statement uses 6
Statement dependency previews
Preview
Definition 8.3.47
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.30
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Level of an integral lattice. (LMFDB)

For an integral lattice, L, the level is the smallest integer, N, such that N\cdot B(\vec{v},\vec{v})\in 2\mathbb{Z} for all \vec{v} in the dual of L.

This is related to the exponent e of the discriminant group: either N = e or N = 2e. You can determine when the second case occurs using the Conway genus symbol: the level will be 2e when the highest 2-adic block is of type I, and it will be e when the highest 2-adic block is of type II (or if 2 does not divide the discriminant).

Depends on: Definition 8.3.47 Definition 8.4.7 Definition 8.4.9 Definition 8.4.13 Definition 8.4.14 Definition 8.4.15

Definition8.4.32
Statement uses 3
Statement dependency previews
Preview
Definition 8.4.5
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Mass of a lattice. (LMFDB)

For an integral lattice L, the mass of L is the weighted sum

\sum_{\Lambda} \frac{1}{\# \text{Aut} (\Lambda)}

where the sum runs over all isometry classes of lattices \Lambda in the same genus as L. Here \text{Aut}(\Lambda) denotes the automorphism group of \Lambda.

Depends on: Definition 8.4.5 Definition 8.4.9 Definition 8.4.21

Definition8.4.33
uses 1
Used by 8
Reverse dependency previews
Preview
Definition 8.4.17
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Minimum. (LMFDB)

For an integral lattice, L, the minimum, denoted m(L), is the length of the shortest non-zero vector in L. A minimal vector in L is a vector \vec{v} such that Q(\vec{v})=m(L).

Tau Ceti Review: TauCeti.IntegralLattice.minimum, TauCeti.IntegralLattice.vectorsOfNorm.

Depends on: Definition 8.4.9

Lean code for Definition8.4.33●2 definitions
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/PosDef/Minimum.lean
    complete
    def TauCeti.IntegralLattice.minimum.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℕ
    def TauCeti.IntegralLattice.minimum.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℕ
    The minimum `min L` of an integral lattice: the least natural number that is the integral norm
    of a nonzero lattice vector, and `0` if there is none. For a positive definite lattice of positive
    rank this is the least norm of a nonzero vector, and it is positive. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Norm.lean
    complete
    def TauCeti.IntegralLattice.vectorsOfNorm.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) (n : ℚ) : Set ↥L.carrier
    def TauCeti.IntegralLattice.vectorsOfNorm.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      (n : ℚ) : Set ↥L.carrier
    The lattice vectors having the prescribed rational norm. 
Definition8.4.34
uses 1used by 1✓L∃∀N

Minimum. (LMFDB)

For an integral lattice, L, the minimum, denoted m(L), is the length of the shortest non-zero vector in L. A minimal vector in L is a vector \vec{v} such that Q(\vec{v})=m(L).

Tau Ceti Review: TauCeti.IntegralLattice.minimum, TauCeti.IntegralLattice.vectorsOfNorm.

Depends on: Definition 8.4.9

Lean code for Definition8.4.34●2 definitions
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/PosDef/Minimum.lean
    complete
    def TauCeti.IntegralLattice.minimum.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℕ
    def TauCeti.IntegralLattice.minimum.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℕ
    The minimum `min L` of an integral lattice: the least natural number that is the integral norm
    of a nonzero lattice vector, and `0` if there is none. For a positive definite lattice of positive
    rank this is the least norm of a nonzero vector, and it is positive. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Norm.lean
    complete
    def TauCeti.IntegralLattice.vectorsOfNorm.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) (n : ℚ) : Set ↥L.carrier
    def TauCeti.IntegralLattice.vectorsOfNorm.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      (n : ℚ) : Set ↥L.carrier
    The lattice vectors having the prescribed rational norm. 
Definition8.4.35
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Name of a lattice. (LMFDB)

Certain integral lattices have names in the LMFDB. These include root lattices (A2...A14, D3=A3, E8), duals of root lattices (A3\=D3\), square lattices (Z2, Z3), and the Leech lattice (Leech).

Tau Ceti Review: TauCeti.IntegralLattice.typeARootLattice, TauCeti.IntegralLattice.checkerboardLattice, TauCeti.IntegralLattice.typeE₈RootLattice, TauCeti.IntegralLattice.unitLattice.

Depends on: Definition 8.4.9 Definition 8.4.49

Lean code for Definition8.4.35●7 definitions
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/RootLattice/TypeA/Basic.lean
    complete
    def TauCeti.IntegralLattice.typeARootLattice (n : ℕ) :
      TauCeti.IntegralLattice (Fin n → ℚ)
    def TauCeti.IntegralLattice.typeARootLattice
      (n : ℕ) :
      TauCeti.IntegralLattice (Fin n → ℚ)
    The positive root lattice of type `Aₙ`: the rank-`n` integral lattice on `Fin n → ℚ` whose
    Gram matrix in the standard basis of simple roots is `CartanMatrix.A n`. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/RootLattice/TypeD/Basic.lean
    complete
    def TauCeti.IntegralLattice.checkerboardLattice (n : ℕ) :
      TauCeti.IntegralLattice (Fin n → ℚ)
    def TauCeti.IntegralLattice.checkerboardLattice
      (n : ℕ) :
      TauCeti.IntegralLattice (Fin n → ℚ)
    **The checkerboard lattice** in the Conway–Sloane coordinate model: the integer vectors of
    `ℚⁿ` whose coordinate sum is even, with the standard dot product.  For `n ≥ 4` this is the
    positive root lattice of type `Dₙ`. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/RootLattice/TypeE/Basic.lean
    complete
    def TauCeti.IntegralLattice.typeE₈RootLattice :
      TauCeti.IntegralLattice (Fin 8 → ℚ)
    def TauCeti.IntegralLattice.typeE₈RootLattice :
      TauCeti.IntegralLattice (Fin 8 → ℚ)
    The root lattice of type `E₈`: the rank-eight integral lattice on `Fin 8 → ℚ` whose
    Gram matrix in the standard basis of simple roots is `CartanMatrix.E 8`. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Unit.lean
    complete
    def TauCeti.IntegralLattice.unitLattice.{u} (ι : Type u) [Fintype ι] :
      TauCeti.IntegralLattice (ι → ℚ)
    def TauCeti.IntegralLattice.unitLattice.{u}
      (ι : Type u) [Fintype ι] :
      TauCeti.IntegralLattice (ι → ℚ)
    The standard unit lattice `I_ι`: the integer coordinate lattice `ℤ^ι` inside `ℚ^ι`,
    with the dot-product form and identity Gram matrix. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Dual.lean
    complete
    def TauCeti.IntegralLattice.rescaledDual.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] : TauCeti.IntegralLattice V
    def TauCeti.IntegralLattice.rescaledDual.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] :
      TauCeti.IntegralLattice V
    The **rescaled dual** (LMFDB `lattice.dual`) of a nondegenerate integral lattice `L` with
    bilinear form `B`: the dual `L^#` with the form `n • B`, where `n` is the dual scale, the least
    positive integer for which `n • B` is integral on `L^#`. When `L` is nonzero this is the unique
    positive rescaling of `B` for which `L^#` is a primitive integral lattice
    (`scaleIdeal_rescaledDual`, `eq_rescaledDual`). 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/NamedLattices.lean
    complete
    def TauCeti.IntegralLattice.typeAThreeIsometryCheckerboardLattice :
      (TauCeti.IntegralLattice.typeARootLattice 3).Isometry
        (TauCeti.IntegralLattice.checkerboardLattice 3)
    def TauCeti.IntegralLattice.typeAThreeIsometryCheckerboardLattice :
      (TauCeti.IntegralLattice.typeARootLattice
            3).Isometry
        (TauCeti.IntegralLattice.checkerboardLattice
          3)
    **`D₃ = A₃`** (LMFDB `lattice.name`): the root lattice `A₃` is isometric to the checkerboard
    lattice `D₃`, by the isometry carrying its simple roots to `(0, 1, -1)`, `(1, -1, 0)` and
    `(0, 1, 1)`. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/NamedLattices.lean
    complete
    def TauCeti.IntegralLattice.typeAThreeRescaledDualIsometry :
      (TauCeti.IntegralLattice.typeARootLattice 3).rescaledDual.Isometry
        (TauCeti.IntegralLattice.checkerboardLattice 3).rescaledDual
    def TauCeti.IntegralLattice.typeAThreeRescaledDualIsometry :
      (TauCeti.IntegralLattice.typeARootLattice
              3).rescaledDual.Isometry
        (TauCeti.IntegralLattice.checkerboardLattice
            3).rescaledDual
    **`A₃* = D₃*`** (LMFDB `lattice.name`): the rescaled duals of the root lattice `A₃` and of the
    checkerboard lattice `D₃`, the integral lattices the LMFDB names `A₃*` and `D₃*`, are isometric. 
Definition8.4.36
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.4.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Nondegenerate lattice. (LMFDB)

An integral lattice L with bilinear form B is nondegenerate if

\{w \in L : B(v, w) = 0 \text{ for all } v \in L\} = 0.

Otherwise, we call L degenerate. All lattices in the database are nondegenerate, but some definitions require degenerate lattices. In particular, the signature of a (possibly degenerate) lattice is a triple (n_+, n_0, n_-) where n_+ and n_- are as in the standard signature and n_0 is the number of 0 eigenvalues for a Gram matrix. A lattice is degenerate if and only if n_0 > 0. We say L is positive semidefinite if n_-=0.

Tau Ceti Review: TauCeti.IntegralLattice.IsNondegenerate, TauCeti.IntegralLattice.signature, TauCeti.IntegralLattice.isDegenerate_iff_sigNull_pos, TauCeti.IntegralLattice.isPosSemidef_iff_sigNeg_eq_zero.

Depends on: Definition 8.4.9 Definition 8.4.23

Lean code for Definition8.4.36●6 declarations
  • class(1 method)defined in TauCeti/LinearAlgebra/IntegralLattice/Basic.lean
    complete
    class TauCeti.IntegralLattice.IsNondegenerate.{u} {V : Type u}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    class TauCeti.IntegralLattice.IsNondegenerate.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    An integral lattice is nondegenerate when its ambient rational bilinear form is
    nondegenerate. This is a mixin rather than a field of `IntegralLattice`, so degenerate lattices
    remain objects of the same type. 
    nondegenerate : L.form.Nondegenerate
    The rational bilinear form has trivial kernel. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/SignatureEigenvalues.lean
    complete
    theorem TauCeti.IntegralLattice.isNondegenerate_iff_forall_form_eq_zero.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      L.IsNondegenerate ↔
        ∀ (w : ↥L.carrier), (∀ (v : ↥L.carrier), (L.form ↑v) ↑w = 0) → w = 0
    theorem TauCeti.IntegralLattice.isNondegenerate_iff_forall_form_eq_zero.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      L.IsNondegenerate ↔
        ∀ (w : ↥L.carrier),
          (∀ (v : ↥L.carrier),
              (L.form ↑v) ↑w = 0) →
            w = 0
    **An integral lattice is nondegenerate exactly when no nonzero vector of the lattice is
    orthogonal to the whole lattice** (LMFDB `lattice.nondegenerate`):
    `{w ∈ L | B(v, w) = 0 for all v ∈ L} = 0`. 
  • abbrevdefined in TauCeti/LinearAlgebra/IntegralLattice/Signature.lean
    complete
    abbrev TauCeti.IntegralLattice.signature.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℕ × ℕ × ℕ
    abbrev TauCeti.IntegralLattice.signature.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      ℕ × ℕ × ℕ
    The signature `(n₊, n₀, n₋)` of an integral lattice. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/SignatureEigenvalues.lean
    complete
    theorem TauCeti.IntegralLattice.sigNull_eq_ncard_eigenvalues_eq_zero.{u_1, u_2}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) {ι : Type u_2}
      (e : Module.Basis ι ℤ ↥L.carrier) [Fintype ι] [DecidableEq ι] :
      L.sigNull = {i | ⋯.eigenvalues i = 0}.ncard
    theorem TauCeti.IntegralLattice.sigNull_eq_ncard_eigenvalues_eq_zero.{u_1,
        u_2}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      {ι : Type u_2}
      (e : Module.Basis ι ℤ ↥L.carrier)
      [Fintype ι] [DecidableEq ι] :
      L.sigNull =
        {i | ⋯.eigenvalues i = 0}.ncard
    **The null index `n₀` of an integral lattice, the dimension of its radical, is the number of
    zero eigenvalues of its Gram matrix** (LMFDB `lattice.nondegenerate`) in any basis, counted with
    multiplicity. 
  • theoremdefined in TauCeti/LinearAlgebra/IntegralLattice/Signature.lean
    complete
    theorem TauCeti.IntegralLattice.isDegenerate_iff_sigNull_pos.{u} {V : Type u}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      L.IsDegenerate ↔ 0 < L.sigNull
    theorem TauCeti.IntegralLattice.isDegenerate_iff_sigNull_pos.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      L.IsDegenerate ↔ 0 < L.sigNull
    Degeneracy is equivalent to a positive null index. 
  • theoremdefined in TauCeti/LinearAlgebra/IntegralLattice/Signature.lean
    complete
    theorem TauCeti.IntegralLattice.isPosSemidef_iff_sigNeg_eq_zero.{u} {V : Type u}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      L.IsPosSemidef ↔ L.sigNeg = 0
    theorem TauCeti.IntegralLattice.isPosSemidef_iff_sigNeg_eq_zero.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      L.IsPosSemidef ↔ L.sigNeg = 0
    Positive-semidefiniteness is equivalent to the vanishing of the negative index. 
Definition8.4.37
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.38
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Norm of a vector. (LMFDB)

Given an integral lattice L with associated bilinear map B, the norm of a vector v \in L is B(v, v). If L has Gram matrix A, then the norm of v is v^T A v.

Tau Ceti Review: TauCeti.IntegralLattice.norm, TauCeti.IntegralLattice.integralNorm.

Depends on: Definition 8.4.9 Definition 8.4.23

Lean code for Definition8.4.37●2 definitions
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Norm.lean
    complete
    def TauCeti.IntegralLattice.norm.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : QuadraticForm ℚ V
    def TauCeti.IntegralLattice.norm.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      QuadraticForm ℚ V
    The rational quadratic form on ambient vectors given by self-pairing. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Norm.lean
    complete
    def TauCeti.IntegralLattice.integralNorm.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      QuadraticForm ℤ ↥L.carrier
    def TauCeti.IntegralLattice.integralNorm.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      QuadraticForm ℤ ↥L.carrier
    The canonical integer quadratic form induced on the lattice carrier. 
Definition8.4.38
Statement uses 4
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Norm 1 sublattice. (LMFDB)

Given an integral lattice L, the norm 1 sublattice is the sublattice of L generated by all vectors of norm 1 in L.

If L is even, then the norm 1 sublattice is trivial. If L =I_n, then the norm 1 sublattice is the lattice I_n itself.

Depends on: Definition 8.4.9 Definition 8.4.37 Definition 8.4.41 Definition 8.4.54

Lean code for Definition8.4.38●3 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Sublattice.lean
    complete
    def TauCeti.IntegralLattice.normOneSubmodule.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      Submodule ℤ ↥L.carrier
    def TauCeti.IntegralLattice.normOneSubmodule.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Submodule ℤ ↥L.carrier
    The **norm 1 sublattice** (LMFDB `lattice.sublattice`, `lattice.norm1_sublattice`) of an
    integral lattice `L`: the submodule of its carrier generated by the vectors of norm `1`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Sublattice.lean
    complete
    theorem TauCeti.IntegralLattice.IsEven.normOneSubmodule_eq_bot.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      {L : TauCeti.IntegralLattice V} (hL : L.IsEven) :
      L.normOneSubmodule = ⊥
    theorem TauCeti.IntegralLattice.IsEven.normOneSubmodule_eq_bot.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      (hL : L.IsEven) : L.normOneSubmodule = ⊥
    **The norm 1 sublattice of an even lattice is trivial**, as it has no vector of odd norm. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Sublattice.lean
    complete
    theorem TauCeti.IntegralLattice.normOneSubmodule_unitLattice.{u_2}
      (ι : Type u_2) [Fintype ι] :
      (TauCeti.IntegralLattice.unitLattice ι).normOneSubmodule = ⊤
    theorem TauCeti.IntegralLattice.normOneSubmodule_unitLattice.{u_2}
      (ι : Type u_2) [Fintype ι] :
      (TauCeti.IntegralLattice.unitLattice
            ι).normOneSubmodule =
        ⊤
    **The norm 1 sublattice of `ℤⁿ` is `ℤⁿ`**, the lattice `ℤⁿ` with the sum of squares being Tau
    Ceti's `unitLattice ι`, spanned by the coordinate vectors, of norm `1`. 
Definition8.4.39
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Normalized minimal vector of a lattice. (LMFDB)

For an integral lattice L, the minimal vectors of L come in pairs: if \vec{v} is a minimal vector, then so is -\vec{v}. A minimal vector is normalized if its first nonzero component is positive.

Tau Ceti Review: TauCeti.IntegralLattice.minimum.

Depends on: Definition 8.4.9 Definition 8.4.33

Lean code for Definition8.4.39●7 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Sublattice.lean
    complete
    def TauCeti.IntegralLattice.minimalVectors.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      Set ↥L.carrier
    def TauCeti.IntegralLattice.minimalVectors.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Set ↥L.carrier
    The **minimal vectors** `S(L)` (LMFDB `lattice.minimal_vector`) of an integral lattice `L`:
    its nonzero vectors whose norm is the minimum `min L`. This is meant for a positive definite
    lattice, whose minimum is the least norm of a nonzero vector; `S(L)` then contains both `v` and
    `-v` for each of the normalised minimal vectors `v` listed by the LMFDB. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/PosDef/Minimum.lean
    complete
    def TauCeti.IntegralLattice.minimum.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℕ
    def TauCeti.IntegralLattice.minimum.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : ℕ
    The minimum `min L` of an integral lattice: the least natural number that is the integral norm
    of a nonzero lattice vector, and `0` if there is none. For a positive definite lattice of positive
    rank this is the least norm of a nonzero vector, and it is positive. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/NormalizedMinimalVector.lean
    complete
    def TauCeti.IntegralLattice.IsNormalized.{u_1, u_2} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] {L : TauCeti.IntegralLattice V}
      {ι : Type u_2} [LinearOrder ι] (b : Module.Basis ι ℤ ↥L.carrier)
      (x : ↥L.carrier) : Prop
    def TauCeti.IntegralLattice.IsNormalized.{u_1,
        u_2}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      {ι : Type u_2} [LinearOrder ι]
      (b : Module.Basis ι ℤ ↥L.carrier)
      (x : ↥L.carrier) : Prop
    A vector `x` of an integral lattice `L` is **normalized** (LMFDB
    `lattice.normalized_minimal_vector`) for a `ℤ`-basis `b` of `L` indexed by a linearly ordered type,
    such as `Fin n` for the basis in which the LMFDB stores the Gram matrix of `L`, if its first nonzero
    coordinate in `b` is positive. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/NormalizedMinimalVector.lean
    complete
    theorem TauCeti.IntegralLattice.neg_mem_minimalVectors_iff.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] {L : TauCeti.IntegralLattice V}
      {x : ↥L.carrier} : -x ∈ L.minimalVectors ↔ x ∈ L.minimalVectors
    theorem TauCeti.IntegralLattice.neg_mem_minimalVectors_iff.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      {x : ↥L.carrier} :
      -x ∈ L.minimalVectors ↔
        x ∈ L.minimalVectors
    **The minimal vectors come in pairs** (LMFDB `lattice.normalized_minimal_vector`): `-v` is a
    minimal vector of an integral lattice exactly when `v` is. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/NormalizedMinimalVector.lean
    complete
    theorem TauCeti.IntegralLattice.neg_ne_self_of_mem_minimalVectors.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      {L : TauCeti.IntegralLattice V} {x : ↥L.carrier}
      (hx : x ∈ L.minimalVectors) : -x ≠ x
    theorem TauCeti.IntegralLattice.neg_ne_self_of_mem_minimalVectors.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      {x : ↥L.carrier}
      (hx : x ∈ L.minimalVectors) : -x ≠ x
    **A minimal vector `v` differs from `-v`**: it is nonzero, and the lattice has no
    `2`-torsion. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/NormalizedMinimalVector.lean
    complete
    theorem TauCeti.IntegralLattice.isNormalized_neg_iff.{u_1, u_2} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] {L : TauCeti.IntegralLattice V}
      {ι : Type u_2} [LinearOrder ι] (b : Module.Basis ι ℤ ↥L.carrier)
      {x : ↥L.carrier} [WellFoundedLT ι] (hx : x ≠ 0) :
      TauCeti.IntegralLattice.IsNormalized b (-x) ↔
        ¬TauCeti.IntegralLattice.IsNormalized b x
    theorem TauCeti.IntegralLattice.isNormalized_neg_iff.{u_1,
        u_2}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      {ι : Type u_2} [LinearOrder ι]
      (b : Module.Basis ι ℤ ↥L.carrier)
      {x : ↥L.carrier} [WellFoundedLT ι]
      (hx : x ≠ 0) :
      TauCeti.IntegralLattice.IsNormalized b
          (-x) ↔
        ¬TauCeti.IntegralLattice.IsNormalized
            b x
    **Exactly one of a nonzero vector and its negative is normalized**: in the lexicographic order
    of the coordinates, a nonzero vector is either positive or negative. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/NormalizedMinimalVector.lean
    complete
    theorem TauCeti.IntegralLattice.kissingNumber_eq_two_mul_ncard.{u_1, u_2}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      {L : TauCeti.IntegralLattice V} {ι : Type u_2} [LinearOrder ι]
      (b : Module.Basis ι ℤ ↥L.carrier) [WellFoundedLT ι]
      (hL : L.IsPosDef) :
      L.kissingNumber =
        2 *
          {x |
              x ∈ L.minimalVectors ∧
                TauCeti.IntegralLattice.IsNormalized b x}.ncard
    theorem TauCeti.IntegralLattice.kissingNumber_eq_two_mul_ncard.{u_1,
        u_2}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      {ι : Type u_2} [LinearOrder ι]
      (b : Module.Basis ι ℤ ↥L.carrier)
      [WellFoundedLT ι] (hL : L.IsPosDef) :
      L.kissingNumber =
        2 *
          {x |
              x ∈ L.minimalVectors ∧
                TauCeti.IntegralLattice.IsNormalized
                  b x}.ncard
    **The kissing number of a positive definite lattice is twice the number of its normalized
    minimal vectors**: the minimal vectors are the normalized ones and their negatives. 
Definition8.4.40
uses 0used by 1XL∃∀N

Orthogonal decomposition of a lattice. (LMFDB)

Let L be an integral lattice, with bilinear form B : L \times L \to \Z. An orthogonal decomposition of L is a direct sum decomposition

L = L_1 \oplus L_2 \oplus \dots \oplus L_r

such that B(x_i, x_j) = 0 for all x_i \in L_i, x_j \in L_j, where i \not = j. Equivalently, if G is the Gram matrix of L, then after a suitable change of basis, it has the block diagonal form

G = \begin{pmatrix} G_1 & & & \\ & G_2 & & \\ & & \ddots & \\ & & & G_r \end{pmatrix}

where each G_i is a Gram matrix for L_i.

A lattice is (orthogonally) indecomposable if it does not admit a non-trivial orthogonal decomposition.

A theorem of Kneser states that every lattice admits a unique orthogonal decomposition into indecomposable summands. This decomposition is unique up to ordering and isometry of the summands.

Definition8.4.41
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 5
Reverse dependency previews
Preview
Definition 8.4.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Parity of a lattice. (LMFDB)

If an integral lattice L has Gram matrix M, we say that L is even if all of the diagonal entries of M are even, and odd otherwise.

Tau Ceti Review: TauCeti.IntegralLattice.IsEven.

Depends on: Definition 8.4.9 Definition 8.4.23

Lean code for Definition8.4.41●1 definition
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Even.lean
    complete
    def TauCeti.IntegralLattice.IsEven.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    def TauCeti.IntegralLattice.IsEven.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    An integral lattice is even when the norm of every lattice vector is an even integer. 
Definition8.4.42
Statement uses 4
Statement dependency previews
Preview
Definition 8.4.4
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.19
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Perfect lattice. (LMFDB)

A lattice L in \mathbb{R}^n is called perfect if the space of n \times n real symmetric matrices is spanned by the set of n \times n symmetric matrices

\{ x x^{\top} : x \in S(L) \},

where S(L) is the set of minimal vectors of L. A perfect lattice is well-rounded, arithmetic, and is uniquely determined by its minimal vectors. Further, there are only finitely many similarity classes of perfect lattices in each dimension n \geq 2.

Depends on: Definition 8.4.4 Definition 8.4.33 Definition 8.4.52 Definition 8.4.59

Lean code for Definition8.4.42●8 declarations
  • defdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/Perfect.lean
    complete
    def ZLattice.IsPerfect.{u_1} {ι : Type u_1} [Fintype ι]
      (L : Submodule ℤ (EuclideanSpace ℝ ι)) : Prop
    def ZLattice.IsPerfect.{u_1} {ι : Type u_1}
      [Fintype ι]
      (L : Submodule ℤ (EuclideanSpace ℝ ι)) :
      Prop
    A lattice `L` in `ℝⁿ = EuclideanSpace ℝ ι` is **perfect** (LMFDB `lattice.perfect`) if every
    real symmetric matrix indexed by `ι` is a real linear combination of the matrices `x xᵀ`, where `x`
    ranges over the minimal vectors of `L` (`ZLattice.minimalVectors`); the matrices `x xᵀ` are
    symmetric, so they then span the space of symmetric matrices. 
  • defdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/MinimalVectors.lean
    complete
    def ZLattice.minimalVectors.{u_1} {E : Type u_1} [NormedAddCommGroup E]
      (L : Submodule ℤ E) : Set E
    def ZLattice.minimalVectors.{u_1}
      {E : Type u_1} [NormedAddCommGroup E]
      (L : Submodule ℤ E) : Set E
    The **minimal vectors** (LMFDB `lattice.minimal_vector`) of a lattice `L` in a real inner
    product space: the nonzero vectors of `L` of least norm `ZLattice.minimum L`. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/PerfectArithmetic.lean
    complete
    theorem ZLattice.IsPerfect.relIndex_span_minimalVectors_ne_zero.{u_1}
      {ι : Type u_1} [Fintype ι] {L : Submodule ℤ (EuclideanSpace ℝ ι)}
      (h : ZLattice.IsPerfect L) :
      (Submodule.span ℤ (ZLattice.minimalVectors L)).toAddSubgroup.relIndex
          L.toAddSubgroup ≠
        0
    theorem ZLattice.IsPerfect.relIndex_span_minimalVectors_ne_zero.{u_1}
      {ι : Type u_1} [Fintype ι]
      {L : Submodule ℤ (EuclideanSpace ℝ ι)}
      (h : ZLattice.IsPerfect L) :
      (Submodule.span ℤ
                (ZLattice.minimalVectors
                  L)).toAddSubgroup.relIndex
          L.toAddSubgroup ≠
        0
    **A perfect lattice is well-rounded** (LMFDB `lattice.perfect`, `lattice.well_rounded`): the
    sublattice spanned by the minimal vectors of a perfect lattice `L` has finite index in `L`. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/PerfectArithmetic.lean
    complete
    theorem ZLattice.IsPerfect.exists_isIntegralLattice_isSimilarLattice.{u_1}
      {ι : Type u_1} [Fintype ι] {L : Submodule ℤ (EuclideanSpace ℝ ι)}
      (h : ZLattice.IsPerfect L) :
      ∃ K,
        K.FG ∧
          DiscreteTopology ↥K ∧
            LinearMap.BilinForm.IsIntegralLattice
                (innerₗ (EuclideanSpace ℝ ι)) K ∧
              LinearMap.BilinForm.IsSimilarLattice
                (innerₗ (EuclideanSpace ℝ ι)) L
                (innerₗ (EuclideanSpace ℝ ι)) K
    theorem ZLattice.IsPerfect.exists_isIntegralLattice_isSimilarLattice.{u_1}
      {ι : Type u_1} [Fintype ι]
      {L : Submodule ℤ (EuclideanSpace ℝ ι)}
      (h : ZLattice.IsPerfect L) :
      ∃ K,
        K.FG ∧
          DiscreteTopology ↥K ∧
            LinearMap.BilinForm.IsIntegralLattice
                (innerₗ (EuclideanSpace ℝ ι))
                K ∧
              LinearMap.BilinForm.IsSimilarLattice
                (innerₗ (EuclideanSpace ℝ ι))
                L
                (innerₗ (EuclideanSpace ℝ ι))
                K
    **A perfect lattice is similar to an integral lattice** (LMFDB `lattice.perfect`,
    `lattice.arithmetic`, `lattice.similarity`): a perfect lattice `L` of `ℝⁿ` is similar to a lattice
    `K` of `ℝⁿ`, finitely generated and discrete, whose inner products are integers. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/PerfectArithmetic.lean
    complete
    theorem ZLattice.IsPerfect.eq_of_apply_self_eq.{u_1} {ι : Type u_1} [Fintype ι]
      {L : Submodule ℤ (EuclideanSpace ℝ ι)} (h : ZLattice.IsPerfect L)
      {B B' : LinearMap.BilinForm ℝ (EuclideanSpace ℝ ι)} (hB : B.IsSymm)
      (hB' : B'.IsSymm)
      (hS : ∀ x ∈ ZLattice.minimalVectors L, (B x) x = (B' x) x) : B = B'
    theorem ZLattice.IsPerfect.eq_of_apply_self_eq.{u_1}
      {ι : Type u_1} [Fintype ι]
      {L : Submodule ℤ (EuclideanSpace ℝ ι)}
      (h : ZLattice.IsPerfect L)
      {B B' :
        LinearMap.BilinForm ℝ
          (EuclideanSpace ℝ ι)}
      (hB : B.IsSymm) (hB' : B'.IsSymm)
      (hS :
        ∀ x ∈ ZLattice.minimalVectors L,
          (B x) x = (B' x) x) :
      B = B'
    **A symmetric bilinear form is determined by its values at the minimal vectors of a perfect
    lattice** (LMFDB `lattice.perfect`): if `L` is a perfect lattice of `ℝⁿ` and the symmetric bilinear
    forms `B` and `B'` on `ℝⁿ` satisfy `B(x, x) = B'(x, x)` for every minimal vector `x` of `L`, then
    `B = B'`. In a basis of `L`, the Gram matrix of `L` is the only symmetric matrix `A` with
    `aᵀ A a = m` for the coordinate vectors `a` of the minimal vectors, `m` being the minimal norm. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/PerfectArithmetic.lean
    complete
    theorem ZLattice.IsPerfect.isSimilarLattice_of_mapsTo.{u_1, u_2} {ι : Type u_1}
      [Fintype ι] {L : Submodule ℤ (EuclideanSpace ℝ ι)} {F : Type u_2}
      [NormedAddCommGroup F] [InnerProductSpace ℝ F] {M : Submodule ℤ F}
      (h : ZLattice.IsPerfect L) (ψ : EuclideanSpace ℝ ι ≃ₗ[ℝ] F)
      (hLM : Submodule.map (↑(LinearEquiv.restrictScalars ℤ ψ)) L = M)
      (hS :
        Set.MapsTo (⇑ψ) (ZLattice.minimalVectors L)
          (ZLattice.minimalVectors M)) :
      LinearMap.BilinForm.IsSimilarLattice (innerₗ (EuclideanSpace ℝ ι)) L
        (innerₗ F) M
    theorem ZLattice.IsPerfect.isSimilarLattice_of_mapsTo.{u_1,
        u_2}
      {ι : Type u_1} [Fintype ι]
      {L : Submodule ℤ (EuclideanSpace ℝ ι)}
      {F : Type u_2} [NormedAddCommGroup F]
      [InnerProductSpace ℝ F]
      {M : Submodule ℤ F}
      (h : ZLattice.IsPerfect L)
      (ψ : EuclideanSpace ℝ ι ≃ₗ[ℝ] F)
      (hLM :
        Submodule.map
            (↑(LinearEquiv.restrictScalars ℤ
                ψ))
            L =
          M)
      (hS :
        Set.MapsTo (⇑ψ)
          (ZLattice.minimalVectors L)
          (ZLattice.minimalVectors M)) :
      LinearMap.BilinForm.IsSimilarLattice
        (innerₗ (EuclideanSpace ℝ ι)) L
        (innerₗ F) M
    **A perfect lattice is determined up to similarity by its minimal vectors** (LMFDB
    `lattice.perfect`): if `L` is a perfect lattice of `ℝⁿ`, and a linear bijection `ψ` carries `L`
    onto a lattice `M` and the minimal vectors of `L` to minimal vectors of `M`, then `M` is similar to
    `L`; `ψ` is a similitude of ratio `m(M) / m(L)`, an isometry if the minima agree
    (`ZLattice.IsPerfect.inner_map_eq_of_mapsTo`). So the Gram matrix of `M` in the basis `ψ(bᵢ)` is
    the multiple by `(m(M) / m(L))²` of that of `L` in a basis `bᵢ`: the quadratic form of a perfect
    lattice is determined, up to scaling, by the coordinates of its minimal vectors. 
  • defdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/PerfectFinite.lean
    complete
    def ZLattice.perfectSimilaritySetoid.{u_1} (ι : Type u_1) [Fintype ι] :
      Setoid { L // ZLattice.IsPerfect L }
    def ZLattice.perfectSimilaritySetoid.{u_1}
      (ι : Type u_1) [Fintype ι] :
      Setoid { L // ZLattice.IsPerfect L }
    **Similarity of perfect lattices**: the equivalence relation of similarity (LMFDB
    `lattice.similarity`, `LinearMap.BilinForm.IsSimilarLattice`) on the perfect lattices of `ℝⁿ`
    (LMFDB `lattice.perfect`). Its classes are the similarity classes of perfect lattices of
    dimension `n`. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/PerfectFinite.lean
    complete
    theorem ZLattice.finite_quotient_perfectSimilaritySetoid.{u_1} {ι : Type u_1}
      [Fintype ι] : Finite (Quotient (ZLattice.perfectSimilaritySetoid ι))
    theorem ZLattice.finite_quotient_perfectSimilaritySetoid.{u_1}
      {ι : Type u_1} [Fintype ι] :
      Finite
        (Quotient
          (ZLattice.perfectSimilaritySetoid
            ι))
    **Voronoi's finiteness theorem** (LMFDB `lattice.perfect`): there are only finitely many
    similarity classes of perfect lattices of `ℝⁿ`, for every `n`. 
Definition8.4.43
uses 0used by 1✓L∃∀N

p-Neighbor of a lattice. (LMFDB)

Given an integral lattice L and a prime p, a p-neighbor of L is an integral lattice M such that

[L : L \cap M ] = [M : L \cap M ] = p.

We denote the p-neighborhood relation as L \sim_p M. This is a symmetric relation, but in general is not reflexive nor transitive. If two lattices are p-neighbors, then they lie in the same genus.

Tau Ceti Review: TauCeti.IntegralLattice.IsNeighbor, TauCeti.IntegralLattice.IsNeighbor.symm, TauCeti.IntegralLattice.isNeighbor_one_iff, TauCeti.IntegralLattice.IsNeighbor.sameGenus.

Lean code for Definition8.4.43●9 declarations
  • structure(3 fields)defined in TauCeti/LinearAlgebra/IntegralLattice/Neighbor/Basic.lean
    complete
    structure TauCeti.IntegralLattice.IsNeighbor.{u_1} {V : Type u_1} [AddCommGroup V]
      [Module ℚ V] (L M : TauCeti.IntegralLattice V) (p : ℕ) : Prop
    structure TauCeti.IntegralLattice.IsNeighbor.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L M : TauCeti.IntegralLattice V)
      (p : ℕ) : Prop
    **Kneser neighbors.** Integral lattices `L` and `M` on the same rational quadratic space are
    `p`-neighbors when their intersection has index `p` in each of them, that is
    `[L : L ∩ M] = [M : L ∩ M] = p`. 
    form_eq : L.form = M.form
    Neighbors carry the same rational form. 
    relIndex_inf_left : (L.carrier ⊓ M.carrier).toAddSubgroup.relIndex L.carrier.toAddSubgroup = p
    The intersection has index `p` in `L`. 
    relIndex_inf_right : (L.carrier ⊓ M.carrier).toAddSubgroup.relIndex M.carrier.toAddSubgroup = p
    The intersection has index `p` in `M`. 
  • theoremdefined in TauCeti/LinearAlgebra/IntegralLattice/Neighbor/Basic.lean
    complete
    theorem TauCeti.IntegralLattice.IsNeighbor.symm.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] {L M : TauCeti.IntegralLattice V}
      {p : ℕ} (h : L.IsNeighbor M p) : M.IsNeighbor L p
    theorem TauCeti.IntegralLattice.IsNeighbor.symm.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L M : TauCeti.IntegralLattice V}
      {p : ℕ} (h : L.IsNeighbor M p) :
      M.IsNeighbor L p
    The neighbor relation is symmetric. 
  • theoremdefined in TauCeti/LinearAlgebra/IntegralLattice/Neighbor/Basic.lean
    complete
    theorem TauCeti.IntegralLattice.isNeighbor_one_iff.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] {L M : TauCeti.IntegralLattice V} :
      L.IsNeighbor M 1 ↔ L = M
    theorem TauCeti.IntegralLattice.isNeighbor_one_iff.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L M : TauCeti.IntegralLattice V} :
      L.IsNeighbor M 1 ↔ L = M
    Two integral lattices are `1`-neighbors exactly when they are equal. 
  • theoremdefined in TauCeti/NumberTheory/IntegralLattice/Neighbor.lean
    complete
    theorem TauCeti.IntegralLattice.IsNeighbor.sameGenus.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] {L M : TauCeti.IntegralLattice V}
      {p : ℕ} (h : L.IsNeighbor M p)
      (hp : p.Coprime (2 * L.determinant.natAbs)) : L.SameGenus M
    theorem TauCeti.IntegralLattice.IsNeighbor.sameGenus.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L M : TauCeti.IntegralLattice V}
      {p : ℕ} (h : L.IsNeighbor M p)
      (hp :
        p.Coprime
          (2 * L.determinant.natAbs)) :
      L.SameGenus M
    **Kneser neighbors lie in one genus.** If `L` and `M` are `p`-neighbors and `p` is coprime
    to `2 det L`, then `L` and `M` have the same genus. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Neighbor.lean
    complete
    theorem TauCeti.IntegralLattice.isNeighbor_self_iff.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] {L : TauCeti.IntegralLattice V}
      {p : ℕ} : L.IsNeighbor L p ↔ p = 1
    theorem TauCeti.IntegralLattice.isNeighbor_self_iff.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      {p : ℕ} : L.IsNeighbor L p ↔ p = 1
    **A lattice is its own `p`-neighbour only for `p = 1`** (LMFDB `lattice.pneighbor`): `L ∩ L = L`
    has index `1` in `L`. So for `p ≠ 1` no lattice is its own `p`-neighbour. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Neighbor.lean
    complete
    theorem TauCeti.IntegralLattice.not_refl_isNeighbor {p : ℕ} (hp : p ≠ 1) :
      ¬Std.Refl fun M N => M.IsNeighbor N p
    theorem TauCeti.IntegralLattice.not_refl_isNeighbor
      {p : ℕ} (hp : p ≠ 1) :
      ¬Std.Refl fun M N => M.IsNeighbor N p
    **The `p`-neighbour relation is not reflexive for `p ≠ 1`** (LMFDB `lattice.pneighbor`): the
    hyperbolic plane is not its own `p`-neighbour. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Neighbor.lean
    complete
    def TauCeti.IntegralLattice.hyperbolicPlaneNeighbor (p : ℕ) [NeZero p] :
      TauCeti.IntegralLattice (Fin 2 → ℚ)
    def TauCeti.IntegralLattice.hyperbolicPlaneNeighbor
      (p : ℕ) [NeZero p] :
      TauCeti.IntegralLattice (Fin 2 → ℚ)
    The `p`-neighbour `ℤ(pe₀) ⊕ ℤ(e₁/p)` of the hyperbolic plane (LMFDB `lattice.pneighbor`), for
    `p ≠ 0`: the lattice of `ℚ²` spanned by `pe₀` and `e₁/p`, with the form `x₀y₁ + x₁y₀` of Tau Ceti's
    `TauCeti.IntegralLattice.hyperbolicPlane`, which is integral on it since its value on `pe₀` and
    `e₁/p` is `1`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Neighbor.lean
    complete
    theorem TauCeti.IntegralLattice.isNeighbor_hyperbolicPlaneNeighbor (p : ℕ)
      [NeZero p] :
      TauCeti.IntegralLattice.hyperbolicPlane.IsNeighbor
        (TauCeti.IntegralLattice.hyperbolicPlaneNeighbor p) p
    theorem TauCeti.IntegralLattice.isNeighbor_hyperbolicPlaneNeighbor
      (p : ℕ) [NeZero p] :
      TauCeti.IntegralLattice.hyperbolicPlane.IsNeighbor
        (TauCeti.IntegralLattice.hyperbolicPlaneNeighbor
          p)
        p
    **The hyperbolic plane and `ℤ(pe₀) ⊕ ℤ(e₁/p)` are `p`-neighbours** (LMFDB `lattice.pneighbor`),
    for every `p ≠ 0`: their intersection `ℤ(pe₀) ⊕ ℤe₁` has index `p` in both. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Neighbor.lean
    complete
    theorem TauCeti.IntegralLattice.not_isTrans_isNeighbor {p : ℕ} [NeZero p]
      (hp : p ≠ 1) :
      ¬IsTrans (TauCeti.IntegralLattice (Fin 2 → ℚ)) fun M N =>
          M.IsNeighbor N p
    theorem TauCeti.IntegralLattice.not_isTrans_isNeighbor
      {p : ℕ} [NeZero p] (hp : p ≠ 1) :
      ¬IsTrans
          (TauCeti.IntegralLattice
            (Fin 2 → ℚ))
          fun M N => M.IsNeighbor N p
    **The `p`-neighbour relation is not transitive for `p ≠ 0, 1`** (LMFDB `lattice.pneighbor`):
    the hyperbolic plane `L` and `M = ℤ(pe₀) ⊕ ℤ(e₁/p)` satisfy `L ∼_p M` and `M ∼_p L`, but not
    `L ∼_p L`. For `p = 0` the relation is empty, and for `p = 1` it is equality. 
Definition8.4.44
Statement uses 5
Statement dependency previews
Preview
Definition 8.4.6
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

p-Neighbor adjacency matrix of a lattice. (LMFDB)

Let \mathcal{G} be a genus of integral lattices, with class number h and with representatives \{L_1, L_2, \dots, L_h\}. The p-neighbor adjacency graph of \mathcal{G} is the weighted directed graph with h vertices \{L_1, L_2, \dots, L_h\}, and with a directed edge from L_i to L_j, where the edge weight is the number of p-neighbors of L_i which are isometric to L_j.

The p-neighbor adjacency matrix is the adjacency matrix of the p-neighbor adjacency graph. In general, the p-neighbor adjacency matrix does not need to be symmetric, and can contain self-edges.

Depends on: Definition 8.4.6 Definition 8.4.9 Definition 8.4.21 Definition 8.4.28 Definition 8.4.43

Definition8.4.45
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 8
Reverse dependency previews
Preview
Definition 8.4.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Positive definite lattice. (LMFDB)

An integral lattice L is positive definite if the Gram matrix of the bilinear form B on L is a positive definite matrix. This is equivalent to the condition that B(u,u)>0 for all u \in L \setminus\{0\}.

The signature of a rank n positive definite integral lattice is (n, 0).

Tau Ceti Review: TauCeti.IntegralLattice.IsPosDef, QuadraticMap.PosDef, Matrix.PosDef.

Depends on: Definition 8.4.9 Definition 8.4.23

Lean code for Definition8.4.45●3 definitions
  • abbrevdefined in TauCeti/LinearAlgebra/IntegralLattice/Signature.lean
    complete
    abbrev TauCeti.IntegralLattice.IsPosDef.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    abbrev TauCeti.IntegralLattice.IsPosDef.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    An integral lattice is positive-definite when its quadratic form is positive on every nonzero
    vector. 
  • defdefined in Mathlib/LinearAlgebra/QuadraticForm/Basic.lean
    complete
    def QuadraticMap.PosDef.{u, u_4, u_5} {M : Type u_4} {N : Type u_5}
      {R₂ : Type u} [CommSemiring R₂] [AddCommMonoid M] [Module R₂ M]
      [PartialOrder N] [AddCommMonoid N] [Module R₂ N]
      (Q₂ : QuadraticMap R₂ M N) : Prop
    def QuadraticMap.PosDef.{u, u_4, u_5}
      {M : Type u_4} {N : Type u_5}
      {R₂ : Type u} [CommSemiring R₂]
      [AddCommMonoid M] [Module R₂ M]
      [PartialOrder N] [AddCommMonoid N]
      [Module R₂ N]
      (Q₂ : QuadraticMap R₂ M N) : Prop
    A positive definite quadratic form is positive on nonzero vectors. 
  • defdefined in Mathlib/LinearAlgebra/Matrix/PosDef.lean
    complete
    def Matrix.PosDef.{u_2, u_3} {n : Type u_2} {R : Type u_3} [Ring R]
      [PartialOrder R] [StarRing R] (M : Matrix n n R) : Prop
    def Matrix.PosDef.{u_2, u_3} {n : Type u_2}
      {R : Type u_3} [Ring R] [PartialOrder R]
      [StarRing R] (M : Matrix n n R) : Prop
    A matrix `M : Matrix n n R` is positive definite if it is Hermitian
    and `xᴴMx` is greater than zero for all nonzero `x`. 
Definition8.4.46
Statement uses 3
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1✓L∃∀N

Positive definite lattice. (LMFDB)

An integral lattice L is positive definite if the Gram matrix of the bilinear form B on L is a positive definite matrix. This is equivalent to the condition that B(u,u)>0 for all u \in L \setminus\{0\}.

The signature of a rank n positive definite integral lattice is (n, 0).

Tau Ceti Review: TauCeti.IntegralLattice.IsPosDef, QuadraticMap.PosDef, Matrix.PosDef.

Depends on: Definition 8.4.9 Definition 8.4.23 Definition 8.4.51

Lean code for Definition8.4.46●3 definitions
  • abbrevdefined in TauCeti/LinearAlgebra/IntegralLattice/Signature.lean
    complete
    abbrev TauCeti.IntegralLattice.IsPosDef.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    abbrev TauCeti.IntegralLattice.IsPosDef.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    An integral lattice is positive-definite when its quadratic form is positive on every nonzero
    vector. 
  • defdefined in Mathlib/LinearAlgebra/QuadraticForm/Basic.lean
    complete
    def QuadraticMap.PosDef.{u, u_4, u_5} {M : Type u_4} {N : Type u_5}
      {R₂ : Type u} [CommSemiring R₂] [AddCommMonoid M] [Module R₂ M]
      [PartialOrder N] [AddCommMonoid N] [Module R₂ N]
      (Q₂ : QuadraticMap R₂ M N) : Prop
    def QuadraticMap.PosDef.{u, u_4, u_5}
      {M : Type u_4} {N : Type u_5}
      {R₂ : Type u} [CommSemiring R₂]
      [AddCommMonoid M] [Module R₂ M]
      [PartialOrder N] [AddCommMonoid N]
      [Module R₂ N]
      (Q₂ : QuadraticMap R₂ M N) : Prop
    A positive definite quadratic form is positive on nonzero vectors. 
  • defdefined in Mathlib/LinearAlgebra/Matrix/PosDef.lean
    complete
    def Matrix.PosDef.{u_2, u_3} {n : Type u_2} {R : Type u_3} [Ring R]
      [PartialOrder R] [StarRing R] (M : Matrix n n R) : Prop
    def Matrix.PosDef.{u_2, u_3} {n : Type u_2}
      {R : Type u_3} [Ring R] [PartialOrder R]
      [StarRing R] (M : Matrix n n R) : Prop
    A matrix `M : Matrix n n R` is positive definite if it is Hermitian
    and `xᴴMx` is greater than zero for all nonzero `x`. 
Definition8.4.47
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.15
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Primitive integral lattice. (LMFDB)

An integral lattice, L, with an associated Gram matrix, G=[g_{ij}], is called primitive if \gcd(\{g_{ij}:1\leq i\leq n,i\leq j\leq n\})=1.

Tau Ceti Review: LinearMap.BilinForm.scaleIdeal, TauCeti.IntegralLattice.scaleIdeal.

Depends on: Definition 8.4.9 Definition 8.4.23

Lean code for Definition8.4.47●2 definitions
  • defdefined in TauCeti/LinearAlgebra/BilinearForm/Ideals.lean
    complete
    def LinearMap.BilinForm.scaleIdeal.{u_1, u_2} {R : Type u_1} {M : Type u_2}
      [CommSemiring R] [AddCommMonoid M] [Module R M]
      (B : LinearMap.BilinForm R M) : Ideal R
    def LinearMap.BilinForm.scaleIdeal.{u_1, u_2}
      {R : Type u_1} {M : Type u_2}
      [CommSemiring R] [AddCommMonoid M]
      [Module R M]
      (B : LinearMap.BilinForm R M) : Ideal R
    The ideal generated by the values of a bilinear form. 
  • abbrevdefined in TauCeti/LinearAlgebra/IntegralLattice/Ideals.lean
    complete
    abbrev TauCeti.IntegralLattice.scaleIdeal.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : Ideal ℤ
    abbrev TauCeti.IntegralLattice.scaleIdeal.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Ideal ℤ
    The scale ideal of the integral form of a lattice. 
Definition8.4.48
Statement uses 3
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.13
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Quadratic form of a lattice. (LMFDB)

Given an integral lattice L with Gram matrix G, the quadratic form of L is the function on L \otimes \mathbb{Q} defined by

Q(\mathbf{v}) = \langle \mathbf{v},\mathbf{v}\rangle = \mathbf{v}^{\mathrm{T}}G\mathbf{v}.

We will refer to the value Q(v) as the norm of v. By construction, Q(L) \subseteq \mathbb{Z}, and we say that Q or L is universal if Q(L) = \mathbb{Z}. An even lattice can never be universal since Q(L) \subseteq 2\mathbb{Z}; we say that L is even universal if Q(L) \supseteq 2\mathbb{Z}.

Tau Ceti Review: TauCeti.IntegralLattice.norm, TauCeti.IntegralLattice.integralNorm.

Depends on: Definition 8.4.9 Definition 8.4.23 Definition 8.4.41

Lean code for Definition8.4.48●5 declarations
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Norm.lean
    complete
    def TauCeti.IntegralLattice.norm.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : QuadraticForm ℚ V
    def TauCeti.IntegralLattice.norm.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      QuadraticForm ℚ V
    The rational quadratic form on ambient vectors given by self-pairing. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Norm.lean
    complete
    def TauCeti.IntegralLattice.integralNorm.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      QuadraticForm ℤ ↥L.carrier
    def TauCeti.IntegralLattice.integralNorm.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      QuadraticForm ℤ ↥L.carrier
    The canonical integer quadratic form induced on the lattice carrier. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Universal.lean
    complete
    def TauCeti.IntegralLattice.IsUniversal.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    def TauCeti.IntegralLattice.IsUniversal.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    An integral lattice `L` is **universal** (LMFDB `lattice.quadratic_form`) if its quadratic form
    `Q` satisfies `Q(L) = ℤ`, read with the sign of `Q`: `Q` represents every positive integer, and
    every negative integer as well if `L` has a vector of negative norm. For a positive semidefinite
    lattice, for which the literal condition `Q(L) = ℤ` cannot hold, this is the classical universality
    `Q(L) = ℤ_{≥0}` (`isUniversal_iff_range_eq_Ici`), and otherwise it is the literal `Q(L) = ℤ`
    (`isUniversal_iff_range_eq_univ`), which a negative definite lattice never satisfies. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Universal.lean
    complete
    def TauCeti.IntegralLattice.IsEvenUniversal.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    def TauCeti.IntegralLattice.IsEvenUniversal.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    An integral lattice `L` is **even universal** (LMFDB `lattice.quadratic_form`) if its quadratic
    form `Q` satisfies `Q(L) ⊇ 2ℤ`, read with the sign of `Q` as for `IsUniversal`: `Q` represents
    every positive even integer, and every negative even integer as well if `L` has a vector of
    negative norm. For a positive semidefinite lattice this is `Q(L) ⊇ 2ℤ_{≥0}`, and otherwise it is
    `Q(L) ⊇ 2ℤ` (`isEvenUniversal_iff_subset_range`, `isEvenUniversal_iff_subset_range_of_exists`). 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Universal.lean
    complete
    theorem TauCeti.IntegralLattice.isUniversal_iff_range_eq_Ici.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      {L : TauCeti.IntegralLattice V} (hL : L.IsPosSemidef) :
      L.IsUniversal ↔ Set.range ⇑L.integralNorm = Set.Ici 0
    theorem TauCeti.IntegralLattice.isUniversal_iff_range_eq_Ici.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      (hL : L.IsPosSemidef) :
      L.IsUniversal ↔
        Set.range ⇑L.integralNorm = Set.Ici 0
    **A positive semidefinite lattice is universal exactly when `Q(L) = ℤ_{≥0}`.** 
Definition8.4.49
uses 1used by 1XL∃∀N

Root lattice. (LMFDB)

A root system is a finite set \Phi of nonzero vectors (called roots) in a Euclidean space E satisfying the following conditions.

  • The roots span E.

  • For \alpha \in \Phi, the only scalar multiples of \alpha in E are \pm \alpha.

  • For \alpha, \beta \in \Phi, the quantity 2 \frac{\alpha \cdot \beta}{\alpha \cdot \alpha} is an integer.

  • For \alpha,\beta \in \Phi, we have \beta - 2 \frac{\alpha \cdot \beta}{\alpha \cdot \alpha} \alpha \in \Phi. That is, \Phi is stable under the reflection through the hyperplane perpendicular to \alpha.

The lattice generated by \Phi is a root lattice.

The product of two root systems is again a root system. Root systems which are irreducible for this product are classified by Dynkin diagrams, which have standard names (where the subscript is always the dimension of the lattice):

A_n \,(n \geq 1), \,B_n \,(n \geq 2), \,C_n\, (n \geq 3), \,D_n \,(n \geq 4), \,E_6,\, E_7, \,E_8, \,F_4,\, G_2.

Some small indices are omitted due to exceptional equalities:

B_1 = A_1, \,C_2 = B_2, \,D_3 = A_3.

In addition, in some cases multiple root systems generate the same lattice. The names used for root lattices are:

A_n \,(n \geq 1), \,D_n \,(n \geq 4), \,E_6, \,E_7, \,E_8.

For any root system, the reflections in the hyperplanes orthogonal to the roots generate a finite group, called the Weyl group. The Weyl group is a subgroup of the automorphism group of the root lattice.

Depends on: Definition 8.4.5

Definition8.4.50
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Root sublattice. (LMFDB)

The root sublattice of a positive definite integral lattice L is the sublattice of L spanned by vectors of length at most equal to 2.

A positive definite integral lattice L is called a root lattice if it is equal to its root sublattice.

Tau Ceti Review: TauCeti.IntegralLattice.restrict.

Depends on: Definition 8.4.9 Definition 8.4.45

Lean code for Definition8.4.50●5 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RootSublattice.lean
    complete
    def TauCeti.IntegralLattice.rootSubmodule.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      Submodule ℤ ↥L.carrier
    def TauCeti.IntegralLattice.rootSubmodule.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Submodule ℤ ↥L.carrier
    The **root sublattice** (LMFDB `lattice.root_sublattice`) of an integral lattice `L`: the
    submodule of its carrier generated by the vectors of norm `1` and `2`. For a positive definite
    lattice this is the span of the vectors of norm at most `2` (`IsPosDef.rootSubmodule_eq_span`), as
    in the LMFDB, which only defines it for positive definite lattices. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RootSublattice.lean
    complete
    def TauCeti.IntegralLattice.IsRootLattice.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    def TauCeti.IntegralLattice.IsRootLattice.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    A **root lattice** (LMFDB `lattice.root_sublattice`): a positive definite integral lattice
    equal to its root sublattice, that is generated by its vectors of norm `1` and `2`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RootSublattice.lean
    complete
    theorem TauCeti.IntegralLattice.IsPosDef.rootSubmodule_eq_span.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      {L : TauCeti.IntegralLattice V} (hL : L.IsPosDef) :
      L.rootSubmodule = Submodule.span ℤ {x | L.integralNorm x ≤ 2}
    theorem TauCeti.IntegralLattice.IsPosDef.rootSubmodule_eq_span.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      {L : TauCeti.IntegralLattice V}
      (hL : L.IsPosDef) :
      L.rootSubmodule =
        Submodule.span ℤ
          {x | L.integralNorm x ≤ 2}
    **The root sublattice of a positive definite lattice is spanned by its vectors of norm at most
    `2`**, as in LMFDB `lattice.root_sublattice`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/RootSublattice.lean
    complete
    theorem TauCeti.IntegralLattice.isRootLattice_typeARootLattice (n : ℕ) :
      (TauCeti.IntegralLattice.typeARootLattice n).IsRootLattice
    theorem TauCeti.IntegralLattice.isRootLattice_typeARootLattice
      (n : ℕ) :
      (TauCeti.IntegralLattice.typeARootLattice
          n).IsRootLattice
    **The lattice `Aₙ` is a root lattice**: it is generated by its simple roots, of norm `2`. 
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Restriction.lean
    complete
    def TauCeti.IntegralLattice.restrict.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V)
      (S : Submodule ℤ ↥L.carrier) :
      TauCeti.IntegralLattice (TensorProduct ℤ ℚ ↥S)
    def TauCeti.IntegralLattice.restrict.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      (S : Submodule ℤ ↥L.carrier) :
      TauCeti.IntegralLattice
        (TensorProduct ℤ ℚ ↥S)
    Restrict a lattice to an arbitrary submodule of its carrier, in that submodule's own rational
    ambient space. Every such submodule is finite free over `ℤ`. 
Definition8.4.51
Statement uses 4
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 4
Reverse dependency previews
Preview
Definition 8.4.7
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Signature of an integral lattice. (LMFDB)

For a nondegenerate integral lattice L, the signature of L is a pair (n_+, n_-), where n_+ (resp. n_-) is the number of positive (resp. negative) eigenvalues of a Gram matrix for L. Note that the signature of a degenerate lattice has an extra component n_0 for the number of 0 eigenvalues. The signature classifies lattices up to isometry over the real numbers.

If L has signature (n,0) we say it is positive definite; if it has signature (0,n) we say it is negative definite; otherwise we say it is indefinite.

Tau Ceti Review: TauCeti.IntegralLattice.signature.

Depends on: Definition 8.4.9 Definition 8.4.23 Definition 8.4.36 Definition 8.4.45

Lean code for Definition8.4.51●6 declarations
  • abbrevdefined in TauCeti/LinearAlgebra/IntegralLattice/Signature.lean
    complete
    abbrev TauCeti.IntegralLattice.signature.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : ℕ × ℕ × ℕ
    abbrev TauCeti.IntegralLattice.signature.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      ℕ × ℕ × ℕ
    The signature `(n₊, n₀, n₋)` of an integral lattice. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/SignatureEigenvalues.lean
    complete
    theorem TauCeti.IntegralLattice.sigPos_eq_ncard_eigenvalues_pos.{u_1, u_2}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) {ι : Type u_2}
      (e : Module.Basis ι ℤ ↥L.carrier) [Fintype ι] [DecidableEq ι] :
      L.sigPos = {i | 0 < ⋯.eigenvalues i}.ncard
    theorem TauCeti.IntegralLattice.sigPos_eq_ncard_eigenvalues_pos.{u_1,
        u_2}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      {ι : Type u_2}
      (e : Module.Basis ι ℤ ↥L.carrier)
      [Fintype ι] [DecidableEq ι] :
      L.sigPos =
        {i | 0 < ⋯.eigenvalues i}.ncard
    **The positive index `n₊` of an integral lattice is the number of positive eigenvalues of its
    Gram matrix** (LMFDB `lattice.signature`, `lattice.nondegenerate`) in any basis, counted with
    multiplicity. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/SignatureEigenvalues.lean
    complete
    theorem TauCeti.IntegralLattice.sigNeg_eq_ncard_eigenvalues_neg.{u_1, u_2}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) {ι : Type u_2}
      (e : Module.Basis ι ℤ ↥L.carrier) [Fintype ι] [DecidableEq ι] :
      L.sigNeg = {i | ⋯.eigenvalues i < 0}.ncard
    theorem TauCeti.IntegralLattice.sigNeg_eq_ncard_eigenvalues_neg.{u_1,
        u_2}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      {ι : Type u_2}
      (e : Module.Basis ι ℤ ↥L.carrier)
      [Fintype ι] [DecidableEq ι] :
      L.sigNeg =
        {i | ⋯.eigenvalues i < 0}.ncard
    **The negative index `n₋` of an integral lattice is the number of negative eigenvalues of its
    Gram matrix** (LMFDB `lattice.signature`, `lattice.nondegenerate`) in any basis, counted with
    multiplicity. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/SignatureEigenvalues.lean
    complete
    theorem TauCeti.IntegralLattice.equivalent_atRealPlace_iff.{u_1, u_3}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) {W : Type u_3} [AddCommGroup W]
      [Module ℚ W] (M : TauCeti.IntegralLattice W) (w : { w // w.IsReal })
      [L.IsNondegenerate] [M.IsNondegenerate] :
      QuadraticMap.Equivalent
          (QuadraticForm.atRealPlace
            (LinearMap.BilinMap.toQuadraticMap L.form) w)
          (QuadraticForm.atRealPlace
            (LinearMap.BilinMap.toQuadraticMap M.form) w) ↔
        (L.sigPos, L.sigNeg) = (M.sigPos, M.sigNeg)
    theorem TauCeti.IntegralLattice.equivalent_atRealPlace_iff.{u_1,
        u_3}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      {W : Type u_3} [AddCommGroup W]
      [Module ℚ W]
      (M : TauCeti.IntegralLattice W)
      (w : { w // w.IsReal })
      [L.IsNondegenerate]
      [M.IsNondegenerate] :
      QuadraticMap.Equivalent
          (QuadraticForm.atRealPlace
            (LinearMap.BilinMap.toQuadraticMap
              L.form)
            w)
          (QuadraticForm.atRealPlace
            (LinearMap.BilinMap.toQuadraticMap
              M.form)
            w) ↔
        (L.sigPos, L.sigNeg) =
          (M.sigPos, M.sigNeg)
    **The signature classifies nondegenerate integral lattices up to isometry over the real
    numbers** (LMFDB `lattice.signature`): `ℝ ⊗ L` and `ℝ ⊗ M` are isometric exactly when `L` and `M`
    have the same signature `(n₊, n₋)`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/SignatureEigenvalues.lean
    complete
    theorem TauCeti.IntegralLattice.isNegDef_iff_signature_eq.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] :
      L.IsNegDef ↔ (L.sigPos, L.sigNeg) = (0, Module.finrank ℚ V)
    theorem TauCeti.IntegralLattice.isNegDef_iff_signature_eq.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] :
      L.IsNegDef ↔
        (L.sigPos, L.sigNeg) =
          (0, Module.finrank ℚ V)
    **A nondegenerate integral lattice of rank `n` is negative definite exactly when its signature
    is `(0, n)`** (LMFDB `lattice.signature`). 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/SignatureEigenvalues.lean
    complete
    theorem TauCeti.IntegralLattice.isIndefinite_iff_signature_ne.{u_1}
      {V : Type u_1} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) [L.IsNondegenerate] :
      L.IsIndefinite ↔
        (L.sigPos, L.sigNeg) ≠ (Module.finrank ℚ V, 0) ∧
          (L.sigPos, L.sigNeg) ≠ (0, Module.finrank ℚ V)
    theorem TauCeti.IntegralLattice.isIndefinite_iff_signature_ne.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] :
      L.IsIndefinite ↔
        (L.sigPos, L.sigNeg) ≠
            (Module.finrank ℚ V, 0) ∧
          (L.sigPos, L.sigNeg) ≠
            (0, Module.finrank ℚ V)
    **A nondegenerate integral lattice of rank `n` is indefinite exactly when its signature is
    neither `(n, 0)` nor `(0, n)`** (LMFDB `lattice.signature`). 
Definition8.4.52
Statement uses 4
Statement dependency previews
Preview
Definition 8.4.10
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 3
Reverse dependency previews
Preview
Definition 8.4.4
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

Similarity of lattices. (LMFDB)

Lattices L and M are called similar if there exists a real constant \alpha so that L is isometric to \alpha M. Key properties of lattices, such as well-roundedness, eutaxy, perfection, packing density are preserved on similarity classes. Each similarity class that contains an integer lattice contains a unique primitive integer lattice.

Depends on: Definition 8.4.10 Definition 8.4.28 Definition 8.4.47 Definition 8.4.59

Lean code for Definition8.4.52●10 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Similarity.lean
    complete
    def TauCeti.IntegralLattice.IsSimilar.{u_1, u_2} {V : Type u_1}
      {W : Type u_2} [AddCommGroup V] [Module ℚ V] [AddCommGroup W]
      [Module ℚ W] (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) : Prop
    def TauCeti.IntegralLattice.IsSimilar.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) : Prop
    Integral lattices `L` and `M` are **similar** (LMFDB `lattice.similarity`) if `L` is isometric
    to `αM` for a real constant `α ≠ 0`: some rational linear equivalence `e` of the ambient spaces
    carries the carrier of `L` onto that of `M` and satisfies `B_M(e x, e y) = c B_L(x, y)` for a
    positive rational constant `c`, which is `α⁻²`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Similarity.lean
    complete
    theorem TauCeti.IntegralLattice.IsSimilar.symm.{u_1, u_2} {V : Type u_1}
      {W : Type u_2} [AddCommGroup V] [Module ℚ V] [AddCommGroup W]
      [Module ℚ W] {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W} (h : L.IsSimilar M) : M.IsSimilar L
    theorem TauCeti.IntegralLattice.IsSimilar.symm.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W}
      (h : L.IsSimilar M) : M.IsSimilar L
    **Similarity is symmetric.** 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Similarity.lean
    complete
    theorem TauCeti.IntegralLattice.IsSimilar.trans.{u_1, u_2, u_3} {V : Type u_1}
      {W : Type u_2} {U : Type u_3} [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W] [AddCommGroup U] [Module ℚ U]
      {L : TauCeti.IntegralLattice V} {M : TauCeti.IntegralLattice W}
      {N : TauCeti.IntegralLattice U} (h : L.IsSimilar M)
      (h' : M.IsSimilar N) : L.IsSimilar N
    theorem TauCeti.IntegralLattice.IsSimilar.trans.{u_1,
        u_2, u_3}
      {V : Type u_1} {W : Type u_2}
      {U : Type u_3} [AddCommGroup V]
      [Module ℚ V] [AddCommGroup W]
      [Module ℚ W] [AddCommGroup U]
      [Module ℚ U]
      {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W}
      {N : TauCeti.IntegralLattice U}
      (h : L.IsSimilar M)
      (h' : M.IsSimilar N) : L.IsSimilar N
    **Similarity is transitive.** 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/Similarity.lean
    complete
    theorem TauCeti.IntegralLattice.Isometry.isSimilar.{u_1, u_2} {V : Type u_1}
      {W : Type u_2} [AddCommGroup V] [Module ℚ V] [AddCommGroup W]
      [Module ℚ W] {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W} (e : L.Isometry M) : L.IsSimilar M
    theorem TauCeti.IntegralLattice.Isometry.isSimilar.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      {L : TauCeti.IntegralLattice V}
      {M : TauCeti.IntegralLattice W}
      (e : L.Isometry M) : L.IsSimilar M
    **Isometric lattices are similar.** 
  • defdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/ArithmeticBilinear.lean
    complete
    def LinearMap.BilinForm.IsSimilarLattice.{u_1, u_2} {V : Type u_1}
      {W : Type u_2} [AddCommGroup V] [Module ℝ V] [AddCommGroup W]
      [Module ℝ W] (B : LinearMap.BilinForm ℝ V) (L : Submodule ℤ V)
      (B' : LinearMap.BilinForm ℝ W) (M : Submodule ℤ W) : Prop
    def LinearMap.BilinForm.IsSimilarLattice.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℝ V]
      [AddCommGroup W] [Module ℝ W]
      (B : LinearMap.BilinForm ℝ V)
      (L : Submodule ℤ V)
      (B' : LinearMap.BilinForm ℝ W)
      (M : Submodule ℤ W) : Prop
    A lattice `L` in a real quadratic space `(V, B)` is **similar** (LMFDB `lattice.similarity`) to
    a lattice `M` in `(W, B')` if `L` is isometric to `αM` for a real constant `α ≠ 0`: some `ℤ`-linear
    bijection `e : L → αM` satisfies `B'(e x, e y) = B(x, y)` (LMFDB `lattice.isometry` asks for
    `Q(e x) = Q(x)`, the same for a linear bijection, `B` being recovered from `Q` by polarisation). 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/SimilarityInvariant.lean
    complete
    theorem LinearMap.BilinForm.IsSimilarLattice.relIndex_span_minimalVectors_eq.{u_1,
        u_2}
      {E : Type u_1} {F : Type u_2} [NormedAddCommGroup E]
      [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [NormedAddCommGroup F]
      [InnerProductSpace ℝ F] [FiniteDimensional ℝ F] {L : Submodule ℤ E}
      {M : Submodule ℤ F} [DiscreteTopology ↥L] [IsZLattice ℝ L]
      [DiscreteTopology ↥M] [IsZLattice ℝ M]
      (h : LinearMap.BilinForm.IsSimilarLattice (innerₗ E) L (innerₗ F) M) :
      (Submodule.span ℤ (ZLattice.minimalVectors M)).toAddSubgroup.relIndex
          M.toAddSubgroup =
        (Submodule.span ℤ
                (ZLattice.minimalVectors L)).toAddSubgroup.relIndex
          L.toAddSubgroup
    theorem LinearMap.BilinForm.IsSimilarLattice.relIndex_span_minimalVectors_eq.{u_1,
        u_2}
      {E : Type u_1} {F : Type u_2}
      [NormedAddCommGroup E]
      [InnerProductSpace ℝ E]
      [FiniteDimensional ℝ E]
      [NormedAddCommGroup F]
      [InnerProductSpace ℝ F]
      [FiniteDimensional ℝ F]
      {L : Submodule ℤ E} {M : Submodule ℤ F}
      [DiscreteTopology ↥L] [IsZLattice ℝ L]
      [DiscreteTopology ↥M] [IsZLattice ℝ M]
      (h :
        LinearMap.BilinForm.IsSimilarLattice
          (innerₗ E) L (innerₗ F) M) :
      (Submodule.span ℤ
                (ZLattice.minimalVectors
                  M)).toAddSubgroup.relIndex
          M.toAddSubgroup =
        (Submodule.span ℤ
                (ZLattice.minimalVectors
                  L)).toAddSubgroup.relIndex
          L.toAddSubgroup
    **The index of the sublattice spanned by the minimal vectors is a similarity invariant**
    (LMFDB `lattice.similarity`): similar lattices `L` and `M` of full rank in real inner product
    spaces have `[L : ⟨S(L)⟩] = [M : ⟨S(M)⟩]`, `S` the set of minimal vectors. So similarity preserves
    well-roundedness (LMFDB `lattice.well_rounded`: finite index) and generation by minimal vectors
    (index `1`). 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/SimilarityInvariant.lean
    complete
    theorem LinearMap.BilinForm.IsSimilarLattice.isEutactic_iff.{u_1, u_2}
      {E : Type u_1} {F : Type u_2} [NormedAddCommGroup E]
      [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [NormedAddCommGroup F]
      [InnerProductSpace ℝ F] [FiniteDimensional ℝ F] {L : Submodule ℤ E}
      {M : Submodule ℤ F} [DiscreteTopology ↥L] [IsZLattice ℝ L]
      [DiscreteTopology ↥M] [IsZLattice ℝ M]
      (h : LinearMap.BilinForm.IsSimilarLattice (innerₗ E) L (innerₗ F) M) :
      ZLattice.IsEutactic L ↔ ZLattice.IsEutactic M
    theorem LinearMap.BilinForm.IsSimilarLattice.isEutactic_iff.{u_1,
        u_2}
      {E : Type u_1} {F : Type u_2}
      [NormedAddCommGroup E]
      [InnerProductSpace ℝ E]
      [FiniteDimensional ℝ E]
      [NormedAddCommGroup F]
      [InnerProductSpace ℝ F]
      [FiniteDimensional ℝ F]
      {L : Submodule ℤ E} {M : Submodule ℤ F}
      [DiscreteTopology ↥L] [IsZLattice ℝ L]
      [DiscreteTopology ↥M] [IsZLattice ℝ M]
      (h :
        LinearMap.BilinForm.IsSimilarLattice
          (innerₗ E) L (innerₗ F) M) :
      ZLattice.IsEutactic L ↔
        ZLattice.IsEutactic M
    **Eutaxy is a similarity invariant** (LMFDB `lattice.similarity`, `lattice.eutactic`): of two
    similar lattices of full rank in real inner product spaces, one is eutactic exactly when the other
    is. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/SimilarityInvariant.lean
    complete
    theorem LinearMap.BilinForm.IsSimilarLattice.isPerfect_iff.{u_1} {ι : Type u_1}
      [Fintype ι] {L M : Submodule ℤ (EuclideanSpace ℝ ι)}
      [DiscreteTopology ↥L] [IsZLattice ℝ L] [DiscreteTopology ↥M]
      [IsZLattice ℝ M]
      (h :
        LinearMap.BilinForm.IsSimilarLattice (innerₗ (EuclideanSpace ℝ ι)) L
          (innerₗ (EuclideanSpace ℝ ι)) M) :
      ZLattice.IsPerfect L ↔ ZLattice.IsPerfect M
    theorem LinearMap.BilinForm.IsSimilarLattice.isPerfect_iff.{u_1}
      {ι : Type u_1} [Fintype ι]
      {L M : Submodule ℤ (EuclideanSpace ℝ ι)}
      [DiscreteTopology ↥L] [IsZLattice ℝ L]
      [DiscreteTopology ↥M] [IsZLattice ℝ M]
      (h :
        LinearMap.BilinForm.IsSimilarLattice
          (innerₗ (EuclideanSpace ℝ ι)) L
          (innerₗ (EuclideanSpace ℝ ι)) M) :
      ZLattice.IsPerfect L ↔
        ZLattice.IsPerfect M
    **Perfection is a similarity invariant** (LMFDB `lattice.similarity`, `lattice.perfect`): of
    two similar lattices of full rank in `ℝⁿ`, one is perfect exactly when the other is. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/SimilarityInvariant.lean
    complete
    theorem LinearMap.BilinForm.IsSimilarLattice.packingDensity_eq.{u_1}
      {ι : Type u_1} [Fintype ι] {L M : Submodule ℤ (EuclideanSpace ℝ ι)}
      [DiscreteTopology ↥L] [IsZLattice ℝ L] [DiscreteTopology ↥M]
      [IsZLattice ℝ M]
      (h :
        LinearMap.BilinForm.IsSimilarLattice (innerₗ (EuclideanSpace ℝ ι)) L
          (innerₗ (EuclideanSpace ℝ ι)) M) :
      ZLattice.packingDensity L = ZLattice.packingDensity M
    theorem LinearMap.BilinForm.IsSimilarLattice.packingDensity_eq.{u_1}
      {ι : Type u_1} [Fintype ι]
      {L M : Submodule ℤ (EuclideanSpace ℝ ι)}
      [DiscreteTopology ↥L] [IsZLattice ℝ L]
      [DiscreteTopology ↥M] [IsZLattice ℝ M]
      (h :
        LinearMap.BilinForm.IsSimilarLattice
          (innerₗ (EuclideanSpace ℝ ι)) L
          (innerₗ (EuclideanSpace ℝ ι)) M) :
      ZLattice.packingDensity L =
        ZLattice.packingDensity M
    **The packing density is a similarity invariant** (LMFDB `lattice.similarity`,
    `lattice.density`): similar lattices of full rank in `ℝⁿ` have the same packing density. 
  • theoremdefined in LeanBridge/ForMathlib/Algebra/Module/ZLattice/SimilarityInvariant.lean
    complete
    theorem LinearMap.BilinForm.IsSimilarLattice.exists_isometry.{u_1, u_2}
      {V : Type u_1} {W : Type u_2} [AddCommGroup V] [Module ℝ V]
      [AddCommGroup W] [Module ℝ W] {B : LinearMap.BilinForm ℝ V}
      {B' : LinearMap.BilinForm ℝ W} {L : Submodule ℤ V} {M : Submodule ℤ W}
      (h : B.IsSimilarLattice L B' M) (hL : B.IsIntegralLattice L)
      (hM : B'.IsIntegralLattice M)
      (hLp : (B.integralForm L hL).scaleIdeal = ⊤)
      (hMp : (B'.integralForm M hM).scaleIdeal = ⊤) :
      ∃ e, ∀ (x y : ↥L), (B' ↑(e x)) ↑(e y) = (B ↑x) ↑y
    theorem LinearMap.BilinForm.IsSimilarLattice.exists_isometry.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℝ V]
      [AddCommGroup W] [Module ℝ W]
      {B : LinearMap.BilinForm ℝ V}
      {B' : LinearMap.BilinForm ℝ W}
      {L : Submodule ℤ V} {M : Submodule ℤ W}
      (h : B.IsSimilarLattice L B' M)
      (hL : B.IsIntegralLattice L)
      (hM : B'.IsIntegralLattice M)
      (hLp :
        (B.integralForm L hL).scaleIdeal = ⊤)
      (hMp :
        (B'.integralForm M hM).scaleIdeal =
          ⊤) :
      ∃ e,
        ∀ (x y : ↥L),
          (B' ↑(e x)) ↑(e y) = (B ↑x) ↑y
    **A similarity class contains at most one primitive integral lattice, up to isometry** (LMFDB
    `lattice.similarity`, `lattice.primitive`): similar integral lattices whose scale ideals are `ℤ`
    are isometric. If `L ≅ αM`, then `B(L, L) = α² B'(M, M)`, so `α²` and `α⁻²` are integers, hence
    `α² = 1`. 
Definition8.4.53
Statement uses 3
Statement dependency previews
Preview
Definition 8.4.17
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0XL∃∀N

Spherical design lattice. (LMFDB)

A collection of m \geq 1 points \{ v_1,\dots,v_m \} on a sphere S_n(r) of radius r >0 in \mathbb{R}^n centered at the origin is a called a spherical t-design if for every polynomial f(x) = f(x_1,\dots,x_n) in n variables with real coefficients of degree no bigger than t, t \geq 1,

\int_{S_n(r)} f(x) dx = \frac{1}{m} \sum_{i=1}^m f(v_i),

where the measure dx is normalized so that the measure of S_n(r) is 1. A lattice L is called a spherical t-design lattice if its set of minimal vectors S(L) is a spherical t-design.

A lattice is a spherical 2-design if and only if it is strongly eutactic. A lattice L is called strongly perfect if it is a spherical 4-design; this last condition implies that it is perfect and is a strictly stronger condition.

Depends on: Definition 8.4.17 Definition 8.4.33 Definition 8.4.42

Definition8.4.54
Statement uses 4
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Sublattice. (LMFDB)

Given an integral lattice L, a sublattice of L is a subgroup M \subseteq L which is itself a lattice.

There are several special named sublattices of L:

  • Norm 1 sublattice - the sublattice generated by vecotrs of norm 1.

  • Root sublattice - the sublattice generated by all vectors of norm 2.

  • Min vector sublattice - the sublattice generated by all minimal vectors.

  • Even sublattice - the sublattice generated by vectors of even norm.

  • Max diag sublattice - the maximal sublattice whose Gram matrix is diagonal.

Depends on: Definition 8.4.9 Definition 8.4.23 Definition 8.4.33 Definition 8.4.37

Definition8.4.55
uses 0used by 1XL∃∀N

Successive minima. (LMFDB)

Successive minima \lambda_1,\dots,\lambda_n of a \boldsymbol 0-symmetric convex body K \subset \mathbb{R}^n with respect to a full-rank lattice L \subset \mathbb{R}^n is defined as \lambda_i = \min \{ t > 0 : \text{dim}_{\mathbb{R}} \text{span}_{\mathbb{R}}(tK \cap L) \geq i \}. Then 0 < \lambda_1 \leq \dots \leq \lambda_n, and

\frac{2^n \text{det}(L)}{n! \text{Vol}(K)} \leq \lambda_1 \cdots \lambda_n \leq \frac{2^n \text{det}(L)}{\text{Vol}(K)},

by Minkowski's Successive Minima Theorem. Successive minima of L are the successive minima of the unit ball with respect to L.

Definition8.4.56
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 0✓L∃∀N

Tensor decomposition of a lattice. (LMFDB)

Given integral lattices L_1 and L_2, we define the tensor product of L_1 and L_2 as the lattice L = L_1 \otimes_{\Z} L_2, where the associated bilinear form is defined as

B( v_1 \otimes w_1, v_2 \otimes w_2 ) = B_{L_1} ( v_1, v_2) B_{L_2} (w_1, w_2),

extended bilinearly. The rank of L is the product of the ranks of L_1 and L_2, and the determinant of L is \det(L_1)^{\operatorname{rank}(L_2)} \cdot \det(L_2)^{\operatorname{rank}(L_1)}.

We say that L is tensor decomposable if it can be written as L = L_1 \otimes L_2 for some integral lattices L_1 and L_2. If not, we say L is tensor indecomposable.

A tensor decomposition of L is a decomposition of the form L = L_1 \otimes L_2 \otimes \dots \otimes L_r.

Depends on: Definition 8.4.9 Definition 8.4.12

Lean code for Definition8.4.56●5 declarations
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/TensorProduct.lean
    complete
    def TauCeti.IntegralLattice.tensorProduct.{u_1, u_2} {V : Type u_1}
      {W : Type u_2} [AddCommGroup V] [Module ℚ V] [AddCommGroup W]
      [Module ℚ W] (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) :
      TauCeti.IntegralLattice (TensorProduct ℚ V W)
    def TauCeti.IntegralLattice.tensorProduct.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) :
      TauCeti.IntegralLattice
        (TensorProduct ℚ V W)
    The **tensor product** `L ⊗ M` (LMFDB `lattice.tensor_decomposition`) of integral lattices
    `L` and `M` in rational spaces `V` and `W`: the lattice of `V ⊗ W` spanned by the tensors `v ⊗ w`
    with `v ∈ L` and `w ∈ M` (`tensorProduct_carrier`), a copy of `L ⊗_ℤ M`, with the tensor product
    of the bilinear forms, `B(v ⊗ w, v' ⊗ w') = B_L(v, v') B_M(w, w')` (`tensorProduct_form_tmul`). It
    is built from the tensor products of chosen bases of `L` and `M`, but does not depend on them. 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/TensorProduct.lean
    complete
    def TauCeti.IntegralLattice.IsTensorDecomposable.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    def TauCeti.IntegralLattice.IsTensorDecomposable.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    An integral lattice `L` is **tensor decomposable** (LMFDB `lattice.tensor_decomposition`) if
    it is isometric to a tensor product `L₁ ⊗ L₂` of integral lattices of rank at least `2`. The ranks
    are bounded below as usual, since `L ≅ L ⊗ ⟨1⟩` for every `L`. The factors are taken in the
    rational spaces `ℚᵐ` and `ℚⁿ`, which is no restriction (`isTensorDecomposable_of_isometry`). 
  • defdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/TensorProduct.lean
    complete
    def TauCeti.IntegralLattice.IsTensorIndecomposable.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    def TauCeti.IntegralLattice.IsTensorIndecomposable.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    An integral lattice is **tensor indecomposable** (LMFDB `lattice.tensor_decomposition`) if it
    is not tensor decomposable. 
  • structure(4 fields)defined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/TensorProduct.lean
    complete
    structure TauCeti.IntegralLattice.TensorDecomposition.{u_1} {V : Type u_1}
      [AddCommGroup V] [Module ℚ V] (L : TauCeti.IntegralLattice V) :
      Type u_1
    structure TauCeti.IntegralLattice.TensorDecomposition.{u_1}
      {V : Type u_1} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) :
      Type u_1
    A **tensor decomposition** `L = L₁ ⊗ L₂ ⊗ ⋯ ⊗ L_r` (LMFDB `lattice.tensor_decomposition`) of
    an integral lattice `L`: integral lattices `L₁, …, L_r`, in the rational spaces
    `ℚ^{n₁}, …, ℚ^{n_r}`, with an isometry from their tensor product onto `L`. 
    length : ℕ
    The number `r` of factors. 
    rank : Fin self.length → ℕ
    The ranks `n₁, …, n_r` of the factors. 
    factor : (i : Fin self.length) → TauCeti.IntegralLattice (Fin (self.rank i) → ℚ)
    The factors `L₁, …, L_r`. 
    isometry : (TauCeti.IntegralLattice.piTensorProduct self.factor).Isometry L
    The isometry `L₁ ⊗ ⋯ ⊗ L_r ≅ L`. 
  • theoremdefined in LeanBridge/ForMathlib/LinearAlgebra/Lattice/TensorProduct.lean
    complete
    theorem TauCeti.IntegralLattice.determinant_tensorProduct.{u_1, u_2}
      {V : Type u_1} {W : Type u_2} [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W] (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) :
      (L.tensorProduct M).determinant =
        L.determinant ^ Module.finrank ℤ ↥M.carrier *
          M.determinant ^ Module.finrank ℤ ↥L.carrier
    theorem TauCeti.IntegralLattice.determinant_tensorProduct.{u_1,
        u_2}
      {V : Type u_1} {W : Type u_2}
      [AddCommGroup V] [Module ℚ V]
      [AddCommGroup W] [Module ℚ W]
      (L : TauCeti.IntegralLattice V)
      (M : TauCeti.IntegralLattice W) :
      (L.tensorProduct M).determinant =
        L.determinant ^
            Module.finrank ℤ ↥M.carrier *
          M.determinant ^
            Module.finrank ℤ ↥L.carrier
    **`det(L ⊗ M) = det(L)^{rank M} det(M)^{rank L}`.** 
Definition8.4.57
Statement uses 7
Statement dependency previews
Preview
Definition 3.1.1
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
used by 1XL∃∀N

Theta series for an integral lattice. (LMFDB)

The theta series \Theta_L of an integral lattice L is a generating function for the number of vectors v\in L of norm n. Specifically, we define

\Theta_L(q) = \sum_{v \in L} q^{\frac{1}{2}\langle v,v \rangle}

If L has rank n and level N and we take q = e^{2\pi i z} as usual, this will be a modular form of weight k = \frac{n}{2} and level N. In the case that n is odd, to get a classical modular form with integer weight one may apply the Shimura lift, which will produce a modular form of weight n-1.

In order to express the theta series in terms of a power series with integral exponents, we will usually record

\Theta_L(q^2) = \sum_{v \in L} q^{\langle v,v \rangle},

which allows a more direct recovery of the number of vectors of each possible norm.

Depends on: Definition 3.1.1 Definition 3.1.57 Definition 3.1.101 Definition 8.4.9 Definition 8.4.12 Definition 8.4.31 Definition 8.4.48

Definition8.4.58
Statement uses 2
Statement dependency previews
Preview
Definition 8.4.9
Loading preview
Statement dependency preview content is loaded from the rendered-fragment cache.
Used by 2
Reverse dependency previews
Preview
Definition 8.4.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N
Lean code for Definition8.4.58●3 declarations
  • defdefined in TauCeti/LinearAlgebra/IntegralLattice/Unimodular.lean
    complete
    def TauCeti.IntegralLattice.IsUnimodular.{u} {V : Type u} [AddCommGroup V]
      [Module ℚ V] (L : TauCeti.IntegralLattice V) : Prop
    def TauCeti.IntegralLattice.IsUnimodular.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V) : Prop
    An integral lattice is unimodular when it is equal to its dual lattice inside the common
    rational ambient space. 
  • theoremdefined in TauCeti/LinearAlgebra/IntegralLattice/Unimodular.lean
    complete
    theorem TauCeti.IntegralLattice.isUnimodular_iff_discriminant_eq_one.{u}
      {V : Type u} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) [L.IsNondegenerate] :
      L.IsUnimodular ↔ L.discriminant = 1
    theorem TauCeti.IntegralLattice.isUnimodular_iff_discriminant_eq_one.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] :
      L.IsUnimodular ↔ L.discriminant = 1
    A nondegenerate integral lattice is unimodular exactly when its basis-independent
    discriminant is one. 
  • theoremdefined in TauCeti/LinearAlgebra/IntegralLattice/Unimodular.lean
    complete
    theorem TauCeti.IntegralLattice.isUnimodular_iff_isUnit_determinant.{u}
      {V : Type u} [AddCommGroup V] [Module ℚ V]
      (L : TauCeti.IntegralLattice V) [L.IsNondegenerate] :
      L.IsUnimodular ↔ IsUnit L.determinant
    theorem TauCeti.IntegralLattice.isUnimodular_iff_isUnit_determinant.{u}
      {V : Type u} [AddCommGroup V]
      [Module ℚ V]
      (L : TauCeti.IntegralLattice V)
      [L.IsNondegenerate] :
      L.IsUnimodular ↔ IsUnit L.determinant
    A nondegenerate integral lattice is unimodular exactly when its signed determinant is a unit
    of `ℤ`. 
Definition8.4.59
uses 1
Used by 3
Reverse dependency previews
Preview
Definition 8.4.17
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Well-rounded lattice. (LMFDB)

A lattice L is called well-rounded if its set of minimal vectors S(L) spans a sublattice M of finite index, and L is said to be generated by minimal vectors if M = L. The lattice L is strongly well-rounded if the set S(L) contains a basis for L. Being generated by minimal vectors is a strictly stronger condition than well-rounded for lattices of rank \geq 5, and a strictly weaker condition than strongly well-rounded for lattices of rank \geq 10.

Depends on: Definition 8.4.33

Definition8.4.60
uses 1used by 0XL∃∀N

Source of lattice data. (LMFDB)

The database contains lattice data (Gram matrices) from the Catalogue of Lattices, maintained by Gabriele Nebe and Neil J.A. Sloane. The Catalogue contains some tables compiled by other authors, which are cited individually in the LMFDB. For lattices of class number one, completeness of the data is confirmed by a calculation of Kirschmer and Lorch (, , ).

Additional data was computed in Magma and PARI using code written by Anna Haensch and Samuele Anni. This code is available from Github.

For solutions of the lattice packing problem in dimensions up to 8, the sphere packing problem in dimensions up to 2, the kissing number problem in dimensions up to 3, and the lattice kissing number problem in dimensions up to 9, see Conway-Sloane . The other known solutions of the sphere packing problem are due to Ferguson and Hales in dimension 3 , Viazovska in dimension 8 (, ) and Cohn, Kumar, Miller, Radchenko, and Viazovska in dimension 24 (, ). The other known solutions of the kissing number problem are due to Musin in dimension 4 , Levenshtein in dimension 8 , and Odlyzko and Sloane in dimension 24 .

Depends on: Definition 8.4.23