On No and On

This entry is part 1 of 1 in the series Ordinals and algebraic closures

Finite fields might seem to be easy to understand, but they are definitely not. Some examples of our limited knowledge are:

  • We represent the field $\mathbb{F}_{p^n}$ by $\mathbb{F}_p[x]/(f(x))$ whith $f(x)$ a monic irreducible polynomial of degree $n$. The polynomial $f$ is not unique, and there is no best option.
  • We can’t extend $\mathbb{F}_{p^n}$ to $\mathbb{F}_{p^{n+1}}$ with compatible addition and multiplication.
  • Simple problems like placing knights at a table are too difficult.
  • We know what the algebraic closure of a finite field is, but how can we do calculations in such an exotic thing?

Conway polynomials are a good example of the danger of solving these problems.

Therefore a better description of finite fields is necessary. For fields with characteristic two there is a good candidate using ordinal numbers with nim-addition and nim-multiplication. In this series I will work out this example. Let’s start by defining numbers.

Numbers

In ONAG, Conway defines (surreal) numbers as follows:

Definition. If $L$, $R$ are any two sets of numbers, and no member of $L$ is $\geq$ any member of $R$, then there is a number $\{L \vert R\}$. All numbers are constructed in this way.

The last sentence is somewhat informal. It means there is no sequence of numbers $x_i = \{L_i \vert R_i\}$ with $x_{i+1} \in L_i \cup R_i$ for all $i \in \mathbb{N}$.

Notation. If $x = \{L \vert R\}$ we write $x^L$ and $x^R$ for the typical member of $L$ resp. $R$. For $x$ itself we then write $\{x^L \vert x^R\}$.

Note that all the definitions are inductive, and don’t need a basis because they start with the empty set. Each element of the empty set has all desired properties because the empty set has no members. This allows us to make a lot of proofs very short. If we can proof that for a property $P$, $P(x)$ is implied by $P(x^L)$ and $P(x^R)$, then $P$ must be true for all numbers. Otherwise, there would be a number $x$ for which $P(x)$ is false. Hence, there is a $x^L$ or $x^R$ for which $P(x^\bullet)$ is false. We can go on like this, but since that would create an infinite descending sequence of numbers, $P(x)$ has to be true.

The relations on numbers are defined as:

  • $x \leq y$ iff $x < y^R$ and $x^L < y$
  • $x \geq y$ iff $x > y^L$ and $x^R > y$
  • $x = y$ iff $x \leq y$ and $x \geq y$

This is a total order. A remarkable property is that $x^L < x < x^R$ for all numbers $x$. We now define an addition and multiplication. We know that $x + y$ must lie between both $x^L + y$ and $x + y^L$ (on the left) and $x^R + y$ and $x + y^R$ (on the right). From $x – x^L > 0$ and $y – y^L > 0$ we can deduce $(x – x^L)(y – y^L) > 0$, so that we must have $xy > x^Ly + xy^L – x^Ly^L$. This motivates following definition:

  • $x + y = \{x^L + y, x + y^L \vert x^R + y, x + y^R \}$
  • $xy = \{ x^Ly + xy^L – x^Ly^L, x^Ry + xy^R – x^Ry^R \vert x^Ly + xy^R – x^Ly^R, x^Ry + xy^L – x^Ry^L \}$

With this addition and multiplication, the Class No of all surreal numbers forms a Field, but not a field (because No is not a set).

Examples of numbers

According to the definition, every number is constructed as two sets of earlier constructed numbers. The only way to get it off the ground is by using empty sets. We call $\{ \vert \}$ the number $0$, born on the zeroth day.

Starting from $0$, the next generation of numbers can be constructed. We obtain $1 = \{ 0 \vert \}$ and $-1 = \{ \vert 0 \}$. It is easy to verify that $\{ 0 \vert 0 \}$ is not a number. We have $-1 < 0 < 1$. This was the first day.

The number $\{ 0 \vert 1 \}$ lies somewhere between $0$ and $1$. We call this number $\frac{1}{2}$. What about $\{ -1, 0 \vert 1 \}$? We can verify the inequalities $\{ -1, 0 \vert 1 \} \leq \{ 0 \vert 1 \}$ and $\{ -1, 0 \vert 1 \} \geq \{ 0 \vert 1 \}$, so we have two expressions for the same number. They are equal, but not identical.

We can go on like this with $\frac{1}{4} = \{ 0 \vert \frac{1}{2} \}$ and $\frac{3}{4} = \{ \frac{1}{2} \vert 1 \}$. The whole number $n$ is born on day $n$ as $\{ n-1 \vert 0 \}$. All dyadic rationals and whole numbers are born on finite days. On day $\omega$, $L$ and $R$ can be infinite sets. Examples are:

  • $\frac{1}{3} = \{ \frac{1}{4}, \frac{1}{4} + \frac{1}{16}, \frac{1}{4} + \frac{1}{16} + \frac{1}{64}, \ldots \vert \frac{1}{2}, \frac{1}{2} – \frac{1}{8}, \ldots \}$
  • $\omega = \{ 0, 1, 2, 3, \ldots \vert \}$
  • $\frac{1}{\omega} = \{ 0 \vert 1, \frac{1}{2}, \frac{1}{4}, \frac{1}{8}, \ldots \}$

On day $\omega + 1$ it’s starting to get a little strange. The number $x = \{ 0, 1, 2, 3, \ldots \vert \omega \}$ satisfies $n < x < \omega$ for all finite integers $n$, and $x = \omega – 1$.

Subsets

The surreal numbers are the largest possible totally ordered field. The rationals, the reals, the ordinals and all other ordered fields are subsets of No. An interesting subclass of No is On, the class of all ordinal numbers.

Definition. $\alpha$ is an ordinal number if $\alpha$ has an expression of the form $\alpha = \{L\vert \}$.

No is a proper Class (not a set), but for every ordinal $x$ the subclass $\{ a : a < x \}$ is a set. Because $\alpha = \{ \beta : \beta < \alpha \vert \}$, we can treat $\alpha$ as the set of all lesser ordinals.

Aliens and reality

This entry is part 1 of 1 in the series Diary of a seminar

October 21st : Dear Diary,

today’s seminar was fun, though a bit unconventional. My goal was to explain faithfully flat descent, but at the last moment i had this urge to let students discover the main idea themselves (in the easiest of examples) by means of a thought experiment :

“I am an alien (laughter…), and a very stubborn alien at that. There’s just one field, the complex numbers $\mathbb{C}$, and all rings are $\mathbb{C}$-algebras. I’ve heard strange rumours that you humans believe in a geometry ‘hidden under $\mathbb{C}$’, something called real manifolds. What then is an algebra over this obviously virtual ‘real’ field?”

Their first hurdle was to convey the concept of complex conjugation as the alien(me) was unwilling to decompose a complex number $c$ into two ‘ghost components’ $a+bi$. Still i had to concede that i knew about addition and multiplication, i had a $1$ and a square root of $-1$, which for some reason they preferred to call $i$.

‘Oh, but then you know about $\mathbb{Z}[i]$! You just add a number of times $1$’s with $i$’s.’

‘Why are you humans so obsessed with counting? We do not count! We can’t! We have neither fingers nor toes!’

Admittedly a fairly drastic intervention, but i had to keep them on the path leading to Galois descent… After a while we agreed on a map (they called it conjugation) sending sums to sums, products to products and taking a root of unity to its inverse.

Next, they asked me to be a bit flexible and allow for ‘generalized’ fields such as the one consisting of all elements fixed under conjugation! Clearly, the alien refused : ‘We’re not going on that slippery road called generalization, we’ve seen the havock caused by it in human-mathematics.’

It took them a while to realize they would never be able to sell me an $\mathbb{R}$-algebra $A$, but perhaps they could try to sell me the complex algebra $B= A \otimes_{\mathbb{R}} \mathbb{C}$?

Alien : ‘But, how do i recognize one of your algebras among mine? Is there a test to detect them?’

Humans : ‘Yes, they have a map (which we know to be the map $a \otimes c \mapsto a \otimes \overline{c}$, but you cannot see it) sending sums to sums, products to products that extends the conjugation on $\mathbb{C}$.’

Alien : ‘But if i take a basis for any of my algebras and apply conjugation to all its coordinates, then surely all my algebras have this property, not?’

Humans : ‘No, such maps are good for sums, but not always for products. For example, take $\mathbb{C}[x]/(x^2-c)$ for $c$ a complex-number not fixed under conjugation.’

Alien : ‘Point taken. But then, your algebras are just a subclass of my algebras, right?’

Humans : ‘No! An algebra can have several of such additional maps. For example, take $B = \mathbb{C} \times \mathbb{C}$ then there is one sending $(a,b)$ to $(\overline{a},\overline{b})$ and another sending it to $(\overline{b},\overline{a})$. (because we know there are two distinct real algebras $\mathbb{R} \times \mathbb{R}$ and $\mathbb{C}$ of dimension two, tensoring both to $\mathbb{C} \times \mathbb{C}$.)’

By now, the alien and humans agreed on a dictionary : what to humans is the $\mathbb{R}$-algebra $A$ is to the alien the complex algebra $B=A \otimes \mathbb{C}$ together with a map $\gamma_B : B \rightarrow B$ sending sums to sums, products to products and extending conjugation on $\mathbb{C}$ (this extra structure, the map $\gamma_B$, is called the ‘descent data’).

A human-observed $\mathbb{R}$-algebra morphism $\phi : A \rightarrow A’$ is to the alien the $\mathbb{C}$-algebra morphism $\Phi = \phi \otimes id_{\mathbb{C}} : B \rightarrow B’$ which commutes with the extra structures, that is, $\Phi \circ \gamma_B = \gamma_{B’} \circ \Phi$.

Phrased differently (the alien didn’t want to hear any of this) : there is an equivalence of categories between the category $\mathbb{R}-\mathsf{algebras}$ of commutative $\mathbb{R}$-algebras and the category $\gamma-\mathsf{algebras}$ consisting of complex commutative algebras $B$ together with a ringmorphism $\gamma_B$ extending complex conjugation and with morphisms $\mathbb{C}$-algebra morphisms compatible with the $\gamma$-structure.

Further, what to humans is the base-extension (or tensor) functor

$- \otimes_{\mathbb{R}} \mathbb{C}~:~\mathbb{R}-\mathsf{algebras} \rightarrow \mathbb{C}-\mathsf{algebras}$

is (modulo the above equivalence) to the alien merely the forgetful functor

$\mathsf{Forget}~:~\gamma-\mathsf{algebras} \rightarrow \mathbb{C}-\mathsf{algebras}$

stripping off the descent-data.

After the break (yes, it took us that long to get here) we used this idea to properly define obviously non-existing rings living ‘under $\mathbb{Z}$’, or if you like silly terminology, algebras over the field with one element $\mathbb{F}_1$.

Alien : ‘Ha-ha-ha, a field with one element? Surely you’re joking Mr. Human’

Note to self : Dare to waste time like this in a seminar.

Russian dense delight

This entry is part 2 of 2 in the series Chebotarëv density

Remember we ended the last post with a question: is it possible to associate with a prime $p$ not dividing $\Delta(f)$, an element $\sigma_{p} \in G$ such that the decomposition type of $f \ \mathsf{mod} \ p$ is the same as the cycle type of $\sigma_{p}$. I told you this could be done up to conjugacy, which I’ll now explain. The element $\sigma_{p}$ will be called the Frobenius substitution of $p$.

Galois theory for finite fields

The Frobenius, as an element of $Aut(\overline{\mathbb{F}}_{p})$, permutes the zeros of any polynomial with coefficients in $\mathbb{F}_{p}$. For such a polynomial $g$, the cycle pattern of the Frobenius, as a permution of the zeros of $g$, is the same as the decomposition type of $g$ over $\mathbb{F}_{p}$. To see this, it’s sufficient to suppose $g$ irreducible, of degree $n$ say. Then you know there is a root $\alpha \in \mathbb{F}_{p^{n}}$, and that the other roots are $\alpha^{p}, \alpha^{p^{2}},…,\alpha^{p^{n-1}}$. The Frobenius obviously acts on $g$ as the permutation $(12…n)$, and since $g$ is irreducible, its decomposition type is also $n$. Returning to the situation at hand, the statement we have just proven closely resembles the one in the introduction. To lift the Frobenius to a Frobenius substitution, which will be an element of $Aut(\mathbb{Q}(\alpha_{1},…,\alpha_{d}))$, we’ll need to connect the fields they’re acting on. Notice that this means we want a way to reduce elements of $\mathbb{Q}(\alpha_{1},…,\alpha_{d})$ modulo $p$. This is exactly what the notion of a place will do for us.

All over the place

A place of $\mathbb{Q}(\alpha_{1},…,\alpha_{d})$ over $p$ is a map $\psi:\mathbb{Q}(\alpha_{1},…,\alpha_{d}) \to \overline{\mathbb{F}}_{p}
\cup \{ \infty \}$, with the following properties:

  1. $\psi^{-1} \overline{\mathbb{F}}_{p}$ is a subring of $\mathbb{Q}(\alpha_{1},…,\alpha_{d})$, and $\psi:\psi^{-1} \overline{\mathbb{F}}_{p} \to \overline{\mathbb{F}}_{p}$ is a ring morphism
  2. $\psi(x)=\infty$ iff $\psi(x^{-1})=0$, for an $x \in \mathbb{Q}(\alpha_{1},…,\alpha_{d})-\{0\}$

This is a concept frequently used in algebraic number theory, albeit in a different context. To motivate the definition a little, think about this as an extension of the classic reduction mod $p$. Since $p \equiv 0 \ \mathsf{mod} \ p$, it’s only natural to introduce $\infty$, since we would like $1/p \equiv 1/0 \equiv \infty$. Taking the polynomial $f$, and one of its roots $\alpha_{1}$, $\psi(f(\alpha_{1}))=0$. Since we would like a ring morphism, this would imply $$\sum_{i=0}^{d} \ \overline{a_{i}} \ \psi(\alpha_{1})^{i}=0,$$ with $f=\sum_{i=0}^{d} \ a_{i}X^{i}$, and $a_{i} \in \mathbb{Z}$. This shows why the codomain has to contain $\overline{\mathbb{F}}_{p}$.

Frobenius substitution

The places we have introduced have three important properties:

  1. a place of $\mathbb{Q}(\alpha_{1},…,\alpha_{d})$ over $p$ exists, for every prime $p$
  2. if $\psi$ and $\psi’$ are two places over $p$, then there is a $\tau \in G$ such that $\psi’=\psi \circ \tau$
  3. if $p \nmid \Delta(f)$, then $\tau$ is unique

Taking a $p \nmid \Delta(f)$, and $\psi$ a place of $K$ over $p$, the map $\psi’=Frob \circ \psi$ is again a place, since $Frob$ is an $\overline{\mathbb{F}}_{p}$-automorphism. If we apply property $2$ to $\psi$ and $\psi’$, one finds a unique element $Frob_{\psi}$ in $G$ such that $\psi \circ Frob_{\psi} = Frob \circ \psi$. This element is going to be our Frobenius substitution. The end of the last paragraph showed us that the $\psi(\alpha_{i})$ are the zeros of $f \ \mathsf{mod} \ p$ in $\overline{\mathbb{F}}_{p}$, and the characterizing property of $Frob_{\psi}$ tells us that it permutes $\alpha_{1},…,\alpha_{d}$ in exactly the same way as $Frob$ permutes $\psi(\alpha_{1}),…,\psi(\alpha_{d})$. This means that the cycle pattern of $Frob_{\psi}$ is equal to the decomposition type of $f \ \mathsf{mod} \ p$.

There’s no reason why $Frob_{\psi}$ shouldn’t depend on the choice of place $\psi$. Taking $\eta$ to be another place over $p$, we know by property $2$ that $\eta=\psi \circ \tau$, and thus $$\psi \circ \tau \circ Frob_{\psi \circ \tau}=Frob \circ \psi \circ \tau=\psi \circ Frob_{\psi} \circ \tau.$$ Taking $Frob_{\psi \circ \tau}$ equal to $\tau^{-1} \circ Frob_{\psi} \circ \tau$ does the trick, and by property $3$, it’s unique. This means that $Frob_{\psi}$ ranges over a conjugacy class as $\psi$ varies over all the places over $p$. We’ll denote a typical element of this conjugacy class by $\sigma_{p}$.

Chebotarëv density

All of this allows for the formulation of the announced theorem

Theorem. Let $f$ be a monic polynomial with integer coefficients and nonzero discriminant $\Delta(f)$. Let $C$ be a conjugacy class of the Galois group of $f$. Denote by $S$ the following set, $$S=\{ p \ \vert \ p \ prime, \ p \nmid \Delta(f), \ \sigma_{p} \in C \}.$$ Then $S$ has a density, which is equal to $\vert C \vert / \vert G \vert$.

Let’s see how exactly this generalizes our previous two theorems. First off, Dirichlet. The only thing we have to do in this case, is pick $f$ to be equal to $X^{m}-1$. Since the Galois group is abelian, the conjugacy classes are the elements, so choose $a \in G \cong (\mathbb{Z}/m\mathbb{Z})^{*}$, and thus $a$ coprime with $m$. Now what is the unique element $\sigma_{p}$? For $\psi$ a place over $p$, we know that $\psi(\sigma_{p}(x))=\psi(x)^{p}$, for all $x \in \mathbb{Q}(\zeta)$. Picking $x$ to be $\zeta$, and knowing that $\sigma_{p}(\zeta)=\zeta^{a}$ (this is how you identify $G$ with $(\mathbb{Z}/m\mathbb{Z})^{*}$), we get that $\psi(\zeta)^{a}=\psi(\zeta)^{p}$. Since $\psi(\zeta)$ is a primitive $m$-th root of unity, one has $a \equiv p$ mod $m$, and Dirichlet pops out.

The way it generalizes Frobenius is slightly trickier, since it needs a reformulation of Frobenius employing divisions of $G$. A division is sort of a conjugacy up to a power. Given an element $g \in G$ of order $m$, the division of $g$ consists of all elements that are conjugate to any $g^{n}$, as long as $n$ and $m$ are coprime. Obviously, a conjugacy class is part of a division. The converse isn’t necessarily true; two element can belong to the same division without being conjugated. A simple abelian example is given by the elements $3$ mod $10$ and $7$ mod $10$, which aren’t equal in $\mathbb{Z}/10\mathbb{Z}$, and thus not conjugated, but $7^{3}=3$, so they’re in the same division. The alternative statement of Frobenius density then says exactly what Chebotarëv density says, with ‘conjugacy class’ replaced by ‘division’. Often, Chebotarëv can distinguish between primes that get stuck together with Frobenius.

Application

I just can’t let you go without a small, beautiful, and rather mysterious application of Chebotarëv. The statement is this:

Corollary. If $f \in \mathbb{Z}[X]$ is an irreducible polynomial that has a $0$ modulo almost all primes, then $f$ is linear.

Proof. Assume that $deg(f)>1$. Since the Galois group of $f$ acts transitively on the roots $\Omega$, and for almost all primes $p$, $f \ \mathsf{mod} \ p$ has a zero in $\mathbb{F}_{p}$, almost all Frobenius substitutions fix a root of $f$. Taking $S$ to be the set of all $g \in G$ that fix at least one element of $\Omega$, we see that $$S=\bigcup_{\omega \in \Omega} Stab(\omega)=\bigcup_{g \in G} g \ Stab(x) \ g^{-1},$$ with $x$ a fixed element of $\Omega$. The first equality is trivial; the second one as well, if you remember to use transitivity. Since no finite group is the union of conjugates of a proper subgroup, $G$ has to contain elements that don’t fix a root of $f$. These elements can be the Frobenius subsitution of only finitely many primes, which is impossible by Chebotarëv, which says there should always should be a density, and we know a finite set has density $0$. $\square$

Of course, one would also like a completely algebraic proof of the theorem, not requiring a big cannon like Chebotarëv (the proof of which uses lots of L-functions and complex analysis). The surprising thing is that the only known algebraic proofs make use of none other than the classification of finite simple groups!

Let me just provide you with the glue that relates $\mathbb{F}_{1}$-geometry to recreational number theory (my state of mind upon writing the first post seems not to have been overly optimistic):

Recreational number theory is that branch of number theory which is too difficult for serious study.

By now I’m sure you can guess who it was that uttered this phrase.

About Theo Raedschelders

dabbling in geometry, algebra and physics in and around Brussels and Antwerp

More Posts (7)