Integral Octonions (Part 9)
Posted by John Baez
Now let’s talk about building the Leech lattice from integral octonions!
The Leech lattice is a marvelous thing. Here are three ways to define it:
Take a bunch of balls of radius one in 24 dimensions. Get as many balls to touch a single ball as you possibly can. Then, get as many balls to touch these as you possibly can. Go on like this forever. Unlike in 3 dimensions, you have no real choice about how to do this: the balls will inevitably be centered at points of the Leech lattice.
Take disks of radius one in the plane and pack them in the densest possible lattice arrangement. Use this pattern to form a layer of balls in 3 dimensions. Stack layers like this on top of each other, pushing them down to get the densest possible lattice packing of 3d balls. Use this pattern to form a layer of balls in 4 dimensions! Stack layers like this on top of each other, pushing them down to get the densest possible lattice packing of 4d balls. Repeat this until you get to 24 dimensions. There will be some choices — but no matter how you make these choices, you’ll inevitably be led to the Leech lattice.
Up to isometry, the Leech lattice is the unique even unimodular lattice in 24 dimensions whose shortest nonzero vectors have length 2.
Since the Leech lattice lives in 24 dimensions and octonions live in 8, we should try to describe points in the Leech lattice using triples of octonions.
That’s what Geoffrey Dixon and Robert Wilson did:
Geoffrey M. Dixon, Octonions: invariant representation of the Leech lattice.
Geoffrey M. Dixon, Invariant Leech lattice exposed.
Robert A. Wilson, Octonions and the Leech lattice.
As a spinoff, this explains why there are
shortest nonzero vectors in the Leech lattice. 240 is the number of shortest nonzero vectors in the lattice — or in other words, the number of integral octonions of norm 1.
In a further paper, Wilson used his idea to give an octonionic description of the symmetries of the Leech lattice:
- Robert A. Wilson, Conway’s group and octonions.
If you take all the rotations and reflections that are symmetries of the Leech lattice, they generate a group called with
elements. This is not a simple group, because it contains the transformation , which commutes with everything else. But when you mod out by that, you get a simple group called . This is half as big, with only
elements. It’s one of the most important sporadic finite simple groups!
All of this sounds quite fun, though also quite terrifying.
Luckily, Greg Egan found a way to simplify Wilson’s ideas in a comment to Part 8. So, let me describe Egan’s construction, and then reprint his proof that it works.
Summary of Egan’s construction
Egan took Wilson’s construction and showed how to eliminate all mention of the octonions, focusing simply on the lattice. Here’s one way to state Egan’s result:
Theorem. Let be the E8 lattice, and let be a basis of simple roots. There exists a rotation
such that:
The transformation maps each to a vector whose dot product with is 1.
The transformation maps each to a vector whose dot product with is 1.
For any rotation with these properties, define lattices
Then the lattice consisting of all triples such that:
is isometric to a copy of the Leech lattice that has been rescaled by a factor of .
Proof. See below.
Here’s the picture in my head:
The vertical vector is the root . It has length , as roots of do. The other two vectors are and . They have length 2 and their dot product with is 1. And in fact, their sum is .
Why? Since they’ve been formed by rescaling and then rotating the result in opposite directions, their sum must be some number times . But since this sum has dot product 2 with , and so does itself, that number must be 1.
Of course, the neat part is that all 24 vectors — the , the and the — all live in the same lattice.
So, if we want, we can take them to be integral octonions! We have to be careful: the integral octonions form a lattice that’s a copy of the lattice rescaled by . But luckily, this cancels the factor of in the theorem above. So, Egan’s construction gives a copy of the Leech lattice at its correct scale as a sublattice of !
To understand why his construction works, we can’t do better than read what he wrote. So, in everything that follows — even in the ‘postscript’ at the end – I’ll just be quoting him.
Constructing the Leech lattice from E8
by Greg Egan
I recently read Robert Wilson’s beautiful paper Octonions and the Leech Lattice, which constructs the Leech lattice as a sublattice of the space of triples of a certain set of octonions.
The particular set of octonions Wilson chooses to work with are not Cayley integral octonions, so they are not closed under multiplication. However, I realised that it’s quite easy to tweak his construction to work with (any of the seven sets of) Cayley integral octonions instead. What’s more, the geometrical aspects of his construction can be abstracted away from the octonionic aspects, giving a nice way to produce the Leech lattice (up to a rescaling) as a sublattice of , where is any lattice isomorphic (up to a rescaling) to .
So, suppose is either isomorphic to , or to some multiple of . For the sake of concreteness, I will illustrate what follows using a specific example, the lattice generated by the rows of this matrix, which we will call :
These vectors have squared norms of 2, which is the usual normalisation convention for , and they comprise a set of simple roots whose mutual dot products are for roots joined by an edge in the Dynkin diagram for , and 0 otherwise.
In this lattice, the shortest non-zero vectors have squared norms of 2, and the next-shortest vectors have squared norms of 4, i.e. they are larger. For every simple root , there are numerous vectors of squared norm 4 for which . (In fact there are 576 such vectors in every case, but that particular number is not important.) If we were dealing with a differently scaled lattice, then this dot product would be different, of course, so the scale-invariant aspect here is that the angle between and all these is .
The split up into pairs that lie precisely opposite each other with respect to , with all three vectors lying in the same plane. In fact, because of the particular angle, , between the vectors and the ratio of between their lengths, the sum of the two in each such pair is simply equal to .
Now, we have so many choices of these pairs of that we can find an ordered pair for every root such that the vectors all lie at the same angles to each other as the corresponding , and so do the second members of each pair, . The mutual dot products between these vectors will be twice as large as those of the , but in other respects they just follow the Dynkin diagram as usual.
We will define to be the lattice generated by the eight and to be the lattice generated by the eight ; both these lattices are sublattices of that are isomorphic to a version of that is larger than that of itself.
To prove that such sets of vectors really exist, here is an example. (I haven’t calculated how many different choices there are, but the number runs at least into the thousands.)
It’s not hard to check that for any , we have that and the individual sets and generate lattices and that are versions of larger by a factor of than the version generated by .
Because of the geometry of the roots of these three lattices as we’ve defined them, we can concisely capture the relationship between the lattices themselves as follows. We define a linear operator by the requirement that:
That is, in each plane spanned by and , rotates by an angle of . But lies in that same plane, separated from by the same angle, so we have:
The entire lattices generated by these vectors are related in the same fashion. We will write this as:
where we have now defined:
We also have the nice relation, which follows from , that:
We’ve now reached the point where we can make use of Wilson’s construction. Wilson showed (using octonionic methods, and his own particular choice of the lattices I’m calling , and ) that:
Theorem. The lattice consisting of all triples such that:
is isomorphic to a version of the Leech lattice which is rescaled by times the scaling of relative to .
Proof. For our concrete example where the roots of have squared norm 2, we will get a lattice from the construction that is times larger than the Leech lattice as it is normally defined. In the following, I will only talk about the particular scaling where is isomorphic to , but it’s trivial to rescale everything in sight to suit any particular application where we want to be larger or smaller.
To prove the claimed result, it suffices to show that is an even unimodular lattice with no vectors of squared norm 2, since the Leech lattice is the unique 24-dimensional lattice with these properties. An even lattice is one where every vector’s squared norm is an even integer, and a unimodular lattice is one where the determinant of any basis is . But rather than requiring a basis, we will use an equivalent property: every unimodular lattice is self-dual. The dual of a lattice is the set of vectors such that for every , the dot product is an integer. That set is precisely the original lattice if and only if the lattice is unimodular.
To proceed, we start from the well-known fact that itself is unimodular, and so will be self-dual. The dual of , because of its different scaling, will be , and the dual of will be .
If you ponder the definition of a dual lattice, you’ll see that the dual of the intersection of two lattices is the lattice spanned by all the vectors in the individual duals. So, the dual of is the lattice spanned by and , which certainly includes the entire lattice , since every one of the that generates can be written as the sum of in and in . But since , the span of and can be no larger than and must be precisely equal to it. Taking duals, we then have:
This result lets us see that our criteria for membership of are still satisfied if we change the sign of any element in ; say we change to . Clearly the first condition, , is still satisfied. For the second, we now have that needs to be in , but since we have , and hence . Similarly, needs to be in , and because , it is.
The same result tells us that all vectors of the form:
and permutations are elements of .
Suppose we have some . Then must be an integer for all , so , and similarly for and .
Vectors of the form:
and permutations are also elements of , since , and . Changing signs and permuting coordinates, we have for all , or simply for all .
This means the dot product must be an integer, for all . The dual of is , so , and similarly for and .
And we also have , or simply for all . The dot product must be an integer, for all , and the dual of is , so .
What we have shown so far is that:
or equivalently:
We want to make this an equality. Suppose , so that and . Then:
The squared norms of vectors in and are multiples of four, so the squared norms of vectors in and are integers. So we have shown that any has a squared norm that is an integer.
It follows that is an even lattice, with all squared norms even integers. What’s more, any dot product of two elements can be written as:
Since all the squared norms here are even, the dot product must be an integer. Therefore every element of also lies in , and we’ve proved that is self-dual and hence unimodular.
Suppose has a vector of squared norm 2, or equivalently, has a vector of squared norm 4. Recall that for any we have , and the squared norms of non-zero vectors in are all at least 2. If all three vectors were non-zero that would mean a squared norm of at least 6, so at least one vector, say , is zero. Then and must lie in , where the non-zero vectors have squared norms of at least 4, and if two vectors were non-zero that would mean a squared norm of at least 8. Our last chance, then, is a single non-zero vector, which must belong to , giving it a squared norm of at least 8. So we’ve shown that has no vector with a squared norm of 2.
Putting together everything we now know about , it must be the Leech lattice.
Postscript
As a postscript to the construction I just described of the Leech lattice as a sublattice of where is isomorphic to some possibly rescaled version of … if we want to set to any of the seven lattices of Cayley integral octonions, which have roots of length 1, and hence are re-scaled from the usual by a factor of , it turns out that we can always choose one of the larger sublattices of , say , to be equal to a certain well-known version of : one where every vector consists solely of either integer coordinates or integers plus , and where the sum of the coordinates is an even integer. This is true regardless of which of the seven sets of Cayley integral octonions we choose for , because this ‘well-known version’ of is a sublattice of the Kirmse integers, and it is invariant under any permutation of its coordinates, including the coordinate-swaps that yield the various Cayley integers.
The second sublattice, , is then found by identifying the rotation that maps into and applying it a second time, to give .
Re: Integral Octonions (Part 9)
Is there a map available showing all the embeddings (and other relationships) between the various lattices that have come up in this series? I’m dizzy!