Skip to content →

Tag: permutation representation

the monster graph and McKay’s observation

While the verdict on a neolithic Scottish icosahedron is still open, let us recall Kostant’s group-theoretic construction of the icosahedron from its rotation-symmetry group A5.

The alternating group A5 has two conjugacy classes of order 5 elements, both consisting of exactly 12 elements. Fix one of these conjugacy classes, say C and construct a graph with vertices the 12 elements of C and an edge between two u,vC if and only if the group-product u.vC still belongs to the same conjugacy class.

Observe that this relation is symmetric as from u.v=wC it follows that v.u=u1.u.v.u=u1.w.uC. The graph obtained is the icosahedron, depicted on the right with vertices written as words in two adjacent elements u and v from C, as indicated.

Kostant writes : “Normally it is not a common practice in group theory to consider whether or not the product of two elements in a conjugacy class is again an element in that conjugacy class. However such a consideration here turns out to be quite productive.”

Still, similar constructions have been used in other groups as well, in particular in the study of the largest sporadic group, the monster group M.

There is one important catch. Whereas it is quite trivial to multiply two permutations and verify whether the result is among 12 given ones, for most of us mortals it is impossible to do actual calculations in the monster. So, we’d better have an alternative way to get at the icosahedral graph using only A5-data that is also available for the monster group, such as its character table.

Let G be any finite group and consider three of its conjugacy classes C(i),C(j) and C(k). For any element wC(k) we can compute from the character table of G the number of different products u.v=w such that uC(i) and vC(j). This number is given by the formula

|G||CG(gi)||CG(gj)|χχ(gi)χ(gj)χ(gk)χ(1)

where the sum is taken over all irreducible characters χ and where giC(i),gjC(j) and gkC(k). Note also that |CG(g)| is the number of G-elements commuting with g and that this number is the order of G divided by the number of elements in the conjugacy class of g.

The character table of A5 is given on the left : the five columns correspond to the different conjugacy classes of elements of order resp. 1,2,3,5 and 5 and the rows are the character functions of the 5 irreducible representations of dimensions 1,3,3,4 and 5.

Let us fix the 4th conjugacy class, that is 5a, as our class C. By the general formula, for a fixed wC the number of different products u.v=w with u,vC is equal to

6025(11+(1+52)33+(152)3314+05)=6025(1+4314)=5

Because for each xC also its inverse x1C, this can be rephrased by saying that there are exactly 5 different products w1.uC, or equivalently, that the valency of every vertex w1C in the graph is exactly 5.

That is, our graph has 12 vertices, each with exactly 5 neighbors, and with a bit of extra work one can show it to be the icosahedral graph.

For the monster group, the Atlas tells us that it has exactly 194 irreducible representations (and hence also 194 conjugacy classes). Of these conjugacy classes, the involutions (that is the elements of order 2) are of particular importance.

There are exactly 2 conjugacy classes of involutions, usually denoted 2A and 2B. Involutions in class 2A are called “Fischer-involutions”, after Bernd Fischer, because their centralizer subgroup is an extension of Fischer’s baby Monster sporadic group.

Likewise, involutions in class 2B are usually called “Conway-involutions” because their centralizer subgroup is an extension of the largest Conway sporadic group.

Let us define the monster graph to be the graph having as its vertices the Fischer-involutions and with an edge between two of them u,v2A if and only if their product u.v is again a Fischer-involution.

Because the centralizer subgroup is 2.B, the number of vertices is equal to 97239461142009186000=243753741113229415971.

From the general result recalled before we have that the valency in all vertices is equal and to determine it we have to use the character table of the monster and the formula. Fortunately GAP provides the function ClassMultiplicationCoefficient to do this without making errors.


gap> table:=CharacterTable("M");
CharacterTable( "M" )
gap> ClassMultiplicationCoefficient(table,2,2,2);
27143910000

Perhaps noticeable is the fact that the prime decomposition of the valency 27143910000=243454233147 is symmetric in the three smallest and three largest prime factors of the baby monster order.

Robert Griess proved that one can recover the monster group M from the monster graph as its automorphism group!

As in the case of the icosahedral graph, the number of vertices and their common valency does not determine the monster graph uniquely. To gain more insight, we would like to know more about the sizes of minimal circuits in the graph, the number of such minimal circuits going through a fixed vertex, and so on.

Such an investigation quickly leads to a careful analysis which other elements can be obtained from products u.v of two Fischer involutions u,v2A. We are in for a major surprise, first observed by John McKay:

Printing out the number of products of two Fischer-involutions giving an element in the i-th conjugacy class of the monster,
where i runs over all 194 possible classes, we get the following string of numbers :


97239461142009186000, 27143910000, 196560, 920808, 0, 3, 1104, 4, 0, 0, 5, 0,
6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

That is, the elements of only 9 conjugacy classes can be written as products of two Fischer-involutions! These classes are :

  • 1A = { 1 } written in 97239461142009186000 different ways (after all involutions have order two)
  • 2A, each element of which can be written in exactly 27143910000 different ways (the valency)
  • 2B, each element of which can be written in exactly 196560 different ways. Observe that this is the kissing number of the Leech lattice leading to a permutation representation of 2.Co1.
  • 3A, each element of which can be written in exactly 920808 ways. Note that this number gives a permutation representation of the maximal monster subgroup 3.Fi24.
  • 3C, each element of which can be written in exactly 3 ways.
  • 4A, each element of which can be written in exactly 1104 ways.
  • 4B, each element of which can be written in exactly 4 ways.
  • 5A, each element of which can be written in exactly 5 ways.
  • 6A, each element of which can be written in exactly 6 ways.

Let us forget about the actual numbers for the moment and concentrate on the orders of these 9 conjugacy classes : 1,2,2,3,3,4,4,5,6. These are precisely the components of the fundamental root of the extended Dynkin diagram E8~!

This is the content of John McKay’s E(8)-observation : there should be a precise relation between the nodes of the extended Dynkin diagram and these 9 conjugacy classes in such a way that the order of the class corresponds to the component of the fundamental root. More precisely, one conjectures the following correspondence



This is similar to the classical McKay correspondence between finite subgroups of SU(2) and extended Dynkin diagrams (the binary icosahedral group corresponding to extended E(8)). In that correspondence, the nodes of the Dynkin diagram correspond to irreducible representations of the group and the edges are determined by the decompositions of tensor-products with the fundamental 2-dimensional representation.

Here, however, the nodes have to correspond to conjugacy classes (rather than representations) and we have to look for another procedure to arrive at the required edges! An exciting proposal has been put forward recently by John Duncan in his paper Arithmetic groups and the affine E8 Dynkin diagram.

It will take us a couple of posts to get there, but for now, let’s give the gist of it : monstrous moonshine gives a correspondence between conjugacy classes of the monster and certain arithmetic subgroups of PSL2(R) commensurable with the modular group Γ=PSL2(Z). The edges of the extended Dynkin E(8) diagram are then given by the configuration of the arithmetic groups corresponding to the indicated 9 conjugacy classes! (to be continued…)

Comments closed

noncommutative F_un geometry (2)

Last time we tried to generalize the Connes-Consani approach to commutative algebraic geometry over the field with one element F1 to the noncommutative world by considering covariant functors

N : groupssets

which over C resp. Z become visible by a complex (resp. integral) algebra having suitable universal properties.

However, we didn’t specify what we meant by a complex noncommutative variety (resp. an integral noncommutative scheme). In particular, we claimed that the F1-‘points’ associated to the functor

D : groupssetsGG2×G3 (here Gn denotes all elements of order n of G)

were precisely the modular dessins d’enfants of Grothendieck, but didn’t give details. We’ll try to do this now.

For algebras over a field we follow the definition, due to Kontsevich and Soibelman, of so called “noncommutative thin schemes”. Actually, the thinness-condition is implicit in both Soule’s-approach as that of Connes and Consani : we do not consider R-points in general, but only those of rings R which are finite and flat over our basering (or field).

So, what is a noncommutative thin scheme anyway? Well, its a covariant functor (commuting with finite projective limits)

X : Algkfdsets

from finite-dimensional (possibly noncommutative) k-algebras to sets. Now, the usual dual-space operator gives an anti-equivalence of categories

AlgkfdCoalgkfdA=CC=A

so a thin scheme can also be viewed as a contra-variant functor (commuting with finite direct limits)

X : CoalgkfdSets

In particular, we are interested to associated to any {tex]k algebraA $ its representation functor :

rep(A) : CoalgkfdSetsCAlgk(A,C)

This may look strange at first sight, but C is a finite dimensional algebra and any n-dimensional representation of A is an algebra map AMn(k) and we take C to be the dual coalgebra of this image.

Kontsevich and Soibelman proved that every noncommutative thin scheme X is representable by a k-coalgebra. That is, there exists a unique coalgebra CX (which they call the coalgebra of ‘distributions’ of X) such that for every finite dimensional k-algebra B we have

X(B)=Coalgk(B,CX)

In the case of interest to us, that is for the functor rep(A) the coalgebra of distributions is Kostant’s dual coalgebra Ao. This is the not the full linear dual of A but contains only those linear functionals on A which factor through a finite dimensional quotient.

So? You’ve exchanged an algebra A for some coalgebra Ao, but where’s the geometry in all this? Well, let’s look at the commutative case. Suppose A=C[X] is the coordinate ring of a smooth affine variety X, then its dual coalgebra looks like

C[X]o=xXU(Tx(X))

the direct sum of all universal (co)algebras of tangent spaces at points xX. But how do we get the variety out of this? Well, any coalgebra has a coradical (being the sun of all simple subcoalgebras) and in the case just mentioned we have

corad(C[X]o)=xXCex

so every point corresponds to a unique simple component of the coradical. In the general case, the coradical of the dual coalgebra Ao is the direct sum of all simple finite dimensional representations of A. That is, the direct summands of the coalgebra give us a noncommutative variety whose points are the simple representations, and the remainder of the coalgebra of distributions accounts for infinitesimal information on these points (as do the tangent spaces in the commutative case).

In fact, it was a surprise to me that one can describe the dual coalgebra quite explicitly, and that A-structures make their appearance quite naturally. See this paper if you’re in for the details on this.

That settles the problem of what we mean by the noncommutative variety associated to a complex algebra. But what about the integral case? In the above, we used extensively the theory of Kostant-duality which works only for algebras over fields…

Well, not quite. In the case of Z (or more general, of Dedekind domains) one can repeat Kostant’s proof word for word provided one takes as the definition of the dual Z-coalgebra
of an algebra (which is Z-torsion free)

Ao=f : AZ : A/Ker(f) is finitely generated and torsion free 

(over general rings there may be also variants of this duality, as in Street’s book an Quantum groups). Probably lots of people have come up with this, but the only explicit reference I have is to the first paper I’ve ever written. So, also for algebras over Z we can define a suitable noncommutative integral scheme (the coradical approach accounts only for the maximal ideals rather than all primes, but somehow this is implicit in all approaches as we consider only thin schemes).

Fine! So, we can make sense of the noncommutative geometrical objects corresponding to the group-algebras CΓ and ZΓ where Γ=PSL2(Z) is the modular group (the algebras corresponding to the GG2×G3-functor). But, what might be the points of the noncommutative scheme corresponding to F1Γ???

Well, let’s continue the path cut out before. “Points” should correspond to finite dimensional “simple representations”. Hence, what are the finite dimensional simple F1-representations of Γ? (Or, for that matter, of any group G)

Here we come back to Javier’s post on this : a finite dimensional F1-vectorspace is a finite set. A Γ-representation on this set (of n-elements) is a group-morphism

ΓGLn(F1)=Sn

hence it gives a permutation representation of Γ on this set. But then, if finite dimensional F1-representations of Γ are the finite permutation representations, then the simple ones are the transitive permutation representations. That is, the points of the noncommutative scheme corresponding to F1Γ are the conjugacy classes of subgroups HΓ such that Γ/H is finite. But these are exactly the modular dessins d’enfants introduced by Grothendieck as I explained a while back elsewhere (see for example this post and others in the same series).

Comments closed

what does the monster see?

The Monster is the largest of the 26 sporadic simple groups and has order

808 017 424 794 512 875 886 459 904 961 710 757 005 754 368 000 000 000

= 2^46 3^20 5^9 7^6 11^2 13^3 17 19 23 29 31 41 47 59 71.

It is not so much the size of its order that makes it hard to do actual calculations in the monster, but rather the dimensions of its smallest non-trivial irreducible representations (196 883 for the smallest, 21 296 876 for the next one, and so on).

In characteristic two there is an irreducible representation of one dimension less (196 882) which appears to be of great use to obtain information. For example, Robert Wilson used it to prove that The Monster is a Hurwitz group. This means that the Monster is generated by two elements g and h satisfying the relations

g2=h3=(gh)7=1

Geometrically, this implies that the Monster is the automorphism group of a Riemann surface of genus g satisfying the Hurwitz bound 84(g-1)=#Monster. That is,

g=9619255057077534236743570297163223297687552000000001=42151199 * 293998543 * 776222682603828537142813968452830193

Or, in analogy with the Klein quartic which can be constructed from 24 heptagons in the tiling of the hyperbolic plane, there is a finite region of the hyperbolic plane, tiled with heptagons, from which we can construct this monster curve by gluing the boundary is a specific way so that we get a Riemann surface with exactly 9619255057077534236743570297163223297687552000000001 holes. This finite part of the hyperbolic tiling (consisting of #Monster/7 heptagons) we’ll call the empire of the monster and we’d love to describe it in more detail.



Look at the half-edges of all the heptagons in the empire (the picture above learns that every edge in cut in two by a blue geodesic). They are exactly #Monster such half-edges and they form a dessin d’enfant for the monster-curve.

If we label these half-edges by the elements of the Monster, then multiplication by g in the monster interchanges the two half-edges making up a heptagonal edge in the empire and multiplication by h in the monster takes a half-edge to the one encountered first by going counter-clockwise in the vertex of the heptagonal tiling. Because g and h generated the Monster, the dessin of the empire is just a concrete realization of the monster.

Because g is of order two and h is of order three, the two permutations they determine on the dessin, gives a group epimorphism C2C3=PSL2(Z)M from the modular group PSL2(Z) onto the Monster-group.

In noncommutative geometry, the group-algebra of the modular group CPSL2 can be interpreted as the coordinate ring of a noncommutative manifold (because it is formally smooth in the sense of Kontsevich-Rosenberg or Cuntz-Quillen) and the group-algebra of the Monster CM itself corresponds in this picture to a finite collection of ‘points’ on the manifold. Using this geometric viewpoint we can now ask the question What does the Monster see of the modular group?

To make sense of this question, let us first consider the commutative equivalent : what does a point P see of a commutative variety X?



Evaluation of polynomial functions in P gives us an algebra epimorphism C[X]C from the coordinate ring of the variety C[X] onto C and the kernel of this map is the maximal ideal mP of
C[X] consisting of all functions vanishing in P.

Equivalently, we can view the point P=spec C[X]/mP as the scheme corresponding to the quotient C[X]/mP. Call this the 0-th formal neighborhood of the point P.

This sounds pretty useless, but let us now consider higher-order formal neighborhoods. Call the affine scheme spec C[X]/mPn+1 the n-th forml neighborhood of P, then the first neighborhood, that is with coordinate ring C[X]/mP2 gives us tangent-information. Alternatively, it gives the best linear approximation of functions near P.
The second neighborhood C[X]/mP3 gives us the best quadratic approximation of function near P, etc. etc.

These successive quotients by powers of the maximal ideal mP form a system of algebra epimorphisms

C[X]mPn+1C[X]mPnC[X]mP2C[X]mP=C

and its inverse limit lim C[X]mPn=O^X,P is the completion of the local ring in P and contains all the infinitesimal information (to any order) of the variety X in a neighborhood of P. That is, this completion O^X,P contains all information that P can see of the variety X.

In case P is a smooth point of X, then X is a manifold in a neighborhood of P and then this completion
O^X,P is isomorphic to the algebra of formal power series C[[x1,x2,,xd]] where the xi form a local system of coordinates for the manifold X near P.

Right, after this lengthy recollection, back to our question what does the monster see of the modular group? Well, we have an algebra epimorphism

π : CPSL2(Z)CM

and in analogy with the commutative case, all information the Monster can gain from the modular group is contained in the m-adic completion

CPSL2(Z)^m=lim CPSL2(Z)mn

where m is the kernel of the epimorphism π sending the two free generators of the modular group PSL2(Z)=C2C3 to the permutations g and h determined by the dessin of the pentagonal tiling of the Monster’s empire.

As it is a hopeless task to determine the Monster-empire explicitly, it seems even more hopeless to determine the kernel m let alone the completed algebra… But, (surprise) we can compute CPSL2(Z)^m as explicitly as in the commutative case we have O^X,PC[[x1,x2,,xd]] for a point P on a manifold X.

Here the details : the quotient m/m2 has a natural structure of CM-bimodule. The group-algebra of the monster is a semi-simple algebra, that is, a direct sum of full matrix-algebras of sizes corresponding to the dimensions of the irreducible monster-representations. That is,

CMCM196883(C)M21296876(C)M258823477531055064045234375(C)

with exactly 194 components (the number of irreducible Monster-representations). For any CM-bimodule M one can form the tensor-algebra

TCM(M)=CMM(MCMM)(MCMMCMM)




and applying the formal neighborhood theorem for formally smooth algebras (such as CPSL2(Z)) due to Joachim Cuntz (left) and Daniel Quillen (right) we have an isomorphism of algebras

CPSL2(Z)^mTCM(m/m2)^

where the right-hand side is the completion of the tensor-algebra (at the unique graded maximal ideal) of the CM-bimodule m/m2, so we’d better describe this bimodule explicitly.

Okay, so what’s a bimodule over a semisimple algebra of the form S=Mn1(C)Mnk(C)? Well, a simple S-bimodule must be either (1) a factor Mni(C) with all other factors acting trivially or (2) the full space of rectangular matrices Mni×nj(C) with the factor Mni(C) acting on the left, Mnj(C) acting on the right and all other factors acting trivially.

That is, any S-bimodule can be represented by a quiver (that is a directed graph) on k vertices (the number of matrix components) with a loop in vertex i corresponding to each simple factor of type (1) and a directed arrow from i to j corresponding to every simple factor of type (2).

That is, for the Monster, the bimodule m/m2 is represented by a quiver on 194 vertices and now we only have to determine how many loops and arrows there are at or between vertices.

Using Morita equivalences and standard representation theory of quivers it isn’t exactly rocket science to determine that the number of arrows between the vertices corresponding to the irreducible Monster-representations Si and Sj is equal to

dimC ExtCPSL2(Z)1(Si,Sj)δij

Now, I’ve been wasting a lot of time already here explaining what representations of the modular group have to do with quivers (see for example here or some other posts in the same series) and for quiver-representations we all know how to compute Ext-dimensions in terms of the Euler-form applied to the dimension vectors.

Right, so for every Monster-irreducible Si we have to determine the corresponding dimension-vector  (a1,a2;b1,b2,b3) for the quiver

Misplaced &

Now the dimensions ai are the dimensions of the +/-1 eigenspaces for the order 2 element g in the representation and the bi are the dimensions of the eigenspaces for the order 3 element h. So, we have to determine to which conjugacy classes g and h belong, and from Wilson’s paper mentioned above these are classes 2B and 3B in standard Atlas notation.

So, for each of the 194 irreducible Monster-representations we look up the character values at 2B and 3B (see below for the first batch of those) and these together with the dimensions determine the dimension vector  (a1,a2;b1,b2,b3).

For example take the 196883-dimensional irreducible. Its 2B-character is 275 and the 3B-character is 53. So we are looking for a dimension vector such that a1+a2=196883,a1275=a2 and b1+b2+b3=196883,b153=b2=b3 giving us for that representation the dimension vector of the quiver above  (98579,98304,65663,65610,65610).

Okay, so for each of the 194 irreducibles Si we have determined a dimension vector  (a1(i),a2(i);b1(i),b2(i),b3(i)), then standard quiver-representation theory asserts that the number of loops in the vertex corresponding to Si is equal to

dim(Si)2+1a1(i)2a2(i)2b1(i)2b2(i)2b3(i)2

and that the number of arrows from vertex Si to vertex Sj is equal to

dim(Si)dim(Sj)a1(i)a1(j)a2(i)a2(j)b1(i)b1(j)b2(i)b2(j)b3(i)b3(j)

This data then determines completely the CM-bimodule m/m2 and hence the structure of the completion CPSL2^m containing all information the Monster can gain from the modular group.

But then, one doesn’t have to go for the full regular representation of the Monster. Any faithful permutation representation will do, so we might as well go for the one of minimal dimension.

That one is known to correspond to the largest maximal subgroup of the Monster which is known to be a two-fold extension 2.B of the Baby-Monster. The corresponding permutation representation is of dimension 97239461142009186000 and decomposes into Monster-irreducibles

S1S2S4S5S9S14S21S34S35

(in standard Atlas-ordering) and hence repeating the arguments above we get a quiver on just 9 vertices! The actual numbers of loops and arrows (I forgot to mention this, but the quivers obtained are actually symmetric) obtained were found after laborious computations mentioned in this post and the details I’ll make avalable here.

Anyone who can spot a relation between the numbers obtained and any other part of mathematics will obtain quantities of genuine (ie. non-Inbev) Belgian beer…

Leave a Comment