← All Posts 📖 The Human DeveloperEarly access → what makes developers irreplaceable in the age of AI

The Chain That Forces Arithmetic

From {0, 1} to ℂ: every number system you use is the unique minimal solution to an obstruction in the one before it

Reading time: ~20 minutes

You can reconstruct the entire number system — integers, rationals, reals, complex numbers — from two elements and a partial operation. Not as an exercise in set-theoretic foundations. As a forced march: each structure has an obstruction, the obstruction has a universal resolution, and the resolution is the next structure in the chain.

I find this framing more revealing than any textbook treatment I've encountered. The individual pieces are standard — you've seen Grothendieck groups, you've proved the fundamental theorem of Galois theory, you know what a localisation is. The point is what happens when you line them up as a single sequence of forced moves and ask: where does the symmetry live?

The answer is the structural punchline of this post. The algebraic closure step is where symmetry explodes. Every other step in the chain is essentially unique. And the Artin-Schreier theorem tells you why the chain stops.

A personal note. While writing my book — which traces the lineage of software craft back through the mathematicians who made it possible — I found myself revisiting pure mathematics for the first time in anger since my university days — particularly the algebraic and topological foundations I hadn't touched in over twenty years. After writing the previous post on how your CPU does math, I tried to recall whether I'd ever seen anyone start from a genuine atom of arithmetic — two elements and a partial operation — and build the entire number line up to $\mathbb{C}$ as a single forced sequence. I couldn't recall it being done this way. So I tried it myself. What followed was one of the most enjoyable detours of my career: relearning much of what I'd forgotten, and a reconstruction that touched Grothendieck groups, Galois theory, Artin-Schreier, completions, and K-theory. This post is the result.

The primitive system

Start with the minimal arithmetic $\mathcal{A}_0 = (\{0, 1\},\; +,\; -)$, where $+$ and $-$ are partial binary operations. Not "partial" in a hand-wavy sense. Partial as in: some entries in the operation table are undefined. I'll write $\bot$ for these — borrowed from domain theory, where it denotes the "bottom" element of a partial order, the value a computation takes when it doesn't terminate. Here it means something simpler: the operation has no output. The symbol earns its place over a blank cell because these holes are load-bearing — the entire reconstruction is driven by the desire to fill them.

Addition (partial):

$+$ $0$ $1$
$0$ $0$ $1$
$1$ $1$ $\bot$

Subtraction (partial):

$-$ $0$ $1$
$0$ $0$ $\bot$
$1$ $1$ $0$

Two obstructions stare out of these tables:

The axioms are minimal — only what the tables already witness:

I want to stress what is not assumed. Associativity is not assumed — there aren't enough elements to test it. It will be proved once the set grows. Closure is not assumed — it will be forced. The question is: starting from this and nothing else, how far does the chain of forced constructions reach?

Further than you'd expect. We will stop at $\mathbb{C}$, and the reason we stop there is itself a theorem.

Constructing ℕ

The first obstruction is $1 + 1 = \bot$. To resolve it, we need an element to serve as the result. Call it $2$. But now $2 + 1$ is undefined, so we need $3$. And $3 + 1$ demands $4$. The pattern is clear: closing $\{0, 1\}$ under addition forces an infinite sequence.

Make this precise. Define the successor:

$$S(n) := n + 1$$

Seed: $0$ and $1$ are given. $S(0) = 1$ is already in the set.

Induction step: if $n$ is in the set, then $S(n) = n + 1$ must be in the set, because closure under $+$ demands it.

The result is the set generated by applying $S$ repeatedly starting from $0$:

$$0, \quad S(0) = 1, \quad S(1) = 2, \quad S(2) = 3, \quad \ldots$$

Every element has a unique representation as an iterated successor of $0$:

$$n = \underbrace{1 + 1 + \cdots + 1}_{n}$$

This is $\mathbb{N}$. It is the closure of $\{0, 1\}$ under $+$, and nothing more — the smallest set that contains $0$ and is closed under successor.

The structure $(\mathbb{N}, +, 0)$ is a commutative monoid: addition is associative, $0$ is the identity, and $a + b = b + a$. It is generated by a single element — $1$ — in the sense that every natural number is a finite sum of copies of $1$.

It is also free. This is the important word. Free means: the only equalities that hold among sums of $1$'s are the ones forced by the monoid axioms (associativity, commutativity, identity). There are no extra relations. In particular, no two distinct sums of $1$'s ever produce the same element — $1 + 1 + 1 \neq 1 + 1$, always. Contrast this with $\mathbb{Z}/5\mathbb{Z}$, which is also a commutative monoid generated by $1$, but where $1 + 1 + 1 + 1 + 1 = 0$ — an extra relation, not forced by the axioms, that collapses five copies of the generator back to the identity.

Freeness gives $\mathbb{N}$ its universal property: for any commutative monoid $(M, \cdot, e)$ and any element $m \in M$, there is a unique homomorphism $\varphi : \mathbb{N} \to M$ sending $1 \mapsto m$. The map is forced — $\varphi(n) = \underbrace{m \cdot m \cdots m}_{n}$ — and its uniqueness is what we will use in §2 to define multiplication.

One consequence worth noting: the unique-representation property (every element is $n \cdot 1$ for exactly one $n$) implies that $\mathbb{N}$ has no zero divisors under addition. If $a + b = 0$, then $a = b = 0$, because the only way to represent $0$ is as the empty sum. This will not survive the passage to $\mathbb{Z}$.

The Peano structure $(\mathbb{N}, 0, S)$ satisfies the standard axioms: $0 \in \mathbb{N}$, $S$ is total and injective, $0 \notin \text{im}(S)$, and the induction axiom holds. But the induction axiom deserves a more careful statement than the one in most textbooks.

$\mathbb{N}$ is the initial object in the category of sets equipped with a distinguished element and an endomorphism. For any $(X, x_0, f)$, there is a unique map $h : \mathbb{N} \to X$ with $h(0) = x_0$ and $h \circ S = f \circ h$. Induction is the assertion that $\mathbb{N}$ contains no proper sub-object — the canonical map from the free construction is surjective. This is the content of initiality, and it's the reason induction works: $\mathbb{N}$ is the smallest thing satisfying P1–P4, not merely a thing satisfying them.

First obstruction resolved. On to the second.

Multiplication as iterated addition

With $(\mathbb{N}, +, 0)$ in hand, define multiplication by recursion:

$$ m \times n := \begin{cases} 0 & \text{if } n = 0 \\ (m \times (n-1)) + m & \text{if } n = S(k) \end{cases} $$

This is the unique monoid endomorphism $\mu_m : (\mathbb{N}, +, 0) \to (\mathbb{N}, +, 0)$ sending $1 \mapsto m$. Multiplication is literally "the $m$-fold map."

Commutativity is a theorem, not an axiom, and the proof has a satisfying flavour. It reduces to the observation that $\text{End}(\mathbb{N}, +) \cong (\mathbb{N}, \times)$ and that this endomorphism monoid is commutative. Distributivity is immediate from $\mu_m$ being a homomorphism. The result is the semiring $(\mathbb{N}, +, \times)$: two monoidal structures linked by distributivity, but still missing additive inverses and multiplicative inverses.

Constructing ℤ — the Grothendieck group

The obstruction

Subtraction is partial on $\mathbb{N}$. The equation $3 - 5 = \bot$. In categorical language, $(\mathbb{N}, +)$ is a commutative monoid but not a group. We need the group completion.

The construction

Define an equivalence relation on $\mathbb{N} \times \mathbb{N}$:

$$(a, b) \sim (c, d) \iff a + d = c + b$$

The pair $(a, b)$ represents the formal difference $a - b$.

$$\mathbb{Z} := (\mathbb{N} \times \mathbb{N}) / \sim$$

with $[(a, b)] + [(c, d)] := [(a + c, b + d)]$ and $-[(a, b)] := [(b, a)]$.

This is the Grothendieck group $K(\mathbb{N})$. The universal property: for any abelian group $G$ and monoid homomorphism $f : \mathbb{N} \to G$, there is a unique group homomorphism $\tilde{f} : \mathbb{Z} \to G$ extending $f$.

$$ \mathbb{N} \xrightarrow{\;\iota\;} \mathbb{Z} \xrightarrow{\;\exists!\,\tilde{f}\;} G $$

The sign rule is a theorem

Extending multiplication to $\mathbb{Z}$ is forced by requiring distributivity. Define:

$$[(a, b)] \times [(c, d)] := [(ac + bd,\; ad + bc)]$$

And now: $(-1)(-1) = 1$. This is usually taught as a convention — a rule you memorize in middle school. It is not a convention. It is a theorem.

$$(-1) \times (-1) = [(0,1)] \times [(0,1)] = [(0 \cdot 0 + 1 \cdot 1,\; 0 \cdot 1 + 1 \cdot 0)] = [(1, 0)] = 1$$

The sign rule is forced by the requirement that multiplication distribute over the new addition. You don't choose $(-1)(-1) = 1$. You discover it. Suppose $(-1)(-1) = k$. Then $0 = (-1)(0) = (-1)(1 + (-1)) = (-1)(1) + (-1)(-1) = -1 + k$, so $k = 1$. Any other value breaks distributivity, and then multiplication isn't a ring operation. There's no other option.

The result is a commutative ring: we have addition with inverses (that was the point of the Grothendieck construction), we have multiplication that distributes over it (inherited from $\mathbb{N}$, extended by the sign rule), and both operations commute. But $\mathbb{Z}$ is more than a commutative ring — it is an integral domain. That means it has no zero divisors: if $ab = 0$, then $a = 0$ or $b = 0$. This is not a minor technical point. It is precisely the property that makes the next step — constructing $\mathbb{Q}$ by localisation — well-defined. Without it, you cannot safely "divide" because you cannot cancel: $ac = bc$ only implies $a = b$ when $c \neq 0$ and there are no zero divisors to spoil the argument.

Representation-theoretic remark

$(\mathbb{Z}, +)$ is the free abelian group on one generator. A representation $\rho : \mathbb{Z} \to GL(V)$ over a field $k$ is determined by the single invertible operator $T := \rho(1)$, and the group algebra is $k[\mathbb{Z}] \cong k[T, T^{-1}]$ — the ring of Laurent polynomials, which is the coordinate ring of the multiplicative group $\mathbb{G}_m$. The passage $\mathbb{N} \to \mathbb{Z}$ corresponds, on the representation side, to the passage from polynomial rings $k[T]$ to Laurent polynomial rings. In the language of algebraic groups, from the additive monoid scheme to the additive group scheme.

Constructing ℚ — localisation

The obstruction

Division is partial on $\mathbb{Z}$: the equation $3x = 7$ has no solution. The multiplicative monoid $(\mathbb{Z} \setminus \{0\}, \times)$ has no inverses except $\pm 1$.

The construction

$\mathbb{Z}$ is an integral domain, so we form the field of fractions. Let $S = \mathbb{Z} \setminus \{0\}$. On $\mathbb{Z} \times S$, define $(a, b) \sim (c, d) \iff ad = cb$. Then:

$$\mathbb{Q} := (\mathbb{Z} \times S) / \sim = S^{-1}\mathbb{Z}$$

The universal property: for every injective ring homomorphism $f : \mathbb{Z} \hookrightarrow F$ into a field $F$, there exists a unique field homomorphism $\tilde{f} : \mathbb{Q} \hookrightarrow F$ extending $f$.

In the language of algebraic geometry, this localisation has a geometric interpretation that is worth pausing on.

$\text{Spec}(\mathbb{Z})$ — the prime spectrum of $\mathbb{Z}$ — is the space whose points are the prime ideals of $\mathbb{Z}$: one point for each prime $(2), (3), (5), (7), \ldots$ and one additional point, the zero ideal $(0)$. The primes are the "closed points" — you can think of them as the concrete locations, the places where residue fields $\mathbb{F}_p$ live. Each prime $p$ gives you arithmetic modulo $p$.

The zero ideal $(0)$ is different. Its residue field is $\mathbb{Q}$ itself. And $(0)$ has a peculiar topological property: its closure is the entire space. Every open set that contains any prime also contains $(0)$. In the Zariski topology, $(0)$ is dense — it is the generic point, the single point that lies in the closure of every other.

$\mathbb{Q}$ is the "everywhere" of $\text{Spec}(\mathbb{Z})$. A property that holds over $\mathbb{Q}$ (at the generic point) holds "generically" — at all but finitely many primes. Localising $\mathbb{Z}$ to get $\mathbb{Q}$ is, geometrically, the act of zooming out until all the individual primes blur into a single generic landscape. You lose the local arithmetic of each $\mathbb{F}_p$, but you gain a field where every nonzero element is invertible — the price of seeing everything at once.

Representation-theoretic remark

$(\mathbb{Q}, +)$ is a divisible abelian group: for every $q \in \mathbb{Q}$ and $n > 0$, the equation $nx = q$ has a solution. The consequence is striking:

$$\text{Ext}^1_{\mathbb{Z}}(A, \mathbb{Q}) = 0$$

for any abelian group $A$. That is, $\mathbb{Q}$ is injective in the category of abelian groups. So the algebraic closure of subtraction and division doesn't just give us a field — it gives us an injective module, cohomologically trivial. This is the reason $\mathbb{Q}$-vector spaces are so much simpler than $\mathbb{Z}$-modules: every short exact sequence of $\mathbb{Q}$-modules splits.

Exponentiation and the two roads out of ℚ

Define exponentiation by recursion:

$$ a^n := \begin{cases} 1 & \text{if } n = 0 \\ a^{n-1} \times a & \text{if } n = S(k) \end{cases} $$

Here's where the pattern breaks. Addition is commutative and associative. Multiplication is commutative and associative. Exponentiation is neither.

Operation Commutative Associative Inverses in $\mathbb{Q}$?
$a + b$ $\checkmark$ $\checkmark$ $\checkmark$
$a \times b$ $\checkmark$ $\checkmark$ $\checkmark$ (for $a \neq 0$)
$a^b$ $\times$ $\times$ $\times$

$2^3 \neq 3^2$. $(2^3)^2 = 64$ but $2^{(3^2)} = 512$. The symmetry that addition and multiplication enjoyed is gone. And inverting exponentiation forks into two distinct problems:

Two roads. They lead to different places.

The algebraic road

Solving $x^2 = 2$ gives $\sqrt{2} \notin \mathbb{Q}$. Extend to $\mathbb{Q}(\sqrt{2})$, keep going, and eventually reach the algebraic closure $\overline{\mathbb{Q}}$ — the smallest algebraically closed field containing $\mathbb{Q}$. It resolves all polynomial equations. But it is countable and metrically incomplete.

The completion step: a change of kind

$\overline{\mathbb{Q}}$ is algebraically closed but has holes. The Cauchy sequence

$$a_n = \left(1 + \frac{1}{n}\right)^n$$

converges (in $\mathbb{R}$) to $e = 2.71828\ldots$, but $e$ is transcendental — it satisfies no polynomial over $\mathbb{Q}$. The sequence exists in $\overline{\mathbb{Q}}$ (each term is rational), but its limit does not. The same is true for convergent series defining $\pi$, $\ln 2$, and countless others: Cauchy sequences in $\overline{\mathbb{Q}}$ whose limits escape the algebraic world.

The reals $\mathbb{R}$ are the Cauchy completion of $\mathbb{Q}$ — equivalently, the Dedekind completion. This construction fills in holes, but not holes in solvability (algebraic closure handles that). Holes in convergence. The obstruction is no longer "this equation has no solution" but "this sequence has no limit."

This is a genuine change of kind in the reconstruction:

Step Obstruction Method Character
$\{0,1\} \to \mathbb{N}$ $1 + 1$ undefined Closure Algebraic
$\mathbb{N} \to \mathbb{Z}$ $0 - 1$ undefined Group completion Algebraic
$\mathbb{Z} \to \mathbb{Q}$ $1 \div 3$ undefined Localisation Algebraic
$\mathbb{Q} \to \overline{\mathbb{Q}}$ $x^2 = 2$ unsolvable Algebraic closure Algebraic
$\overline{\mathbb{Q}} \to \mathbb{R}$ $(1+1/n)^n$ has no limit Cauchy completion Topological
$\mathbb{R} \to \mathbb{C}$ $x^2 = -1$ unsolvable Adjunction Algebraic

The topological step is the only one that is not algebraic. It cannot be recovered by iterating "adjoin a root." It requires passing from a structure to its metric completion, and the objects it adds — transcendental numbers — are characterised not by polynomial equations but by limiting processes.

A remark on ordering: one could instead complete first ($\mathbb{Q} \to \mathbb{R}$) and then algebraically close ($\mathbb{R} \to \mathbb{C}$). The terminus is the same. But the intermediate objects differ: $\overline{\mathbb{Q}}$ is countable and algebraically closed; $\mathbb{R}$ is uncountable and real-closed. The Galois theory that follows depends on taking the algebraic closure route, since Galois groups measure algebraic ambiguity, not topological structure.

The Galois anomaly

This is the section I care about. Everything above is forced prologue. Here is where the chain reveals its deepest feature.

The hidden ambiguity

Every construction so far has been canonical. The Grothendieck group of $(\mathbb{N}, +)$ is determined up to unique isomorphism. The field of fractions of $\mathbb{Z}$ is determined up to unique isomorphism. There was one way to adjoin additive inverses, one way to adjoin multiplicative inverses. The integer $-3$ is uniquely determined. The fraction $7/3$ is uniquely determined.

The algebraic closure step is fundamentally different.

When I solve $x^2 = 2$ and adjoin $\sqrt{2}$ to $\mathbb{Q}$, I must choose: which root? There are two, $+\sqrt{2}$ and $-\sqrt{2}$, and no algebraic property of $\mathbb{Q}$ distinguishes them. They satisfy the same polynomial, the same field axioms, the same algebraic relations with every element of $\mathbb{Q}$. The only way to tell them apart is to embed them in $\mathbb{R}$ and use the ordering — but the ordering is not algebraic. It's topological.

The automorphism $\sigma : \mathbb{Q}(\sqrt{2}) \to \mathbb{Q}(\sqrt{2})$ swapping $\sqrt{2} \mapsto -\sqrt{2}$ while fixing $\mathbb{Q}$ is the Galois group of this extension:

$$\text{Gal}(\mathbb{Q}(\sqrt{2})/\mathbb{Q}) \cong \mathbb{Z}/2\mathbb{Z}$$

This is the symmetry group of the ambiguity. Not a symmetry we imposed — a symmetry we discovered.

The fundamental theorem in context

For a finite Galois extension $E/F$ with Galois group $G = \text{Gal}(E/F)$, the fundamental theorem establishes an order-reversing bijection:

$$\{\text{subgroups } H \leq G\} \;\longleftrightarrow\; \{\text{intermediate fields } F \subseteq K \subseteq E\}$$

$$H \longmapsto E^H := \{x \in E \mid \sigma(x) = x \;\forall\, \sigma \in H\}$$

You know this theorem. You've proved it. But see it in this context: the lattice of obstructions (which polynomials still lack roots) corresponds to the lattice of symmetries (which automorphisms survive). Resolving an obstruction breaks a symmetry, and vice versa. The fundamental theorem is, in this framing, a precise accounting of how much ambiguity remains at each stage of obstruction resolution.

The tower

Starting from $\mathbb{Q}$, resolve obstructions one at a time:

$$x^2 - 2 = 0 \;\longrightarrow\; \mathbb{Q}(\sqrt{2})$$

$$x^2 + 1 = 0 \;\longrightarrow\; \mathbb{Q}(\sqrt{2}, i)$$

The full extension $\mathbb{Q}(\sqrt{2}, i)/\mathbb{Q}$ has degree 4. Its Galois group is:

$$\text{Gal}(\mathbb{Q}(\sqrt{2}, i)/\mathbb{Q}) \cong \mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/2\mathbb{Z}$$

generated by $\sigma : \sqrt{2} \mapsto -\sqrt{2}$ and $\tau : i \mapsto -i$. The subgroup lattice gives four intermediate fields: $\mathbb{Q}(\sqrt{2})$, $\mathbb{Q}(i)$, $\mathbb{Q}(i\sqrt{2})$. Each one represents a partial resolution — some obstructions resolved, some symmetries broken, others intact.

The absolute Galois group

The algebraic closure $\overline{\mathbb{Q}}$ is the union of all finite extensions. The corresponding symmetry group is the absolute Galois group:

$$G_{\mathbb{Q}} := \text{Gal}(\overline{\mathbb{Q}}/\mathbb{Q}) = \varprojlim \text{Gal}(E/\mathbb{Q})$$

where the inverse limit runs over all finite Galois extensions $E/\mathbb{Q}$. This is a profinite group — uncountable, compact, and profoundly mysterious. Understanding its structure is one of the deepest open problems in mathematics. We know fragments: its abelianisation is described by class field theory, its representations over $\mathbb{Q}_\ell$ are the central objects of the Langlands programme, its action on étale cohomology groups of varieties encodes arithmetic information that remains largely inaccessible.

The representation-theoretic connection

I said earlier that the representation-theoretic remarks were worth keeping. Here is where they converge.

A continuous homomorphism $\rho : G_{\mathbb{Q}} \to GL_n(\mathbb{Q}_\ell)$ is an $\ell$-adic Galois representation. The Langlands programme conjectures that such representations correspond to automorphic forms — a vast generalisation of the relationship between quadratic reciprocity and Dirichlet characters. Fermat's Last Theorem was proved (Wiles, 1995) by establishing a specific case of this correspondence: the modularity of elliptic curves over $\mathbb{Q}$, which amounts to showing that a certain 2-dimensional Galois representation is automorphic.

The representation theory of $G_{\mathbb{Q}}$ — the symmetry group of how algebraic obstructions are resolved — connects our minimal two-element arithmetic directly to the frontier of modern number theory. I find this the most striking fact in the entire chain: the structure that was forced into existence by demanding that $1 + 1$ have a value carries, in its symmetries, enough information to encode Fermat's Last Theorem.

The anomaly in the pattern

Here is the pattern laid bare:

Step Symmetry of resolution Group
$\mathbb{N} \to \mathbb{Z}$ None — inverses are unique Trivial
$\mathbb{Z} \to \mathbb{Q}$ None — fractions are unique Trivial
$\mathbb{Q} \to \overline{\mathbb{Q}}$ Vast — roots are ambiguous $G_{\mathbb{Q}}$ (profinite, uncountable)
$\mathbb{R} \to \mathbb{C}$ Conjugation only $\mathbb{Z}/2\mathbb{Z}$

The algebraic closure step is where symmetry explodes. Every other step in the chain is essentially determined; this one carries an enormous hidden structure. And the final step $\mathbb{R} \to \mathbb{C}$ collapses that symmetry back to a single involution — complex conjugation — because $\mathbb{R}$ is already so large (uncountable, complete) that there is almost no room for ambiguity.

Why the chain terminates

The Artin-Schreier theorem provides the deepest explanation for why the chain stops at $\mathbb{C}$. To me, it is the single most remarkable result in this entire story.

Theorem (Artin-Schreier). If $F$ is a field and $\overline{F}/F$ is a finite extension of degree $> 1$, then $\text{char}(F) = 0$, $[\overline{F} : F] = 2$, and $F$ is a real closed field.

Read that again. The only way for a field to be "one step away" from algebraic closure is to be essentially $\mathbb{R}$ — an ordered field where every positive element has a square root and every odd-degree polynomial has a root — with the missing step being the adjunction of $\sqrt{-1}$. There is no field that is "two steps" from algebraic closure. The moment you start resolving algebraic obstructions, either you have infinitely many to go (like $\mathbb{Q}$) or exactly one (like $\mathbb{R}$).

This is why $\mathbb{C}$ is the terminus. Not because we ran out of obstructions to resolve by accident. Because the Artin-Schreier theorem forbids any intermediate state between "infinitely far" and "one step away."

The full picture

The summary:

Step Construction Obstruction What's lost
$\{0,1\} \to \mathbb{N}$ Free monoid Closure under $+$ Nothing
$\mathbb{N} \to \mathbb{Z}$ Group completion Additive inverses $\mathbb{N}$ is not a group
$\mathbb{Z} \to \mathbb{Q}$ Localisation Multiplicative inverses $\mathbb{Z}$ is not a field
$\mathbb{Q} \to \overline{\mathbb{Q}}$ Algebraic closure Polynomial roots Unique ordering
$\overline{\mathbb{Q}} \to \mathbb{R}$ Cauchy completion Limits exist Algebraic closure
$\mathbb{R} \to \mathbb{C}$ $\mathbb{R}[x]/(x^2+1)$ $x^2 = -1$ Ordering

Each arrow is a left adjoint or a completion functor. Each construction is the universal (smallest, most efficient) solution to the given obstruction. This is the categorical moral:

$$\text{Free} \dashv \text{Forget}$$

at each level. The forgetful functor drops structure; the free functor — group completion, localisation, algebraic closure — freely adds exactly what's missing and nothing more.

Ostrowski's theorem seals the termination: the only complete archimedean valued fields are $\mathbb{R}$ and $\mathbb{C}$. The chain has nowhere left to go.

What about the quaternions?

The natural objection: "You adjoined $\sqrt{-1}$ to $\mathbb{R}$ and got $\mathbb{C}$. What if I adjoin another square root? Or two more?" Hamilton tried exactly this in 1843 and produced the quaternions $\mathbb{H}$ — a four-dimensional algebra over $\mathbb{R}$ with basis $\{1, i, j, k\}$ satisfying $i^2 = j^2 = k^2 = ijk = -1$.

The quaternions are useful. They encode rotations in three dimensions. Every 3D game engine uses them. But $\mathbb{H}$ is not a field, and it can never be made into one — because multiplication is not commutative. $ij = k$ but $ji = -k$. The moment you go beyond $\mathbb{C}$, you lose commutativity, and without commutativity you don't have a field. You have a division ring — every nonzero element has an inverse, but $ab \neq ba$.

You can push further. The octonions $\mathbb{O}$ are eight-dimensional over $\mathbb{R}$. They lose not only commutativity but associativity: $(ab)c \neq a(bc)$. After that, the sedenions lose the division property entirely — zero divisors appear, and you can't even cancel.

Frobenius's theorem makes this precise: the only finite-dimensional associative division algebras over $\mathbb{R}$ are $\mathbb{R}$, $\mathbb{C}$, and $\mathbb{H}$. If you want a field (commutative and associative), you stop at $\mathbb{C}$. If you'll tolerate non-commutativity, you get one more: $\mathbb{H}$. After that, each doubling (Cayley-Dickson construction) forfeits another algebraic property, and the structure degrades irreversibly.

The chain we built — $\{0,1\} \to \mathbb{N} \to \mathbb{Z} \to \mathbb{Q} \to \overline{\mathbb{Q}} \to \mathbb{R} \to \mathbb{C}$ — is the unique path that preserves every field axiom at every step. The quaternions are what happens when you try to keep climbing after the staircase has ended.

A remark from K-theory

The Grothendieck construction $\mathbb{N} \to \mathbb{Z}$ is the prototype for algebraic K-theory. The group $K_0(R)$ of a ring $R$ is formed by the same procedure applied to the monoid of isomorphism classes of finitely generated projective $R$-modules under direct sum:

$$K_0(R) = \text{Groth}(\text{Proj}(R), \oplus)$$

The passage from "what we can add" to "what we can subtract" — the very first non-trivial step in our reconstruction — is the conceptual seed of one of the deepest invariants in modern algebra and topology. The Grothendieck group is not a pedagogical simplification of K-theory. K-theory is the Grothendieck group taken seriously.

The computational shadow

The algebraic chain you've just seen has an operational shadow. Every construction — the group completion, the localisation, the recursive definitions of multiplication and exponentiation — compiles down to sequences of additions. The algorithms that implement this reduction, and the hardware that runs them, are the subject of the previous post.

I'm writing a book about what makes developers irreplaceable in the age of AI. Join the early access list →

Naz Quadri once tried to explain the Grothendieck group to a bartender and got as far as "imagine you have three beers but you owe someone five" before realising he'd just described a tab. He blogs at nazquadri.com. Rabbit holes all the way down 🐇🕳️.

Further Reading