Skip to content →

Tag: Connes

why mathematicians can’t write

The Music of the
Primes
will attract many young people to noncommutative geometry a
la Connes. It would be great if someone would spend a year trying to
write a similar pamphlet in favour of noncommutative _algebraic_
geometry, but as I mentioned before chances are not very high as most
mathematicians are unwilling to sacrifice precision and technical detail
for popular success. Still, perhaps we should reconsider this position.
A fine illustration why most mathematicians cannot write books for a
bigger audience is to be found in the preface to the book “The
problems of mathematics” (out of print or at least out of
amazon.com) by the Warwick mathematician Ian Stewart.
Below I quote a fraction from his ‘An interview with a
mathematician…’

(I)nterviewer : … So,
Mathematician : what delights do you have in store for us?
(M)athematician : I thought I’d say a bit about how you can get a TOP
but non-DIFF 4-manifold by surgery on the Kummer surface. You see,
there’s this fascinating cohomology intersection form related to the
exceptional Lie algebra $E_8$, and…
(I) : That’s
fascinating.
(M) : Thank you.
(I) : Is all that
gobbledegook really significant?
(M) : Of course! It’s one of the
most important discoveries of the last decade!
(I) : Can you
explain it in words ordinary mortals can understand?
(M) : Look,
buster, if ordinary mortals could understand it, you wouldn’t need
mathematicians to do the job for you, right?
(I) : I don’t want
the technical details. Just a general feeling for what’s going on.
(M) : You can’t get a feeling for what’s going on without
understanding the technical details.
(I) : Why not?
(M) :
Well, you just can’t.
(I) : Physicists seem to manage.
(M)
: But they work with things from everyday experience…
(I) :
Sure. ‘How gluon antiscreening affects the colour charge of a
quark.’ ‘Conduction bands in Gallium Arsenide.’ Trip over
‘em all the time on the way to work, don’t you?
(M) : Yes,
but…
(I) : I’m sure that the physicists find all the
technical details just as fascinating as you do. But they don’t let them
intrude so much.
(M) : But how can I explain things properly if I
don’t give the details?
(I) : How can anyone else
understand them if you do?

(M) : But if I skip the fine
points, some of the things I say won’t be completely true! How can I
talk about manifolds without mentioning that the theorems only work if
the manifolds are finite-dimensional paracompact Hausdorff with empty
boundary?
(I) : Lie a bit.
(M) : Oh, but I couldn’t do
that!
(I) : Why not? Everybody else does.
(M) : But, I
must tell the truth!
(I) : Sure. But you might be prepared to
bend it a little, if it helps people understand what you’re doing.
(M) : Well…

Leave a Comment

music of the primes

Let me
admit it : i was probably wrong in this post to
advise against downloading A walk in the noncommutative
garden
by Alain Connes and Matilde Marcolli. After all, it seems
that Alain&Matilde are on the verge of proving the biggest open
problem in mathematics, the Riemann
hypothesis
using noncommutative geometry. At least, this is the
impression one gets from reading through The music of the
primes, why an unsolved problem in mathematics matters
by Oxford
mathematician Prof.
Marcus du Sautoy
… At the moment I’ve only read the first
chapter (_Who wants to be a millionaire?_) and the final two
chapters (_From orderly zeros to quantum chaos_ and _The
missing piece of the jigsaw_) as I assume I’ll be familiar with most
of the material in between (and also, I’m saving these chapters for some
vacation reading). From what I’ve read, I agree most with the final
review at amazon.co.uk

Fascinating
and infuriating
, October 5, 2004
Reviewer: pja_jennings
from Southampton, Hants. United Kingdom
This is a book I found
fascinating and infuriating in turns. It is an excellent layman’s
history of number theory with particular reference to prime numbers and
the Riemann zeta function. As such it is well worth the reading.
However I found that there are certain elements, more of style than
anything else, that annoyed me. Most of the results are handed to us
without any proof whatsoever. All right, some of these proofs would be
obviously well beyond the layman, but one is described as being
understandable by the ancient Greeks (who started the whole thing) so
why not include it as a footnote or appendix?
Having established
fairly early on that the points where a mathematical function
“reaches sea level” are known as zeros, why keep reverting
to the sea level analogy? And although the underlying theme throughout
the book is the apparent inextricable link between the zeta function’s
zeros and counting primes, the Riemann hypothesis, I could find no
clear, concise statement of exactly what Riemann said.
Spanning
over 2000 years, from the ancient Greeks to the 21st century, this is a
book I would thoroughly recommend.

Books on Fermat’s last
theorem
(and there are some nice ones, such as Alf Van der Poorten’s
Notes on
Fermat’s last theorem
) can take Wiles’ solution as their focal
point. Failing a solution, du Sautoy constructs his book around an
April’s Fool email-message by Bombieri in which he claimed that a young
physicist did prove the Riemann hypothesis after hearing a talk by Alain
Connes. Here’s du Sautoy’s account (on page 3)

According
to his email, Bombieri has been beaten to his prize. ‘There are
fantastic developments to Alain Connes’s lecture at IAS last wednesday.’
Bombieri began. Several years previously, the mathematical world had
been set alight by the news that Alain Connes had turned his attention
to trying to crack the Riemann Hypothesis. Connes is one of the
revolutionaries of the subject, a benign Robespierre of mathematics to
Bombieri’s Louis XVI. He is an extraordinary charismatic figure whose
fiery style is far from the image of the staid, awkward mathematician.
He has the drive of a fanatic convinced of his world-view, and his
lectures are mesmerising. Amongst his followers he has almost cult
status. They will happily join him on the mathematical barricades to
defend their hero against any counter-offensive mounted from the ancien
regime’s entrenched positions.

Contrary to physics,
mathematics doesn’t produce many books aimed at a larger public. To a
large extend this is caused by most mathematicians’ unwillingness to
sacrifice precision and technical detail. Hence, most of us would never
be able to come up with something like du Sautoy’s description of Weil’s
work on the zeta function of curves over finite fields (page 295)

It was while exploring some of these related landscapes that
Weil discovered a method that would explain why points at sea level in
them like to be in a straight line. The landscapes where Weil was
successful did not have to do with prime numbers, but held the key to
counting how many solutions an equation such as $y^2=x^3-x$ will have if
you are working on one of Gauss’s clock calculators.

But,
it is far too easy to criticize people who do want to make the effort.
Books such as this one will bring more young people to mathematics than
any high-publicity-technical-paper. To me, the chapter on quantum chaos
was an eye-opener as I hadn’t heard too much about all of this before.
Besides, du Sautoy accompanies this book with an interesting website musicofprimes and several of
his articles for newspapers available from his homepage are
a good read (in case you wonder why the book-cover is full of joggers
with a prime number on their T-shirt, you might have a look at Beckham in his
prime number
). The music of the
primes
will definitely bring many students to noncommutative
geometry and its possible use to proving the Riemann Hypothesis.

7 Comments

noncommutative topology (1)

A couple of days ago Ars Mathematica had a post Cuntz on noncommutative topology pointing to a (new, for me) paper by Joachim Cuntz

A couple of years ago, the Notices of the AMS featured an article on noncommutative geometry a la Connes: Quantum Spaces and Their Noncommutative Topology by Joachim Cuntz. The hallmark of this approach is the heavy reliance on K theory. The first few pages of the article are fairly elementary (and full of intriguing pictures), before the K theory takes over.

A few comments are in order. To begin, the paper is **not** really about noncommutative geometry a la Connes, but rather about noncommutative geometry a la Cuntz&Quillen (based on quasi-free algebras) or, equivalently, a la Kontsevich (formally smooth algebras) or if I may be so bold a la moi (qurves).

About the **intruiging pictures** : it seems to be a recent trend in noncommutative geometry research papers to include meaningless pictures to lure the attention of the reader. But, unlike aberrations such as the recent pastiche by Alain Connes and Mathilde Marcolli A Walk in the Noncommutative Garden, Cuntz is honest about their true meaning

I am indebted to my sons, Nicolas and Michael,
for the illustrations to the examples above. Since
these pictures have no technical meaning, they
are only meant to provide a kind of suggestive
visualization of the corresponding quantum spaces.

As one of these pictures made it to the cover of the **Notices** an explanation was included by the cover-editor

About the Cover :

The image on this month’s cover arose from
Joachim Cuntz’s effort to render into visible art
his own internal vision of a noncommutative
torus, an object otherwise quite abstract. His
original idea was then implemented by his son
Michael in a program written in Pascal. More
explicitly, he says that the construction started
out with a triangle in a square, then translated
the triangle by integers times a unit along a line
with irrational slope; plotted the images thus
obtained in a periodic manner; and stopped
just before the figure started to seem cluttered.
Many mathematicians carry around inside
their heads mental images of the abstractions
they work with, and manipulate these objects
somehow in conformity with their mental imagery. They probably also make aesthetic judgements of the value of their work according to
the visual qualities of the images. These presumably common phenomena remain a rarely
explored domain in either art or psychology.

—Bill Casselman(covers@ams.org)

There can be no technical meaning to the pictures as in the Connes and Cuntz&Quillen approach there is only a noncommutative algebra and _not_ an underlying geometric space, so there is no topology, let alone a noncommutative topology. Of course, I do understand why Cuntz&others name it as such. They view the noncommutative algebra as the ring of functions on some virtual noncommutative space and they compute topological invariants (such as K-groups) of the algebras and interprete them as information about the noncommutative topology of these virtual and unspecified spaces.

Still, it is perfectly possible to associate to a qurve (aka quasi-free algebra or formally smooth algebra) a genuine noncommutative topological space. In this series of posts I’ll explain the little I know of the history of this topic, the thing I posted about it a couple of years ago, why I abandoned the project and the changes I made to it since and the applications I have in mind, both to new problems (such as the birational_classification of qurves) as well as classical problems (such as rationality problems for $PGL_n $ quotient spaces).

Although others have tried to define noncommutative topologies before, I learned about them from Fred Van Oystaeyen. Fred spend the better part of his career constructing structure sheaves associated to noncommutative algebras, mainly to prime Noetherian algebras (the algebras of preference for the majority of non-commutative algebraists). So, suppose you have an ordinary (meaning, the usual commutative definition) topological space X associated to this algebra R, he wants to define an algebra of sections on every open subset $X(\sigma) $ by taking a suitable localization of the algebra $Q_{\sigma}(R) $. This localization is taken with respect to a suitable filter of left ideals $\mathcal{L}(\sigma) $ of R and is defined to be the subalgebra of the classiocal quotient ring $Q(R) $ (which exists because $R$ is prime Noetherian in which case it is a simple Artinian algebra)

$Q_{\sigma}(R) = { q \in Q(R)~|~\exists L \in \mathcal{L}(\sigma)~:~L q \subset R } $

(so these localizations are generalizations of the usual Ore-type rings of fractions). But now we come to an essential point : if we want to glue this rings of sections together on an intersection $X(\sigma) \cap X(\tau) $ we want to do this by ‘localizing further’. However, there are two ways to do this, either considering $~Q_{\sigma}(Q_{\tau}(R)) $ or considering $Q_{\tau}(Q_{\sigma}(R)) $ and these two algebras are only the same if we impose fairly heavy restrictions on the filters (or on the algebra) such as being compatible.

As this gluing property is essential to get a sheaf of noncommutative algebras we seem to get stuck in the general (non compatible) case. Fred’s way out was to make a distinction between the intersection $X_{\sigma} \cap X_{\tau} $ (on which he put the former ring as its ring of sections) and the intersection $X_{\tau} \cap X_{\sigma} $ (on which he puts the latter one). So, the crucial new ingredient in a noncommutative topology is that the order of intersections of opens matter !!!

Of course, this is just the germ of an idea. He then went on to properly define what a noncommutative topology (and even more generally a noncommutative Grothendieck topology) should be by using this localization-example as guidance. I will not state the precise definition here (as I will have to change it slightly later on) but early version of it can be found in the Antwerp Ph.D. thesis by Luc Willaert (1995) and in Fred’s book Algebraic geometry for associative algebras.

Although _qurves_ are decidedly non-Noetherian (apart from trivial cases), one can use Fred’s idea to associate a noncommutative topological space to a qurve as I will explain next time. The quick and impatient may already sneak at my old note a non-commutative topology on rep A but please bear in mind that I changed my mind since on several issues…

Leave a Comment

dvonn (2) overload

In the
[previous post](http://www.neverendingbooks.org/index.php?p=309) we have
seen that it is important to have lots of mobile pieces around in the
endgame and that it is hard for a computer-program to evaluate a
position correctly. In fact, we illustrated this with a position which
‘clearly’ looks much better for Black (the computer) whereas it is
already lost! In fact, the computer lost this particular game already 7
plies earlier. Consider the position

$\xymatrix@=.3cm @!C
@R=.7cm{.& & & & & & & & & & & & & \\ & & & \SBlack \connS & &
\bull{d}{5} \conn & & \bull{e}{5} \conn & & \bull{f}{5} \conn & &
\bull{g}{5} \conn & & \bull{h}{5} \conn & & \SWhite \connS & & \SWhite
\connS & & \SWhite \conneS & & & \\ & & \SBlack \connS & & \SBlack
\connS & & \Black{6} \connS & & \bull{e}{4} \conn& & \bull{f}{4} \conn &
& \bull{g}{4} \conn & & \bull{h}{4} \conn & & \SWhite \connS & &
\SWhite \connS & & \SWhite \conneS & & \\ & \SBlack \connbeginS & &
\SBlack \connS & & \BDvonn{2} \connS & & \bull{d}{3} \conn & & \SBlack
\connS & & \BDvonn{3} \connS & & \White{4} \connS & & \SWhite \connS &
& \Dvonn \connS & & \SWhite \connS & & \SWhite \connendS & . \\ & &
\Black{5} \connbeginS & & \SBlack \connS & & \SBlack \connS & &
\bull{d}{2} \conn & & \SBlack \connS & & \bull{f}{2} \conn & &
\bull{g}{2} \conn & & \SWhite \connS & & \SWhite \connS & & \SWhite
\connendS & & \\ & & & \bull{a}{1} \con & & \bull{b}{1} \con & &
\Black{5} \conS & & \bull{d}{1} \con & & \bull{e}{1} \con & &
\bull{f}{1} \con & & \bull{g}{1} \con & & \bull{h}{1} \con & & \White{2}
& & & \\ .& & & & & & & & & & & & & } $

Probably, Black lost the
game with its last move d1-f3 thereby disconnecting its pieces into two
clusters. White (the human player) must already have realized at this
moment he had a good chance of winning (as indicated in the previous
post) by letting Black run out of moves by building large stacks on the
third row, White building a stack of the appropriate size which then
jumps on the largest Black stack on the final move. Btw. this technique
is called *sharpshooting* in Dvonn-parlance

The concept
of manipulating the height of a stack so that it can land precisely on a
critical space. It’s a matter of counting and one-digit addition. Notice
that this doesn’t necessarily mean putting your own stacks atop one
another – the best sharpshooting moves are moves which also neutralize.
To counter a sharpshooting move is called “spoiling”.

But
for this strategy to have a chance, White must keep the Black stacks
containing the Dvonn pieces on the third row. At the moment the stack on
c3 can move to c1 or to c5 and with his next move White counters this
by *overloading* the stack, that is

To spoil a move or
prevent a lifting move by moving atop the enemy stack. Even if the
opponent has enough control to retake the stack, he cannot move it
because it has become taller.

So, White sacrifies his
height 4 stack on g3 with the move g3-c3. Black must take back
immediately (if not, White moves c3-i3 and all Black’s material in the
farmost right cluster is lost) but now the previously mobile Black
height 2 stack at c3 has become an immobile (or *old stack*) height 7
stack which has no option but to stay on c3 (clearly Black will never
move it to j3…). Next, White performs a similar startegy to
neutralize the *young* height 3 Black stack on f3 by overloading it by 2
and hence after the forced recapture it becomes a height 6 Black stack
which must remain on f3 forever. Here are the actual moves 1) g3-c3
b2-c3 2) h2-h3 b4-c5 3) h3-f3 e2-f3 and we end up with the
situation we analyzed last time, that is

$\xymatrix@=.3cm @!C
@R=.7cm{.& & & & & & & & & & & & & \\ & & & \Black{2} \connS & &
\bull{d}{5} \conn & & \bull{e}{5} \conn & & \bull{f}{5} \conn & &
\bull{g}{5} \conn & & \bull{h}{5} \conn & & \SWhite \connS & & \SWhite
\connS & & \SWhite \conneS & & & \\ & & \bull{b}{4} \conn & & \SBlack
\connS & & \Black{6} \connS & & \bull{e}{4} \conn& & \bull{f}{4} \conn &
& \bull{g}{4} \conn & & \bull{h}{4} \conn & & \SWhite \connS & &
\SWhite \connS & & \SWhite \conneS & & \\ & \SBlack \connbeginS & &
\SBlack \connS & & \BDvonn{7} \connS & & \bull{d}{3} \conn & & \SBlack
\connS & & \BDvonn{6} \connS & & \bull{g}{3} \conn & & \bull{h}{3}
\conn & & \Dvonn \connS & & \SWhite \connS & & \SWhite \connendS & . \\
& & \Black{5} \connbeginS & & \bull{b}{2} \conn & & \SBlack \connS & &
\bull{d}{2} \conn & & \bull{e}{2} \conn & & \bull{f}{2} \conn & &
\bull{g}{2} \conn & & \bull{h}{2} \conn & & \SWhite \connS & & \SWhite
\connendS & & \\ & & & \bull{a}{1} \con & & \bull{b}{1} \con & &
\Black{5} \conS & & \bull{d}{1} \con & & \bull{e}{1} \con & &
\bull{f}{1} \con & & \bull{g}{1} \con & & \bull{h}{1} \con & & \White{2}
& & & \\ . & & & & & & & & & & & & & } $

Leave a Comment

Latexrender and dvonn boards

In order
to blog a bit about Dvonn-strategy, I made myself a simple Dvonn
LaTeX-template which works very well on paper but which gets mutilated
by Latexrender, for example the first situation of the looks
like

$~\xymatrix@=.3cm @!C @R=.7cm{ & & \Black{2} \connS & &
\bull{d}{5} \conn & & \bull{e}{5} \conn & & \bull{f}{5} \conn & &
\bull{g}{5} \conn & & \bull{h}{5} \conn & & \SWhite \connS & & \SWhite
\connS & & \SWhite \conneS & & \\ & \bull{b}{4} \conn & & \SBlack
\connS & & \Black{6} \connS & & \bull{e}{4} \conn& & \bull{f}{4} \conn &
& \bull{g}{4} \conn & & \bull{h}{4} \conn & & \SWhite \connS & &
\SWhite \connS & & \SWhite \conneS & \\ \SBlack \connbeginS & &
\SBlack \connS & & \BDvonn{7} \connS & & \bull{d}{3} \conn & & \SBlack
\connS & & \BDvonn{6} \connS & & \bull{g}{3} \conn & & \bull{h}{3}
\conn & & \Dvonn \connS & & \SWhite \connS & & \SWhite \connendS \\ &
\Black{5} \connbeginS & & \bull{b}{2} \conn & & \SBlack \connS & &
\bull{d}{2} \conn & & \bull{e}{2} \conn & & \bull{f}{2} \conn & &
\bull{g}{2} \conn & & \bull{h}{2} \conn & & \SWhite \connS & & \SWhite
\connendS & \\ & & \bull{a}{1} \con & & \bull{b}{1} \con & & \Black{5}
\conS & & \bull{d}{1} \con & & \bull{e}{1} \con & & \bull{f}{1} \con & &
\bull{g}{1} \con & & \bull{h}{1} \con & & \White{2} & &} $

The
reason behind this unwanted clipping is that Latexrender uses
**convert** to take the relevant part of a ps-page containing only the
TeXed formula on an empty page by performing clipping and then converts
it into a GIF-file (or any other format you desire). The obvious way
round this is to enlarge my template by adding two additional rows and
columns and putting visible nonsense there (such as dots) to enlarge the
relevant part so that no clipping is done of essential info. But then
(1) the picture generated becomes even larger than that above and (2) I
don’t want you to see the extra nonsensical dots… The essential line
in the **class.latexrender.php** file is

$command =
$this->_convert_path." -density ".$this->_formula_density.
" -trim -transparent \"#FFFFFF\" ".$this->_tmp_filename.".ps ".
$this->_tmp_filename.".".$this->_image_format;

So
I needed to delve into the [manual pages for the convert command](http://amath.colorado.edu/computing/software/man/convert.html)
of the ImageMagick-package. To my surprise, the *-trim* option (which I
thought to adjust somewhat by adding parameters) doesn’t exist! Still, I
got around my second problem using the *crop* option and around the
first by using the very useful *geometry* option. The latter is also
useful if you find that the size of the output of Latexrender is not
compatible with the size of your regular text. Of course you can amend
this somewhat by using the *extarticle* documentclass (as suggested) but
if you want to further adjust it, use for example

-geometry
86%

to size the output to exactly 86% (or whatever you need).
So, whenever I want to do some Dvonn-blogging from now on I’ll change my
class.latexrender.php file as follows

$command =
$this->_convert_path." -crop 0x0-10% -crop 0x0+10% -density
".$this->_formula_density. " -geometry 80%
-transparent \"#FFFFFF\" ".$this->_tmp_filename.".ps ".
$this->_tmp_filename.".".$this->_image_format;

which
produces the output

$\xymatrix@=.3cm @R=.7cm{.& & & & & & & & & &
& & & \\ & & & \Black{2} \connS & & \bull{d}{5} \conn & & \bull{e}{5}
\conn & & \bull{f}{5} \conn & & \bull{g}{5} \conn & & \bull{h}{5} \conn
& & \SWhite \connS & & \SWhite \connS & & \SWhite \conneS & & & \\ & &
\bull{b}{4} \conn & & \SBlack \connS & & \Black{6} \connS & &
\bull{e}{4} \conn& & \bull{f}{4} \conn & & \bull{g}{4} \conn & &
\bull{h}{4} \conn & & \SWhite \connS & & \SWhite \connS & & \SWhite
\conneS & & \\ & \SBlack \connbeginS & & \SBlack \connS & &
\BDvonn{7} \connS & & \bull{d}{3} \conn & & \SBlack \connS & &
\BDvonn{6} \connS & & \bull{g}{3} \conn & & \bull{h}{3} \conn & &
\Dvonn \connS & & \SWhite \connS & & \SWhite \connendS & . \\ & &
\Black{5} \connbeginS & & \bull{b}{2} \conn & & \SBlack \connS & &
\bull{d}{2} \conn & & \bull{e}{2} \conn & & \bull{f}{2} \conn & &
\bull{g}{2} \conn & & \bull{h}{2} \conn & & \SWhite \connS & & \SWhite
\connendS & & \\ & & & \bull{a}{1} \con & & \bull{b}{1} \con & &
\Black{5} \conS & & \bull{d}{1} \con & & \bull{e}{1} \con & &
\bull{f}{1} \con & & \bull{g}{1} \con & & \bull{h}{1} \con & & \White{2}
& & & \\ . & & & & & & & & & & & & & } $

which (I hope) you will
find slightly better…

Leave a Comment

dvonn (1) mobility

[Dvonn](http://www.gipf.com/dvonn $ is
the fourth game in the [Gipf Project](http://www.gipf.com/project_gipf/index.html) and the most
mathematical of all six. It is a very fast (but subtle) game with a
simple [set of rules](http://www.gipf.com/dvonn/rules/rules.html). Here
is a short version

DVONN is a stacking game. It is played
on an elongated hexagonal board, with 23 white, 23 black and 3 red
DVONN-pieces. In the beginning the board is empty. The players first
place the DVONN-pieces on the board and next their own pieces. Then they
start stacking pieces on top of each other. A single piece may be moved
1 space in any direction, a stack of two pieces may be moved two spaces,
etc. A stack must always be moved as a whole and a move must always end
on top of another piece or stack. If pieces or stacks lose contact with
the DVONN pieces, they must be removed from the board. The game ends
when no more moves can be made. The players put the stacks they control
on top of each other and the one with the highest stack is the winner.
That’s all!

All this will become clearer once we fix a
specific end-game, for example

$\xymatrix@=.3cm @!C @R=.7cm{ & &
\Black{2} \connS & & \bull{d}{5} \conn & & \bull{e}{5} \conn & &
\bull{f}{5} \conn & & \bull{g}{5} \conn & & \bull{h}{5} \conn & &
\SWhite \connS & & \SWhite \connS & & \SWhite \conneS & & \\ &
\bull{b}{4} \conn & & \SBlack \connS & & \Black{6} \connS & &
\bull{e}{4} \conn& & \bull{f}{4} \conn & & \bull{g}{4} \conn & &
\bull{h}{4} \conn & & \SWhite \connS & & \SWhite \connS & & \SWhite
\conneS & \\ \SBlack \connbeginS & & \SBlack \connS & & \BDvonn{7}
\connS & & \bull{d}{3} \conn & & \SBlack \connS & & \BDvonn{6} \connS &
& \bull{g}{3} \conn & & \bull{h}{3} \conn & & \Dvonn \connS & & \SWhite
\connS & & \SWhite \connendS \\ & \Black{5} \connbeginS & &
\bull{b}{2} \conn & & \SBlack \connS & & \bull{d}{2} \conn & &
\bull{e}{2} \conn & & \bull{f}{2} \conn & & \bull{g}{2} \conn & &
\bull{h}{2} \conn & & \SWhite \connS & & \SWhite \connendS & \\ & &
\bull{a}{1} \con & & \bull{b}{1} \con & & \Black{5} \conS & &
\bull{d}{1} \con & & \bull{e}{1} \con & & \bull{f}{1} \con & &
\bull{g}{1} \con & & \bull{h}{1} \con & & \White{2} & &} $

with
White to move. Some comments about notation : the left-slanted columns
are denoted by letters from a (left) to k (right) and the rows are
labeled 1 to 5 from bottom to top (surprisingly this ‘standard’
webgame-notation differs from the numbering on my Dvonn-board where the
rows are labeled from top to bottom…). So, for example, the three
spots on the upper right are k3,k4 and k5 (there are no k1 or k2 spots).
The three Dvonn pieces are colored red and in the course of the game a
stack may land on a Dvonn piece and so stacks containing a Dvonn piece
are denoted with a red halo. For example, the symbol on spot f3 stands
for for a stack of 6 pieces, one of which is a red Dvonn piece, under
the control of Black (that is, the top-piece is Black). Further note
that a piece or stack can only move if it is not surrounded by 6 other
pieces or stacks (so the White pieces on j3 and j4 cannot (yet) move). A
piece can only move by one step in either line-direction provided there
is another piece or stack on that position. The same applies for stacks
: an height 3 stack for example can move in each lin-direction by
exactly 3 steps provided there is a piece or stack to jump onto. For
example, the height 6 stack on d4 can only move to j4 whereas the height
6 stack on f3 cannot move at all! Similarly, the two black height 5
stacks are immobile. At the moment black has all its stacks defended,
that is, if White should be able to jump onto one of them (which White
cannot at the moment), Black can use one of its neighbouring pieces to
take the stack back under its control. So, any computer program would
‘evaluate’ the position as favourable for Black : Black has stacks of
total height 34 safely under control (there are no immediate threats to
be seen : the [horizon effect](http://www.comp.lancs.ac.uk/computing/research/aai-aied/people/paulb/old243prolog/subsection3_7_5.html) in such programs) whereas White
can only claim potential stacks of total height 13… Still, Black
has already lost the game. White has more pieces which are quite mobile
as opposed to the immobile black stacks, so Black will soon run out of
moves to make and his end position will have some large stacks on the
third row. All white has to do is to let Black run out of moves and then
continue (Dvonn forces each player to make a move if they still can and
to pass the move otherwise, so the most mobile player can still continue
long after the other player was forced to stop) to build a White stack
of the appropriate height on the third row to jump on the highest Black
stack with its last move! Here is how the play continued : 1) j2-k3 ;
a3-b3 2) i1-k3 ; c5-c3 3) i2-i3 ; c2-c3 4) i3-k3 ; d4-j4 5)
j3-j4 ; e3-f3 6) i4-j4 ; c4-b3 to arrive at the position where
Black is no longer able to make any moves at all

$\xymatrix@=.3cm
@!C @R=.7cm{ & & \bull{c}{5} \conn & & \bull{d}{5} \conn & & \bull{e}{5}
\conn & & \bull{f}{5} \conn & & \bull{g}{5} \conn & & \bull{h}{5} \conn
& & \SWhite \connS & & \SWhite \connS & & \SWhite \conneS & & \\ &
\bull{b}{4} \conn & & \bull{c}{4} \conn & & \bull{d}{4} \conn & &
\bull{e}{4} \conn& & \bull{f}{4} \conn & & \bull{g}{4} \conn & &
\bull{h}{4} \conn & & \bull{i}{4} \connS & & \White{9} \connS & &
\SWhite \conneS & \\ \bull{a}{3} \connbegin & & \Black{3} \connS & &
\BDvonn{10} \connS & & \bull{d}{3} \conn & & \bull{e}{3} \conn & &
\BDvonn{7} \connS & & \bull{g}{3} \conn & & \bull{h}{3} \conn & &
\bull{i}{3} \conn & & \bull{j}{3} \conn & & \WDvonn{6} \connendS \\ &
\Black{5} \connbeginS & & \bull{b}{2} \conn & & \bull{c}{2} \conn & &
\bull{d}{2} \conn & & \bull{e}{2} \conn & & \bull{f}{2} \conn & &
\bull{g}{2} \conn & & \bull{h}{2} \conn & & \bull{i}{2} \conn & &
\bull{j}{2} \connend & \\ & & \bull{a}{1} \con & & \bull{b}{1} \con & &
\bull{c}{1} \con & & \bull{d}{1} \con & & \bull{e}{1} \con & &
\bull{f}{1} \con & & \bull{g}{1} \con & & \bull{h}{1} \con & &
\bull{i}{1} & &} $

Note that all pieces and stacks no longer
connected to a Dvonn piece must be removed. So, for example, after the
third move by Black, the Black height 5 stacks on c1 was removed. All
white now has to do is to built an height 8 stack on k3 and jump onto
the height 10 Black stack on c3 to win the game. The (only) way to do
this is by 7. j5-k5 and 8. k5-k3 to finish with 9. k3-c3 with final
position (note again that the White right-hand pieces and stacks are no
longer connected to a Dvonn piece and are hence removed)

$\xymatrix@=.3cm @!C @R=.7cm{ & & \bull{c}{5} \conn & & \bull{d}{5}
\conn & & \bull{e}{5} \conn & & \bull{f}{5} \conn & & \bull{g}{5} \conn
& & \bull{h}{5} \conn & & \bull{i}{5} \conn & & \bull{j}{5} \conn & &
\bull{k}{5} \conne & & \\\ & \bull{b}{4} \conn & & \bull{c}{4} \conn &
& \bull{d}{4} \conn & & \bull{e}{4} \conn& & \bull{f}{4} \conn & &
\bull{g}{4} \conn & & \bull{h}{4} \conn & & \bull{i}{4} \conn & &
\bull{j}{4} \conn & & \bull{k}{4} \conne & \\\ \bull{a}{3} \connbegin
& & \Black{3} \connS & & \WDvonn{18} \connS & & \bull{d}{3} \conn & &
\bull{e}{3} \conn & & \BDvonn{7} \connS & & \bull{g}{3} \conn & &
\bull{h}{3} \conn & & \bull{i}{3} \conn & & \bull{j}{3} \conn & &
\bull{k}{3} \connend \\\ & \Black{5} \connbeginS & & \bull{b}{2} \conn
& & \bull{c}{2} \conn & & \bull{d}{2} \conn & & \bull{e}{2} \conn & &
\bull{f}{2} \conn & & \bull{g}{2} \conn & & \bull{h}{2} \conn & &
\bull{i}{2} \conn & & \bull{j}{2} \connend & \\\ & & \bull{a}{1} \con &
& \bull{b}{1} \con & & \bull{c}{1} \con & & \bull{d}{1} \con & &
\bull{e}{1} \con & & \bull{f}{1} \con & & \bull{g}{1} \con & &
\bull{h}{1} \con & & \bull{i}{1} & & } $

So White wins with 18 to
Black’s 15. This shows that it is important to maintain mobility and
also that it is possible to win a Dvonn-game from computers. In fact,
the above end-game was played against a computer-program (Black). The
entire game can be found
[here](http://www.littlegolem.net/jsp/game/game.jsp?gid=426457&nmove=91)
.

One Comment

Alain Connes on everything

A few
days ago, Ars Mathematica wrote :

Alain Connes and Mathilde Marcolli have posted a
new survey paper on Arxiv A walk in the
noncommutative garden
. There are many contenders for the title of
noncommutative geometry, but Connes’ flavor is the most
successful.

Be that as it may, do
not print this 106 page long paper! Browse through it
if you have to, be dazzled by it if you are so inclined, but I doubt it
is the eye-opener you were looking for if you gave up on reading
Connes’ book Noncommutative
Geometry
…. Besides, there is much better
_Tehran-material_ on Connes to be found on the web : An interview
with Alain Connes
, still 45 pages long but by all means : print it
out, read it in full and enjoy! Perhaps it may contain a lesson or two
for you. To wet your appetite a few quotes

It is
important that different approaches be developed and that one
doesn’t try to merge them too fast. For instance in noncommutative
geometry my approach is not the only one, there are other approaches
and it’s quite important that for these approaches there is no
social pressure to be the same so that they can develop
independently. It’s too early to judge the situation for instance
in quantum gravity. The only thing I resent in string theory is that
they put in the mind of people that it is the only theory that can
give the answer or they are very close to the answer. That I resent.
For people who have enough background it is fine since they know all
the problems that block the road like the cosmological constant, the
supersymmetry breaking, etc etc…but if you take people who are
beginners in physics programs and brainwash them from the very start
it is really not fair. Young physicists should be completely free,
but it is very hard with the actual system.

And here for some (moderate) Michael Douglas bashing :

Physicists tend to shift often and work on the
last fad. I cannot complain because at some point around 98 that fad was
NCG after my paper with Douglas and Schwarz. But after a while when
I saw Michael Douglas and asked him if he had thought more about
these problems the answer was no because it was no longer the last
fad and he wanted to work on something else. In mathematics one
sometimes works for several years on a problem but these young
physicists have a very different type of working habit. The unit of
time in mathematics is about 10 years. A paper in mathematics which is
10 years old is still a recent paper. In physics it is 3 months. So
I find it very difficult to cope with constant
zapping.

To the suggestion that he is the
prophet (remember, it is a Tehran-interview) of noncommutative geometry
he replies

It is flattering but I don’t think
it is a good thing. In fact we are all human beings and it is a
wrong idea to put a blind trust in a single person and believe in
that person whatever happens. To give you an example I can tell you
a story that happened to me. I went to Chicago in 1996, and gave a
talk in the physics department. A well known physicist was there and
he left the room before the talk was over. I didn’t meet this
physicist for two years and then, two years later, I gave the same
talk in the Dirac Forum in Rutherford laboratory near Oxford. This
time the same physicist was attending, looking very open and convinced
and when he gave his talk later he mentioned my talk quite
positively. This was quite amazing because it was the same talk and
I had not forgotten his previous reaction. So on the way back to
Oxford, I was sitting next to him in the bus, and asked him openly
how can it be that you attended the same talk in Chicago and you
left before the end and now you really liked it. The guy was not a
beginner and was in his forties, his answer was “Witten was seen
reading your book in the library in Princeton”! So I don’t want
to play that role of a prophet preventing people from thinking on
their own and ruling the sub ject, ranking people and all that. I
care a lot for ideas and about NCG because I love it as a branch of
mathematics but I don’t want my name to be associated with it as a
prophet.

and as if that was not convincing
enough, he continues

Well, the point is that what
matters are the ideas and they belong to nobody. To declare that
some persons are on top of the ladder and can judge and rank the
others is just nonsense mostly produced by the sociology (in fact by the
system of recommendation letters). I don’t want that to be true in
NCG. I want freedom, I welcome heretics.

But please, read it all for yourself and draw your own conclusions.

One Comment

nostalgia

Unlike the
cooler people out there, I haven’t received my
_pre-ordered_ copy (via AppleStore) of Tiger yet. Partly my own fault
because I couldn’t resist the temptation to bundle up with a
personalized iPod Photo!
The good news is that it buys me more time to follow the
housecleaning tips
. First, my idea was to make a CarbonCopyClooner
image of my iBook and put it on the _iMac_ upstairs which I
rarely use these days, do a clean
Tiger install
on the iBook and gradually copy over the essential
programs and files I need (and only those!). But reading the
macdev-article, I think it is better to keep my iBook running Panther
and experiment with Tiger on the redundant iMac. (Btw. unless you want
to have a copy of my Mac-installation there will be hardly a point
checking this blog the next couple of weeks as I intend to write down
all details of the Panther/Tiger switch here.)

Last week-end I
started a _Paper-rescue_ operation, that is, to find among the
multiple copies of books/papers/courses, the ones that contain all the
required material to re-TeX them and unfortunately my _archive_
is in a bad state. There is hardly a source-file left of a paper prior
to 1999 when I started putting all my papers on the arXiv.

On the other hand, I do
have saved most of my undergraduate courses. Most of them were still
using postscript-crap like _epsfig_ etc. so I had to convert all
the graphics to PDFs (merely using Preview ) and
modify the epsfig-command to _includegraphics_. So far, I
converted all my undergraduate _differential geometry_ courses
from 1998 to this year and made them available in a uniform
screen-friendly viewing format at TheLibrary/undergraduate.

There are two
ways to read the changes in these courses over the years. (1) as a shift
from _differential_ geometry to more _algebraic_ geometry
and (2) as a shift towards realism wrt.the level of our undegraduate
students. In 1998 I was still thinking
that I could teach them an easy way into Connes non-commutative standard
model but didn’t go further than the Lie group sections (maybe one day
I’ll rewrite this course as a graduate course when I ever get
reinterested in the Connes’ approach). In 1999 I had the illusion that
it might be a good idea to introduce manifolds-by-examples coming from
operads! In 2000 I gave in to the fact
that most of the students which had to follow this course were applied
mathematicians so perhaps it was a good idea to introduce them to
dynamical systems (quod non!). The 2001 course is probably the
most realistic one while still doing standard differential geometry. In
2002 I used the conifold
singularity and conifold transitions (deformations and blow-ups) as
motivation but it was clear that the students did have difficulties with
the blow-up part as they didn’t have enough experience in
_algebraic_ geometry. So the last two years I’m giving an
introduction to algebraic geometry culminating in blow-ups and some
non-commutative geometry.

Leave a Comment

a cosmic Galois group

Are
there hidden relations between mathematical and physical constants such
as

$\frac{e^2}{4 \pi \epsilon_0 h c} \sim \frac{1}{137} $

or are these numerical relations mere accidents? A couple of years
ago, Pierre Cartier proposed in his paper A mad day’s work : from Grothendieck to Connes and
Kontsevich : the evolution of concepts of space and symmetry
that
there are many reasons to believe in a cosmic Galois group acting on the
fundamental constants of physical theories and responsible for relations
such as the one above.

The Euler-Zagier numbers are infinite
sums over $n_1 > n_2 > ! > n_r \geq 1 $ of the form

$\zeta(k_1,\dots,k_r) = \sum n_1^{-k_1} \dots n_r^{-k_r} $

and there are polynomial relations with rational coefficients between
these such as the product relation

$\zeta(a)\zeta(b)=\zeta(a+b)+\zeta(a,b)+\zeta(b,a) $

It is
conjectured that all polynomial relations among Euler-Zagier numbers are
consequences of these product relations and similar explicitly known
formulas. A consequence of this conjecture would be that
$\zeta(3),\zeta(5),\dots $ are all trancendental!

Drinfeld
introduced the Grothendieck-Teichmuller group-scheme over $\mathbb{Q} $
whose Lie algebra $\mathfrak{grt}_1 $ is conjectured to be the free Lie
algebra on infinitely many generators which correspond in a natural way
to the numbers $\zeta(3),\zeta(5),\dots $. The Grothendieck-Teichmuller
group itself plays the role of the Galois group for the Euler-Zagier
numbers as it is conjectured to act by automorphisms on the graded
$\mathbb{Q} $-algebra whose degree $d $-term are the linear combinations
of the numbers $\zeta(k_1,\dots,k_r) $ with rational coefficients and
such that $k_1+\dots+k_r=d $.

The Grothendieck-Teichmuller
group also appears mysteriously in non-commutative geometry. For
example, the set of all Kontsevich deformation quantizations has a
symmetry group which Kontsevich conjectures to be isomorphic to the
Grothendieck-Teichmuller group. See section 4 of his paper Operads and motives in
deformation quantzation
for more details.

It also appears
in the renormalization results of Alain Connes and Dirk Kreimer. A very
readable introduction to this is given by Alain Connes himself in Symmetries Galoisiennes
et renormalisation
. Perhaps the latest news on Cartier’s dream of a
cosmic Galois group is the paper by Alain Connes and Matilde Marcolli posted
last month on the arXiv : Renormalization and
motivic Galois theory
. A good web-page on all of this, including
references, can be found here.

Leave a Comment

algebraic vs. differential nog


OK! I asked to get side-tracked by comments so now that there is one I’d better deal with it at once. So, is there any relation between the non-commutative (algebraic) geometry based on formally smooth algebras and the non-commutative _differential_ geometry advocated by Alain Connes?
Short answers to this question might be (a) None whatsoever! (b) Morally they are the same! and (c) Their objectives are quite different!

As this only adds to the confusion, let me try to explain each point separately after issuing a _disclaimer_ that I am by no means an expert in Connes’ NOG neither in $C^* $-algebras. All I know is based on sitting in some lectures by Alain Connes, trying at several times to make sense of his terribly written book and indeed by reading the Landi notes in utter desperation.
(a) _None whatsoever!_ : Connes’ approach via spectral triples is modelled such that one gets (suitable) ordinary (that is, commutative) manifolds into this framework. The obvious algebraic counterpart for this would be a statement to the effect that the affine coordinate ring $\mathbb{C}[X] $ of a (suitable) smooth affine variety X would be formally smooth. Now you’re in for a first shock : the only affine smooth varieties for which this holds are either _points_ or _curves_! Not much of a geometry huh? In fact, that is the reason why I prefer to call formally smooth algebras just _qurves_ …
(b) _Morally they are the same_ : If you ever want to get some differential geometry done, you’d better have a connection on the tangent bundle! Now, Alain Connes extended the notion of a connection to the non-commutative world (see for example _the_ book) and if you take the algebraic equivalent of it and ask for which algebras possess such a connection, you get _precisely_ the formally smooth algebras (see section 8 of the Cuntz-Quillen paper “Algebra extensions and nonsingularity” Journal AMS Vol 8 (1991). Besides there is a class of $C^* $-algebras which are formally smooth algebras : the AF-algebras which also feature prominently in the Landi notes (although they are virtually never affine, that is, finitely generated as an algebra).
(c) _Their objectives are quite different!_ : Connes’ formalism aims to define a length function on a non-commutative manifold associated to a $C^* $-algebra. Non-commutative geometry based on formally smooth algebras has no interest in defining some sort of space associated to the algebra. The major importance of formally smooth algebras (as advocated by Maxim Kontsevich is that such an algebra A can be seen as a _machine_ producing an infinite family of ordinary commutative manifolds via its _representation varieties_ $\mathbf{rep}_n~A $ which are manifolds equipped with a $GL_n $-action. Non-commutative functions and diifferential forms defined at the level of the formally smooth algebra A do determine similar $GL_n $-invariant features on _all_ of these representation varieties at once.

Leave a Comment