Skip to content →

Category: math

the 171 moonshine groups

Published January 6, 2018 by lievenlb

Monstrous moonshine associates to every element of order $n$ of the monster group $\mathbb{M}$ an arithmetic group of the form
\[
(n|h)+e,f,\dots \]
where $h$ is a divisor of $24$ and of $n$ and where $e,f,\dots$ are divisors of $\frac{n}{h}$ coprime with its quotient.

In snakes, spines, and all that we’ve constructed the arithmetic group
\[
\Gamma_0(n|h)+e,f,\dots \]
which normalizes $\Gamma_0(N)$ for $N=h.n$. If $h=1$ then this group is the moonshine group $(n|h)+e,f,\dots$, but for $h > 1$ the moonshine group is a specific subgroup of index $h$ in $\Gamma_0(n|h)+e,f,\dots$.

I’m sure one can describe this subgroup explicitly in each case by analysing the action of the finite group $(\Gamma_0(n|h)+e,f,\dots)/\Gamma_0(N)$ on the $(N|1)$-snake. Some examples were worked out by John Duncan in his paper Arithmetic groups and the affine E8 Dynkin diagram.

But at the moment I don’t understand the general construction given by Conway, McKay and Sebbar in On the discrete groups of moonshine. I’m stuck at the last sentence of (2) in section 3. Nothing a copy of Charles Ferenbaugh Ph. D. thesis cannot fix.

The correspondence between the conjugacy classes of the Monster and these arithmetic groups takes up 3 pages in Conway & Norton’s Monstrous Moonshine. Here’s the beginning of it.

Leave a Comment

Snakes, spines, threads and all that

Published January 5, 2018 by lievenlb

Conway introduced his Big Picture to make it easier to understand and name the groups appearing in Monstrous Moonshine.

For $M \in \mathbb{Q}_+$ and $0 \leq \frac{g}{h} < 1$, $M,\frac{g}{h}$ denotes (the projective equivalence class of) the lattice \[ \mathbb{Z} (M \vec{e}_1 + \frac{g}{h} \vec{e}_2) \oplus \mathbb{Z} \vec{e}_2 \] which we also like to represent by the $2 \times 2$ matrix \[ \alpha_{M,\frac{g}{h}} = \begin{bmatrix} M & \frac{g}{h} \\ 0 & 1 \end{bmatrix} \] A subgroup $G$ of $GL_2(\mathbb{Q})$ is said to fix $M,\frac{g}{h}$ if
\[
\alpha_{M,\frac{g}{h}}.G.\alpha_{M,\frac{g}{h}}^{-1} \subset SL_2(\mathbb{Z}) \]
The full group of all elements fixing $M,\frac{g}{h}$ is the conjugate
\[
\alpha_{M,\frac{g}{h}}^{-1}.SL_2(\mathbb{Z}).\alpha_{M,\frac{g}{h}} \]
For a number lattice $N=N,0$ the elements of this group are all of the form
\[
\begin{bmatrix} a & \frac{b}{N} \\ cN & d \end{bmatrix} \qquad \text{with} \qquad \begin{bmatrix} a & b \\ c & d \end{bmatrix} \in SL_2(\mathbb{Z}) \]
and the intersection with $SL_2(\mathbb{Z})$ (which is the group of all elements fixing the lattice $1=1,0$) is the congruence subgroup
\[
\Gamma_0(N) = \{ \begin{bmatrix} a & b \\ cN & d \end{bmatrix}~|~ad-Nbc = 1 \} \]
Conway argues that this is the real way to think of $\Gamma_0(N)$, as the joint stabilizer of the two lattices $N$ and $1$!

The defining definition of 24 tells us that $\Gamma_0(N)$ fixes more lattices. In fact, it fixes exactly the latices $M \frac{g}{h}$ such that
\[
1~|~M~|~\frac{N}{h^2} \quad \text{with} \quad h^2~|~N \quad \text{and} \quad h~|~24 \]
Conway calls the sub-graph of the Big Picture on these lattices the snake of $(N|1)$.

Here’s the $(60|1)$-snake (note that $60=2^2.3.5$ so $h=1$ or $h=2$ and edges corresponding to the prime $2$ are coloured red, those for $3$ green and for $5$ blue).

\[
\xymatrix{& & & 15 \frac{1}{2} \ar@[red]@{-}[dd] & & \\
& & 5 \frac{1}{2} \ar@[red]@{-}[dd] & & & \\
& 15 \ar@[red]@{-}[rr] \ar@[blue]@{-}[dd] & & 30 \ar@[red]@{-}[rr] \ar@[blue]@{-}[dd] & & 60 \ar@[blue]@{-}[dd] \\
5 \ar@[green]@{-}[ru] \ar@[blue]@{-}[dd] \ar@[red]@{-}[rr] & & 10 \ar@[green]@{-}[ru] \ar@[red]@{-}[rr] \ar@[blue]@{-}[dd] & & 20 \ar@[green]@{-}[ru] \ar@[blue]@{-}[dd] & \\
& 3 \ar@[red]@{-}[rr] & & 6 \ar@[red]@{-}[rr] \ar@[red]@{-}[dd] & & 12 \\
1 \ar@[green]@{-}[ru] \ar@[red]@{-}[rr] & & 2 \ar@[green]@{-}[ru] \ar@[red]@{-}[rr] \ar@[red]@{-}[dd] & & 4 \ar@[green]@{-}[ru] & \\
& & & 3\frac{1}{2} & & \\
& & 1 \frac{1}{2} & & &} \]

The sub-graph of lattices fixed by $\Gamma_0(N)$ for $h=1$, that is all number-lattices $M=M,0$ for $M$ a divisor of $N$ is called the thread of $(N|1)$. Here’s the $(60|1)$-thread

\[
\xymatrix{
& 15 \ar@[red]@{-}[rr] \ar@[blue]@{-}[dd] & & 30 \ar@[red]@{-}[rr] \ar@[blue]@{-}[dd] & & 60 \ar@[blue]@{-}[dd] \\
5 \ar@[green]@{-}[ru] \ar@[blue]@{-}[dd] \ar@[red]@{-}[rr] & & 10 \ar@[green]@{-}[ru] \ar@[red]@{-}[rr] \ar@[blue]@{-}[dd] & & 20 \ar@[green]@{-}[ru] \ar@[blue]@{-}[dd] & \\
& 3 \ar@[red]@{-}[rr] & & 6 \ar@[red]@{-}[rr] & & 12 \\
1 \ar@[green]@{-}[ru] \ar@[red]@{-}[rr] & & 2 \ar@[green]@{-}[ru] \ar@[red]@{-}[rr] & & 4 \ar@[green]@{-}[ru] &
} \]

If $N$ factors as $N = p_1^{e_1} p_2^{e_2} \dots p_k^{e_k}$ then the $(N|1)$-thread is the product of the $(p_i^{e_i}|1)$-threads and has a symmetry group of order $2^k$.

It is generated by $k$ involutions, each one the reflexion in one $(p_i^{e_i}|1)$-thread and the identity on the other $(p_j^{e_j}|1)$-threads.
In the $(60|1)$-thread these are the reflexions in the three mirrors of the figure.

So, there is one involution for every divisor $e$ of $N$ such that $(e,\frac{N}{e})=1$. For such an $e$ there are matrices, with $a,b,c,d \in \mathbb{Z}$, of the form
\[
W_e = \begin{bmatrix} ae & b \\ cN & de \end{bmatrix} \quad \text{with} \quad ade^2-bcN=e \]
Think of Bezout and use that $(e,\frac{N}{e})=1$.

Such $W_e$ normalizes $\Gamma_0(N)$, that is, for any $A \in \Gamma_0(N)$ we have that $W_e.A.W_e^{-1} \in \Gamma_0(N)$. Also, the determinant of $W_e^e$ is equal to $e^2$ so we can write $W_e^2 = e A$ for some $A \in \Gamma_0(N)$.

That is, the transformation $W_e$ (left-multiplication) sends any lattice in the thread or snake of $(N|1)$ to another such lattice (up to projective equivalence) and if we apply $W_e^2$ if fixes each such lattice (again, up to projective equivalence), so it is the desired reflexion corresponding with $e$.

Consider the subgroup of $GL_2(\mathbb{Q})$ generated by $\Gamma_0(N)$ and some of these matrices $W_e,W_f,\dots$ and denote by $\Gamma_0(N)+e,f,\dots$ the quotient modulo positive scalar matrices, then
\[
\Gamma_0(N) \qquad \text{is a normal subgroup of} \qquad \Gamma_0(N)+e,f,\dots \]
with quotient isomorphic to some $(\mathbb{Z}/2\mathbb{Z})^l$ isomorphic to the subgroup generated by the involutions corresponding to $e,f,\dots$.

More generally, consider the $(n|h)$-thread for number lattices $n=n,0$ and $h=h,0$ such that $h | n$ as the sub-graph on all number lattices $l=l,0$ such that $h | l | n$. If we denote with $\Gamma_0(n|h)$ the point-wise stabilizer of $n$ and $h$, then we have that
\[
\Gamma(n|h) = \begin{bmatrix} h & 0 \\ 0 & 1 \end{bmatrix}^{-1}.\Gamma_0(\frac{n}{h}).\begin{bmatrix} h & 0 \\ 0 & 1 \end{bmatrix} \]
and we can then denote with
\[
\Gamma_0(n|h)+e,f,\dots \]
the conjugate of the corresponding group $\Gamma_0(\frac{n}{h})+e,f,\dots$.

If $h$ is the largest divisor of $24$ such that $h^2$ divides $N$, then Conway calls the spine of the $(N|1)$-snake the subgraph on all lattices of the snake whose distance from its periphery is exactly $log(h)$.

For $N=60$, $h=2$ and so the spine of the $(60|1)$-snake is the central piece connected with double black edges

\[
\xymatrix{& & & 15 \frac{1}{2} \ar@[red]@{-}[dd] & & \\
& & 5 \frac{1}{2} \ar@[red]@{-}[dd] & & & \\
& 15 \ar@[red]@{-}[rr] \ar@[blue]@{-}[dd] & & 30 \ar@[red]@{-}[rr] \ar@[black]@{=}[dd] & & 60 \ar@[blue]@{-}[dd] \\
5 \ar@[green]@{-}[ru] \ar@[blue]@{-}[dd] \ar@[red]@{-}[rr] & & 10 \ar@[black]@{=}[ru] \ar@[red]@{-}[rr] \ar@[black]@{=}[dd] & & 20 \ar@[green]@{-}[ru] \ar@[blue]@{-}[dd] & \\
& 3 \ar@[red]@{-}[rr] & & 6 \ar@[red]@{-}[rr] \ar@[red]@{-}[dd] & & 12 \\
1 \ar@[green]@{-}[ru] \ar@[red]@{-}[rr] & & 2 \ar@[black]@{=}[ru] \ar@[red]@{-}[rr] \ar@[red]@{-}[dd] & & 4 \ar@[green]@{-}[ru] & \\
& & & 3\frac{1}{2} & & \\
& & 1 \frac{1}{2} & & &} \]

which is the $(30|2)$-thread.

The upshot of all this is to have a visual proof of the Atkin-Lehner theorem which says that the full normalizer of $\Gamma_0(N)$ is the group $\Gamma_0(\frac{N}{h}|h)+$ (that is, adding all involutions) where $h$ is the largest divisor of $24$ for which $h^2|N$.

Any element of this normalizer must take every lattice in the $(N|1)$-snake fixed by $\Gamma_0(N)$ to another such lattice. Thus it follows that it must take the snake to itself.
Conversely, an element that takes the snake to itself must conjugate into itself the group of all matrices that fix every point of the snake, that is to say, must normalize $\Gamma_0(N)$.

But the elements that take the snake to itself are precisely those that take the spine to itself, and since this spine is just the $(\frac{N}{h}|h)$-thread, this group is just $\Gamma_0(\frac{N}{h}|h)+$.

Reference: J.H. Conway, “Understanding groups like $\Gamma_0(N)$”, in “Groups, Difference Sets, and the Monster”, Walter de Gruyter-Berlin-New York, 1996

Leave a Comment

The Big Picture is non-commutative

Published January 3, 2018 by lievenlb

Conway’s Big Picture consists of all pairs of rational numbers $M,\frac{g}{h}$ with $M > 0$ and $0 \leq \frac{g}{h} < 1$ with $(g,h)=1$. Recall from last time that $M,\frac{g}{h}$ stands for the lattice
\[
\mathbb{Z} (M \vec{e}_1 + \frac{g}{h} \vec{e}_2) \oplus \mathbb{Z} \vec{e}_2 \subset \mathbb{Q}^2 \]
and we associate to it the rational $2 \times 2$ matrix
\[
\alpha_{M,\frac{g}{h}} = \begin{bmatrix} M & \frac{g}{h} \\ 0 & 1 \end{bmatrix} \]

If $M$ is a natural number we write $M \frac{g}{h}$ and call the corresponding lattice number-like, if $g=0$ we drop the zero and write $M$.

The Big Picture carries a wealth of structures. Today, we will see that it can be factored as the product of Bruhat-Tits buildings for $GL_2(\mathbb{Q}_p)$, over all prime numbers $p$.

Here’s the factor-building for $p=2$, which is a $3$-valent tree:

To see this, define the distance between lattices to be
\[
d(M,\frac{g}{h}~|~N,\frac{i}{j}) = log~Det(q(\alpha_{M,\frac{g}{h}}.\alpha_{N,\frac{i}{j}}^{-1})) \]
where $q$ is the smallest strictly positive rational number such that $q(\alpha_{M,\frac{g}{h}}.\alpha_{N,\frac{i}{j}}^{-1}) \in GL_2(\mathbb{Z})$.

We turn the Big Picture into a (coloured) graph by drawing an edge (of colour $p$, for $p$ a prime number) between any two lattices distanced by $log(p)$.

\[
\xymatrix{M,\frac{g}{h} \ar@[red]@{-}[rr]|p & & N,\frac{i}{j}} \qquad~\text{iff}~\qquad d(M,\frac{g}{h}~|~N,\frac{i}{j})=log(p) \]

The $p$-coloured subgraph is $p+1$-valent.

The $p$-neighbours of the lattice $1 = \mathbb{Z} \vec{e}_1 \oplus \mathbb{Z} \vec{e}_2$ are precisely these $p+1$ lattices:

\[
p \qquad \text{and} \qquad \frac{1}{p},\frac{k}{p} \qquad \text{for} \qquad 0 \leq k < p \] And, multiplying the corresponding matrices with $\alpha_{M,\frac{g}{h}}$ tells us that the $p$-neighbours of $M,\frac{g}{h}$ are then these $p+1$ lattices: \[ pM,\frac{pg}{h}~mod~1 \qquad \text{and} \qquad \frac{M}{p},\frac{1}{p}(\frac{g}{h}+k)~mod~1 \qquad \text{for} \qquad 0 \leq k < p \] Here's part of the $2$-coloured neighbourhood of $1$

To check that the $p$-coloured subgraph is indeed the Bruhat-Tits building of $GL_2(\mathbb{Q}_p)$ it remains to see that it is a tree.

For this it is best to introduce $p+1$ operators on lattices

\[
p \ast \qquad \text{and} \qquad \frac{k}{p} \ast \qquad \text{for} \qquad 0 \leq k < p \] defined by left-multiplying $\alpha_{M,\frac{g}{h}}$ by the matrices \[ \begin{bmatrix} p & 0 \\ 0 & 1 \end{bmatrix} \qquad \text{and} \qquad \begin{bmatrix} \frac{1}{p} & \frac{k}{p} \\ 0 & 1 \end{bmatrix} \qquad \text{for} \qquad 0 \leq k < p \] The lattice $p \ast M,\frac{g}{h}$ lies closer to $1$ than $M,\frac{g}{h}$ (unless $M,\frac{g}{h}=M$ is a number) whereas the lattices $\frac{k}{p} \ast M,\frac{g}{h}$ lie further, so it suffices to show that the $p$ operators \[ \frac{0}{p} \ast,~\frac{1}{p} \ast,~\dots~,\frac{p-1}{p} \ast \] form a free non-commutative monoid.
This follows from the fact that the operator
\[
(\frac{k_n}{p} \ast) \circ \dots \circ (\frac{k_2}{p} \ast) \circ (\frac{k_1}{p} \ast) \]
is given by left-multiplication with the matrix
\[
\begin{bmatrix} \frac{1}{p^n} & \frac{k_1}{p^n}+\frac{k_2}{p^{n-1}}+\dots+\frac{k_n}{p} \\ 0 & 1 \end{bmatrix} \]
which determines the order in which the $k_i$ occur.

A lattice at distance $n log(p)$ from $1$ can be uniquely written as
\[
(\frac{k_{n-l}}{p} \ast) \circ \dots \circ (\frac{k_{l+1}}{p} \ast) \circ (p^l \ast) 1 \]
which gives us the unique path to it from $1$.

The Big Picture itself is then the product of these Bruhat-Tits trees over all prime numbers $p$. Decomposing the distance from $M,\frac{g}{h}$ to $1$ as
\[
d(M,\frac{g}{h}~|~1) = n_1 log(p_1) + \dots + n_k log(p_k) \]
will then allow us to find minimal paths from $1$ to $M,\frac{g}{h}$.

But we should be careful in drawing $2$-dimensional cells (or higher dimensional ones) in this ‘product’ of trees as the operators
\[
\frac{k}{p} \ast \qquad \text{and} \qquad \frac{l}{q} \ast \]
for different primes $p$ and $q$ do not commute, in general. The composition
\[
(\frac{k}{p} \ast) \circ (\frac{l}{q} \ast) \qquad \text{with matrix} \qquad \begin{bmatrix} \frac{1}{pq} & \frac{kq+l}{pq} \\ 0 & 1 \end{bmatrix} \]
has as numerator in the upper-right corner $0 \leq kq + l < pq$ and this number can be uniquely(!) written as \[ kq+l = up+v \qquad \text{with} \qquad 0 \leq u < q,~0 \leq v < p \] That is, there are unique operators $\frac{u}{q} \ast$ and $\frac{v}{p} \ast$ such that \[ (\frac{k}{p} \ast) \circ (\frac{l}{q} \ast) = (\frac{u}{q} \ast) \circ (\frac{v}{p} \ast) \] which determine the $2$-cells \[ \xymatrix{ \bullet \ar@[blue]@{-}[rr]^{\frac{u}{q} \ast} \ar@[red]@{-}[dd]_{\frac{v}{p} \ast} & & \bullet \ar@[red]@{-}[dd]^{\frac{k}{p} \ast} \\ & & \\ \bullet \ar@[blue]@{-}[rr]_{\frac{l}{q} \ast} & & \bullet} \] These give us the commutation relations between the free monoids of operators corresponding to different primes.
For the primes $2$ and $3$, relevant in the description of the Moonshine Picture, the commutation relations are

\[
(\frac{0}{2} \ast) \circ (\frac{0}{3} \ast) = (\frac{0}{3} \ast) \circ (\frac{0}{2} \ast), \quad
(\frac{0}{2} \ast) \circ (\frac{1}{3} \ast) = (\frac{0}{3} \ast) \circ (\frac{1}{2} \ast),
\quad
(\frac{0}{2} \ast) \circ (\frac{2}{3} \ast) = (\frac{1}{3} \ast) \circ (\frac{0}{2} \ast) \]

\[
(\frac{1}{2} \ast) \circ (\frac{0}{3} \ast) = (\frac{1}{3} \ast) \circ (\frac{1}{2} \ast), \quad
(\frac{1}{2} \ast) \circ (\frac{1}{3} \ast) = (\frac{2}{3} \ast) \circ (\frac{0}{2} \ast),
\quad
(\frac{1}{2} \ast) \circ (\frac{2}{3} \ast) = (\frac{2}{3} \ast) \circ (\frac{1}{2} \ast) \]

Leave a Comment