Referring to the triple of exceptional Galois groups 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”

but I would like to alter it into

where 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 are the octonians.

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 is the alternating group on n letters and 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 , say the 4 vertices. But what is the 4 of 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 of 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 .

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 , 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?

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 with the braid on the top 3 subintervals and 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 (with ) being the overcrossing between inputs i and i+1. Observe that the undercrossing is then the inverse . For example, the braid on the left corresponds to the word

Clearly there are relations among words in the generators. The easiest one we have already used implicitly namely that 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

whenever

=

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

=

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 . As this permutation doesn’t change under applying basic reduction, this gives a group-morphism

from the braid group on n strings to the symmetric group. We have seen before that the symmetric group has a F-un interpretation as the linear group 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 is the general linear group over the polynomial ring over the field with one element and that the evaluation morphism (setting t=0)

gives the groupmorphism

The rationale behind this analogy is a theorem of Drinfeld’s saying that over a finite field , the profinite completion of 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 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

obtained by sending each generator to the matrix over (remember that where are the n-th roots of unity)

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

There are only a handful of human activities where one goes to extraordinary lengths to keep a dream alive, in spite of overwhelming evidence : religion, theoretical physics, supporting the Belgian football team and … mathematics.

In recent years several people spend a lot of energy looking for properties of an elusive object : the field with one element , or in French : “F-un”. The topic must have reached a level of maturity as there was a conference dedicated entirely to it : NONCOMMUTATIVE GEOMETRY AND GEOMETRY OVER THE FIELD WITH ONE ELEMENT.

In this series I’d like to find out what the fuss is all about, why people would like it to exist and what it has to do with noncommutative geometry. However, before we start two remarks :

The field does not exist, so don’t try to make sense of sentences such as “The ‘field with one element’ is the free algebraic monad generated by one constant (p.26), or the universal generalized ring with zero (p.33)” in the wikipedia-entry. The simplest proof is that in any (unitary) ring we have so any ring must contain at least two elements. A more highbrow version : the ring of integers is the initial object in the category of unitary rings, so it cannot be an algebra over anything else.

The second remark is that several people have already written blog-posts about . Here are a few I know of : David Corfield at the n-category cafe and at his old blog, Noah Snyder at the secret blogging seminar, Kea at the Arcadian functor, AC and K. Consani at Noncommutative geometry and John Baez wrote about it in his weekly finds.

The dream we like to keep alive is that we will prove the Riemann hypothesis one fine day by lifting Weil’s proof of it in the case of curves over finite fields to rings of integers.

Even if you don’t know a word about Weil’s method, if you think about it for a couple of minutes, there are two immediate formidable problems with this strategy.

For most people this would be evidence enough to discard the approach, but, we mathematicians have found extremely clever ways for going into denial.

The first problem is that if we want to think of (or rather its completion adding the infinite place) as a curve over some field, then must be an algebra over this field. However, no such field can exist…

No problem! If there is no such field, let us invent one, and call it . But, it is a bit hard to do geometry over an illusory field. Christophe Soule succeeded in defining varieties over in a talk at the 1999 Arbeitstagung and in a more recent write-up of it : Les varietes sur le corps a un element.

We will come back to this in more detail later, but for now, here’s the main idea. Consider an existent field and an algebra over it. Now study the properties of the functor (extension of scalars) from -schemes to -schemes. Even if there is no morphism , let us assume it exists and define -varieties by requiring that these guys should satisfy the properties found before for extension of scalars on schemes defined over a field by going to schemes over an algebra (in this case, -schemes). Roughly speaking this defines -schemes as subsets of points of suitable -schemes.

But, this is just one half of the story. He adds to such an -variety extra topological data ‘at infinity’, an idea he attributes to J.-B. Bost. This added feature is a -algebra , which does not necessarily have to be commutative. He only writes : “Par ignorance, nous resterons tres evasifs sur les proprietes requises sur cette -algebre.”

The algebra originates from trying to bypass the second major obstacle with the Weil-Riemann-strategy. On a smooth projective curve all points look similar as is clear for example by noting that the completions of all local rings are isomorphic to the formal power series over the basefield, in particular there is no distinction between ‘finite’ points and those lying at ‘infinity’.

The completions of the local rings of points in on the other hand are completely different, for example, they have residue fields of different characteristics… Still, local class field theory asserts that their quotient fields have several common features. For example, their Brauer groups are all isomorphic to . However, as and , even then there would be a clear distinction between the finite primes and the place at infinity…

Alain Connes came up with an extremely elegant solution to bypass this problem in Noncommutative geometry and the Riemann zeta function. He proposes to replace finite dimensional central simple algebras in the definition of the Brauer group by AF (for Approximately Finite dimensional)-central simple algebras over . This is the origin and the importance of the Bost-Connes algebra.

We will come back to most of this in more detail later, but for the impatient, Connes has written a paper together with Caterina Consani and Matilde Marcolli Fun with relating the Bost-Connes algebra to the field with one element.

MUBs (for Mutually Unbiased Bases) are quite popular at the moment. Kea is running a mini-series Mutual Unbias as is Carl Brannen. Further, the Perimeter Institute has a good website for its seminars where they offer streaming video (I like their MacromediaFlash format giving video and slides/blackboard shots simultaneously, in distinct windows) including a talk on MUBs (as well as an old talk by Wootters).

So what are MUBs to mathematicians? Recall that a d-state quantum system is just the vectorspace equipped with the usual Hermitian inproduct . An observable is a choice of orthonormal basis consisting of eigenvectors of the self-adjoint matrix . together with another observable (with orthonormal basis ) are said to be mutally unbiased if the norms of all inproducts are equal to . This definition extends to a collection of pairwise mutually unbiased observables. In a d-state quantum system there can be at most d+1 mutually unbiased bases and such a collection of observables is then called a MUB of the system. Using properties of finite fields one has shown that MUBs exists whenever d is a prime-power. On the other hand, existence of a MUB for d=6 still seems to be open…

The King’s Problem¹ is the following : A physicist is trapped on an island ruled by a mean king who promises to set her free if she can give him the answer to the following puzzle. The physicist is asked to prepare a d−state quantum system in any state of her choosing and give it to the king, who measures one of several mutually unbiased observables on it. Following this, the physicist is allowed to make a control measurement on the system, as well as any other systems it may have been coupled to in the preparation phase. The king then reveals which observable he measured and the physicist is required to predict correctly all the eigenvalues he found.

The Solution to the King’s problem in prime power dimension by P. K. Aravind, say for , consists in taking a system of k object qupits (when one qupit is a spin l particle) which she will give to the King together with k ancilla qupits that she retains in her possession. These 2k qupits are diligently entangled and prepared is a well chosen state. The final step in finding a suitable state is the solution to a pure combinatorial problem :

She must use the numbers 1 to d to form ordered sets of d+1 numbers each, with repetitions of numbers within a set allowed, such that any two sets have exactly one identical number in the same place in both. Here’s an example of 16 such strings for d=4 :

11432, 12341, 13214, 14123, 21324, 22413, 23142, 24231, 31243, 32134, 33421, 34312, 41111, 42222, 43333, 44444

Here again, finite fields are used in the solution. When , identify the elements of with the numbers from 1 to d in some fixed way. Then, the of number-strings are found as follows : let and take as the first 2 numbers the ones corresponding to these field-elements. The remaning d-2 numbers in the string are those corresponding to the field element (with ) determined from by the equation

where is the field-element corresponding to the integer i ( corresponds to the zero element). It is easy to see that these strings satisfy the conditions of the combinatorial problem. Indeed, any two of its digits determine (and hence the whole string) as it follows from and that .

In the special case when d=3 (that is, one spin 1 particle is given to the King), we recover the tetracode : the nine codewords

0000, 0+++, 0—, +0+-, ++-0, +-0+, -0-+, -+0-, –+0

encode the strings (with +=1,-=2,0=3)

3333, 3111, 3222, 1312, 1123, 1231, 2321, 2132, 2213

1. actually a misnomer, it’s more the poor physicists’ problem… [↩]

Terry Tao is reworking some of his better blogposts into a book, to be published by the AMS (here’s a preliminary version of the book “What’s New?”)

After some thought, I decided not to transcribe all of my posts from last year (there are 93 of them!), but instead to restrict attention to those articles which (a) have significant mathematical content, (b) are not announcements of material that will be published elsewhere, and (c) are not primarily based on a talk given by someone else. As it turns out, this still leaves about 33 articles from 2007, leading to a decent-sized book of a couple hundred pages in length.

If you have a blog and want to turn it into a LaTeX-book, there’s no need to transcribe or copy every single post, thanks to the WPTeX tool. Note that this is NOT a WP-plugin, but a (simple at that) php-program which turns all posts into a bookcontent.tex file. This file can then be edited further into a proper book.

Unfortunately, the present version chokes on LaTeXrender-code (which is easy enough to solve doing a global ‘find-and-replace’ of the tex-tags by dollar-signs) but worse, on Markdown-code… But then, someone fluent in php-regex will have no problems extending the libs/functions.php file (I hope…).

At the moment I’m considering turning the Mathieu-games-posts into a booklet. A possible title might be Mathieumatical Games. Rereading them (and other posts) I regret to be such an impatient blogger. Often I’m interested in something and start writing posts about it without knowing where or when I’ll land. This makes my posts a lot harder to get through than they might have been, if I would blog only after having digested the material myself… Typical recent examples are the tori-crypto-posts and the Bost-Connes algebra posts.

So, I still have a lot to learn from other bloggers I admire, such as Jennifer Ouellette who maintains the Coctail Party Physics blog. At the moment, Jennifer is resident blogger-journalist at the Kavli Institute where she is running a “Journal Club” workshop giving ideas on how to write better about science.

But the KITP is also committed to fostering scientific communication. That’s where I come in. Each Friday through April 26th, I’ll be presiding over a “Journal Club” meeting focusing on some aspect of communicating science.

Her most recent talk was entitled To Blog or Not to Blog? That is the Question and you can find the slides as well as a QuickTime movie of her talk. They even plan to set up a blog for the participants of the workshop. I will surely follow the rest of her course with keen interest!