# Leech lattice

In mathematics, the **Leech lattice** is an even unimodular lattice Λ_{24} in 24-dimensional Euclidean space **E**^{24} found by Template:Harvs.

## Contents

## History

Many of the cross-sections of the Leech lattice, including the Coxeter–Todd lattice and Barnes–Wall lattice, in 12 and 16 dimensions, were found much earlier than the Leech lattice. Template:Harvtxt discovered a related odd unimodular lattice in 24 dimensions, now called the odd Leech lattice, whose even sublattice has index 2 in the Leech lattice. The Leech lattice was discovered in 1965 by Template:Harvs, by improving some earlier sphere packings he found Template:Harv.

Template:Harvs calculated the order of the automorphism group of the Leech lattice, and, working with John G. Thompson, discovered three new sporadic groups as a by-product: the Conway groups, Co_{1}, Co_{2}, Co_{3}. They also rediscovered four other (then) recently announced sporadic groups, namely, Higman-Sims, Suzuki, McLaughlin, and the Janko group J_{2} (Ronan, p. 155)

Bei dem Versuch, eine Form aus einer solchen Klasse wirklich anzugeben, fand ich mehr als 10 verschiedene Klassen in Γ_{24}

In a seminar in 1970 Ernst Witt claimed that one of the lattices he found in 1940 was the Leech lattice. Template:Harvtxt, has a single rather cryptic sentence mentioning that he found more than 10 even unimodular lattices in 24 dimensions without giving further details. See his collected works Template:Harv for more comments and for some notes Witt wrote about this in 1972.

## Characterization

The Leech lattice Λ_{24} is the unique lattice in **E**^{24} with the following list of properties:

- It is unimodular; i.e., it can be generated by the columns of a certain 24×24 matrix with determinant 1.
- It is even; i.e., the square of the length of any vector in Λ
_{24}is an even integer. - The length of any non-zero vector in Λ
_{24}is at least 2.

## Properties

The last condition is equivalent to the condition that unit balls centered at the points of Λ_{24} do not overlap. Each is tangent to 196,560 neighbors, and this is known to be the largest number of non-overlapping 24-dimensional unit balls that can simultaneously touch a single unit ball (compare with 6 in dimension 2, as the maximum number of pennies which can touch a central penny; see kissing number). This arrangement of 196560 unit balls centred about another unit ball is so efficient that there is no room to move any of the balls; this configuration, together with its mirror-image, is the *only* 24-dimensional arrangement where 196560 unit balls simultaneously touch another. This property is also true in 1, 2 and 8 dimensions, with 2, 6 and 240 unit balls, respectively, based on the integer lattice, hexagonal tiling and E8 lattice, respectively.

It has no root system and in fact is the first unimodular lattice with no *roots* (vectors of norm less than 4), and therefore has a centre density of 1. By multiplying this value by the volume of a unit ball in 24 dimensions, , one can derive its absolute density.

Template:Harvtxt showed that the Leech lattice is isometric to the set of simple roots (or the Dynkin diagram) of the reflection group of the 26-dimensional even Lorentzian unimodular lattice II_{25,1}. By comparison, the Dynkin diagrams of II_{9,1} and II_{17,1} are finite.

## Constructions

The Leech lattice can be constructed in a variety of ways. As with all lattices, it can be constructed via its generator matrix, a 24×24 matrix with determinant 1.

### Using the binary Golay code

The Leech lattice can be explicitly constructed as the set of vectors of the form 2^{−3/2}(*a*_{1}, *a*_{2}, ..., *a*_{24}) where the *a _{i}* are integers such that

and for each fixed residue class modulo 4, the 24 bit word, whose 1's correspond to the coordinates *i* such that *a*_{i} belongs to this residue class, is a word in the binary Golay code. The Golay code, together with the related Witt Design, features in a construction for the 196560 minimal vectors in the Leech lattice.

### Using the Lorentzian lattice II_{25,1}

The Leech lattice can also be constructed as where *w* is the Weyl vector:

in the 26-dimensional even Lorentzian unimodular lattice II_{25,1}. The existence of such an integral vector of norm zero relies on the fact that 1^{2} + 2^{2} + ... + 24^{2} is a perfect square (in fact 70^{2}); the number 24 is the only integer bigger than 1 with this property. This was conjectured by Édouard Lucas, but the proof came much later, based on elliptic functions.

The vector
in this construction is really the Weyl vector of the even sublattice *D*_{24} of the odd unimodular lattice *I*^{25}. More generally, if *L* is any positive definite unimodular lattice of dimension 25 with at least 4 vectors of norm 1, then the Weyl vector of its norm 2 roots has integral length, and there is a similar construction of the Leech lattice using *L* and this Weyl vector.

### Based on other lattices

Template:Harvtxt described another 23 constructions for the Leech lattice, each based on a Niemeier lattice. It can also be constructed by using three copies of the E8 lattice, in the same way that the binary Golay code can be constructed using three copies of the extended Hamming code, H_{8}. This construction is known as the **Turyn** construction of the Leech lattice.

### As a laminated lattice

Starting with a single point, Λ_{0}, one can stack copies of the lattice Λ_{n} to form an (*n* + 1)-dimensional lattice, Λ_{n+1}, without reducing the minimal distance between points. Λ_{1} corresponds to the integer lattice, Λ_{2} is to the hexagonal lattice, and Λ_{3} is the face-centered cubic packing. Template:Harvtxt showed that the Leech lattice is the unique laminated lattice in 24 dimensions.

### As a complex lattice

The Leech lattice is also a 12-dimensional lattice over the Eisenstein integers. This is known as the **complex Leech lattice**, and is isomorphic to the 24-dimensional real Leech lattice. In the complex construction of the Leech lattice, the binary Golay code is replaced with the ternary Golay codeTemplate:Clarify, and the Mathieu group *M*_{24} is replaced with the Mathieu group *M*_{12}Template:Clarify. The *E*_{6} lattice, *E*_{8} lattice and Coxeter–Todd lattice also have constructions as complex lattices, over either the Eisenstein or Gaussian integers.

### Using the icosian ring

The Leech lattice can also be constructed using the ring of icosians. The icosian ring is abstractly isomorphic to the E8 lattice, three copies of which can be used to construct the Leech lattice using the Turyn construction.

## Symmetries

The Leech lattice is highly symmetrical. Its automorphism group is the Conway group Co_{0}, and its order is 8 315 553 613 086 720 000. The center of Co_{0} has two elements, and the quotient of Co_{0} by this center is the Conway group Co_{1}, a finite simple group. Many other sporadic groups, such as the remaining Conway groups and Mathieu groups, can be constructed as the stabilizers of various configurations of vectors in the Leech lattice.

Despite having such a high *rotational* symmetry group, the Leech lattice does not possess any lines of reflection symmetry. In other words, the Leech lattice is chiral.

The automorphism group was first described by John Conway. The 398034000 vectors of norm 8 fall into 8292375 'crosses' of 48 vectors. Each cross contains 24 mutually orthogonal vectors and their inverses, and thus describe the vertices of a 24-dimensional orthoplex. Each of these crosses can be taken to be the coordinate system of the lattice, and has the same symmetry of the Golay code, namely 2^{12} × |M_{24}|. Hence the full automorphism group of the Leech lattice has order 8292375 × 4096 × 244823040, or 8 315 553 613 086 720 000.

## Geometry

Template:Harvtxt showed that the covering radius of the Leech lattice is ; in other words, if we put a closed ball of this radius around each lattice point, then these just cover Euclidean space. The points at distance at least from all lattice points are called the * deep holes* of the Leech lattice. There are 23 orbits of them under the automorphism group of the Leech lattice, and these orbits correspond to the 23 Niemeier lattices other than the Leech lattice: the set of vertices of deep hole is isometric to the affine Dynkin diagram of the corresponding Niemeier lattice.

The Leech lattice has a density of , correct to six decimal places. Template:Harvtxt showed that it gives the densest *lattice* packing of balls in 24-dimensional space. Their results suggest, but do not prove, that this configuration also gives the densest among all packings of balls in 24-dimensional space. In particular, they show that no arrangement of 24-dimensional spheres can be denser than the Leech lattice by a factor of more than 1+1.65×10^{−30}.

The 196560 minimal vectors are of three different varieties, known as *shapes*:

- 1104 vectors of shape (4
^{2},0^{22}), for all permutations and sign choices; - 97152 vectors of shape (2
^{8},0^{16}), where the '2's correspond to octads in the Golay code, and there an even number of minus signs; - 98304 vectors of shape (3,1
^{23}), where the signs come from the Golay code, and the '3' can appear in any position.

The ternary Golay code, binary Golay code and Leech lattice give very efficient 24-dimensional spherical codes of 729, 4096 and 196560 points, respectively. Spherical codes are higher-dimensional analogues of Tammes problem, which arose as an attempt to explain the distribution of pores on pollen grains. These are distributed as to maximise the minimal angle between them. In two dimensions, the problem is trivial, but in three dimensions and higher it is not. An example of a spherical code in three dimensions is the set of the 12 vertices of the regular icosahedron.

## Theta series

One can associate to any (positive-definite) lattice Λ a theta function given by

The theta function of a lattice is then a holomorphic function on the upper half-plane. Furthermore, the theta function of an even unimodular lattice of rank *n* is actually a modular form of weight *n*/2. The theta function of an integral lattice is often written as a power series in so that the coefficient of *q*^{n} gives the number of lattice vectors of norm 2*n*. In the Leech lattice, there are 196560 vectors of norm 4, 16773120 vectors of norm 6, 398034000 vectors of norm 8 and so on. The theta series of the Leech lattice is thus:

where represents the Ramanujan tau function, and is a divisor function. It follows that the number of vectors of norm 2*m* is

## Applications

The vertex algebra of the conformal field theory describing bosonic string theory, compactified on the 24-dimensional quotient torus **R**^{24}/Λ_{24} and orbifolded by a two-element reflection group, provides an explicit construction of the Griess algebra that has the monster group as its automorphism group. This **monster vertex algebra** was also used to prove the monstrous moonshine conjectures.

The binary Golay code, independently developed in 1949, is an application in coding theory. More specifically, it is an error-correcting code capable of correcting up to three errors in each 24-bit word, and detecting a fourth. It was used to communicate with the Voyager probes, as it is much more compact than the previously-used Hadamard code.

Quantizers, or analog-to-digital converters, can use lattices to minimise the average root-mean-square error. Most quantizers are based on the one-dimensional integer lattice, but using multi-dimensional lattices reduces the RMS error. The Leech lattice is a good solution to this problem, as the Voronoi cells have a low second moment.

## See also

## References

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- Conway, J. H.; Sloane, N. J. A. (1999).
*Sphere packings, lattices and groups.*(3rd ed.) With additional contributions by E. Bannai, R. E. Borcherds, John Leech, Simon P. Norton, A. M. Odlyzko, Richard A. Parker, L. Queen and B. B. Venkov. Grundlehren der Mathematischen Wissenschaften, 290. New York: Springer-Verlag. ISBN 0-387-98585-9. - {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- Thompson, Thomas M.: "From Error Correcting Codes through Sphere Packings to Simple Groups", Carus Mathematical Monographs, Mathematical Association of America, 1983.
- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- Griess, Robert L.:
*Twelve Sporadic Groups*, Springer-Verlag, 1998. - Ronan, Mark:
*Symmetry and the Monster*, Oxford University Press. ISBN 978-0-19-280723-6. - Marcus du Sautoy:
*Finding Moonshine*. ISBN 978-0-00-721462-4.