The Gate of Numbers: Foundations of the Real Line and the Architecture of Cardinals

Chapter 1: The Gate of Numbers

The Wanderer at the Threshold

The Cartesian Wanderer—having departed the village of Mere Assertion and crossed the Bridge of Definitions—arrives at dusk before a structure that has no analog in the inhabited world. The Gate of Numbers rises as a triple archway hewn from a stone that is neither marble nor granite, but something with the density of pure idea. Above the central arch, an inscription in a script older than civilization announces the condition of passage: *From nothing, construct everything; from the finite, reach the infinite; from the countable, escape to the uncountable.* A figure materializes beside the gate—neither human nor beast, but geometric, with the stillness of a theorem. This is the Warden of Cardinals, and the Warden does not yield to those who would merely *describe* the real numbers. The Warden demands that the Wanderer *build* them, in plain sight, from the axioms of set theory, and that the Wanderer demonstrate, in addition, an understanding of the cardinality of the continuum and of the strange metaphysical apparatus—choice, well-ordering, Zorn's lemma—that accompanies any serious passage into infinity. The Wanderer accepts the challenge, and so the expedition begins not with theorems about numbers, but with the construction of numbers themselves.

This chapter is the foundation of the entire expedition. Every subsequent chapter—from the topology of metric spaces to the algebra of field extensions to the analysis of function spaces—depends upon the precise formal objects we are about to build. Without the natural numbers there is no induction; without the integers there is no additive inverse; without the rationals there is no multiplicative inverse; without the real numbers there is no completeness; and without the theory of cardinalities there is no language in which to speak of the sizes of infinite sets. The Wanderer's task, and our task, is to construct these objects with the rigor expected of a working mathematician and to position them within the broader Cantorian framework that will accompany us throughout the book.

```mermaid flowchart LR N["ℕ<br/>Peano Axioms<br/>Induction<br/>+ , ×"] Z["ℤ<br/>ℕ × ℕ / ~<br/>equivalence classes<br/>+ , − , ×"] Q["ℚ<br/>ℤ × ℤ∖{0} / ~<br/>equivalence classes<br/>+ , − , × , ÷"] R["ℝ<br/>Dedekind cuts<br/>or Cauchy sequences<br/>+ , − , × , ÷ , sup"]

N -->|canonical embedding| Z Z -->|canonical embedding| Q Q -->|completion| R ```

The diagram above captures the architecture of the four number systems we shall construct and the operations preserved at each stage. Notice that the arrows are not arbitrary; each represents an embedding, a structure-preserving map that allows us to view the previous system as a subset of the next. The final arrow, however, is qualitatively different: it is not an embedding but a *completion*, in the precise sense of the word we shall define. This single fact—that the reals are not merely a larger number system but a *completed* one—is the key to almost all of analysis.

The Peano Axioms and the Architecture of the Naturals

The construction of mathematics from nothing begins, as it must, with the simplest possible object: the natural numbers. The Italian mathematician Giuseppe Peano, in his 1889 *Arithmetices principia, nova methodo exposita*, distilled the essence of the natural numbers into a system of axioms that remains, with minor variations, the standard foundation for arithmetic to this day. We adopt the formulation in terms of a *zero* element and a *successor* function, because it is the most convenient for the constructions that follow.

A Peano structure is a triple $(\mathbb{N}, 0, S)$ consisting of a set $\mathbb{N}$, a distinguished element $0 \in \mathbb{N}$, and a function $S: \mathbb{N} \to \mathbb{N}$, satisfying the following axioms:

P1. $S(n) \neq 0$ for every $n \in \mathbb{N}$. (Zero is not a successor.)

P2. If $S(m) = S(n)$, then $m = n$. (The successor function is injective.)

P3. (Induction axiom.) If $A \subseteq \mathbb{N}$ is a set such that $0 \in A$ and such that $n \in A$ implies $S(n) \in A$ for all $n \in \mathbb{N}$, then $A = \mathbb{N}$.

These three axioms, plus a fourth sometimes appended about the existence of infinitely many elements, completely characterize the natural numbers. The induction axiom deserves special attention: it is not merely a tool for proving theorems about the natural numbers, it is the *defining property* of the natural numbers. Any set with a designated zero and a successor function that satisfies these three axioms is isomorphic to the standard natural numbers. This is the content of the categoricity of the Peano axioms (modulo set-theoretic foundations).

The induction axiom deserves elaboration, because it has two distinct uses that are often conflated. First, it is a *proof technique*: to prove that every natural number has some property $P(n)$, we let $A = \{n \in \mathbb{N} : P(n)\}$ and verify that $A$ satisfies the two closure conditions; the induction axiom then guarantees $A = \mathbb{N}$. Second, it is a *principle of definition*: to define a function $f: \mathbb{N} \to X$ recursively, we specify $f(0) = a$ and $f(S(n)) = F(f(n))$, and the induction axiom guarantees that there exists a unique such function. This second use is what allows us to define addition and multiplication on $\mathbb{N}$ in the first place.

Let us be explicit. Addition $+ : \mathbb{N} \times \mathbb{N} \to \mathbb{N}$ is defined by recursion on the second argument:

$$m + 0 = m, \qquad m + S(n) = S(m + n).$$

Multiplication $\cdot : \mathbb{N} \times \mathbb{N} \to \mathbb{N}$ is defined similarly:

$$m \cdot 0 = 0, \qquad m \cdot S(n) = m \cdot n + m.$$

These are not definitions we are free to modify; they are forced by the induction axiom together with the requirement that the operations respect the successor function. Once defined, they satisfy the expected algebraic laws—associativity, commutativity, distributivity—which can be proved by induction. The commutative law $m + n = n + m$, for instance, requires a double induction, first on $n$ for fixed $m$, then on $m$: it cannot be proved by a single induction.

Two further points deserve emphasis. First, the Peano axioms do not by themselves specify what $\mathbb{N}$ *is*; they specify only what structure $\mathbb{N}$ must have. In set theory, we typically realize $\mathbb{N}$ as the *von Neumann ordinals*: $\mathbb{N} = \{\emptyset, \{\emptyset\}, \{\emptyset, \{\emptyset\}\}, \ldots\}$, with $0 = \emptyset$ and $S(n) = n \cup \{n\}$. In this realization, $2 = \{\emptyset, \{\emptyset\}\} = \{0, 1\}$, $3 = \{0, 1, 2\}$, and in general $n = \{0, 1, \ldots, n-1\}$. Each natural number is the set of all smaller natural numbers, and the successor function becomes $S(n) = n \cup \{n\}$. This set-theoretic implementation is the one we shall use throughout the book, because it makes the embedding of $\mathbb{N}$ into $\mathbb{Z}$ and beyond natural (no pun intended).

Second, the induction axiom is not the only possible foundational scheme. The recursive definition theorem, which we used to define addition and multiplication, can be derived from the induction axiom, and conversely the induction axiom can be derived from the principle of recursive definitions. Different authors choose different formulations, and the resulting Peano structures are essentially equivalent. For our purposes, what matters is that the natural numbers come equipped with an induction principle, and that this principle gives us both a powerful proof technique and a flexible definition mechanism.

From Naturals to Rationals: The Algebraic Extensions

The natural numbers are not yet a complete foundation for analysis. They lack two algebraic operations that we shall need: subtraction (which requires additive inverses) and division (which requires multiplicative inverses for nonzero e