Skip to content →

Category: featured

From Galois to NOG


Evariste Galois (1811-1832) must rank pretty high on the all-time
list of moving last words. Galois was mortally wounded in a duel he
fought with Perscheux d\’Herbinville on May 30th 1832, the reason for
the duel not being clear but certainly linked to a girl called
Stephanie, whose name appears several times as a marginal note in
Galois\’ manuscripts (see illustration). When he died in the arms of his
younger brother Alfred he reportedly said “Ne pleure pas, j\’ai besoin
de tout mon courage pour mourir ‚àö‚Ć 20 ans”. In this series I\’ll
start with a pretty concrete problem in Galois theory and explain its
elegant solution by Aidan Schofield and Michel Van den Bergh.
Next, I\’ll rephrase the problem in non-commutative geometry lingo,
generalise it to absurd levels and finally I\’ll introduce a coalgebra
(yes, a co-algebra…) that explains it all. But, it will take some time
to get there. Start with your favourite basefield $k$ of
characteristic zero (take $k = \mathbb{Q}$ if you have no strong
preference of your own). Take three elements $a,b,c$ none of which
squares, then what conditions (if any) must be imposed on $a,b,c$ and $n
\in \mathbb{N}$ to construct a central simple algebra $\Sigma$ of
dimension $n^2$ over the function field of an algebraic $k$-variety such
that the three quadratic fieldextensions $k\sqrt{a}, k\sqrt{b}$ and
$k\sqrt{c}$ embed into $\Sigma$? Aidan and Michel show in \’Division
algebra coproducts of index $n$\’ (Trans. Amer. Math. Soc. 341 (1994),
505-517) that the only condition needed is that $n$ is an even number.
In fact, they work a lot harder to prove that one can even take $\Sigma$
to be a division algebra. They start with the algebra free
product
$A = k\sqrt{a} \ast k\sqrt{b} \ast k\sqrt{c}$ which is a pretty
monstrous algebra. Take three letters $x,y,z$ and consider all
non-commutative words in $x,y$ and $z$ without repetition (that is, no
two consecutive $x,y$ or $z$\’s). These words form a $k$-basis for $A$
and the multiplication is induced by concatenation of words subject to
the simplifying relations $x.x=a,y.y=b$ and $z.z=c$.

Next, they look
at the affine $k$-varieties $\mathbf{rep}(n) A$ of $n$-dimensional
$k$-representations of $A$ and their irreducible components. In the
parlance of $\mathbf{geometry@n}$, these irreducible components correspond
to the minimal primes of the level $n$-approximation algebra $\int(n) A$.
Aidan and Michel worry a bit about reducedness of these components but
nowadays we know that $A$ is an example of a non-commutative manifold (a
la Cuntz-Quillen or Kontsevich-Rosenberg) and hence all representation
varieties $\mathbf{rep}n A$ are smooth varieties (whence reduced) though
they may have several connected components. To determine the number of
irreducible (which in this case, is the same as connected) components
they use _Galois descent
, that is, they consider the algebra $A
\otimes_k \overline{k}$ where $\overline{k}$ is the algebraic closure of
$k$. The algebra $A \otimes_k \overline{k}$ is the group-algebra of the
group free product $\mathbb{Z}/2\mathbb{Z} \ast \mathbb{Z}/2\mathbb{Z}
\ast \mathbb{Z}/2\mathbb{Z}$. (to be continued…) A digression : I
cannot resist the temptation to mention the tetrahedral snake problem
in relation to such groups. If one would have started with $4$ quadratic
fieldextensions one would get the free product $G =
\mathbb{Z}/2\mathbb{Z} \ast \mathbb{Z}/2\mathbb{Z} \ast
\mathbb{Z}/2\mathbb{Z} \ast \mathbb{Z}/2\mathbb{Z}$. Take a supply of
tetrahedra and glue them together along common faces so that any
tertrahedron is glued to maximum two others. In this way one forms a
tetrahedral-snake and the problem asks whether it is possible to make
such a snake having the property that the orientation of the
\’tail-tetrahedron\’ in $\mathbb{R}^3$ is exactly the same as the
orientation of the \’head-tetrahedron\’. This is not possible and the
proof of it uses the fact that there are no non-trivial relations
between the four generators $x,y,z,u$ of $\mathbb{Z}/2\mathbb{Z} \ast
\mathbb{Z}/2\mathbb{Z} \ast \mathbb{Z}/2\mathbb{Z} \ast
\mathbb{Z}/2\mathbb{Z}$ which correspond to reflections wrt. a face of
the tetrahedron (in fact, there are no relations between these
reflections other than each has order two, so the subgroup generated by
these four reflections is the group $G$). More details can be found in
Stan Wagon\’s excellent book The Banach-tarski paradox, p.68-71.

Leave a Comment

snortGO

Before I'm bogged down by the changes let me
return to the snortGO
puzzle
. Recall that in snortGO black and white take
turns in placing a Go-stone on the board respecting the rule that no
stones of opposite colour may be adjacent. Javier is right that snortGo
with an empty starting board having an odd number of rows and columns is
a first player's win (place your first stone on the central spot and
respond to your opponent's moves by reflecting them along the
center).
Still, one can compose realistic end-game problems (as
in the previous snortGo post where the problem was : prove that the position is a first
player's win and indicate a winning move for both black and white).
To start the analysis let us remove all spots which are unavailable for
both players (as depicted in the top picture). Some of the remaining
spots are available to just one player (the central free spots and the
two in the top left corner). One counts that black has 5 such central
spots and white 4 (including the top left corner). So, all the genuine
action is happening in the three remaining corner regions for which one
can calculate the exact value following the rules of combinatorial game
theory
where bLack is playing Left and white Right (so the free
spots for black add up to +5 whereas those for white add up to -4). It
is pretty easy to work out the exact values of the corner subgames

To find the value of the total game we have to sum up these
values which can either be done by hand (use this and this to get
started and use the inductive rule $G+H = \\{ G^L+H,G+H^L \\vert
G^R+H,G+H^R \\}$) or using combinatorial game suite to
verify that this sum is equal to $\\{ \\{ 3 \\vert 2 \\} \\vert -1 \\}$
which is a fuzzy game (that is, confused with zero or a first
player's win). To find the actual winning moves just try out the
Left (bLack) and Right (white) options in the corner games to find out
that there is a unique winning move for white and there are just 2
winning moves for bLack, all indicated in the pictures below.

Leave a Comment

quintominal dodecahedra


A _quintomino_ is a regular pentagon having all its sides
colored by five different colours. Two quintominoes are the same if they
can be transformed into each other by a symmetry of the pentagon (that
is, a cyclic rotation or a flip of the two faces). It is easy to see
that there are exactly 12 different quintominoes. On the other hand,
there are also exactly 12 pentagonal faces of a dodecahedron
whence the puzzling question whether the 12 quintominoes can be joined
together (colours mathching) into a dodecahedron.
According to
the Dictionnaire de
mathematiques recreatives
this can be done and John Conway found 3
basic solutions in 1959. These 3 solutions can be found from the
diagrams below, taken from page 921 of the reprinted Winning Ways for your Mathematical
Plays (volume 4)
where they are called _the_ three
quintominal dodecahedra giving the impression that there are just 3
solutions to the puzzle (up to symmetries of the dodecahedron). Here are
the 3 Conway solutions

One projects the dodecahedron down from the top face which is
supposed to be the quintomino where the five colours red (1), blue (2),
yellow (3), green (4) and black(5) are ordered to form the quintomino of
type A=12345. Using the other quintomino-codes it is then easy to work
out how the quintominoes fit together to form a coloured dodecahedron.

In preparing to explain this puzzle for my geometry-101 course I
spend a couple of hours working out a possible method to prove that
these are indeed the only three solutions. The method is simple : take
one or two of the bottom pentagons and fill then with mathching
quintominoes, then these more or less fix all the other sides and
usually one quickly runs into a contradiction.
However, along the
way I found one case (see top picture) which seems to be a _new_
quintominal dodecahedron. It can't be one of the three Conway-types
as the central quintomino is of type F. Possibly I did something wrong
(but what?) or there are just more solutions and Conway stopped after
finding the first three of them…
Update (with help from
Michel Van den Bergh
) Here is an elegant way to construct
'new' solutions from existing ones, take a permutation $\\sigma
\\in S_5$ permuting the five colours and look on the resulting colored
dodecahedron (which again is a solution) for the (new) face of type A
and project from it to get a new diagram. Probably the correct statement
of the quintominal-dodecahedron-problem is : find all solutions up to
symmetries of the dodecahedron _and_ permutations of the colours.
Likely, the 3 Conway solutions represent the different orbits under this
larger group action. Remains the problem : to which orbit belongs the
top picture??

Leave a Comment