Skip to content →

Tag: games

THE rationality problem

This morning, Esther Beneish
arxived the paper The center of the generic algebra of degree p that may contain the most
significant advance in my favourite problem for over 15 years! In it she
claims to prove that the center of the generic division algebra of
degree p is stably rational for all prime values p. Let me begin by
briefly explaining what the problem is all about. Consider one n by n
matrix A which is sufficiently general, then it will have all its
eigenvalues distinct, but then it is via the Jordan normal form theorem uniquely
determined upto conjugation (that is, base change) by its
characteristic polynomial. In
other words, the conjugacy class of a sufficiently general n by n matrix
depends freely on the coefficients of the characteristic polynomial
(which are the n elementary symmetric functions in the eigenvalues of
the matrix). Now what about couples of n by n matrices (A,B) under
simultaneous conjugation (that is all couples of the form $~(g A
g^{-1}, g B g^{-1}) $ for some invertible n by n matrix g) ??? So,
does there exist a sort of Jordan normal form for couples of n by n
matrices which are sufficiently general? That is, are there a set of
invariants for such couples which determine it is freely upto
simultaneous conjugation?

For couples of 2 by 2 matrices, Claudio Procesi rediscovered an old
result due to James Sylvester saying
that this is indeed the case and that the set of invariants consists of
the five invariants Tr(A),Tr(B),Det(A),Det(B) and Tr(AB). Now, Claudio
did a lot more in his paper. He showed that if you could prove this for
couples of matrices, you can also do it for triples, quadruples even any
k-tuples of n by n matrices under simultaneous conjugation. He also
related this problem to the center of the generic division algebra of
degree n (which was introduced earlier by Shimshon Amitsur in a rather
cryptic manner and for a while he simply refused to believe Claudio’s
description of this division algebra as the one generated by two
_generic_ n by n matrices, that is matrices filled with independent
variables). Claudio also gave the description of the center of this
algebra as a field of lattice-invariants (over the symmetric group S(n)
) which was crucial in subsequent investigations. If you are interested
in the history of this problem, its connections with Brauer group
problems and invariant theory and a short description of the tricks used
in proving the results I’ll mention below, you might have a look at the
talk Centers of Generic Division Algebras, the rationality problem 1965-1990
I gave in Chicago in 1990.

The case of couples of 3 by 3 matrices was finally
settled in 1979 by Ed Formanek and a
year later he was able to solve also the case of couples of 4 by 4
matrices in a fabulous paper. In it, he used solvability of S(4) in an
essential way thereby hinting at the possibility that the problem might
no longer have an affirmative answer for larger values of n. When I read
his 4×4 paper I believed that someone able to prove such a result must
have an awesome insight in the inner workings of matrices and decided to
dedicate myself to this problem the moment I would get a permanent
job… . But even then it is a reckless thing to do. Spending all of
your time to such a difficult problem can be frustrating as there is no
guarantee you’ll ever write a paper. Sure, you can find translations of
the problem and as all good problems it will have connections with other
subjects such as moduli spaces of vectorbundles and of quiver
representations, but to do the ‘next number’ is another matter.

Fortunately, early 1990, together with
Christine Bessenrodt we were
able to do the next two ‘prime cases’ : couples of 5 by 5 and couples of
7 by 7 matrices (Katsylo and Aidan Schofield had already proved that if
you could do it for couples of k by k and l by l matrices and if k and l
were coprime then you could also do it for couples of kl by kl matrices,
so the n=6 case was already done). Or did we? Well not quite, our
methods only allowed us to prove that the center is stably rational
that is, it becomes rational by freely adjoining extra variables. There
are examples known of stably rational fields which are NOT rational, but
I guess most experts believe that in the case of matrix-invariants
stable rationality will imply rationality. After this paper both
Christine and myself decided to do other things as we believed we had
reached the limits of what the lattice-method could do and we thought a
new idea was required to go further. If today’s paper by Esther turns
out to be correct, we were wrong. The next couple of days/weeks I’ll
have a go at her paper but as my lattice-tricks are pretty rusty this
may take longer than expected. Still, I see that in a couple of weeks
there will be a meeting in
Atlanta were Esther
and all experts in the field will be present (among them David Saltman
and Jean-Louis Colliot-Thelene) so we will know one way or the other
pretty soon. I sincerely hope Esther’s proof will stand the test as she
was the only one courageous enough to devote herself entirely to the
problem, regardless of slow progress.

Leave a Comment

devilish symmetries

In another post we introduced
Minkowski’s question-mark function, aka the devil’s straircase
and related it to
Conways game of _contorted fractions_. Side remark : over at Good Math, Bad Math Mark Chu-Carroll is running
a mini-series on numbers&games, so far there is a post on surreal numbers,
surreal arithmetic and the connection with
games but
probably this series will go on for some time.

About a year ago I had
an email-exchange with Linas Vepstas because I was
intrigued by one of his online publications linking the fractal
symmetries of the devil’s staircase to the modular group. Unfortunately,
his paper contained some inaccuracies and I’m happy some of my comments
made it into his rewrite The Minkowski question mark, GL(2,Z) and the
modular group
. Still, several
mistakes remain so read this paper only modulo his own caveat

XXXX This paper is unfinished. Although this version
corrects a number of serious errors in the previous drafts, it is still
misleading and confusing in many ways. The second half, in particular
must surely contain errors and mis-statements! Caveat emptor! XXXX

For example, on page 15 of the march 24-version he claims
that the third braid group $B_3 \simeq SL_2(\mathbb{Z}) $ which
would make life, mathematics and even physics a lot easier, but
unfortunately is not true. Recall that Artin’s defining relation for the
3-string braid group is $\sigma_1 \sigma_2 \sigma_1 = \sigma_2
\sigma_1 \sigma_2 $ as can be seen because the 3-strings below can
be transformed into each other
But from this
relation it follows that $c=(\sigma_1 \sigma_2 \sigma_1)^2 $ is
a central element in $B_3 $ and it is not difficult to verify
that indeed $B_3/ \langle c \rangle \simeq PSL_2(\mathbb{Z}) $
and $B_3/ \langle c^2 \rangle \simeq SL_2(\mathbb{Z}) $ An easy
way to see that the third braid group and the modular group are quite
different is to look at their one-dimensional representations. Any
group-map $B_3 \rightarrow \mathbb{C}^_ $ is determined by
non-zero complex numbers x and y satisfying $x^2y=y^2x $ so are
parametrized by the torus $\mathbb{C}^_ $ whereas there are only
6 one-dimensional representations of $PSL_2(\mathbb{Z}) = C_2 \ast
C_3 $ (and similarly, there are only 12 one-dimensional
$SL_2(\mathbb{Z}) $-representations). Btw. for those still
interested in noncommutative geometry : $(P)SL_2(\mathbb{Z}) $
are noncommutative manifolds whereas $B_3 $ is definitely
singular, if I ever get to the definitions of all of this… Still,
there is a gem contained in Linas’ paper and here’s my reading of it :
the fractal symmetries of the devil’s staircase form a generating
sub-semigroup $C_2 \ast \mathbb{N} $ of
$GL_2(\mathbb{Z}) $ . To begin, let us recall that the
question-mark function is defined in terms of continued fraction
expressions. So, what group of symmetries may be around the corner?
Well, if $a = \langle a_0;a_1,a_2,\ldots \rangle $ is the
continued fraction of a (see this
post
for details) then if we
look at the n-th approximations $\frac{p_n}{q_n} $ (that is, the
rational numbers obtained after breaking off the continued fraction at
step n) it is failrly easy to show that $\begin{bmatrix} p_n &
p_{n-1} \\ q_n & q_{n-1} \end{bmatrix} \in GL_2(\mathbb{Z}) $ and
recall (again) that this group acts on
$\mathbb{P}^1_{\mathbb{C}} $ via Moebius transformations
$\begin{bmatrix} a & b \ c & d \end{bmatrix} $ via $z
\mapsto \frac{az+b}{cz+d} $ One of the symmetries is easy to spot
(reflexion along the 1/2-axis) That is, $?(x-1) = 1 – ?(x) $ Observe that the left-hand
side transformation is given by the Moebius transformation determined by
the matrix $r = \begin{bmatrix} -1 & 1 \\ 0 & 1 \end{bmatrix} \in
GL_2(\mathbb{Z}) $ Other symmetries are harder to see as they are
_fractal symmetries_, that is they are self-symmetries but at different
scales. For example, let us blow-up the ?-function at the interval
[1/3,1/2] and compare it with the function at the interval [1/2,1]
which has the same graph, while halving the function value. More
generally, substituting the ?-function definition using continued
fraction expressions one verifies that $?(\frac{x}{x+1}) =
\frac{1}{2} ?(x) $ and this time the left-hand transformation is
determined by the matrix $g = \begin{bmatrix} 1 & 0 \\ 1 & 1
\end{bmatrix} \in GL_2(\mathbb{Z}) $ We obtain a semi-group $S
= \langle r,g \rangle $ of fractal symmetries which are induced (the
right hand sides of the above expressions) via a 2-dimensional
representation of S $S \rightarrow GL_2(\mathbb{C})~\qquad r
\mapsto \begin{bmatrix} 1 & 0 \\ 1 & -1 \end{bmatrix}~\qquad g \mapsto
\begin{bmatrix} 1 & 0 \\ 0 & \frac{1}{2} \end{bmatrix} $ acting
via left-multiplication on the two-dimensional vectorspace
$\mathbb{C}1+\mathbb{C}x $. We claim that S is the free
semi-group $C_2 \ast \mathbb{N} $. Clearly, $r^2=1 $ and
g is of infinite order, but we have to show that no expression of the
form $rg^{i_1}rg^{i_2}r \ldots rg^{i_l}r $ can be the identity
in S. We will prove this by computing its action on the continued
fraction expression of $a = \langle 0;a_0,a_1,\ldots \rangle $.
It is a pleasant exercise to show that $g. \langle 0;a_1,a_2,\ldots
\rangle = \langle 0;a_1+1,a_2,\ldots \rangle $ whence by induction
$g^n. \langle 0;a_1,a_2,\ldots \rangle = \langle 0;a_1+n,a_2,\ldots
\rangle $ Moreover, the action on r is given by $r. \langle
0;a_1,a_2,\ldots \rangle = \langle 0;1,a_1-1,a_2,\ldots \rangle $ if
$a_1 \not= 1 $ whereas $r. \langle 0;1,a_2,a_3,\ldots
\rangle = \langle 0;a_2+1,a_3,\ldots \rangle $ But then, as a
consequence we have that $g^{n-1}rg . \langle 0;a_1,a_2,\ldots
\rangle = \langle 0;n,a_1,a_2,\ldots \rangle $ and iterating this
procedure gives us finally that an expression $g^{j-1} r g^k r g^l
r \ldots g^z r g = (g^{j-1} r g)(g^{k-1} r g)(g^{l-1} r g) \ldots
(g^{z-1} r g) $ acts on $a = \langle 0;a_1,a_2,\ldots
\rangle $ by sending it to $\langle
0;j,k,l,\ldots,z,a_1,a_2,\ldots \rangle $ whence such an expression
can never act as the identity element, proving that indeed $S \simeq
C_2 \ast \mathbb{N} $. As for the second claim, recall from this
post
that
$GL_2(\mathbb{Z}) $ is generated by the matrices $U =
\begin{bmatrix} 0 & -1 \ 1 & 0 \end{bmatrix}~\quad V = \begin{bmatrix}
0 & 1 \ -1 & 1 \end{bmatrix}~\quad R = \begin{bmatrix} 0 & 1 \ 1 & 0
\end{bmatrix} $ and a straightforward verification shows that
$r = RV,~\quad g = VU $ and $R = g^{-1}rg,~\quad
V=g^{-1}rgr,\quad U=rg^{-1}rg^2 $ whence, indeed, the semi-group S
generates the whole of $GL_2(\mathbb{Z}) $!

Leave a Comment

the father of all beamer talks

Who was the first mathematician to give a slide show talk? I don’t have the
definite answer to this question, but would like to offer a strong
candidate : Hermann Minkowski gave the talk “Zur Geometrie der Zahlen” (On the
geometry of numbers) before the third ICM in 1904 in Heidelberg and even
the title page of his paper in the proceedings indicates that he did
present his talk using slides (Mit Projektionsbildern auf einer
Doppeltafel)

Seven
of these eight slides would be hard to improve using LaTeX

What concerns
us today is the worst of all slides, the seventh, where Minkowski tries
to depict his famous questionmark function $?(x) $, sometimes also called
the _devil’s staircase_

The devil’s
staircase is a fractal curve and can be viewed as a mirror (taking a
point on the horizontal axis to the point on the vertical axis through
the function value) having magical simplifying properties : – it takes
rational numbers to _dyadic numbers_, that is those of the form
$n.2^{-m}$ with $n,m \in \mathbb{Z} $. – it takes quadratic
_irrational_ numbers to rational numbers. So, iterating this
mirror-procedure, the devil’s staircase is a device solving the main
problem of Greek Mathematics : which lengths can be constructed using
ruler and compass? These _constructible numbers_ are precisely those
real numbers which become after a finite number of devil-mirrors a
dyadic number. The proofs of these facts are not very difficult but
they involve a piece of long-forgotten mathematical technology :
_continued fractions_. By repeted approximations using the
floor-function (the largest natural number less than or equal to the real
number), every positive real number can be written as

$a = a_0 +
\frac{1}{a_1 + \frac{1}{a_2 + \frac{1}{a_3 + \frac{1}{\dots}}}} $

with all $a_i $ natural numbers. So, let us just denote from now on this
continued fraction of a by the expression

$a = \langle
a_0;a_1,a_2,a_3,\dots \rangle $

Clearly, a is a rational number if
(and also if but this requires a small argument using the Euclidian
algorithm) the above description has a tail of zeroes at the end and
(slightly more difficult) $a$ is a real quadratic irrational number
(that is, an element of a quadratic extension field
$\mathbb{Q}\sqrt{n} $) if and only if the continued fraction-expression
has a periodic tail. There is a lot more to say about
continued-fraction expressions and I’ll do that in another
‘virtual-course-post’ (those prepended with a (c): sign). For the
impatient let me just say that two real numbers will lie in the same
$GL_2(\mathbb{Z}) $-orbit (under the action via Moebius-transformations)
if and only if their continued fraction expressions have the same tails
eventually (which has applications in noncommutative geometry as in the
work of Manin and Marcolli but maybe I’ll come to this in the (c):
posts).

Right, now we can define the mysterious devil-stair function
$?(x) $. If a is in the real interval $[0,1] $ and if $a \in
\mathbb{Q} $ then $a = \langle 0;a_1,a_2,\dots,a_n,0,0,\dots
\rangle $ and we define $?(a) = 2 \sum_{k=1}^{n} (-1)^k
2^{-(a_1+a_2+\dots+a_k)} $ and if a is irrational with continued
fraction expression $a = \langle 0;a_1,a_2,a_3,\dots \rangle $, then

$?(a) = 2 \sum_{k=1}^{\infty} (-1)^{k+1} 2^{-(a_1+a_2+\dots+a_k)} $

A
perhaps easier description is that with the above continued-fraction
expression, the _binary_ expansion of $?(a) $ has the following form

$?(a) = 0,0 \dots 01 \dots 1 0 \dots 0 1 \dots 1 0 \dots 0 1 \dots
1 0 \dots $

where the first batch of zeroes after the comma has length
$a_1-1 $, the first batch of ones has length $a_2 $ the next batch of
zeroes length $a_3 $ and so on.

It is a pleasant exercise to verify that
this function does indeed have the properties we claimed before. A
recent incarnation of the question mark function is in Conway’s game of
_contorted fractions_. A typical position consists of a finite number of
boxed real numbers, for example the position might be

$\boxed{\pi} + \boxed{\sqrt{2}} + \boxed{1728} +
\boxed{-\frac{1}{3}} $

The Rules of the game are : (1) Both
players L and R take turns modifying just one of the numbers such that
the denominator becomes strictly smaller (irrational numbers are
supposed to have $\infty$ as their ‘denominator’). And if the boxed
number is already an integer, then its absolute value must decrease.
(2) Left must always _decrease_ the value of the boxed number, Right
must always increase it. (3) The first player unable to move looses
the game. To decide who wins a particular game, one needs to compute
the value of a position $\boxed{x} $ according to the rules of
combinatorial game theory (see for example the marvelous series of four
books Winning Ways for your Mathematical Plays. It turns out that this CG-value is no other than $?(x)$
… And, Conway has a much improved depiction of the devil-staircase in
his book On Numbers And Games

One Comment