Posts Tagged ‘Manin’



Arnold’s trinities

Tuesday, June 17th, 2008

Referring to the triple of exceptional Galois groups L_2(5),L_2(7),L_2(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”

\xymatrix{& \mathbb{C} \ar@{-}[rd] & \\ \mathbb{R} \ar@{-}[ru] \ar@{-}[rr] & & \mathbb{H}} but I would like to alter it into \xymatrix{& \mathbb{H} \ar@{-}[rd] & \\ \mathbb{C} \ar@{-}[ru] \ar@{-}[rr] & & \mathbb{O}}

where \mathbb{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 \mathbb{O} are the octonians.

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

\xymatrix{& E_7 \ar@{-}[rd] & \\ E_6 \ar@{-}[ru] \ar@{-}[rr] & & E_8}

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

\xymatrix{& Cube \ar@{-}[rd] & \\ Tetra \ar@{-}[ru] \ar@{-}[rr] & & Dode}

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

\xymatrix{& S_4 \ar@{-}[rd] & \\ A_4 \ar@{-}[ru] \ar@{-}[rr] & & A_5}

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

7 : The seventh trinity involves complex polynomials in one variable

\xymatrix{& \mathbb{C}[z,z^{-1}] \ar@{-}[rd] & \\ \mathbb{C}[z] \ar@{-}[ru] \ar@{-}[rr] & & \mathbb{C}[z,z^{-1},(z-1)^{-1}] }

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

8 : The eight one is another beauty

\xymatrix{& TrigonoNumbers \ar@{-}[rd] & \\ Numbers \ar@{-}[ru] \ar@{-}[rr] & & EllipticNumbers }

Here ‘numbers’ are the ordinary complex numbers \mathbb{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

\xymatrix{& 28-biTangents \ar@{-}[rd] & \\ 27-Lines \ar@{-}[ru] \ar@{-}[rr] & & 120-Tritangents }

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

\xymatrix{& L_2(7) \ar@{-}[rd] & \\ L_2(5) \ar@{-}[ru] \ar@{-}[rr] & & L_2(11) }

explained last time.

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

\xymatrix{& KleinQuartic \ar@{-}[rd] & \\ Dodecahedron \ar@{-}[ru] \ar@{-}[rr] & & ? }

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

\xymatrix{& Conway \ar@{-}[rd] & \\ Mathieu \ar@{-}[ru] \ar@{-}[rr] & & Monster }

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

bloomsday 2 : BistroMath

Monday, June 16th, 2008

Conceptual blog-proposals

  1. bloomsday 2 : BistroMath
  2. the future of this blog
  3. the future of this blog (2)

Exactly one year ago this blog was briefly renamed MoonshineMath. The concept being that it would focus on the mathematics surrounding the monster group & moonshine. Well, I got as far as the Mathieu groups…

After a couple of months, I changed the name back to neverendingbooks because I needed the freedom to post on any topic I wanted. I know some people preferred the name MoonshineMath, but so be it, anyone’s free to borrow that name for his/her own blog.

Today it’s bloomsday again, and, as I’m a cyclical guy, I have another idea for a conceptual blog : the bistromath chronicles (or something along this line).

Here’s the relevant section from the Hitchhikers guide

Bistromathics itself is simply a revolutionary new way of understanding the behavior of numbers. …
Numbers written on restaurant checks within the confines of restaurants do not follow the same mathematical laws as numbers written on any other pieces of paper in any other parts of the Universe.
This single statement took the scientific world by storm. It completely revolutionized it.So many mathematical conferences got hold in such good restaurants that many of the finest minds of a generation died of obesity and heart failure and the science of math was put back by years.

Right, so what’s the idea? Well, on numerous occasions Ive stated that any math-blog can only survive as a group-blog. I did approach a lot of people directly, but, as you have noticed, without too much success… Most of them couldnt see themselves contributing to a blog for one of these reasons : it costs too much energy and/or it’s way too inefficient. They say : career-wise there are far cleverer ways to spend my energy than to write a blog. And… there’s no way I can argue against this.

Whence plan B : set up a group-blog for a fixed amount of time (say one year), expect contributors to write one or two series of about 4 posts on their chosen topic, re-edit the better series afterwards and turn them into a book.

But, in order to make a coherent book proposal out of blog-post-series, they’d better center around a common theme, whence the BistroMath ploy. Imagine that some of these forgotten “restaurant-check-notes” are discovered, decoded and explained. Apart from the mathematics, one is free to invent new recepies or add descriptions of restaurants with some mathematical history, etc. etc.

One possible scenario (but I’m sure you will have much better ideas) : part of the knotation is found on a restaurant-check of some Italian restaurant. This allow to explain Conway’s theory of rational tangles, give the perfect way to cook spaghetti to experiment with tangles and tell the history of Manin’s Italian restaurant in Bonn where (it is rumoured) the 1998 Fields medals were decided…

But then, there is no limit to your imagination as long as it somewhat fits within the framework. For example, I’d love to read the transcripts of a chat-session in SecondLife between Dedekind and Conway on the construction of real numbers… I hope you get the drift.

I’m not going to rename neverendingbooks again, but am willing to set up the BistroMath blog provided

  • Five to ten people are interested to participate
  • At least one book-editor shows an interest
    update : (16/06) contacted by first publisher
You can leave a comment or, if you prefer, contact me via email (if you’re human you will have no problem getting my address…).

Clearly, people already blogging are invited and are allowed to cross-post (in fact, that’s what I will do if it ever gets so far). Finally, if you are not willing to contribute blog-posts but like the idea and are willing to contribute to it in any other way, we are still auditioning for chanting monks

The small group of monks who had taken up hanging around the major research institutes singing strange chants to the effect that the Universe was only a figment of its own imagination were eventually given a street theater grant and went away.

And, if you do not like this idea, there will be another bloomsday-idea next year…

The F_un folklore

Saturday, June 7th, 2008

All esoteric subjects have their own secret (sacred) texts. If you opened the Da Vinci Code (or even better, the original The Holy blood and the Holy grail) you will known about a mysterious collection of documents, known as the “ Dossiers secrets“, deposited in the Bibliothèque nationale de France on 27 April 1967, which is rumoured to contain the mysteries of the Priory of Sion, a secret society founded in the middle ages and still active today…

The followers of F-un, for \mathbb{F}_1 the field of one element, have their own collection of semi-secret texts, surrounded by whispers, of which they try to decode every single line in search of enlightenment. Fortunately, you do not have to search the shelves of the Bibliotheque National in Paris, but the depths of the internet to find them as huge, bandwidth-unfriendly, scanned documents.

The first are the lecture notes “Lectures on zeta functions and motives” by Yuri I. Manin of a course given in 1991.

One can download a scanned version of the paper from the homepage of Katia Consani as a huge 23.1 Mb file. Of F-un relevance is the first section “Absolute Motives?” in which

“…we describe a highly speculative picture of analogies between arithmetics over \mathbb{F}_q and over \mathbb{Z}, cast in the language reminiscent of Grothendieck’s motives. We postulate the existence of a category with tensor product \times whose objects correspond not only to the divisors of the Hasse-Weil zeta functions of schemes over \mathbb{Z}, but also to Kurokawa’s tensor divisors. This neatly leads to teh introduction of an “absolute Tate motive” \mathbb{T}, whose zeta function is \tfrac{s-1}{2\pi}, and whose zeroth power is “the absolute point” which is teh base for Kurokawa’s direct products. We add some speculations about the role of \mathbb{T} in the “algebraic geometry over a one-element field”, and in clarifying the structure of the gamma factors at infinity.” (loc.cit. p 1-2)

I’d welcome links to material explaining this section to people knowing no motives.

The second one is the unpublished paper “Cohomology determinants and reciprocity laws : number field case” by Mikhail Kapranov and A. Smirnov.

This paper features in blog-posts at the Arcadian Functor, in John Baez’ Weekly Finds and in yesterday’s post at Noncommutative Geometry.

You can download every single page (of 15) as a separate file from here. But, in order to help spreading the Fun-gospel, I’ve made these scans into a single PDF-file which you can download as a 2.6 Mb PDF. In the introduction they say :

“First of all, it is an old idea to interpret combinatorics of finite sets as the q \rightarrow 1 limit of linear algebra over the finite field \mathbb{F}_q. This had lead to frequent consideration of the folklore object \mathbb{F}_1, the “field with one element”, whose vector spaces are just sets. One can postulate, of course, that \wis{spec}(\mathbb{F}_1) is the absolute point, but the real problem is to develop non-trivial consequences of this point of view.”

They manage to deduce higher reciprocity laws in class field theory within the theory of \mathbb{F}_1 and its field extensions \mathbb{F}_{1^n}. But first, let us explain how they define linear algebra over these absolute fields.

Here is a first principle : in doing linear algebra over these fields, there is no additive structure but only scalar multiplication by field elements. So, what are vector spaces over the field with one element? Well, as scalar multiplication with 1 is just the identity map, we have that a vector space is just a set. Linear maps are just set-maps and in particular, a linear isomorphism of a vector space onto itself is a permutation of the set. That is, linear algebra over \mathbb{F}_1 is the same as combinatorics of (finite) sets.

A vector space over \mathbb{F}_1 is just a set; the dimension of such a vector space is the cardinality of the set. The general linear group GL_n(\mathbb{F}_1) is the symmetric group S_n, the identification via permutation matrices (having exactly one 1 in every row and column)

Some people prefer to view an \mathbb{F}_1 vector space as a pointed set, the special element being the ‘origin’ 0 but as \mathbb{F}_1 doesnt have a zero, there is also no zero-vector. Still, in later applications (such as defining exact sequences and quotient spaces) it is helpful to have an origin. So, let us denote for any set S by S^{\bullet} = S \cup \{ 0 \}. Clearly, linear maps between such ‘extended’ spaces must be maps of pointed sets, that is, sending 0 \rightarrow 0.

The field with one element \mathbb{F}_1 has a field extension of degree n for any natural number n which we denote by \mathbb{F}_{1^n} and using the above notation we will define this field as :

\mathbb{F}_{1^n} = \mu_n^{\bullet} with \mu_n the group of all n-th roots of unity. Note that if we choose a primitive n-th root \epsilon_n, then \mu_n \simeq C_n is the cyclic group of order n.

Now what is a vector space over \mathbb{F}_{1^n}? Recall that we only demand units of the field to act by scalar multiplication, so each ‘vector’ \vec{v} determines an n-set of linear dependent vectors \epsilon_n^i \vec{v}. In other words, any \mathbb{F}_{1^n}-vector space is of the form V^{\bullet} with V a set of which the group \mu_n acts freely. Hence, V has N=d.n elements and there are exactly d orbits for the action of \mu_n by scalar multiplication. We call d the dimension of the vectorspace and a basis consists in choosing one representant for every orbits. That is, B = \{ b_1,\hdots,b_d \} is a basis if (and only if) V = \{ \epsilon_n^j b_i~:~1 \leq i \leq d, 1 \leq j \leq n \}.

So, vectorspaces are free \mu_n-sets and hence linear maps V^{\bullet} \rightarrow W^{\bullet} is a \mu_n-map V \rightarrow W. In particular, a linear isomorphism of V, that is an element of GL_d(\mathbb{F}_{1^n}) is a \mu_n bijection sending any basis element b_i \rightarrow \epsilon_n^{j(i)} b_{\sigma(i)} for a permutation \sigma \in S_d.

An \mathbb{F}_{1^n}-vectorspace V^{\bullet} is a free \mu_n-set V of N=n.d elements. The dimension dim_{\mathbb{F}_{1^n}}(V^{\bullet}) = d and the general linear group GL_d(\mathbb{F}_{1^n}) is the wreath product of S_d with \mu_n^{\times d}, the identification as matrices with exactly one non-zero entry (being an n-th root of unity) in every row and every column.

This may appear as a rather sterile theory, so let us give an extremely important example, which will lead us to our second principle for developing absolute linear algebra.

Let q=p^k be a prime power and let \mathbb{F}_q be the finite field with q elements. Assume that q \cong 1~mod(n). It is well known that the group of units \mathbb{F}_q^{\ast} is cyclic of order q-1 so by the assumption we can identify \mu_n with a subgroup of \mathbb{F}_q^{\ast}.

Then, \mathbb{F}_q = (\mathbb{F}_q^{\ast})^{\bullet} is an \mathbb{F}_{1^n}-vectorspace of dimension d=\tfrac{q-1}{n}. In other words, \mathbb{F}_q is an \mathbb{F}_{1^n}-algebra. But then, any ordinary \mathbb{F}_q-vectorspace of dimension e becomes (via restriction of scalars) an \mathbb{F}_{1^n}-vector space of dimension \tfrac{e(q-1)}{n}.

Next time we will introduce more linear algebra definitions (including determinants, exact sequences, direct sums and tensor products) in the realm the absolute fields \mathbb{F}_{1^n} and remarkt that we have to alter the known definitions as we can only use the scalar-multiplication. To guide us, we have the second principle : all traditional results of linear algebra over \mathbb{F}_q must be recovered from the new definitions under the vector-space identification \mathbb{F}_q = (\mathbb{F}_q^{\ast})^{\bullet} = \mathbb{F}_{1^n} when n=q-1. (to be continued)

the King’s problem on MUBs

Thursday, February 28th, 2008

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 \mathbb{C}^d equipped with the usual Hermitian inproduct \vec{v}.\vec{w} = \sum \overline{v_i} w_i. An observable E is a choice of orthonormal basis \{ \vec{e_i} \} consisting of eigenvectors of the self-adjoint matrix E. E together with another observable F (with orthonormal basis \{ \vec{f_j} \}) are said to be mutally unbiased if the norms of all inproducts \vec{f_j}.\vec{e_i} are equal to 1/\sqrt{d}. 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 Problem1 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 d=p^k, consists in taking a system of k object qupits (when p=2l+1 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 d^2 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 d=p^k, identify the elements of \mathbb{F}_{p^k} with the numbers from 1 to d in some fixed way. Then, the d^2 of number-strings are found as follows : let k_0,k_1 \in \mathbb{F}_{p^k} 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 k_m (with 2 \leq m \leq d) determined from k_0,k_1 by the equation

k_m = l_{m} * k_0+k_1

where l_i is the field-element corresponding to the integer i (l_1 corresponds to the zero element). It is easy to see that these d^2 strings satisfy the conditions of the combinatorial problem. Indeed, any two of its digits determine k_0,k_1 (and hence the whole string) as it follows from k_m = l_m k_0 + k_1 and k_r = l_r k_0 + k_1 that k_0 = \frac{k_m-k_r}{l_m-l_r}.

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… []

neverendingbooks-geometry

Tuesday, June 12th, 2007

Here a list of saved pdf-files of previous NeverEndingBooks-posts on geometry in reverse chronological order.

(more…)

AWSOM Powered