Conway and Norton showed that there are exactly 171 moonshine functions and associated two arithmetic subgroups to them. We want a tool to describe these and here’s where Conway’s big picture comes in very handy. All moonshine groups are arithmetic groups, that is, they are commensurable with the modular group. Conway’s idea is to view several of these groups as point- or set-wise stabilizer subgroups of finite sets of (projective) commensurable 2-dimensional lattices.
Expanding (and partially explaining) the original moonshine observation of McKay and Thompson, John Conway and Simon Norton formulated monstrous moonshine :
To every cyclic subgroup of the Monster is associated a function
with and all coefficients are characters at of a representation of . These representations are the homogeneous components of the so called Moonshine module.
Each is a principal modulus for a certain genus zero congruence group commensurable with the modular group . These groups are called the moonshine groups.
Conway and Norton showed that there are exactly 171 different functions and associated two arithmetic subgroups to them (in most cases, but not all, these two groups coincide).
Whereas there is an extensive literature on subgroups of the modular group (see for instance the series of posts starting here), most moonshine groups are not contained in the modular group. So, we need a tool to describe them and here’s where Conway’s big picture comes in very handy.
All moonshine groups are arithmetic groups, that is, they are subgroups of which are commensurable with the modular group meaning that the intersection is of finite index in both and in . Conway’s idea is to view several of these groups as point- or set-wise stabilizer subgroups of finite sets of (projective) commensurable 2-dimensional lattices.
Start with a fixed two dimensional lattice and we want to name all lattices of the form that are commensurable to . Again this means that the intersection is of finite index in both lattices. From this it follows immediately that all coefficients are rational numbers.
It simplifies matters enormously if we do not look at lattices individually but rather at projective equivalence classes, that is if there is a rational number such that . Further, we are of course allowed to choose a different ‘basis’ for our lattices, that is, whenever for some .
Using both operations we can get any lattice in a specific form. For example,
Here, identities (1) and (3) follow from projective equivalence and identity (2) from a base-change. In general, any lattice commensurable to the standard lattice can be rewritten uniquely as where a positive rational number and with .
Another major feature is that one can define a symmetric hyper-distance between (equivalence classes of) such lattices. Take and and consider the matrix
and let be the smallest positive rational number such that all entries of the matrix are integers, then
defines a symmetric hyperdistance which depends only of the equivalence classes of lattices (hyperdistance because the log of it behaves like an ordinary distance).
Conway’s big picture is the graph obtained by taking as its vertices the equivalence classes of lattices commensurable with and with edges connecting any two lattices separated by a prime number hyperdistance. Here’s part of the 2-picture, that is, only depicting the edges of hyperdistance 2.

The 2-picture is an infinite 3-valent tree as there are precisely 3 classes of lattices at hyperdistance 2 from any lattice namely (the equivalence classes of) and .
Similarly, for any prime hyperdistance p, the p-picture is an infinite p+1-valent tree and the big picture is the product over all these prime trees. That is, two lattices at square-free hyperdistance are two corners of a k-cell in the big picture!
(Astute readers of this blog (if such people exist…) may observe that Conway’s big picture did already appear here prominently, though in disguise. More on this another time).
The big picture presents a simple way to look at arithmetic groups and makes many facts about them visually immediate. For example, the point-stabilizer subgroup of clearly is the modular group . The point-stabilizer of any other lattice is a certain conjugate of the modular group inside . For example, the stabilizer subgroup of the lattice (at hyperdistance N from ) is the subgroup
Now the intersection of these two groups is the modular subgroup (consisting of those modular group element whose lower left-hand entry is divisible by N). That is, the proper way to look at this arithmetic group is as the joint stabilizer of the two lattices . The picture makes it trivial to compute the index of this subgroup.
Consider the ball with center and hyper-radius N (on the left, the ball with hyper-radius 4). Then, it is easy to show that the modular group acts transitively on the boundary lattices (including the lattice ), whence the index is just the number of these boundary lattices. For N=4 the picture shows that there are exactly 6 of them. In general, it follows from our knowledge of all the p-trees the number of all lattices at hyperdistance N from is equal to , in accordance with the well-known index formula for these modular subgroups!
But, there are many other applications of the big picture giving a simple interpretation for the Hecke operators, an elegant proof of the Atkin-Lehner theorem on the normalizer of (the whimsical source of appearances of the number 24) and of Helling’s theorem characterizing maximal arithmetical groups inside as conjugates of the normalizers of for square-free N.
J.H. Conway’s paper “Understanding groups like ” containing all this material is a must-read! Unfortunately, I do not know of an online version.