Skip to content →

Category: math

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

Monstrous dessins 1

Dedekind’s Psi-function Ψ(n)=np|n(1+1p) pops up in a number of topics:

  • Ψ(n) is the index of the congruence subgroup Γ0(n) in the modular group Γ=PSL2(Z),
  • Ψ(n) is the number of points in the projective line P1(Z/nZ),
  • Ψ(n) is the number of classes of 2-dimensional lattices LMgh at hyperdistance n in Conway’s big picture from the standard lattice L1,
  • Ψ(n) is the number of admissible maximal commuting sets of operators in the Pauli group of a single qudit.

The first and third interpretation have obvious connections with Monstrous Moonshine.

Conway’s big picture originated from the desire to better understand the Moonshine groups, and Ogg’s Jack Daniels problem
asks for a conceptual interpretation of the fact that the prime numbers such that Γ0(p)+ is a genus zero group are exactly the prime divisors of the order of the Monster simple group.

Here’s a nice talk by Ken Ono : Can’t you just feel the Moonshine?



For this reason it might be worthwhile to make the connection between these two concepts and the number of points of P1(Z/nZ) as explicit as possible.

Surely all of this is classical, but it is nicely summarised in the paper by Tatitscheff, He and McKay “Cusps, congruence groups and monstrous dessins”.

The ‘monstrous dessins’ from their title refers to the fact that the lattices LMgh at hyperdistance n from L1 are permuted by the action of the modular groups and so determine a Grothendieck’s dessin d’enfant. In this paper they describe the dessins corresponding to the 15 genus zero congruence subgroups Γ0(n), that is when n=1,2,3,4,5,6,7,8,9,10,12,13,16,18 or 25.

Here’s the ‘monstrous dessin’ for Γ0(6)



But, one can compute these dessins for arbitrary n, describing the ripples in Conway’s big picture, and try to figure out whether they are consistent with the Riemann hypothesis.

We will get there eventually, but let’s start at an easy pace and try to describe the points of the projective line P1(Z/nZ).

Over a field k the points of P1(k) correspond to the lines through the origin in the affine plane A2(k) and they can represented by projective coordinates [a:b] which are equivalence classes of couples (a,b)k2{(0,0)} under scalar multiplication with non-zero elements in k, so with points [a:1] for all ak together with the point at infinity [1:0]. When n=p is a prime number we have #P1(Z/pZ)=p+1. Here are the 8 lines through the origin in A2(Z/7Z)



Over an arbitrary (commutative) ring R the points of P1(R) again represent equivalence classes, this time of pairs
(a,b)R2 : aR+bR=R
with respect to scalar multiplication by units in R, that is
(a,b)(c,d)  iff λR : a=λc,b=λd
For P1(Z/nZ) we have to find all pairs of integers (a,b)Z2 with 0a,b<n with gcd(a,b)=1 and use Cremona’s trick to test for equivalence:
(a,b)=(c,d)P1(Z/nZ) iff adbc0 mod n
The problem is to find a canonical representative in each class in an efficient way because this is used a huge number of times in working with modular symbols.

Perhaps the best algorithm, for large n, is sketched in pages 145-146 of Bill Stein’s Modular forms: a computational approach.

For small n the algorithm in §1.3 in the Tatitscheff, He and McKay paper suffices:

  • Consider the action of (Z/nZ) on {0,1,,n1}=Z/nZ and let D be the set of the smallest elements in each orbit,
  • For each dD compute the stabilizer subgroup Gd for this action and let Cd be the set of smallest elements in each Gd-orbit on the set of all elements in Z/nZ coprime with d,
  • Then P1(Z/nZ)={[c:d] | dD,cCd}.

Let’s work this out for n=12 which will be our running example (the smallest non-squarefree non-primepower):

  • (Z/12Z)={1,5,7,11}C2×C2,
  • The orbits on {0,1,,11} are
    {0},{1,5,7,11},{2,10},{3,9},{4,8},{6}
    and D={0,1,2,3,4,6},
  • G0=C2×C2, G1={1}, G2={1,7}, G3={1,5}, G4={1,7} and G6=C2×C2,
  • 1 is the only number coprime with 0, giving us [1:0],
  • {0,1,,11} are all coprime with 1, and we have trivial stabilizer, giving us the points [0:1],[1:1],,[11:1],
  • {1,3,5,7,9,11} are coprime with 2 and under the action of {1,7} they split into the orbits
    {1,7}, {3,9}, {5,11}
    giving us the points [1:2],[3:2] and [5:2],
  • {1,2,4,5,7,8,10,11} are coprime with 3, the action of {1,5} gives us the orbits
    {1,5}, {2,10}, {4,8}, {7,11}
    and additional points [1:3],[2:3],[4:3] and [7:3],
  • {1,3,5,7,9,11} are coprime with 4 and under the action of {1,7} we get orbits
    {1,7}, {3,9}, {5,11}
    and points [1:4],[3:4] and [5,4],
  • Finally, {1,5,7,11} are the only coprimes with 6 and they form a single orbit under C2×C2 giving us just one additional point [1:6].

This gives us all 24=Ψ(12) points of P1(Z/12Z) (strangely, op page 43 of the T-H-M paper they use different representants).

One way to see that #P1(Z/nZ)=Ψ(n) comes from a consequence of the Chinese Remainder Theorem that for the prime factorization n=p1e1pkek we have
P1(Z/nZ)=P1(Z/p1e1Z)××P1(Z/pkekZ)
and for a prime power pk we have canonical representants for P1(Z/pkZ)
[a:1] for a=0,1,,pk1 and[1:b] for b=0,p,2p,3p,,pkp
which shows that #P1(Z/pkZ)=(p+1)pk1=Ψ(pk).

Next time, we’ll connect P1(Z/nZ) to Conway’s big picture and the congruence subgroup Γ0(n).

Comments closed

the Riemann hypothesis and Psi

Last time we revisited Robin’s theorem saying that 5040 being the largest counterexample to the bound
σ(n)n log(log(n))<eγ=1.78107... is equivalent to the Riemann hypothesis.

There’s an industry of similar results using other arithmetic functions. Today, we’ll focus on Dedekind’s Psi function
Ψ(n)=np|n(1+1p)
where p runs over the prime divisors of n. It is series A001615 in the online encyclopedia of integer sequences and it starts off with

1, 3, 4, 6, 6, 12, 8, 12, 12, 18, 12, 24, 14, 24, 24, 24, 18, 36, 20, 36, 32, 36, 24, 48, 30, 42, 36, 48, 30, 72, 32, 48, 48, 54, 48, …

and here’s a plot of its first 1000 values



To understand this behaviour it is best to focus on the ‘slopes’ Ψ(n)n=p|n(1+1p).

So, the red dots of minimal ‘slope’ 1 correspond to the prime numbers, and the ‘outliers’ have a maximal number of distinct small prime divisors. Look at 210=2×3×5×7 and its multiples 420,630 and 840 in the picture.

For this reason the primorial numbers, which are the products of the fist k prime numbers, play a special role. This is series A002110 starting off with

1, 2, 6, 30, 210, 2310, 30030, 510510, 9699690, 223092870,…

In Patrick Solé and Michel Planat Extreme values of the Dedekind Ψ function, it is shown that the primorials play a similar role for Dedekind’s Psi as the superabundant numbers play for the sum-of-divisors function σ(n).

That is, if Nk is the k-th primorial, then for all n<Nk we have that the 'slope' at n is strictly below that of Nk Ψ(n)n<Ψ(Nk)Nk which follows immediately from the fact that any n<Nk can have at most k1 distinct prime factors and p1+1p is a strictly decreasing function.

Another easy, but nice, observation is that for all n we have the inequalities
n2>ϕ(n)×ψ(n)>n2ζ(2)
where ϕ(n) is Euler’s totient function
ϕ(n)=np|n(11p)
This follows as once from the definitions of ϕ(n) and Ψ(n)
ϕ(n)×Ψ(n)=n2p|n(11p2)<n2p prime(11p2)=n2ζ(2) But now it starts getting interesting.

In the proof of his theorem, Guy Robin used a result of his Ph.D. advisor Jean-Louis Nicolas



known as Nicolas’ criterion for the Riemann hypothesis: RH is true if and only if for all k we have the inequality for the k-th primorial number Nk
Nkϕ(Nk) log(log(Nk))>eγ
From the above lower bound on ϕ(n)×Ψ(n) we have for n=Nk that
Ψ(Nk)Nk>Nkϕ(Nk)ζ(2)
and combining this with Nicolas’ criterion we get
Ψ(Nk)Nk log(log(Nk))>Nkϕ(Nk) log(log(Nk))ζ(2)>eγζ(2)1.08
In fact, Patrick Solé and Michel Planat prove in their paper Extreme values of the Dedekind Ψ function that RH is equivalent to the lower bound
Ψ(Nk)Nk log(log(Nk))>eγζ(2)
holding for all k3.

Dedekind’s Psi function pops up in lots of interesting mathematics.

In the theory of modular forms, Dedekind himself used it to describe the index of the congruence subgroup Γ0(n) in the full modular group Γ.

In other words, it gives us the number of tiles needed in the Dedekind tessellation to describe the fundamental domain of the action of Γ0(n) on the upper half-plane by Moebius transformations.

When n=6 we have Ψ(6)=12 and we can view its fundamental domain via these Sage commands:


G=Gamma0(6)
FareySymbol(G).fundamental_domain()

giving us the 24 back or white tiles (note that these tiles are each fundamental domains of the extended modular group, so we have twice as many of them as for subgroups of the modular group)



But, there are plenty of other, seemingly unrelated, topics where Ψ(n) appears. To name just a few:

  • The number of points on the projective line P1(Z/nZ).
  • The number of lattices at hyperdistance n in Conway’s big picture.
  • The number of admissible maximal commuting sets of operators in the Pauli group for the n qudit.

and there are explicit natural one-to-one correspondences between all these manifestations of Ψ(n), tbc.

Comments closed