# Contents

## Idea

A natural number is traditionally defined as any of the numbers $1$, $2$, $3$, and so on. It is now common in many fields of mathematics to include $0$ as a natural number as well. One advantage of this is that then the natural numbers can be identified with the cardinalities of finite sets, as well as the finite ordinal numbers. One can distinguish these as the nonnegative integers (with $0$) and the positive integers (without $0$), at least until somebody uses ‘positive’ in the semidefinite sense. To a set theorist, a natural number is essentially the same as an integer, so they often use the shorter word; one can also clarify with unsigned integer (but this doesn't help with $0$).

The set of natural numbers is often written $N$, $N$, $ℕ$, $\omega$, or ${\aleph }_{0}$. The last two notations refer to this set's structure as an ordinal number or cardinal number respectively, and they often (usually for $\aleph$) have a subscript $0$ allowing them to be generalised. In the foundations of mathematics, the axiom of infinity states that this actually forms a set (rather than a proper class).

## Natural numbers objects

$N$ has the structure of a natural numbers object in Set; indeed, it is the original example. This consists of an initial element $0$ (or $1$ if $0$ is not used) and a successor operation $n↦n+1$ (or simply $n↦n+$). Given any other set $X$ with an element $a:X$ and a function $s:X\to X$, we define by primitive recursion at $X$ a unique function $f:N\to X$ such that ${f}_{0}=a$ and ${f}_{n+}=s\left({f}_{n}\right)$. (Fancier forms of recursion are also possible.) The basic idea is that we define the values of $f$ one by one, starting with ${f}_{0}=a$, then ${f}_{1}=s\left(a\right)$, ${f}_{2}=s\left(s\left(a\right)\right)$, and so on. These are all both possible and necessary individually, but something must be put in the foundations to ensure that this can go on uniquely forever.

Revised on March 7, 2013 01:47:08 by Toby Bartels (64.89.53.123)