Tag: representations

The cartographers’ groups

Published March 13, 2007 by lievenlb

Just as cartographers like
Mercator drew maps of
the then known world, we draw dessins
d ‘enfants to depict the
associated algebraic curve defined over
$\overline{\mathbb{Q}} $.

In order to see that such a dessin
d’enfant determines a permutation representation of one of
Grothendieck’s cartographic groups, $SL_2(\mathbb{Z}),
\Gamma_0(2) $ or $\Gamma(2) $ we need to have realizations of these
groups (as well as their close relatives
$PSL_2(\mathbb{Z}),GL_2(\mathbb{Z}) $ and $PGL_2(\mathbb{Z}) $) in
terms of generators and relations.

As this lesson will be rather
technical I’d better first explain what we will prove (so that you can
skip it if you feel comfortable with the statements) and why we want to
prove it. What we will prove in detail below is that these groups
can be written as free (or amalgamated) group products. We will explain
what this means and will establish that

$PSL_2(\mathbb{Z}) = C_2
\ast C_3, \Gamma_0(2) = C_2 \ast C_{\infty}, \Gamma(2)
= C_{\infty} \ast C_{\infty} $

$SL_2(\mathbb{Z}) =
C_4 \ast_{C_2} C_6, GL_2(\mathbb{Z}) = D_4 \ast_{D_2} D_6,
PGL_2(\mathbb{Z}) = D_2 \ast_{C_2} D_3 $

where $C_n $ resp.
$D_n $ are the cyclic (resp. dihedral) groups. The importance of these
facts it that they will allow us to view the set of (isomorphism classes
of) finite dimensional representations of these groups as
noncommutative manifolds . Looking at the statements above we
see that these arithmetical groups can be build up from the first
examples in any course on finite groups : cyclic and dihedral
groups.

Recall that the cyclic group of order n, $C_n $ is the group of
rotations of a regular n-gon (so is generated by a rotation r with
angle $\frac{2 \pi}{n} $ and has defining relation $r^n = 1 $, where 1
is the identity). However, regular n-gons have more symmetries :
flipping over one of its n lines of symmetry

The dihedral group $D_n $ is the group generated by the n
rotations and by these n flips. If, as before r is a generating
rotation and d is one of the flips, then it is easy to see that the
dihedral group is generated by r and d and satisfied the defining
relations

$r^n=1 $ and $d^2 = 1 = (rd)^2 $

Flipping twice
does nothing and to see the relation $~(rd)^2=1 $ check that doing twice a
rotation followed by a flip brings all vertices back to their original
location. The dihedral group $D_n $ has 2n elements, the n-rotations
$r^i $ and the n flips $dr^i $.

In fact, to get at the cartographic
groups we will only need the groups $D_4, D_6 $ and their
subgroups. Let us start by finding generators of the largest
group $GL_2(\mathbb{Z}) $ which is the group of all invertible $2
\times 2 $ matrices with integer coefficients.

Consider the
elements

$U = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix},
V = \begin{bmatrix} 0 & 1 \\ -1 & 1 \end{bmatrix}/tex] and $R =
\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} $

and form the
matrices

$X = UV = \begin{bmatrix} 1 & -1 \\ 0 & 1
\end{bmatrix}, Y = VU = \begin{bmatrix} 1 & 0 \\ 1 & 1
\end{bmatrix} $

By induction we prove the following relations in
$GL_2(\mathbb{Z}) $

$X^n \begin{bmatrix} a & b \\ c & d
\end{bmatrix} = \begin{bmatrix} a-nc & b-nd \\ c & d \end{bmatrix} $
and $\begin{bmatrix} a & b \\ c& d \end{bmatrix} X^n =
\begin{bmatrix} a & b-na \\ c & d-nc \end{bmatrix} $

$Y^n \begin{bmatrix} a & b \\ c & d \end{bmatrix} =
\begin{bmatrix} a & b \\ c+na & d+nb \end{bmatrix} $ and
$\begin{bmatrix} a & b \\ c & d \end{bmatrix} Y^n = \begin{bmatrix}
a+nb & b \\ c+nd & d \end{bmatrix} $

The determinant ad-bc of
a matrix in $GL_2(\mathbb{Z}) $ must be $\pm 1 $ whence all rows and
columns of

$\begin{bmatrix} a & b \\ c & d \end{bmatrix} \in
GL_2(\mathbb{Z}) $

consist of coprime numbers and hence a and
c can be reduced modulo each other by left multiplication by a power
of X or Y until one of them is zero and the other is $\pm 1 $. We
may even assume that $a = \pm 1 $ (if not, left multiply with U).

So,
by left multiplication by powers of X and Y and U we can bring any
element of $GL_2(\mathbb{Z}) $ into the form

$\begin{bmatrix}
\pm 1 & \beta \\ 0 & \pm 1 \end{bmatrix} $

and again by left
multiplication by a power of X we can bring it in one of the four
forms

$\begin{bmatrix} \pm 1 & 0 \\ 0 & \pm 1 \end{bmatrix}
= { 1,UR,RU,U^2 } $

This proves that $GL_2(\mathbb{Z}) $ is
generated by the elements U,V and R.

Similarly, the group
$SL_2(\mathbb{Z}) $ of all $2 \times 2 $ integer matrices with
determinant 1 is generated by the elements U and V as using the
above method and the restriction on the determinant we will end up with
one of the two matrices

${ \begin{bmatrix} 1 & 0 \\ 0 & 1
\end{bmatrix},\begin{bmatrix} -1 & 0 \\ 0 & -1 \end{bmatrix} } =
{ 1,U^2 } $

so we never need the matrix R. As for
relations, there are some obvious relations among the matrices U,V and
R, namely

$U^2=V^3 $ and $1=U^4=R^2=(RU)^2=(RV)^2$ $

The
real problem is to prove that all remaining relations are consequences
of these basic ones. As R clearly has order two and its commutation
relations with U and V are just $RU=U^{-1}R $ and $RV=V^{-1}R $ we can
pull R in any relation to the far right and (possibly after
multiplying on the right with R) are left to prove that the only
relations among U and V are consequences of $U^2=V^3 $ and
$U^4=1=V^6 $.

Because $U^2=V^3 $ this element is central in the
group generated by U and V (which we have seen to be
$SL_2(\mathbb{Z}) $) and if we quotient it out we get the modular
group

$\Gamma = PSL_2(\mathbb{Z}) $

Hence in order to prove our claim
it suffices that

$PSL_2(\mathbb{Z}) = \langle
\overline{U},\overline{V} : \overline{U}^2=\overline{V}^3=1
\rangle $

Phrased differently, we have to show that
$PSL_2(\mathbb{Z}) $ is the free group product of the cyclic groups of
order two and three (those generated by $u = \overline{U} $ and
$v=\overline{V} $) $C_2 \ast C_3 $

Any element of this free group
product is of the form $~(u)v^{a_1}uv^{a_2}u \ldots
uv^{a_k}(u) $ where beginning and trailing u are optional and
all $a_i $ are either 1 or 2.

So we have to show that in
$PSL_2(\mathbb{Z}) $ no such word can give the identity
element. Today, we will first sketch the classical argument based
on the theory of groups acting on trees due to Jean-Pierre
Serre and Hyman Bass. Tomorrow, we will give a short elegant proof due to
Roger Alperin and draw
consequences to the description of the carthographic groups as
amalgamated free products of cyclic and dihedral groups.

Recall
that $GL_2(\mathbb{Z}) $ acts via Moebius
transformations on
the complex plane $\mathbb{C} = \mathbb{R}^2 $ (actually it is an
action on the Riemann sphere $\mathbb{P}^1_{\mathbb{C}} $) given by the
maps

$\begin{bmatrix} a & b \\ c & d \end{bmatrix}.z =
\frac{az+b}{cz+d} $

Note that the action of the
center of $GL_2(\mathbb{Z}) $ (that is of $\pm \begin{bmatrix} 1 & 0
\\ 0 & 1 \end{bmatrix} $) acts trivially, so it is really an action of
$PGL_2(\mathbb{Z}) $.

As R interchanges the upper and lower half-plane
we might as well restrict to the action of $SL_2(\mathbb{Z}) $ on the
upper-halfplane $\mathcal{H} $. It is quite easy to see that a
fundamental domain
for this action is given by the greyed-out area

To see that any $z \in \mathcal{H} $ can be taken into this
region by an element of $PSL_2(\mathbb{Z}) $ note the following two
Moebius transformations

$\begin{bmatrix} 1 & 1 \\ 0 & 1
\end{bmatrix}.z = z+1 $ and $\begin{bmatrix} 0 & 1 \\ -1
& 0 \end{bmatrix}.z = -\frac{1}{z} $

The first
operation takes any z into a strip of length one, for example that
with Re(z) between $-\frac{1}{2} $ and $\frac{1}{2} $ and the second
interchanges points within and outside the unit-circle, so combining the
two we get any z into the greyed-out region. Actually, we could have
taken any of the regions in the above tiling as our fundamental domain
as they are all translates of the greyed-out region by an element of
$PSL_2(\mathbb{Z}) $.

Of course, points on the boundary of the
greyed-out fundamental region need to be identified (in order to get the
identification of $\overline{\mathcal{H}/PSL_2(\mathbb{Z})} $ with the
Riemann sphere $S^2=\mathbb{P}^1_{\mathbb{C}} $). For example, the two
halves of the boundary by the unit circle are interchanged by the action
of the map $z \rightarrow -\frac{1}{z} $ and if we take the translates under
$PSL_2(\mathbb{Z}) $ of the indicated circle-part

we get a connected tree with fundamental domain the circle
part bounded by i and $\rho = \frac{1}{2}+\frac{\sqrt{3}}{2} i $.
Calculating the stabilizer subgroup of i (that is, the subgroup of
elements fixing i) we get that this subgroup
is $\langle u \rangle = C_2 $ whereas the stabilizer subgroup of
$\rho $ is $\langle v \rangle = C_3 $.

Using this facts and the general
results of Jean-Pierre Serres book Trees
one deduces that $PSL_2(\mathbb{Z}) = C_2 \ast C_3 $
and hence that the obvious relations among U,V and R given above do
indeed generate all relations.

4 Comments

Monsieur Mathieu

Published March 1, 2007 by lievenlb

Even a virtual course needs an opening line, so here it is : Take your favourite $SL_2(\mathbb{Z}) $-representation Here is mine : the permutation presentation of the Mathieu group(s). Emile Leonard Mathieu is remembered especially for his discovery (in 1861 and 1873) of five sporadic simple groups named after him, the Mathieu groups $M_{11},M_{12},M_{22},M_{23} $ and $M_{24} $. These were studied in his thesis on transitive functions. He had a refreshingly direct style
of writing. I’m not sure what Cauchy would have thought (Cauchy died in 1857) about this ‘acknowledgement’ in his 1861-paper in which Mathieu describes $M_{12} $ and claims the construction of $M_{24} $.

Also the opening sentenses of his 1873 paper are nice, something along the lines of “if no expert was able to fill in the details of my claims made twelve years ago, I’d better do it myself”.

However, even after this paper opinions remained divided on the issue whether or not he did really achieve his goal, and the matter was settled decisively by Ernst Witt connecting the Mathieu groups to Steiner systems (if I recall well from Mark Ronan’s book Symmetry and the monster)

As Mathieu observed, the quickest way to describe these groups would be to give generators, but as these groups are generated by two permutations on 12 respectively 24 elements, we need to have a mnemotechnic approach to be able to reconstruct them whenever needed.

Here is a nice approach, due to Gunther Malle in a Luminy talk in 1993 on “Dessins d’enfants” (more about them later). Consider the drawing of “Monsieur Mathieu” on the left. That is, draw the left-handed bandit picture on 6 edges and vertices, divide each edge into two and give numbers to both parts (the actual numbering is up to you, but for definiteness let us choose the one on the left). Then, $M_{12} $ is generated by the order two permutation describing the labeling of both parts of the edges

$s=(1,2)(3,4)(5,8)(7,6)(9,12)(11,10) $

together with the order three permutation obtained from cycling counterclockwise
around a trivalent vertex and calling out the labels one encounters. For example, the three cycle corresponding to the ‘neck vertex’ is $~(1,2,3) $ and the total permutation
is

$t=(1,2,3)(4,5,6)(8,9,10) $

A quick verification using GAP tells that these elements do indeed generate a simple group of order 95040.

Similarly, if you have to reconstruct the largest Mathieu group from scratch, apply the same method to the the picture above or to “ET Mathieu” drawing on the left. This picture I copied from Alexander Zvonkin‘s paper How to draw a group as well as the computational details below.

This is all very nice and well but what do these drawings have to do with Grothendieck’s “dessins d’enfants”? Consider the map from the projective line onto itself

$\mathbb{P}^1_{\mathbb{C}} \rightarrow \mathbb{P}^1_{\mathbb{C}}$

defined by the rational map

$f(z) = \frac{(z^3-z^2+az+b)^3(z^3+cz^2+dz+e)}{Kz} $

where N. Magot calculated that

$a=\frac{107+7 \sqrt{-11}}{486},
b=-\frac{13}{567}a+\frac{5}{1701}, c=-\frac{17}{9},
d=\frac{23}{7}a+\frac{256}{567},
e=-\frac{1573}{567}a+\frac{605}{1701} $

and finally

$K =
-\frac{16192}{301327047}a+\frac{10880}{903981141} $

One verifies that this map is 12 to 1 everywhere except over the points ${
0,1,\infty } $ (that is, there are precisely 12 points mapping under f to a given point of $\mathbb{P}^1_{\mathbb{C}} – { 0,1,\infty } $. From the expression of f(z) it is clear that over 0 there lie 6 points (3 of which with multiplicity three, the others of multiplicity one). Over $\infty $ there are two points, one with multiplicity 11 and one with multiplicity one. The difficult part is to compute the points lying over 1. The miraculous fact of the given values is that

$f(z)-1 = \frac{-B(z)^2}{Kz} $

where

$B(z)=z^6+\frac{1}{11}(10c-8)z^5+(5a+9d-7c)z^4+(2b+4ac+8e-6d)z^3+$
$(3ad+bc-5e)z^2+2aez-be) $

and hence there are 6 points lying over 1 each with mutiplicity two.

Right, now consider the complex projective line $\mathbb{P}^1_{\mathbb{C}} $ as the Riemann sphere $S^2 $ and mark the six points lying over 1 by a white vertex and the six points lying over 0 with a black vertex (in the source sphere). Now, lift the real interval $[0,1] $ in the target sphere $\mathbb{P}^1_{\mathbb{C}} = S^2 $ to its inverse image on the source sphere. As there are exactly 12 points lying over each real
number $0 \lneq r \lneq 1 $, this inverse image will consist of 12 edges which are noncrossing and each end in one black and one white vertex. The obtained graph will look like the \”Monsieur Mathieu\” drawing above with the vertices corresponding to the black vertices and the three points over 1 of multiplicity three corresponding to the
trivalent vertices, those of multiplicity one to the three end-vertices. The white vertices correspond to mid-points of the six edges, so that we do get a drawing with twelve edges, one corresponding to each number. From the explicit description of f(z) it is clear that this map is defined over $\mathbb{Q}\sqrt{-11} $ which is also the
smallest field containing all character-values of the Mathieu group $M_{12} $. Further, the Galois group of the extension $Gal(\mathbb{Q}\sqrt{-11}/\mathbb{Q}) =
\mathbb{Z}/2\mathbb{Z} $ and is generated by complex conjugation. So, one might wonder what would happen if we replaced in the definition of the rational map f(z) the value of a by $a = \frac{107-\sqrt{-11}}{486} $. It turns out that this modified map has the same properties as $f(z) $ so again one can draw on the source sphere a picture consisting of twelve edges each ending in a white and black vertex.

If we consider the white vertices (which incidentally each lie on two edges as all points lying over 0 are of multiplicity two) as mid-points of longer edges connecting the
black vertices we obtain a drawing on the sphere which looks like \”Monsieur Mathieu\” but this time as a right handed bandit, and applying our mnemotechnic rule we obtain _another_ (non conjugated) embedding of $M_{12} $ in the full symmetric group on 12 vertices.

What is the connection with $SL_2(\mathbb{Z}) $-representations? Well, the permutation generators s and t of $M_{12} $ (or $M_{24} $ for that matter) have orders two and three, whence there is a projection from the free group product $C_2 \star C_3 $ (here $C_n $ is just the cyclic group of order n) onto $M_{12} $ (respectively $M_{24} $). Next
time we will say more about such free group products and show (among other things) that $PSL_2(\mathbb{Z}) \simeq C_2 \star C_3 $ whence the connection with $SL_2(\mathbb{Z}) $. In a following lecture we will extend the Monsieur Mathieu example to
arbitrary dessins d\’enfants which will allow us to assign to curves defined over $\overline{\mathbb{Q}} $ permutation representations of $SL_2(\mathbb{Z}) $ and other _cartographic groups_ such as the congruence subgroups $\Gamma_0(2) $ and
$\Gamma(2) $.

9 Comments

noncommutative geometry : a medieval science?

Published February 28, 2007 by lievenlb

According to a science article in the New York Times, archeologists have discovered “signs of advanced math” in medieval mosaics. An example of a quasi-crystalline Penrose pattern was found at the Darb-i Imam shrine in Isfahan, Iran.

“A new study shows that the Islamic pattern-making process, far more intricate than the laying of one‚Äôs bathroom floor, appears to have involved an advanced math of quasi crystals, which was not understood by modern scientists until three decades ago. Two years ago, Peter J. Lu, a doctoral student in physics at Harvard University, was transfixed by the geometric pattern on a wall in Uzbekistan. It reminded him of what mathematicians call quasi-crystalline designs. These were demonstrated in the early 1970s by Roger Penrose, a mathematician and cosmologist at the University of Oxford. Mr. Lu set about examining pictures of other tile mosaics from Afghanistan, Iran, Iraq and Turkey, working with Paul J. Steinhardt, a Princeton cosmologist who is an authority on quasi crystals and had been Mr. Lu’s undergraduate adviser. ”

Penrose tilings are one of the motivating examples of Alain Connes’ book as there is a $C^* $-algebra associated to it. In fact, the algebra is AF ( a limit of semi-simple finite dimensional algebras) so is even a formally smooth algebra in Kontsevichian noncommutative geometry (it is remarkable how quickly one gets used to silly terminology…). However, the Penrose algebra is simple, so rather useless from the point of view of finite dimensional representations… Still, Connesian noncommutative geometry may be a recent incarnation of the medieval Tehran program (pun intended). Thanks to easwaran for the link (via Technorati).

Added, March 1 : I haven’t looked at the Connes-Marcolli paper A walk in the noncommutative garden for a while but now that I do, I see that they mentioned the above already at the end of their section on Tilings (page 32). They also include clearer pictures.

One Comment