Skip to content →

Category: groups

Dessinflateurs

I’m trying to get into the latest Manin-Marcolli paper Quantum Statistical Mechanics of the Absolute Galois Group on how to create from Grothendieck’s dessins d’enfant a quantum system, generalising the Bost-Connes system to the non-Abelian part of the absolute Galois group Gal(Q/Q).

In doing so they want to extend the action of the multiplicative monoid N× by power maps on the roots of unity to the action of a larger monoid on all dessins d’enfants.

Here they use an idea, originally due to Jordan Ellenberg, worked out by Melanie Wood in her paper Belyi-extending maps and the Galois action on dessins d’enfants.



To grasp this, it’s best to remember what dessins have to do with Belyi maps, which are maps defined over Q
π:ΣP1
from a Riemann surface Σ to the complex projective line (aka the 2-sphere), ramified only in 0,1 and . The dessin determining π is the 2-coloured graph on the surface Σ with as black vertices the pre-images of 0, white vertices the pre-images of 1 and these vertices are joined by the lifts of the closed interval [0,1], so the number of edges is equal to the degree d of the map.

Wood considers a very special subclass of these maps, which she calls Belyi-extender maps, of the form
γ:P1P1
defined over Q with the additional property that γ maps {0,1,} into {0,1,}.

The upshot being that post-compositions of Belyi’s with Belyi-extenders γπ are again Belyi maps, and if two Belyi’s π and π lie in the same Galois orbit, then so must all γπ and γπ.

The crucial Ellenberg-Wood idea is then to construct “new Galois invariants” of dessins by checking existing and easily computable Galois invariants on the dessins of the Belyi’s γπ.

For this we need to know how to draw the dessin of γπ on Σ if we know the dessins of π and of the Belyi-extender γ. Here’s the procedure



Here, the middle dessin is that of the Belyi-extender γ (which in this case is the power map tt4) and the upper graph is the unmarked dessin of π.

One has to replace each of the black-white edges in the dessin of π by the dessin of the expander γ, but one must be very careful in respecting the orientations on the two dessins. In the upper picture just one edge is replaced and one has to do this for all edges in a compatible manner.

Thus, a Belyi-expander γ inflates the dessin π with factor the degree of γ. For this reason i prefer to call them dessinflateurs, a contraction of dessin+inflator.

In her paper, Melanie Wood says she can separate dessins for which all known Galois invariants were the same, such as these two dessins,



by inflating them with a suitable Belyi-extender and computing the monodromy group of the inflated dessin.

This monodromy group is the permutation group generated by two elements, the first one gives the permutation on the edges given by walking counter-clockwise around all black vertices, the second by walking around all white vertices.

For example, by labelling the edges of Δ, its monodromy is generated by the permutations (2,3,5,4)(1,6)(8,10,9) and (1,3,2)(4,7,5,8)(9,10) and GAP tells us that the order of this group is 1814400. For Ω the generating permutations are (1,2)(3,6,4,7)(8,9,10) and (1,2,4,3)(5,6)(7,9,8), giving an isomorphic group.

Let’s inflate these dessins using the Belyi-extender γ(t)=274(t3t2) with corresponding dessin



It took me a couple of attempts before I got the inflated dessins correct (as i knew from Wood that this simple extender would not separate the dessins). Inflated Ω on top:



Both dessins give a monodromy group of order 35838544379904000000.

Now we’re ready to do serious work.

Melanie Wood uses in her paper the extender ζ(t)=27t2(t1)24(t2t+1)3 with associated dessin



and says she can now separate the inflated dessins by the order of their monodromy groups. She gets for the inflated Δ the order 19752284160000 and for inflated Ω the order 214066877211724763979841536000000000000.

It’s very easy to make mistakes in these computations, so probably I did something horribly wrong but I get for both Δ and Ω that the order of the monodromy group of the inflated dessin is 214066877211724763979841536000000000000.

I’d be very happy when someone would be able to spot the error!

One Comment

Monstrous dessins 3

A long while ago I promised to take you from the action by the modular group Γ=PSL2(Z) on the lattices at hyperdistance n from the standard orthogonal laatice L1 to the corresponding ‘monstrous’ Grothendieck dessin d’enfant.

Speaking of dessins d’enfant, let me point you to the latest intriguing paper by Yuri I. Manin and Matilde Marcolli, ArXived a few days ago Quantum Statistical Mechanics of the Absolute Galois Group, on how to build a quantum system for the absolute Galois group from dessins d’enfant (more on this, I promise, later).

Where were we?

We’ve seen natural one-to-one correspondences between (a) points on the projective line over Z/nZ, (b) lattices at hyperdistance n from L1, and (c) coset classes of the congruence subgroup Γ0(n) in Γ.

How to get from there to a dessin d’enfant?

The short answer is: it’s all in Ravi S. Kulkarni’s paper, “An arithmetic-geometric method in the study of the subgroups of the modular group”, Amer. J. Math 113 (1991) 1053-1135.

It is a complete mystery to me why Tatitscheff, He and McKay don’t mention Kulkarni’s paper in “Cusps, congruence groups and monstrous dessins”. Because all they do (and much more) is in Kulkarni.

I’ve blogged about Kulkarni’s paper years ago:

– In the Dedekind tessalation it was all about assigning special polygons to subgroups of finite index of Γ.

– In Modular quilts and cuboid tree diagram it did go on assigning (multiple) cuboid trees to a (conjugacy class) of such finite index subgroup.

– In Hyperbolic Mathieu polygons the story continued on a finite-to-one connection between special hyperbolic polygons and cuboid trees.

– In Farey codes it was shown how to encode such polygons by a Farey-sequence.

– In Generators of modular subgroups it was shown how to get generators of the finite index subgroups from this Farey sequence.

The modular group is a free product
Γ=C2C3=s,u | s2=1=u3
with lifts of s and u to SL2(Z) given by the matrices
S=[0110], U=[0111]

As a result, any permutation representation of Γ on a set E can be represented by a 2-coloured graph (with black and white vertices) and edges corresponding to the elements of the set E.

Each white vertex has two (or one) edges connected to it and every black vertex has three (or one). These edges are the elements of E permuted by s (for white vertices) and u (for black ones), the order of the 3-cycle determined by going counterclockwise round the vertex.



Clearly, if there’s just one edge connected to a vertex, it gives a fixed point (or 1-cycle) in the corresponding permutation.

The ‘monstrous dessin’ for the congruence subgroup Γ0(n) is the picture one gets from the permutation Γ-action on the points of P1(Z/nZ), or equivalently, on the coset classes or on the lattices at hyperdistance n.

Kulkarni’s paper (or the blogposts above) tell you how to get at this picture starting from a fundamental domain of Γ0(n) acting on teh upper half-plane by Moebius transformations.

Sage gives a nice image of this fundamental domain via the command


FareySymbol(Gamma0(n)).fundamental_domain()

Here’s the image for n=6:



The boundary points (on the halflines through 0 and 1 and the 4 half-circles need to be identified which is indicaed by matching colours. So the 2 halflines are identified as are the two blue (and green) half-circles (in opposite direction).

To get the dessin from this, let’s first look at the interior points. A white vertex is a point in the interior where two black and two white tiles meet, a black vertex corresponds to an interior points where three black and three white tiles meet.

Points on the boundary where tiles meet are coloured red, and after identification two of these reds give one white or black vertex. Here’s the intermediate picture



The two top red points are identified giving a white vertex as do the two reds on the blue half-circles and the two reds on the green half-circles, because after identification two black and two white tiles meet there.

This then gives us the ‘monstrous’ modular dessin for n=6 of the Tatitscheff, He and McKay paper:



Let’s try a more difficult example: n=12. Sage gives us as fundamental domain



giving us the intermediate picture



and spotting the correct identifications, this gives us the ‘monstrous’ dessin for Γ0(12) from the THM-paper:

In general there are several of these 2-coloured graphs giving the same permutation representation, so the obtained ‘monstrous dessin’ depends on the choice of fundamental domain.

You’ll have noticed that the domain for Γ0(6) was symmetric, whereas the one Sage provides for Γ0(12) is not.

This is caused by Sage using the Farey-code
Misplaced &

One of the nice results from Kulkarni’s paper is that for any n there is a symmetric Farey-code, giving a perfectly symmetric fundamental domain for Γ0(n). For n=12 this symmetric code is

Misplaced &

It would be nice to see whether using these symmetric Farey-codes gives other ‘monstrous dessins’ than in the THM-paper.

Remains to identify the edges in the dessin with the lattices at hyperdistance n from L1.

Using the tricks from the previous post it is quite easy to check that for any n the monstrous dessin for Γ0(n) starts off with the lattices LM,gh=M,gh as below



Let’s do a sample computation showing that the action of s on Ln gives L1n:

Ln.s=[n001][0110]=[0n10]

and then, as last time, to determine the class of the lattice spanned by the rows of this matrix we have to compute

[0110][0n10]=[100n]

which is class L1n. And similarly for the other edges.

2 Comments

Monstrous dessins 2

Let’s try to identify the Ψ(n)=np|n(1+1p) points of P1(Z/nZ) with the lattices LMgh at hyperdistance n from the standard lattice L1 in Conway’s big picture.

Here are all 24=Ψ(12) lattices at hyperdistance 12 from L1 (the boundary lattices):

You can also see the 4=Ψ(3) lattices at hyperdistance 3 (those connected to 1 with a red arrow) as well as the intermediate 12=Ψ(6) lattices at hyperdistance 6.

The vertices of Conway’s Big Picture are the projective classes of integral sublattices of the standard lattice Z2=Ze1Ze2.

Let’s say our sublattice is generated by the integral vectors v=(v1,v2) and w=(w1.w2). How do we determine its class LM,gh where MQ+ is a strictly positive rational number and 0gh<1?

Here’s an example: the sublattice (the thick dots) is spanned by the vectors v=(2,1) and w=(1,4)



Well, we try to find a basechange matrix in SL2(Z) such that the new 2nd base vector is of the form (0,z). To do this take coprime (c,d)Z2 such that cv1+dw1=0 and complete with (a,b) satisfying adbc=1 via Bezout to a matrix in SL2(Z) such that
[abcd][v1v2w1w2]=[xy0z]
then the sublattice is of class Lxz,yz mod 1.

In the example, we have
[0112][2114]=[1407]
so this sublattice is of class L17,47.

Starting from a class LM,gh it is easy to work out its hyperdistance from L1: let d be the smallest natural number making the corresponding matrix integral
d.[Mgh01]=[uv0w]M2(Z)
then LM,gh is at hyperdistance u.w from L1.

Now that we know how to find the lattice class of any sublattice of Z2, let us assign a class to any point [c:d] of P1(Z/nZ).

As gcd(c,d)=1, by Bezout we can find a integral matrix with determinant 1
S[c:d]=[abcd]
But then the matrix
[a.nb.ncd]
has determinant n.

Working backwards we see that the class L[c:d] of the sublattice of Z2 spanned by the vectors (a.n,b.n) and (c,d) is of hyperdistance n from L1.

This is how the correspondence between points of P1(Z/nZ) and classes in Conway’s big picture at hyperdistance n from L1 works.

Let’s do an example. Take the point [7:3]P1(Z/12Z) (see last time), then
[2173]SL2(Z)
so we have to determine the class of the sublattice spanned by (24,12) and (7,3). As before we have to compute
[27724][241273]=[13012]
giving us that the class L[7:3]=L11234 (remember that the second term must be taken mod 1).

If you do this for all points in P1(Z/12Z) (and P1(Z/6Z) and P1(Z/3Z)) you get this version of the picture we started with



You’ll spot that the preimages of a canonical coordinate of P1(Z/mZ) for m|n are the very same coordinate together with ‘new’ canonical coordinates in P1(Z/nZ).

To see that this correspondence is one-to-one and that the index of the congruence subgroup
Γ0(n)={[pqrs] | n|r and psqr=1}
in the full modular group Γ=PSL2(Z) is equal to Ψ(n) it is useful to consider the action of PGL2(Q)+ on the right on the classes of lattices.

The stabilizer of L1 is the full modular group Γ and the stabilizer of any class is a suitable conjugate of Γ. For example, for the class Ln (that is, of the sublattice spanned by (n,0) and (0,1), which is of hyperdistance n from L1) this stabilizer is
Stab(Ln)={[abnc.nd] | adbc=1}
and a very useful observation is that
Stab(L1)Stab(Ln)=Γ0(n)
This is the way Conway likes us to think about the congruence subgroup Γ0(n): it is the joint stabilizer of the classes L1 and Ln (as well as all classes in the ‘thread’ Lm with m|n).

On the other hand, Γ acts by rotations on the big picture: it only fixes L1 and maps a class to another one of the same hyperdistance from L1.The index of Γ0(n) in Γ is then the number of classes at hyperdistance n.

To see that this number is Ψ(n), first check that the classes at hyperdistance pk for p a prime number and for all k for the p+1 free valent tree with root L1, so there are exactly pk1(p+1) classes as hyperdistance pk.

To get from this that the number of hyperdistance n classes is indeed Ψ(n)=p|npvp(n)1(p+1) we have to use the prime- factorisation of the hyperdistance (see this post).

The fundamental domain for the action of Γ0(12) by Moebius tranfos on the upper half plane must then consist of 48=2Ψ(12) black or white hyperbolic triangles



Next time we’ll see how to deduce the ‘monstrous’ Grothendieck dessin d’enfant for Γ0(12) from it



Comments closed