Théorème

N3 — Structural minimality of ℕ

$(\mathbb{N}_{\geq 1}, \times)$ is the unique free commutative cancellative UFD monoid with countable atoms.

Statement

The Eratosthenes sieve is structurally minimal in the following sense:

(M1) Minimal monoid. $(\mathbb{N}_{\geq 1}, \times)$ is, up to isomorphism, the unique free commutative cancellative monoid with unique factorisation (UFD) and countably many atoms.
(M2) Minimal operation. The sieve uses only divisibility ( $a \mid b$ ), which requires no metric, topology, or additive structure.

Théorème

Plain reading. ℕ with multiplication is not an arbitrary frame: it’s the simplest possible for unique “fundamental bricks” to emerge. No poorer structure works, no richer one is needed. The sieve uses the only truly indispensable operation: “does this divide that?”

Why it matters

N3 locks the inevitability of PT at a deeper level than N1 and N2. N1 says: on ℕ, primes are unique. N2 says: on ℕ, the sieve is unique. N3 goes further: ℕ itself is forced. No need to look elsewhere for a simpler frame.

Consequence: PT takes as starting point the logical minimum — a commutative, free, unique-factorisation monoid. Any alternative would be either richer (hence subject to the same structure) or inconsistent.

Proof — outline

(M1) Existence of such a monoid. $(\mathbb{N}_{\geq 1}, \times)$ satisfies: commutative (✓), free (generated by primes, no hidden relations), cancellative ( $ac = bc \Rightarrow a = b$ for $c \neq 0$ ), UFD (unique factorisation).
(M1) Uniqueness. Any monoid with these properties and a countable atom set is isomorphic to $(\mathbb{N}_{\geq 1}, \times)$ .
(M2) Divisibility as minimal primitive. The relation $a \mid b$ is the unique binary relation definable without additional structure (metric, topology, additive order), capable of identifying atoms.

Detailed proof

Part M1.1 — ℕ satisfies the UFD axioms

Commutative: $ab = ba$ for all $a, b \in \mathbb{N}_{\geq 1}$ .
Free: no hidden relations between primes ( $p \cdot q \neq r$ for distinct primes $p, q, r$ ).
Cancellative: $ac = bc$ with $c \neq 0$ implies $a = b$ .
UFD: Fundamental Theorem of Arithmetic.

Part M1.2 — Uniqueness by isomorphism

Let $(M, \cdot)$ be a free commutative cancellative UFD monoid with countably many atoms $\{a_n\}_{n \in \mathbb{N}}$ . Index atoms by $\mathbb{N}$ : $a_1, a_2, \ldots$ . The unique factorisation of an element $m \in M$ writes:

m = a_1^{k_1} \cdot a_2^{k_2} \cdots a_n^{k_n}

with $k_i \geq 0$ . This defines a bijection $\varphi : M \to \mathbb{N}_{\geq 1}$ sending $a_i \mapsto p_i$ (the $i$ -th prime). $\varphi$ is a monoid isomorphism by construction.

Part M2 — Operational minimality

Divisibility $a \mid b \iff \exists c : ac = b$ is definable purely from the multiplicative structure. No other relation has this property. In particular:

No need for order $a < b$ — the sieve does not use order, just “is this number a multiple?”.
No need for a metric $d(a, b)$ — no notion of closeness.
No need for topology — no continuity.
No need for additive structure — the cascade uses only multiplication.

This axiomatic poverty is what makes PT philosophically remarkable: physics reconstructs from almost nothing.

Consequence: PT irreducibility

N3 implies that there is no simpler framework where the PT cascade could operate. Any attempted alternative reformulation reduces, by isomorphism, to $(\mathbb{N}, \times)$ . PT is structurally unique.

For the complete derivation, see chapter 2 of the monograph.