Peano's Axioms — Definition, Formula & Examples

Peano's Axioms are five axioms that formally define the natural numbers by specifying a starting element (0 or 1), a successor function that generates each next number, and the principle of mathematical induction to ensure no extra elements sneak in.

Let $\mathbb{N}$ be a set, $0 \in \mathbb{N}$ a distinguished element, and $S: \mathbb{N} \to \mathbb{N}$ a function (the successor). The Peano axioms state: (P1) $0 \in \mathbb{N}$ ; (P2) if $n \in \mathbb{N}$ , then $S(n) \in \mathbb{N}$ ; (P3) there is no $n \in \mathbb{N}$ such that $S(n) = 0$ ; (P4) $S$ is injective, i.e., $S(m) = S(n) \implies m = n$ ; (P5) if a subset $A \subseteq \mathbb{N}$ satisfies $0 \in A$ and $n \in A \implies S(n) \in A$ , then $A = \mathbb{N}$ .

How It Works

The axioms build the natural numbers from scratch. Axiom P1 gives you a starting point. Axiom P2 says you can always take the successor (think of

S(n) = n + 1

) to get another natural number, so

0, S(0), S(S(0)), \ldots

generates the entire set. Axiom P3 prevents any element from looping back to 0, and axiom P4 prevents two distinct numbers from sharing the same successor — together these ensure the natural numbers form an infinite chain with no cycles or collapses. Axiom P5 is the axiom of induction: it guarantees that the only elements in

\mathbb{N}

are those reachable from 0 by repeatedly applying

S

, ruling out rogue elements.

Example

Problem: Using Peano's Axioms, verify that

S(S(0)) \neq S(0)

, i.e., that 2 and 1 are distinct natural numbers.

Assume for contradiction: Suppose

S(S(0)) = S(0)

S(S(0)) = S(0)

Apply axiom P4 (injectivity): Since

S

is injective,

S(m) = S(n) \implies m = n

. Applying this gives:

S(0) = 0

Contradiction with P3: Axiom P3 states that 0 is not the successor of any natural number. But

S(0) = 0

contradicts this. Therefore

S(S(0)) \neq S(0)

, confirming that 2 and 1 are distinct.

Answer:

S(S(0)) \neq S(0)

, so 2 and 1 are distinct natural numbers, as guaranteed by axioms P3 and P4.

Why It Matters

Peano's Axioms provide the rigorous foundation on which all of number theory and arithmetic are built. In courses like abstract algebra and real analysis, these axioms justify why mathematical induction works as a proof technique. They also underpin formal verification in computer science, where automated theorem provers need explicit axioms for reasoning about integers.

Common Mistakes

Mistake: Thinking axiom P5 (induction) is redundant given the other four axioms.

Correction: Without P5, models could contain extra elements beyond

0, S(0), S(S(0)), \ldots

— for instance, an isolated infinite chain disconnected from 0. The induction axiom is what forces

\mathbb{N}

to contain only the elements reachable from 0.