Documentation

TauCeti.LinearAlgebra.IntegralLattice.ConstructionB.Golay

The Construction B lattice of the extended binary Golay code #

Construction B applied to the extended binary Golay code is the lattice of integer vectors in ℚ^(Fin 24) reducing to a Golay codeword modulo two and having coordinate sum divisible by four, with the halved dot product. It is the kernel of half the coordinate sum modulo two on the unimodular Golay Construction A lattice, so it has index two there and discriminant four. It is positive definite, even, and of rank 24.

This is the half-lattice of the Construction B model of the Leech lattice: the Leech lattice is the union of it and one odd shifted coset. Every nonzero vector of the half-lattice has norm at least 4. Under the congruence conditions describing the Leech lattice in the coordinates x = a / 2, every nonzero admissible integer vector a has ∑ aᵢ² ≥ 32. Both bounds use the minimum distance 8 of the Golay code; the second also uses the divisibility of its weights by four.

References #

The Construction B lattice of the extended binary Golay code: the integer vectors of ℚ^(Fin 24) reducing to a Golay codeword modulo two whose coordinate sum is divisible by four, with the dot product halved.

Instances For
    @[simp]

    The Golay Construction B carrier is the Construction B carrier of the Golay code.

    @[simp]

    The Golay Construction B form is the halved coordinate dot product.

    The Golay Construction B lattice is a sublattice of the Golay Construction A lattice.

    The Golay Construction B lattice has index two in the Golay Construction A lattice.

    @[simp]

    The Golay Construction B lattice has rank 24.

    The Golay Construction B lattice is positive definite.

    @[simp]

    The Golay Construction B lattice has discriminant four, being of index two in the unimodular Golay Construction A lattice.

    @[simp]

    The discriminant group of the Golay Construction B lattice has order four.

    The Golay Construction B lattice has no nonzero vector of norm less than four, since the Golay code has minimum distance eight.

    theorem TauCeti.BinaryGolay.thirtyTwo_le_sum_sq {m : ℤ} (hm : m = 0 ∨ m = 1) {b : Fin 24 → ℤ} (hb : (fun (i : Fin 24) => ↑(b i)) ∈ code) (hsum : ∑ i : Fin 24, (2 * b i + m) ≡ 4 * m [ZMOD 8]) (hne : (fun (i : Fin 24) => 2 * b i + m) ≠ 0) :
    32 ≤ ∑ i : Fin 24, (2 * b i + m) ^ 2

    The norm bound for the Leech lattice in congruence coordinates. Let m ∈ {0, 1} and let b be an integer vector reducing to a Golay codeword modulo two, and put a = 2b + m 𝟙. If ∑ aᵢ ≡ 4m (mod 8) and a ≠ 0, then ∑ aᵢ² ≥ 32. These are the congruence conditions that describe the Leech lattice in the coordinates x = a / 2, in which the halved dot product of x with itself is ∑ aᵢ² / 8; so the bound says that such an x has norm at least 4.