Processing math: 100%
\usepackagecolor\usepackage[matrix]xy\usepackageskak Skip to content →

Category: groups

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, (A241)+, sharing an index two sub-lattice with the Leech.

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

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, A241=2Z24 has 48 roots, determinant 224, its dual lattice is (A241)=12Z24 and the quotient group (A241)/A241 is C242 isomorphic to the additive subgroup of F242.

A larger lattice A241L of index k gives for the dual lattices an extension L(A241), also of index k. If L were unimodular, then the index has to be 212 because we have the situation
A241L=L(A241)
So, Kneser’s glue vectors form a 12-dimensional subspace C in F242, that is,
L=C×F2(A241)={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 A241 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 F242 spanned by his 759 octads to be 12-dimensional and self-dual, thereby constructing the Niemeier-lattice (A241)+ 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(A241), all but one of them having more roots than A241.

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

Leave a Comment

Witt and his Niemeier lattices

Sunday, January 28th 1940, Hamburg

Ernst Witt wants to get two papers out of his system because he knows he’ll have to enter the Wehrmacht in February.

The first one, “Spiegelungsgruppen und Aufzählung halbeinfacher Liescher Ringe”, contains his own treatment of the root systems of semisimple Lie algebras and their reflexion groups, following up on previous work by Killing, Cartan, Weyl, van der Waerden and Coxeter.



(Photo: Natascha Artin, Nikolausberg 1933): From left to right: Ernst Witt; Paul Bernays; Helene Weyl; Hermann Weyl; Joachim Weyl, Emil Artin; Emmy Noether; Ernst Knauf; unknown woman; Chiuntze Tsen; Erna Bannow (later became wife of Ernst Witt)

Important for our story is that this paper contains the result stating that integral lattices generated by norm 2 elements are direct sums of root systems of the simply laced Dynkin diagrans An,Dn and E6,E7 or E8 (Witt uses a slightly different notation).



In each case, Witt knows of course the number of roots and the determinant of the Gram matrix
#rootsdeterminantAnn2+nn+1Dn2n22n4E6723E71262E82401
The second paper “Eine Identität zwischen Modulformen zweiten Grades” proves that there are just two positive definite even unimodular lattices (those in which every squared length is even, and which have one point per unit volume, that is, have determinant one) in dimension sixteen, E8E8 and D+16. Previously, Louis Mordell showed that the only unimodular even lattice in dimension 8 is E8.

The connection with modular forms is via their theta series, listing the number of lattice points of each squared length
θL(q)=m=0#{λL:(λ,λ)=m}qm
which is a modular form of weight n/2 (n being the dimension which must be divisible by 8) in case L is a positive definitive even unimodular lattice.

The algebra of all modular forms is generated by the Eisenstein series E2 and E3 of weights 4 and 6, so in dimension 8 we have just one possible theta series
θL(q)=E22=1+480q2+61920q4+1050240q6+

It is interesting to read Witt’s proof of his main result (Satz 3) in which he explains how he constructed the possible even unimodular lattices in dimension 16.

He knows that the sublattice of L generated by the 480 norm two elements must be a direct sum of root lattices. His knowledge of the number of roots in each case tells him there are only two possibilities
E8E8andD16
The determinant of the Gram matrix of E8E8 is one, so this one is already unimodular. The remaining possibility
D16={(x1,,x16)Z16 | x1++x162Z}
has determinant 4 so he needs to add further lattice points (necessarily contained in the dual lattice D16) to get it unimodular. He knows the coset representatives of D16/D16:
{[0]=(0,,0) of norm 0[1]=(12,,12) of norm 4[2]=(0,,0,1) of norm 1[3]=(12,,12,12) of norm 4
and he verifies that the determinant of D+16=D16+([1]+D16) is indeed one (btw. adding coset [3] gives an isomorphic lattice). Witt calls this procedure to arrive at the correct lattices forced (‘zwangslaufig’).

So, how do you think Witt would go about finding even unimodular lattices in dimension 24?

To me it is clear that he would start with a direct sum of root lattices whose dimensions add up to 24, compute the determinant of the Gram matrix and, if necessary, add coset classes to arrive at a unimodular lattice.

Today we would call this procedure ‘adding glue’, after Martin Kneser, who formalised this procedure in 1967.

On January 28th 1940, Witt writes that he found more than 10 different classes of even unimodular lattices in dimension 24 (without giving any details) and mentioned that the determination of the total number of such lattices will not be entirely trivial (‘scheint nicht ganz leicht zu sein’).

The complete classification of all 24 even unimodular lattices in dimension 24 was achieved by Hans Volker Niemeier in his 1968 Ph.D. thesis “Definite quadratische Formen der Dimension 24 und Diskriminante 1”, under the direction of Martin Kneser. Naturally, these lattices are now known as the Niemeier lattices.

Which of the Niemeier lattices were known to Witt in 1940?

There are three obvious certainties: E8E8E8, E8D+16 (both already unimodular, the second by Witt’s work) and D+24 with a construction analogous to the one of D+16.

To make an educated guess about the remaining Witt-Niemeier lattices we can do two things:

  1. use our knowledge of Niemeier lattices to figure out which of these Witt was most likely to stumble upon, and
  2. imagine how he would adapt his modular form approach in dimension 16 to dimension 24.

Here’s Kneser’s neighbourhood graph of the Niemeier lattices. Its vertices are the 24 Niemeiers and there’s an edge between L and M whenever the intersection LM is of index 2 in both L and M. In this case, L and M are called neighbours.



Although the theory of neighbours was not known to Witt, the graph may give an indication of how likely it is to dig up a new Niemeier lattice by poking into an already discovered one.
The three certainties are the three lattices at the bottom of the neighborhood graph, making it more likely for the lattices in the lower region to be among Witt’s list.

For the other approach, the space of modular forms of weight 12 is two dimensional, with a basis formed by the series
{E6(q)=1+65520691(q+2049q2+177148q3+4196353q4+Δ(q)=q24q2+252q31472q4+

If you are at all with me, Witt would start with a lattice R which is a direct sum of root lattices, so he would know the number of its roots (the norm 2 vectors in R), let’s call this number r. Now, he wants to construct an even unimodular lattice L containing R, so the theta series of both L and R must start off with 1+rq2+. But, then he knows
θL(q)=E6(q)+(r65520691)Δ(q)
and comparing coefficients of θL(q) with those of θR(q) will give him an idea what extra vectors he has to throw in.

If we’re generous to Witt (and frankly, why shouldn’t we), we may believe that he used his vast knowledge of Steiner systems (a few years earlier he wrote the definite paper on the Mathieu groups, and a paper on Steiner systems) to construct in this way the lattices (A241)+ and (A122)+.

The ‘glue’ for (A241)+ is coming from the extended binary Golay code, which itself uses the Steiner system S(5,8,24). (A122)+ is constructed using the extended ternary Golay code, based on the Steiner system S(5,6,12).

The one thing that would never have crossed his mind that sunday in 1940 was to explore the possibility of an even unimodular 24-dimensional lattice Λ without any roots!

One with r=0, and thus with a theta series starting off as
θΛ(q)=1+196560q4+16773120q6+
No, he did not find the Leech lattice that day.

If he would have stumbled upon it, it would have simply blown his mind.

It would have been so much against all his experiences and intuitions that he would have dropped everything on the spot to write a paper about it, or at least, he would have mentioned in his ‘more than 10 lattices’-claim that, surprisingly, one of them was an even unimodular lattice without any roots.

Leave a Comment

de Bruijn’s pentagrids (2)

Last time we’ve seen that de Bruijn’s pentagrids determined the vertices of Penrose’s P3-aperiodic tilings.

These vertices can also be obtained by projecting a window of the standard hypercubic lattice Z5 by the cut-and-project-method.

We’ll bring in representation theory by forcing this projection to be compatible with a D5-subgroup of the symmetries of Z5, which explains why Penrose tilings have a local D5-symmetry.



The symmetry group of the standard n-dimensional hypercubic lattice
Ze1++ZenRn
is the hyperoctahedral group of all signed n×n permutation matrices
Bn=Cn2Sn
in which all n-permutations Sn act on the group Cn2={1,1}n of all signs. The signed permutation n×n matrix corresponding to an element (a,π)Bn is given by
Tij=T(a,π)ij=ajδi,π(j)
The represenation theory of Bn was worked out in 1930 by the British mathematician and clergyman Alfred Young




We want to do explicit calculations in Bn using a computational system such as GAP, so it is best to describe Bn as a permutation subgroup of S2n via the morphism
τ((a,π))(k)={π(k)+nδ1,ak if 1knπ(kn)+n(1δ1,akn) if n+1k2n
the image is generated by the permutations
{α=(1,2)(n+1,n+2),β=(1,2,,n)(n+1,n+2,,2n),γ=(n,2n)
and to a permutation στ(Bn)S2n we assign the signed permutation n×n matrix Tσ=T(τ1(π)).

We use GAP to set up B5 from these generators and determine all its conjugacy classes of subgroups. It turns out that B5 has no less than 953 different conjugacy classes of subgroups.

gap> B5:=Group((1,2)(6,7),(1,2,3,4,5)(6,7,8,9,10),(5,10));
Group([ (1,2)(6,7), (1,2,3,4,5)(6,7,8,9,10), (5,10) ])
gap> Size(B5);
3840
gap> C:=ConjugacyClassesSubgroups(B5);;
gap> Length(C);
953

But we are only interested in the subgroups isomorphic to D5. So, first we make a sublist of all conjugacy classes of subgroups of order 10, and then we go through this list one-by-one and look for an explicit isomorphism between D5=x,y | x5=e=y2, xyx=y and a representative of the class (or get a ‘fail’ is this subgroup is not isomorphic to D5).

gap> C10:=Filtered(C,x->Size(Representative(x))=10);;
gap> Length(C10);
3
gap> s10:=List(C10,Representative);
[ Group([ (2,5)(3,4)(7,10)(8,9), (1,5,4,3,2)(6,10,9,8,7) ]),
Group([ (1,6)(2,5)(3,4)(7,10)(8,9), (1,10,9,3,2)(4,8,7,6,5) ]),
Group([ (1,6)(2,7)(3,8)(4,9)(5,10), (1,2,8,4,10)(3,9,5,6,7) ]) ]
gap> D:=DihedralGroup(10); gap> IsomorphismGroups(D,s10[1]);
[ f1, f2 ] -> [ (2,5)(3,4)(7,10)(8,9), (1,5,4,3,2)(6,10,9,8,7) ]
gap> IsomorphismGroups(D,s10[2]);
[ f1, f2 ] -> [ (1,6)(2,5)(3,4)(7,10)(8,9), (1,10,9,3,2)(4,8,7,6,5) ]
gap> IsomorphismGroups(D,s10[3]);
fail
gap> IsCyclic(s10[3]);
true

Of the three (conjugacy classes of) subgroups of order 10, two are isomorphic to D5, and the third one to C10. Next, we have to transform the generating permutations into signed 5×5 permutation matrices using the bijection τ1.
σ(a,π)(2,5)(3,4)(7,10)(8,9)((1,1,1,1,1),(2,5)(3,4))(1,5,4,3,2)(6,10,9,8,7)((1,1,1,1,1)(1,5,4,3,2))(1,6)(2,5)(3,4)(7,10)(8,9)((1,1,1,1,1),(2,5)(3,4))(1,10,9,3,2)(4,8,7,6,5)((1,1,1,1,1),(1,5,4,3,2))
giving the signed permutation matrices
xyA[0100000100000100000110000][1000000001000100010001000]B[0100000100000100000110000][1000000001000100010001000]
D5 has 4 conjugacy classes with representatives e,y,x and x2. the
character table of D5 is
(1)(2)(2)(5)1a51522aD5exx2yT1111V1111W121+521520W221521+520
Using the signed permutation matrices it is easy to determine the characters of the 5-dimensional representations A and B
D5exx2yA5001B5001
decomosing into D5-irreducibles as
ATW1W2andBVW1W2
Representation A realises D5 as a rotation symmetry group of the hypercube lattice Z5 in R5, and next we have to find a D5-projection R5=AW1=R2.

As a complex representation AC5 decomposes as a direct sum of 1-dimensional representations
AC5=V1VζVζ2Vζ3Vζ4
where ζ=e2πi/5 and where the action of x on Vζi=Cvi is given by x.vi=ζivi. The x-eigenvectors in C5 are
{v0=(1,1,1,1,1)v1=(1,ζ,ζ2,ζ3,ζ4)v2=(1,ζ2,ζ4,ζ,ζ3)v3=(1,ζ3,ζ,ζ4,ζ2)v4=(1,ζ4,ζ3,ζ2,ζ)
The action of y on these vectors is given by y.vi=v5i because
x.(y.vi)=(xy).vi=(yx1).vi=y.(x1.vi)=y.(ζivi)=ζ1(y.vi)
and therefore y.vi is an x-eigenvector with eigenvalue ζ5i. As a complex D5-representation, the factors of A are therefore
T=Cv0,W1=Cv1+Cv4,andW2=Cv2+Cv3
But we want to consider A as a real representation. As ζj=cos(2πj5)+i sin(2πj5)=cj+isj hebben we can take the vectors in R5
{12(v1+v4)=(1,c1,c2,c3,c4)=u112i(v1v4)=(0,s1,s2,s3,s4)=u212(v2+v3)=(1,c2,c4,c1,c3)=w112i(v2v3)=(0,s2,s4,s1,s3)=w2
and A decomposes as a real D5-representation with
T=Rv0,W1=Ru1+Ru2,andW2=Rw1+Rw2
and if we identify C with R2 via z(Re(z),Im(z)) we can describe the D5-projection morphism πW1 : R5=AW1=R2 via
(y0,y1,y2,y3,y4)y0+y1ζ+y2ζ2+y3ζ3+y4ζ4=4i=0yi(ci,si)
Note also that W1 is the orthogonal complement of TW2, so is equal to the linear subspace in R5 determined by the three linear equations
{4i=0xi=04i=0c2ixi=04i=0s2ixi=0



Okay, now take the Rhombic tiling corresponding to the regular pentagrid defined by γ0,,γ4 satisfying 4i=0γi=0. Let k=(k0,,k4)Z5 and define the open hypercube Hk corresponding to k as the set of points
(x0,,x4)R5 : 0i4 : ki1<xi<ki From the vector γ=(γ0,,γ4) determining the Rhombic tiling we define the 2-dimensional plane Pγ in R5 given by the equations {4i=0xi=04i=0c2i(xiγi)=04i=0s2i(xiγi)=0 The point being that Pγ is the linear plane W1 in R5 translated over the vector γ, so it is parallel to W1. Here's the punchline:

de Bruijn’s theorem: The vertices of the Rhombic tiling produced by the regular pentagrid with parameters γ=(γ0,,γ4) are the points
4i=0ki(ci,si)
with k=(k0,,k4)Z5 such that HkPγ.

To see this, let x=(x0,,x4)Pγ, then xγW1, but then there is a vector yR2 such that
xjγj=y.vj 0j4
But then, with kj=y.vj+γj we have that xHk and we note that V(y)=4i=0kivi is a vetex of the Rhombic tiling associated to the regular pentagrid parameters γ=(γ0,,γ4).

Here we used regularity of the pentagrid in order to have that kj=y.vj+γj can happen for at most two j’s, so we can manage to vary y a little in order to have x in the open hypercube.

Here’s what we did so far: we have identified D5 as a group of rotations in R5, preserving the hypercube-lattice Z5 in R5. If the 2-plane Pγ is left stable under these rotations, then because rotations preserve distances, also the subset of lattice-points
Sγ={(k0,,k4) | HkPγ}Z5
is left stable under the D5-action. But, because the map
(k0,,k4)4i=0ki(ci,si)
is the D5-projection map π:AW1, the vertices of the associated Rhombic tiling must be stable under the D5-action on W1, meaning that the Rhombic tiling should have a global D5-symmetry.

Sadly, the only plane Pγ left stable under all rotations of D5 is when γ=0, which is an exceptionally singular pentagrid. If we project this situation we do indeed get an image with global D5-symmetry




but it is not a Rhombic tiling. What’s going on?

Because this post is already dragging on for far too long (TL;DR), we’ll save the investigation of projections of singular pentagrids, how they differ from the regular situation, and how they determine multiple Rhombic tilings, for another time.

Leave a Comment