Skip to content →

Tag: Leech

a monstrous unimodular lattice

An integral n-dimensional lattice L is the set of all integral linear combinations
L=Zλ1Zλn
of base vectors {λ1,,λn} of Rn, equipped with the usual (positive definite) inner product, satisfying
(λ,μ)Zfor all λ,μZ.
But then, L is contained in its dual lattice L=HomZ(L,Z), and if L=L we say that L is unimodular.

If all (λ,λ)2Z, we say that L is an even lattice. Even unimodular lattices (such as the E8-lattice or the 24 Niemeier lattices) are wonderful objects, but they can only live in dimensions n which are multiples of 8.

Just like the Conway group Co0=.0 is the group of rotations of the Leech lattice Λ, one might ask whether there is a very special lattice on which the Monster group M acts faithfully by rotations. If such a lattice exists, it must live in dimension at least 196883.



Simon Norton (1952-2019) – Photo Credit

A first hint of such a lattice is in Conway’s original paper A simple construction for the Fischer-Griess monster group (but not in the corresponding chapter 29 of SPLAG).

Conway writes that Simon Norton showed ‘by a very simple computations that does not even require knowledge of the conjugacy classes, that any 198883-dimensional representation of the Monster must support an invariant algebra’, which, after adding an identity element 1, we now know as the 196884-dimensional Griess algebra.

Further, on page 529, Conway writes:

Norton has shown that the lattice L spanned by vectors of the form 1,t,tt, where t and t are transposition vectors, is closed under the algebra multiplication and integral with respect to the doubled inner product 2(u,v). The dual quotient L/L is cyclic of order some power of 4, and we believe that in fact L is unimodular.

Here, transposition vectors correspond to transpositions in M, that is, elements of conjugacy class 2A.

I only learned about this lattice yesterday via the MathOverflow-post A lattice with Monster group symmetries by Adam P. Goucher.

In his post, Adam considers the 196883-dimensional lattice L=L1 (which has M as its rotation symmetry group), and asks for the minimal norm (squared) of a lattice point, which he believes is 448, and for the number of minimal vectors in the lattice, which might be
2639459181687194563957260000000=9723946114200918600×27143910000
the number of oriented arcs in the Monster graph.

Here, the Monster graph has as its vertices the elements of M in conjugacy class 2A (which has 9723946114200918600 elements) and with an edge between two vertices if their product in M again belongs to class 2A, so the valency of the graph must be 27143910000, as explained in that old post the monster graph and McKay’s observation.

When I asked Adam whether he had more information about his lattice, he kindly informed me that Borcherds told him that the Norton lattice L didn’t turn out to be unimodular after all, but that a unimodular lattice with monstrous symmetry had been constructed by Scott Carnahan in the paper A Self-Dual Integral Form of the Moonshine Module.



Scott Carnahan – Photo Credit

The major steps (or better, the little bit of it I could grasp in this short time) in the construction of this unimodular 196884-dimensional monstrous lattice might put a smile on your face if you are an affine scheme aficionado.

Already in his paper Vertex algebras, Kac-Moody algebras, and the Monster, Richard Borcherds described an integral form of any lattice vertex algebra. We’ll be interested in the lattice vertex algebra VΛ constructed from the Leech lattice Λ and call its integral form (VΛ)Z.

One constructs the Moonshine module V from VΛ by a process called ‘cyclic orbifolding’, a generalisation of the original construction by Frenkel, Lepowsky and Meurman. In fact, there are now no less than 51 constructions of the moonshine module.

One starts with a fixed point free rotation rp of Λ in Co0 of prime order p{2,3,5,7,13}, which one can lift to an automorphism gp of the vertex algebra VΛ of order p giving an isomorphism VΛ/gpV of vertex operator algebras over C.

For two distinct primes p,p{2,3,5,7,13} if Co0 has an element of order p.p one can find one such rpp such that rppp=rp and rppp=rp, and one can lift rpp to an automorphism gpp of VΛ such that VΛ/gppVΛ as vertex operator algebras over C.

Problem is that these lifts of automorphisms and the isomorphisms are not compatible with the integral form (VΛ)Z of VΛ, but ‘essentially’, they can be performed on
(VΛ)ZZZ[1pp,ζ2pp]
where ζ2pp is a primitive 2pp-th root of unity. These then give a Z[1pp,ζ2pp]-form on V.

Next, one uses a lot of subgroup information about M to prove that these Z[1pp,ζ2pp]-forms of V have M as their automorphism group.

Then, using all his for different triples in {2,3,5,7,13} one can glue and use faithfully flat descent to get an integral form VZ of the moonshine module with monstrous symmetry and such that the inner product on VZ is positive definite.

Finally, one looks at the weight 2 subspace of VZ which gives us our Carnahan’s 196884-dimensional unimodular lattice with monstrous symmetry!

Beautiful as this is, I guess it will be a heck of a project to deduce even the simplest of facts about this wonderful lattice from running through this construction.

For example, what is the minimal length of vectors? What is the number of minimal length vectors? And so on. All info you might have is very welcome.

One Comment

Know thy neighbours

Two lattices L and L in the same vector space are called neighbours if their intersection LL is of index two in both L and L.

In 1957, Martin Kneser gave a method to find all unimodular lattices (of the same dimension and signature) starting from one such unimodular lattice, finding all its neighbours, and repeating this with the new lattices obtained.

In other words, Kneser’s neighbourhood graph, with vertices the unimodular lattices (of fixed dimension and signature) and edges between them whenever the lattices are neighbours, is connected.



Martin Kneser (1928-2004) – Photo Credit

Last time, we’ve constructed the Niemeier lattice (A124)+ from the binary Golay code C24
L=(A124)+=C24×F2(A124)={12v | vZ24, v=v mod 2C24}
With hindsight, we know that (A124)+ is the unique neighbour of the Leech lattice in the Kneser neighbourhood graph of the positive definite, even unimodular 24-dimensional lattices, aka the Niemeier lattices.

Let’s try to construct the Leech lattice Λ from L=(A124)+ by Kneser’s neighbour-finding trick.



Sublattices of L of index two are in one-to-one correspondence with non-zero elements in L/2L. Take lL2L and mL such that the inner product l.m is odd, then
Ll={xL | l.x is even}
is an index two sublattice because L=Ll(Ll+m). By definition l.x is even for all xLl and therefore l2Ll. We have this situation
LlL=LLl
and Ll/LlF2F2, with the non-zero elements represented by {l2,m,l2+m}. That is,
Ll=Ll(Ll+m)(Ll+l2)(Ll+(l2+m))
This gives us three lattices
{M1=Ll(Ll+m)=LM2=Ll(Ll+l2)M3=Ll(Ll+(l2+m))
and all three of them are unimodular because
LlMiMiLl
and Ll is of index 4 in Ll.

Now, let’s assume the norm of l, that is, l.l4Z. Then, either the norm of l2 is odd (but then the norm of l2+m must be even), or the norm of l2 is even, in which case the norm of l2+m is odd.

That is, either M2 or M3 is an even unimodular lattice, the other one being an odd unimodular lattice.

Let’s take for l and m the vectors λ=12(1,1,,1)L2L and μ=2(1,0,,0)L, then
λ.λ=12×24=12andμ.λ=1
Because λ2.λ2=124=3 is odd, we have that
Λ=Lλ(Lλ+(λ2+μ))
is an even unimodular lattice, which is the Leech lattice, and
Λodd=Lλ(Lλ+λ2)
is an odd unimodular lattice, called the odd Leech lattice.



John Leech (1926-1992) – Photo Credit

Let’s check that these are indeed the Leech lattices, meaning that they do not contain roots (vectors of norm two).

The only roots in L=(A124)+ are the 48 roots of A124 and they are of the form ±2[1,023], but none of them lies in Lλ as their inproduct with λ is one. So, all non-zero vectors in Lλ have norm 4.

As for the other part of Λ and Λodd
(Lλ+λ2)(Lλ+μ+λ2)=(Lλ(Lλ+μ))+λ2=L+λ2
From the description of L=(A124)+ it follows that every coordinate of a vector in L+λ2 is of the form
12(v+12)or12(v+32)
with v2Z, with the second case instances forming a codeword in C24. In either case, the square of each of the 24 coordinates is 18, so the norm of such a vector must be 3, showing that there are no roots in this region either.

If one takes for l a vector of the form 12v=12[1a,024a] where a=8,12 or 16 and vC24, takes m=μ as before, and repeats the construction, one gets the other Niemeier-neighbours of (A124)+, that is, the lattices (A212)+, (A38)+ and (D46)+.

For a=12 one needs a slightly different argument, see section 0.2 of Richard Borcherds’ Ph.D. thesis.

Comments closed

The Leech lattice neighbour

Here’s the upper part of Kneser‘s neighbourhood graph of the Niemeier lattices:



The Leech lattice has a unique neighbour, that is, among the 23 remaining Niemeier lattices there is a unique one, (A124)+, sharing an index two sub-lattice with the Leech.

How would you try to construct (A124)+, an even unimodular lattice having the same roots as A124?

The root lattice A1 is 2Z. It has two roots ±2, determinant 2, its dual lattice is A1=12Z and we have A1/A1C2F2.

Thus, A124=2Z24 has 48 roots, determinant 224, its dual lattice is (A124)=12Z24 and the quotient group (A124)/A124 is C224 isomorphic to the additive subgroup of F224.

A larger lattice A124L of index k gives for the dual lattices an extension L(A124), also of index k. If L were unimodular, then the index has to be 212 because we have the situation
A124L=L(A124)
So, Kneser’s glue vectors form a 12-dimensional subspace C in F224, that is,
L=C×F2(A124)={12v | vZ24, v=v mod 2C}
Because L=L, the linear code C must be self-dual meaning that v.w=0 (in F2) for all v,wC. Further, we want that the roots of A124 and L are the same, so the minimal number of non-zero coordinates in vC must be 8.

That is, C must be a self-dual binary code of length 24 with Hamming distance 8.



Marcel Golay (1902-1989) – Photo Credit

We now know that there is a unique such code, the (extended) binary Golay code, C24, which has

  • one vector of weight 0
  • 759 vectors of weight 8 (called ‘octads’)
  • 2576 vectors of weight 12 (called ‘dodecads’)
  • 759 vectors of weight 16
  • one vector of weight 24

The 759 octads form a Steiner system S(5,8,24) (that is, for any 5-subset S of the 24-coordinates there is a unique octad having its non-zero coordinates containing S).

Witt constructed a Steiner system S(5,8,24) in his 1938 paper “Die 5-fach transitiven Gruppen von Mathieu”, so it is not unthinkable that he checked the subspace of F224 spanned by his 759 octads to be 12-dimensional and self-dual, thereby constructing the Niemeier-lattice (A124)+ on that sunday in 1940.

John Conway classified all nine self-dual codes of length 24 in which the weight
of every codeword is a multiple of 4. Each one of these codes C gives a Niemeier lattice C×F2(A124), all but one of them having more roots than A124.

Vera Pless and Neil Sloan classified all 26 binary self-dual codes of length 24.

Comments closed