Skip to content →

Category: groups

Arnold’s trinities

Referring to the triple of exceptional Galois groups L2(5),L2(7),L2(11) and its connection to the Platonic solids I wrote : “It sure seems that surprises often come in triples…”. Briefly I considered replacing triples by trinities, but then, I didnt want to sound too mystic…

David Corfield of the n-category cafe and a dialogue on infinity (and perhaps other blogs I’m unaware of) pointed me to the paper Symplectization, complexification and mathematical trinities by Vladimir I. Arnold. (Update : here is a PDF-conversion of the paper)

The paper is a write-up of the second in a series of three lectures Arnold gave in june 1997 at the meeting in the Fields Institute dedicated to his 60th birthday. The goal of that lecture was to explain some mathematical dreams he had.

The next dream I want to present is an even more fantastic set of theorems and conjectures. Here I also have no theory and actually the ideas form a kind of religion rather than mathematics.
The key observation is that in mathematics one encounters many trinities. I shall present a list of examples. The main dream (or conjecture) is that all these trinities are united by some rectangular “commutative diagrams”.
I mean the existence of some “functorial” constructions connecting different trinities. The knowledge of the existence of these diagrams provides some new conjectures which might turn to be true theorems.

Follows a list of 12 trinities, many taken from Arnold’s field of expertise being differential geometry. I’ll restrict to the more algebraically inclined ones.

1 : “The first trinity everyone knows is”

where H are the Hamiltonian quaternions. The trinity on the left may be natural to differential geometers who see real and complex and hyper-Kaehler manifolds as distinct but related beasts, but I’m willing to bet that most algebraists would settle for the trinity on the right where O are the octonions.

2 : The next trinity is that of the exceptional Lie algebras E6, E7 and E8.

with corresponding Dynkin-Coxeter diagrams

Arnold has this to say about the apparent ubiquity of Dynkin diagrams in mathematics.

Manin told me once that the reason why we always encounter this list in many different mathematical classifications is its presence in the hardware of our brain (which is thus unable to discover a more complicated scheme).
I still hope there exists a better reason that once should be discovered.

Amen to that. I’m quite hopeful human evolution will overcome the limitations of Manin’s brain…

3 : Next comes the Platonic trinity of the tetrahedron, cube and dodecahedron



Clearly one can argue against this trinity as follows : a tetrahedron is a bunch of triangles such that there are exactly 3 of them meeting in each vertex, a cube is a bunch of squares, again 3 meeting in every vertex, a dodecahedron is a bunch of pentagons 3 meeting in every vertex… and we can continue the pattern. What should be a bunch a hexagons such that in each vertex exactly 3 of them meet? Well, only one possibility : it must be the hexagonal tiling (on the left below). And in normal Euclidian space we cannot have a bunch of septagons such that three of them meet in every vertex, but in hyperbolic geometry this is still possible and leads to the Klein quartic (on the right). Check out this wonderful post by John Baez for more on this.



4 : The trinity of the rotation symmetry groups of the three Platonics

where An is the alternating group on n letters and Sn is the symmetric group.

Clearly, any rotation of a Platonic solid takes vertices to vertices, edges to edges and faces to faces. For the tetrahedron we can easily see the 4 of the group A4, say the 4 vertices. But what is the 4 of S4 in the case of a cube? Well, a cube has 4 body-diagonals and they are permuted under the rotational symmetries. The most difficult case is to see the 5 of A5 in the dodecahedron. Well, here’s the solution to this riddle



there are exactly 5 inscribed cubes in a dodecahedron and they are permuted by the rotations in the same way as A5.

7 : The seventh trinity involves complex polynomials in one variable

the Laurant polynomials and the modular polynomials (that is, rational functions with three poles at 0,1 and .

8 : The eight one is another beauty

Here ‘numbers’ are the ordinary complex numbers C, the ‘trigonometric numbers’ are the quantum version of those (aka q-numbers) which is a one-parameter deformation and finally, the ‘elliptic numbers’ are a two-dimensional deformation. If you ever encountered a Sklyanin algebra this will sound familiar.

This trinity is based on a paper of Turaev and Frenkel and I must come back to it some time…

The paper has some other nice trinities (such as those among Whitney, Chern and Pontryagin classes) but as I cannot add anything sensible to it, let us include a few more algebraic trinities. The first one attributed by Arnold to John McKay

13 : A trinity parallel to the exceptional Lie algebra one is

between the 27 straight lines on a cubic surface, the 28 bitangents on a quartic plane curve and the 120 tritangent planes of a canonic sextic curve of genus 4.

14 : The exceptional Galois groups

explained last time.

15 : The associated curves with these groups as symmetry groups (as in the previous post)

where the ? refers to the mysterious genus 70 curve. I’ll check with one of the authors whether there is still an embargo on the content of this paper and if not come back to it in full detail.

16 : The three generations of sporadic groups

Do you have other trinities you’d like to worship?

Leave a Comment

F_un and braid groups

Recall that an n-braid consists of n strictly descending elastic strings connecting n inputs at the top (named 1,2,…,n) to n outputs at the bottom (labeled 1,2,…,n) upto isotopy (meaning that we may pull and rearrange the strings in any way possible within 3-dimensional space). We can always change the braid slightly such that we can divide the interval between in- and output in a number of subintervals such that in each of those there is at most one crossing.

n-braids can be multiplied by putting them on top of each other and connecting the outputs of the first braid trivially to the inputs of the second. For example the 5-braid on the left can be written as B=B1.B2 with B1 the braid on the top 3 subintervals and B2 the braid on the lower 5 subintervals.

In this way (and using our claim that there can be at most 1 crossing in each subinterval) we can write any n-braid as a word in the generators σi (with 1i<n) being the overcrossing between inputs i and i+1. Observe that the undercrossing is then the inverse σi1. For example, the braid on the left corresponds to the word

σ11.σ21.σ11.σ2.σ31.σ41.σ31.σ4

Clearly there are relations among words in the generators. The easiest one we have already used implicitly namely that σi.σi1 is the trivial braid. Emil Artin proved in the 1930-ies that all such relations are consequences of two sets of ‘obvious’ relations. The first being commutation relations between crossings when the strings are far enough from each other. That is we have

σi.σj=σj.σi whenever |ij|2


=

The second basic set of relations involves crossings using a common string

σi.σi+1.σi=σi+1.σi.σi+1


=

Starting with the 5-braid at the top, we can use these relations to reduce it to a simpler form. At each step we have outlined to region where the relations are applied


=
=
=

These beautiful braid-pictures were produced using the braid-metapost program written by Stijn Symens.

Tracing a string from an input to an output assigns to an n-braid a permutation on n letters. In the above example, the permutation is  (1,2,4,5,3). As this permutation doesn’t change under applying basic reduction, this gives a group-morphism

BnSn

from the braid group on n strings Bn to the symmetric group. We have seen before that the symmetric group Sn has a F-un interpretation as the linear group GLn(F1) over the field with one element. Hence, we can ask whether there is also a F-un interpretation of the n-string braid group and of the above group-morphism.

Kapranov and Smirnov suggest in their paper that the n-string braid group BnGLn(F1[t]) is the general linear group over the polynomial ring F1[t] over the field with one element and that the evaluation morphism (setting t=0)

GLn(F1[t])GLn(F1) gives the groupmorphism BnSn

The rationale behind this analogy is a theorem of Drinfeld‘s saying that over a finite field Fq, the profinite completion of GLn(Fq[t]) is embedded in the fundamental group of the space of q-polynomials of degree n in much the same way as the n-string braid group Bn is the fundamental group of the space of complex polynomials of degree n without multiple roots.

And, now that we know the basics of absolute linear algebra, we can give an absolute braid-group representation

Bn=GLn(F1[t])GLn(F1n)

obtained by sending each generator σi to the matrix over F1n (remember that F1n=(μn) where μn=ϵn are the n-th roots of unity)

σi[1i10ϵnϵn101n1i]

and it is easy to see that these matrices do indeed satisfy Artin’s defining relations for Bn.

Leave a Comment

Galois’ last letter

“Ne pleure pas, Alfred ! J’ai besoin de tout mon courage pour mourir à vingt ans!”

We all remember the last words of Evariste Galois to his brother Alfred. Lesser known are the mathematical results contained in his last letter, written to his friend Auguste Chevalier, on the eve of his fatal duel. Here the final sentences :



Tu prieras publiquement Jacobi ou Gauss de donner leur avis non sur la verite, mais sur l’importance des theoremes.
Apres cela il se trouvera, j’espere, des gens qui trouvent leur profis a dechiffrer tout ce gachis.
Je t’embrasse avec effusion.
E. Galois, le 29 Mai 1832

A major result contained in this letter concerns the groups L2(p)=PSL2(Fp), that is the group of 2×2 matrices with determinant equal to one over the finite field Fp modulo its center. L2(p) is known to be simple whenever p5. Galois writes that L2(p) cannot have a non-trivial permutation representation on fewer than p+1 symbols whenever p>11 and indicates the transitive permutation representation on exactly p symbols in the three ‘exceptional’ cases p=5,7,11.

Let α=[1101] and consider for p=5,7,11 the involutions on PFp1=Fp (on which L2(p) acts via Moebius transformations)

π5=(0,)(1,4)(2,3)π7=(0,)(1,3)(2,6)(4,5)π11=(0,)(1,6)(3,7)(9,10)(5,8)(4,2)

(in fact, Galois uses the involution  (0,)(1,2)(3,6)(4,8)(5,10)(9,7) for p=11), then L2(p) leaves invariant the set consisting of the p involutions Π=αiπpαi : 1ip. After mentioning these involutions Galois merely writes :

Ainsi pour le cas de p=5,7,11, l’equation modulaire s’abaisse au degre p.
En toute rigueur, cette reduction n’est pas possible dans les cas plus eleves.

Alternatively, one can deduce these permutation representation representations from group isomorphisms. As L2(5)A5, the alternating group on 5 symbols, L2(5) clearly acts transitively on 5 symbols.

Similarly, for p=7 we have L2(7)L3(2) and so the group acts as automorphisms on the projective plane over the field on two elements PF22 aka the Fano plane, as depicted on the left.

This finite projective plane has 7 points and 7 lines and L3(2) acts transitively on them.

For p=11 the geometrical object is a bit more involved. The set of non-squares in F11 is

1,3,4,5,9

and if we translate this set using the additive structure in F11 one obtains the following 11 five-element sets

1,3,4,5,9,2,4,5,6,10,3,5,6,7,11,1,4,6,7,8,2,5,7,8,9,3,6,8,9,10,

4,7,9,10,11,1,5,8,10,11,1,2,6,9,11,1,2,3,7,10,2,3,4,8,11

and if we regard these sets as ‘lines’ we see that two distinct lines intersect in exactly 2 points and that any two distinct points lie on exactly two ‘lines’. That is, intersection sets up a bijection between the 55-element set of all pairs of distinct points and the 55-element set of all pairs of distinct ‘lines’. This is called the biplane geometry.

The subgroup of S11 (acting on the eleven elements of F11) stabilizing this set of 11 5-element sets is precisely the group L2(11) giving the permutation representation on 11 objects.

An alternative statement of Galois’ result is that for p>11 there is no subgroup of L2(p) complementary to the cyclic subgroup

Cp=[1x01] : xFp

That is, there is no subgroup such that set-theoretically L2(p)=F×Cp (note this is of courese not a group-product, all it says is that any element can be written as g=f.c with fF,cCp.

However, in the three exceptional cases we do have complementary subgroups. In fact, set-theoretically we have

L2(5)=A4×C5L2(7)=S4×C7L2(11)=A5×C11

and it is a truly amazing fact that the three groups appearing are precisely the three Platonic groups!

Recall that here are 5 Platonic (or Scottish) solids coming in three sorts when it comes to rotation-automorphism groups : the tetrahedron (group A4), the cube and octahedron (group S4) and the dodecahedron and icosahedron (group A5). The “4” in the cube are the four body diagonals and the “5” in the dodecahedron are the five inscribed cubes.

That is, our three ‘exceptional’ Galois-groups correspond to the three Platonic groups, which in turn correspond to the three exceptional Lie algebras E6,E7,E8 via McKay correspondence (wrt. their 2-fold covers). Maybe I’ll detail this latter connection another time. It sure seems that surprises often come in triples…

Finally, it is well known that L2(5)A5 is the automorphism group of the icosahedron (or dodecahedron) and that L2(7) is the automorphism group of the Klein quartic.

So, one might ask : is there also a nice curve connected with the third group L2(11)? Rumour has it that this is indeed the case and that the curve in question has genus 70… (to be continued).

Reference

Bertram Kostant, “The graph of the truncated icosahedron and the last letter of Galois”

Leave a Comment