Natural Number

Exploring — Practical detail

Peano's axioms

Peano's 1889 axiomatisation of the natural numbers (in Arithmetices principia, nova methodo exposita) uses a first element, a successor function S, and mathematical induction. In modern formulation (Peano Arithmetic, PA):

• 0 is a natural number.
• For every natural number n, S(n) — the successor of n — is a natural number.
• 0 is not the successor of any natural number: S(n) ≠ 0 for all n.
• The successor function is injective: if S(m) = S(n) then m = n.
• Induction: if a property holds for 0, and whenever it holds for n it holds for S(n), then it holds for all natural numbers.

From these axioms, all arithmetic (addition, multiplication, ordering) can be defined. Addition is defined recursively: a + 0 = a and a + S(n) = S(a + n). Multiplication: a × 0 = 0 and a × S(n) = (a × n) + a.

Multi-civilisational development

Every known human civilisation developed counting systems. The notable systems and their distinctive features:

• Babylonian (c. 2000 BCE): Sexagesimal (base 60) system. Positional notation. No zero as a position-holder initially; later a placeholder symbol appeared but not zero as a number (Robson, E., Mathematics in Ancient Iraq, Princeton, 2008).
• Egyptian (c. 3100 BCE): Additive decimal system recorded in the Rhind Mathematical Papyrus (c. 1550 BCE, in the British Museum). Hieroglyphic symbols for powers of 10.
• Indian (Vedic era, c. 1500–500 BCE): Sanskrit number words with decimal structure that influenced Greek, Latin, and ultimately all European languages. The Vedic number system extended to enormous numbers — names for 10^53 appear in ancient texts.
• Chinese (c. 1600 BCE): Decimal system with rod numerals. The Jiuzhang Suanshu (Nine Chapters on the Mathematical Art, c. 200 BCE) uses a sophisticated arithmetic including negative numbers.
• Maya (c. 350 CE, possibly earlier): Vigesimal (base 20) positional system with an independent invention of zero — one of only three known independent inventions of positional notation with zero.

Properties of natural numbers

Under addition and multiplication, ℕ forms a commutative semiring: addition is associative and commutative, multiplication is associative and commutative, multiplication distributes over addition, and 0 is the additive identity and 1 is the multiplicative identity. It is not a ring (no additive inverses — negative numbers are not natural numbers).

The successor model and infinity

The fifth Peano axiom (induction) is what distinguishes ℕ from other structures satisfying the first four axioms. Without it, "non-standard models" of arithmetic exist — structures satisfying Peano axioms 1–4 that contain infinite elements. Gödel's incompleteness theorems (1931) showed that no finite set of axioms can completely characterise the natural numbers — there will always be true statements about ℕ that are not provable in any fixed axiom system.

Deep Dive — Formal and citable

Von Neumann ordinal construction in ZFC

In ZFC set theory, the natural numbers are defined as the finite von Neumann ordinals. Define: 0 = ∅, and for each ordinal n, define S(n) = n ∪ {n}. Thus 1 = {∅}, 2 = {∅, {∅}}, 3 = {∅, {∅}, {∅, {∅}}}, and so on. The Axiom of Infinity guarantees that the set ω = {0, 1, 2, 3, …} exists. In this construction, the natural number n is literally a set with exactly n elements: n = {0, 1, …, n−1}. Membership (∈) in this context corresponds to the strict less-than ordering: m < n iff m ∈ n.

Peano Arithmetic and incompleteness

Peano Arithmetic (PA) is the first-order theory with constant 0, successor function S, addition +, and multiplication ×, satisfying the Peano axioms stated in first-order logic (with the induction schema rather than second-order induction). By Gödel's first incompleteness theorem (1931), PA is incomplete: there exist statements in the language of PA that are true in the standard model ℕ but not provable in PA. The Paris-Harrington theorem (1977) gives a combinatorial example of a true statement about natural numbers that is not provable in PA, though it is provable in stronger systems. (Paris, J. and Harrington, L., "A Mathematical Incompleteness in Peano Arithmetic," in Barwise, J. (ed.), Handbook of Mathematical Logic, North-Holland, 1977.)

Ordinal and cardinal aspects

Natural numbers serve two distinct roles. As cardinals, they count the size of finite sets: the set {a, b, c} has cardinality 3. As ordinals, they describe position in a sequence: "the third element." For finite numbers, these roles coincide. They diverge at infinity: ω (the first infinite ordinal) and ℵ₀ (the first infinite cardinal) are different objects with different arithmetic, though they are both "the size of the natural numbers" in different senses.

Formal statement of Peano axioms (second-order)

The second-order Peano axioms categorically characterise ℕ (up to isomorphism). Let 0 be a constant, S a unary function. The axioms state: (1) S(n) ≠ 0 for all n; (2) S is injective; (3) for any set X, if 0 ∈ X and whenever n ∈ X then S(n) ∈ X, then X = ℕ. The categoricity result — that any two models of these axioms are isomorphic — was established by Dedekind in 1888 in Was sind und was sollen die Zahlen? ("What are Numbers and What Should They Be?", Brunswick, 1888).