#jsDisabledContent { display:none; } My Account | Register | Help

# Peano axioms

Article Id: WHEBN0000025005
Reproduction Date:

 Title: Peano axioms Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### Peano axioms

In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are a set of axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano. These axioms have been used nearly unchanged in a number of metamathematical investigations, including research into fundamental questions of consistency and completeness of number theory.

The need for formalism in arithmetic was not well appreciated until the work of Hermann Grassmann, who showed in the 1860s that many facts in arithmetic could be derived from more basic facts about the successor operation and induction.[1] In 1881, Charles Sanders Peirce provided an axiomatization of natural-number arithmetic.[2] In 1888, Richard Dedekind proposed a collection of axioms about the numbers, and in 1889 Peano published a more precisely formulated version of them as a collection of axioms in his book, The principles of arithmetic presented by a new method (Latin: Arithmetices principia, nova methodo exposita).

The Peano axioms contain three types of statements. The first axiom asserts the existence of at least one member of the set "number". The next four are general statements about equality; in modern treatments these are often not taken as part of the Peano axioms, but rather as axioms of the "underlying logic".[3] The next three axioms are first-order statements about natural numbers expressing the fundamental properties of the successor operation. The ninth, final axiom is a second order statement of the principle of mathematical induction over the natural numbers. A weaker first-order system called Peano arithmetic is obtained by explicitly adding the addition and multiplication operation symbols and replacing the second-order induction axiom with a first-order axiom schema.

## Contents

• Formulation 1
• Arithmetic 2
• Multiplication 2.2
• Inequalities 2.3
• First-order theory of arithmetic 3
• Equivalent axiomatizations 3.1
• Models 4
• Nonstandard models 4.1
• Set-theoretic models 4.2
• Interpretation in category theory 4.3
• Consistency 5
• Footnotes 7
• References 8

## Formulation

The set of natural numbers can be illustrated by the infinite chain of light wood domino pieces, their first one corresponding to zero, and each piece facing its top side towards its successor. However, the Peano axioms 1–8 are also fulfilled by the incontiguous structure consisting of both light and dark wood pieces. The induction axiom, 9, corresponds to the requirement that if the first light wood domino piece (0) is overthrown, then each piece will eventually fall ("domino effect"); this is satisfied only in the absence of the dark pieces.

When Peano formulated his axioms, the language of Boole and Schröder.[5]

The Peano axioms define the arithmetical properties of natural numbers, usually represented as a set N or \mathbb{N}. The signature (a formal language's non-logical symbols) for the axioms includes a constant symbol 0 and a unary function symbol S.

The constant 0 is assumed to be a natural number:

1. 0 is a natural number.

The next four axioms describe the equality relation. Since they are logically valid in first-order logic with equality, they are not considered to be part of "the Peano axioms" in modern treatments.[6]

1. For every natural number x, x = x. That is, equality is reflexive.
2. For all natural numbers x and y, if x = y, then y = x. That is, equality is symmetric.
3. For all natural numbers x, y and z, if x = y and y = z, then x = z. That is, equality is transitive.
4. For all a and b, if a is a natural number and a = b, then b is also a natural number. That is, the natural numbers are closed under equality.

The remaining axioms define the arithmetical properties of the natural numbers. The naturals are assumed to be closed under a single-valued "successor" function S.

1. For every natural number n, S(n) is a natural number.

Peano's original formulation of the axioms used 1 instead of 0 as the "first" natural number.[7] This choice is arbitrary, as axiom 1 does not endow the constant 0 with any additional properties. However, because 0 is the additive identity in arithmetic, most modern formulations of the Peano axioms start from 0. Axioms 1 and 6 define a unary representation of the natural numbers: the number 1 can be defined as S(0), 2 as S(S(0)) (which is also S(1)), and, in general, any natural number n as the result of n-fold application of S to 0, denoted as Sn(0). The next two axioms define the properties of this representation.

1. For every natural number n, S(n) = 0 is false. That is, there is no natural number whose successor is 0.
2. For all natural numbers m and n, if S(m) = S(n), then m = n. That is, S is an injection.

Axioms 1, 6, 7 and 8 imply that the set of natural numbers contains the distinct elements 0, S(0), S(S(0)), and furthermore that {0, S(0), S(S(0)), …} ⊆ N. This shows that the set of natural numbers is infinite. However, to show that N = {0, S(0), S(S(0)), …}, it must be shown that N ⊆ {0, S(0), S(S(0)), …}; i.e., it must be shown that every natural number is included in {0, S(0), S(S(0)), …}. To do this however requires an additional axiom, which is sometimes called the axiom of induction. This axiom provides a method for reasoning about the set of all natural numbers.

1. If K is a set such that:
• 0 is in K, and
• for every natural number n, if n is in K, then S(n) is in K,
then K contains every natural number.

The induction axiom is sometimes stated in the following form:

1. If φ is a unary predicate such that:
• φ(0) is true, and
• for every natural number n, if φ(n) is true, then φ(S(n)) is true,
then φ(n) is true for every natural number n.

In Peano's original formulation, the induction axiom is a second-order axiom. It is now common to replace this second-order principle with a weaker first-order induction scheme. There are important differences between the second-order and first-order formulations, as discussed in the section Models below.

## Arithmetic

The Peano axioms can be augmented with the operations of addition and multiplication and the usual total (linear) ordering on N. The respective functions and relations are constructed in second-order logic, and are shown to be unique using the Peano axioms.

Addition is a function that maps two natural numbers (two elements of N) to another one. It is defined recursively as:

\begin{align} a + 0 &= a ,\\ a + S (b) &= S (a + b). \end{align}

For example,

a + 1 = a + S(0) = S(a + 0) = S(a).

The structure (N, +) is a commutative semigroup with identity element 0. (N, +) is also a cancellative magma, and thus embeddable in a group. The smallest group embedding N is the integers.

### Multiplication

Similarly, multiplication is a function mapping two natural numbers to another one. Given addition, it is defined recursively as:

\begin{align} a \cdot 0 &= 0, \\ a \cdot S (b) &= a + (a \cdot b). \end{align}

It is easy to see that setting b equal to 0 yields the multiplicative identity:

a · 1 = a · S(0) = a + (a · 0) = a + 0 = a

a · (b + c) = (a · b) + (a · c).

Thus, (N, +, 0, ·, 1) is a commutative semiring.

### Inequalities

The usual total order relation ≤ on natural numbers can be defined as follows, assuming 0 is a natural number:

For all a, bN, ab if and only if there exists some cN such that a + c = b.

This relation is stable under addition and multiplication: for a, b, c \in N , if ab, then:

• a + cb + c, and
• a · cb · c.

Thus, the structure (N, +, ·, 1, 0, ≤) is an ordered semiring; because there is no natural number between 0 and 1, it is a discrete ordered semiring. The axiom of induction is sometimes stated in the following strong form, making use of the ≤ order:

For any predicate φ, if
• φ(0) is true, and
• for every n, kN, if kn implies φ(k) is true, then φ(S(n)) is true,
then for every nN, φ(n) is true.

This form of the induction axiom is a simple consequence of the standard formulation, but is often better suited for reasoning about the ≤ order. For example, to show that the naturals are well-ordered—every nonempty subset of N has a least element—one can reason as follows. Let a nonempty XN be given and assume X has no least element.

• Because 0 is the least element of N, it must be that 0 ∉ X.
• For any nN, suppose for every kn, kX. Then S(n) ∉ X, for otherwise it would be the least element of X.

Thus, by the strong induction principle, for every nN, nX. Thus, XN = ∅, which contradicts X being a nonempty subset of N. Thus X has a least element.

## First-order theory of arithmetic

First-order theories are often better than second order theories for model- or proof theoretic analysis. All of the Peano axioms except the ninth axiom (the induction axiom) are statements in first-order logic. The arithmetical operations of addition and multiplication and the order relation can also be defined using first-order axioms. The second-order axiom of induction can be transformed into a weaker first-order induction schema.

First-order axiomatizations of Peano arithmetic have an important limitation, however. In second-order logic, it is possible to define the addition and multiplication operations from the successor operation, but this cannot be done in the more restrictive setting of first-order logic. Therefore, the addition and multiplication operations are directly included in the signature of Peano arithmetic, and axioms are included that relate the three operations to each other.

The following list of axioms (along with the usual axioms of equality), which contains six of the seven axioms of Robinson arithmetic, is sufficient for this purpose:[8]

• xN. 0 ≠ S(x)
• x,yN. S(x) = S(y) ⇒ x = y
• xN. x + 0 = x
• x,yN. x + S(y) = S(x + y)
• xN. x ⋅ 0 = 0
• x,yN. xS(y) = xy + x

In addition to this list of numerical axioms, Peano arithmetic contains the induction schema, which consists of a countably infinite set of axioms. For each formula φ(x,y1,...,yk) in the language of Peano arithmetic, the first-order induction axiom for φ is the sentence

\forall \bar{y} (\varphi(0,\bar{y}) \land \forall x ( \varphi(x,\bar{y})\Rightarrow\varphi(S(x),\bar{y})) \Rightarrow \forall x \varphi(x,\bar{y}))

where \bar{y} is an abbreviation for y1,...,yk. The first-order induction schema includes every instance of the first-order induction axiom, that is, it includes the induction axiom for every formula φ.

This schema avoids quantification over sets of natural numbers, which is impossible in first-order logic. For instance, it is not possible in first-order logic to say that any set of natural numbers containing 0 and closed under successor is the entire set of natural numbers. What can be expressed is that any definable set of natural numbers has this property. Because it is not possible to quantify over definable subsets explicitly with a single axiom, the induction schema includes one instance of the induction axiom for every definition of a subset of the naturals.

### Equivalent axiomatizations

There are many different, but equivalent, axiomatizations of Peano arithmetic. While some axiomatizations, such as the one just described, use a signature that only has symbols for 0 and the successor, addition, and multiplications operations, other axiomatizations use the language of ordered semirings, including an additional order relation symbol. One such axiomatization begins with the following axioms that describe a discrete ordered semiring.[9]

1. \forall x, y, z \in N. (x + y) + z = x + (y + z), i.e., addition is associative.
2. \forall x, y \in N. x + y = y + x, i.e., addition is commutative.
3. \forall x, y, z \in N. (x \cdot y) \cdot z = x \cdot (y \cdot z), i.e., multiplication is associative.
4. \forall x, y \in N. x \cdot y = y \cdot x, i.e., multiplication is commutative.
5. \forall x, y, z \in N. x \cdot (y + z) = (x \cdot y) + (x \cdot z), i.e., the distributive law.
6. \forall x \in N. x + 0 = x \and x \cdot 0 = 0, i.e., zero is the identity element for addition.
7. \forall x \in N. x \cdot 1 = x, i.e., one is the identity element for multiplication.
8. \forall x, y, z \in N. x < y \and y < z \Rightarrow x < z, i.e., the '<' operator is transitive.
9. \forall x \in N. \neg (x < x), i.e., the '<' operator is irreflexive.
10. \forall x, y \in N. x < y \or x = y \or y < x.
11. \forall x, y, z \in N. x < y \Rightarrow x + z < y + z.
12. \forall x, y, z \in N. 0 < z \and x < y \Rightarrow x \cdot z < y \cdot z.
13. \forall x, y \in N x < y \Rightarrow \exists z \in N x + z = y.
14. 0 < 1 \and \forall x \in N. x > 0 \Rightarrow x \geq 1.
15. \forall x \in N. x \geq 0.

The theory defined by these axioms is known as PA; PA is obtained by adding the first-order induction schema.

An important property of PA is that any structure M satisfying this theory has an initial segment (ordered by ≤) isomorphic to N. Elements of M \ N are known as nonstandard elements.

## Models

A model of the Peano axioms is a triple (N, 0, S), where N is a (necessarily infinite) set, 0 ∈ N and S : NN satisfies the axioms above. Dedekind proved in his 1888 book, What are numbers and what should they be (German: Was sind und was sollen die Zahlen) that any two models of the Peano axioms (including the second-order induction axiom) are isomorphic. In particular, given two models (NA, 0A, SA) and (NB, 0B, SB) of the Peano axioms, there is a unique homomorphism f : NANB satisfying

\begin{align} f(0_A) &= 0_B \\ f(S_A (n)) &= S_B (f (n)) \end{align}

and it is a bijection. The second-order Peano axioms are thus categorical; this is not the case with any first-order reformulation of the Peano axioms, however.

### Nonstandard models

Although the usual natural numbers satisfy the axioms of PA, there are other non-standard models as well; the compactness theorem implies that the existence of nonstandard elements cannot be excluded in first-order logic. The upward Löwenheim–Skolem theorem shows that there are nonstandard models of PA of all infinite cardinalities. This is not the case for the original (second-order) Peano axioms, which have only one model, up to isomorphism. This illustrates one way the first-order system PA is weaker than the second-order Peano axioms.

When interpreted as a proof within a first-order set theory, such as ZFC, Dedekind's categoricity proof for PA shows that each model of set theory has a unique model of the Peano axioms, up to isomorphism, that embeds as an initial segment of all other models of PA contained within that model of set theory. In the standard model of set theory, this smallest model of PA is the standard model of PA; however, in a nonstandard model of set theory, it may be a nonstandard model of PA. This situation cannot be avoided with any first-order formalization of set theory.

It is natural to ask whether a countable nonstandard model can be explicitly constructed. The answer is affirmative as Skolem in 1933 provided an explicit construction of such a nonstandard model. On the other hand, Tennenbaum's theorem, proved in 1959, shows that there is no countable nonstandard model of PA in which either the addition or multiplication operation is computable.[10] This result shows it is difficult to be completely explicit in describing the addition and multiplication operations of a countable nonstandard model of PA. However, there is only one possible order type of a countable nonstandard model. Letting ω be the order type of the natural numbers, ζ be the order type of the integers, and η be the order type of the rationals, the order type of any countable nonstandard model of PA is ω + ζ·η, which can be visualized as a copy of the natural numbers followed by a dense linear ordering of copies of the integers.

### Set-theoretic models

The Peano axioms can be derived from set theoretic constructions of the natural numbers and axioms of set theory such as the ZF.[11] The standard construction of the naturals, due to John von Neumann, starts from a definition of 0 as the empty set, ∅, and an operator s on sets defined as:

s(a) = a ∪ { a }.

The set of natural numbers N is defined as the intersection of all sets closed under s that contain the empty set. Each natural number is equal (as a set) to the set of natural numbers less than it:

\begin{align} 0 &= \emptyset \\ 1 &= s(0) = s(\emptyset) = \emptyset \cup \{ \emptyset \} = \{ \emptyset \} = \{ 0 \} \\ 2 &= s(1) = s(\{ 0 \}) = \{ 0 \} \cup \{ \{ 0 \} \} = \{ 0 , \{ 0 \} \} = \{ 0, 1 \} \\ 3 &= ... = \{ 0, 1, 2 \} \end{align}

and so on. The set N together with 0 and the successor function s : NN satisfies the Peano axioms.

Peano arithmetic is equiconsistent with several weak systems of set theory.[12] One such system is ZFC with the axiom of infinity replaced by its negation. Another such system consists of general set theory (extensionality, existence of the empty set, and the axiom of adjunction), augmented by an axiom schema stating that a property that holds for the empty set and holds of an adjunction whenever it holds of the adjunct must hold for all sets.

### Interpretation in category theory

The Peano axioms can also be understood using category theory. Let C be a category with terminal object 1C, and define the category of pointed unary systems, US1(C) as follows:

• The objects of US1(C) are triples (X, 0X, SX) where X is an object of C, and 0X : 1CX and SX : XX are C-morphisms.
• A morphism φ : (X, 0X, SX) → (Y, 0Y, SY) is a C-morphism φ : XY with φ 0X = 0Y and φ SX = SY φ.

Then C is said to satisfy the Dedekind–Peano axioms if US1(C) has an initial object; this initial object is known as a natural number object in C. If (N, 0, S) is this initial object, and (X, 0X, SX) is any other object, then the unique map u : (N, 0, S) → (X, 0X, SX) is such that

\begin{align} u 0 &= 0_X, \\ u (S x) &= S_X (u x). \end{align}

This is precisely the recursive definition of 0X and SX.

## Consistency

When the Peano axioms were first proposed, Bertrand Russell and others agreed that these axioms implicitly defined what we mean by a "natural number". Henri Poincaré was more cautious, saying they only defined natural numbers if they were consistent; if there is a proof that starts from just these axioms and derives a contradiction such as 0 = 1, then the axioms are inconsistent, and don't define anything. In 1900, David Hilbert posed the problem of proving their consistency using only finitistic methods as the second of his twenty-three problems.[13] In 1931, Kurt Gödel proved his second incompleteness theorem, which shows that such a consistency proof cannot be formalized within Peano arithmetic itself.[14]

Although it is widely claimed that Gödel's theorem rules out the possibility of a finitistic consistency proof for Peano arithmetic, this depends on exactly what one means by a finitistic proof. Gödel himself pointed out the possibility of giving a finitistic consistency proof of Peano arithmetic or stronger systems by using finitistic methods that are not formalizable in Peano arithmetic, and in 1958 Gödel published a method for proving the consistency of arithmetic using type theory.[15] In 1936, Gerhard Gentzen gave a proof of the consistency of Peano's axioms, using transfinite induction up to an ordinal called ε0.[16] Gentzen explained: "The aim of the present paper is to prove the consistency of elementary number theory or, rather, to reduce the question of consistency to certain fundamental principles". Gentzen's proof is arguably finitistic, since the transfinite ordinal ε0 can be encoded in terms of finite objects (for example, as a Turing machine describing a suitable order on the integers, or more abstractly as consisting of the finite trees, suitably linearly ordered). Whether or not Gentzen's proof meets the requirements Hilbert envisioned is unclear: there is no generally accepted definition of exactly what is meant by a finitistic proof, and Hilbert himself never gave a precise definition.

The vast majority of contemporary mathematicians believe that Peano's axioms are consistent, relying either on intuition or the acceptance of a consistency proof such as Gentzen's proof. The small number of mathematicians who advocate ultrafinitism reject Peano's axioms because the axioms require an infinite set of natural numbers.

## Footnotes

1. ^ Grassmann 1861
2. ^ Peirce 1881; also see Shields 1997
3. ^ van Heijenoort 1967:94
4. ^ Van Heijenoort 1967, p. 2
5. ^ Van Heijenoort 1967, p. 83
6. ^ Van Heijenoort 1967, p. 83
7. ^ Peano 1889, p. 1
8. ^ Mendelson 1997:155
9. ^ Kaye 1991, pp. 16–18
10. ^ Kaye 1991, sec. 11.3
11. ^ Suppes 1960; Hatcher 1982
12. ^ Tarski & Givant 1987, sec. 7.6
13. ^ Hilbert 1900
14. ^ Godel 1931
15. ^ Godel 1958
16. ^ Gentzen 1936

## References

• Martin Davis, 1974. Computability. Notes by Barry Jacobs. Courant Institute of Mathematical Sciences, New York University.
• . Two English translations:
• 1963 (1901). Essays on the Theory of Numbers. Beman, W. W., ed. and trans. Dover.
• 1996. In From Kant to Hilbert: A Source Book in the Foundations of Mathematics, 2 vols, Ewald, William B., ed. Oxford University Press: 787–832.
• Gentzen, G., 1936, Die Widerspruchsfreiheit der reinen Zahlentheorie. Mathematische Annalen 112: 132–213. Reprinted in English translation in his 1969 Collected works, M. E. Szabo, ed. Amsterdam: North-Holland.
• . See On Formally Undecidable Propositions of Principia Mathematica and Related Systems for details on English translations.
• --------, 1958, "Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes," Dialectica 12: 280–87. Reprinted in English translation in 1990. Gödel's Collected Works, Vol II. Solomon Feferman et al., eds. Oxford University Press.
• Hermann Grassmann (1861). Lehrbuch der Arithmetik (A tutorial in arithmetic). Enslin.
• Hatcher, William S., 1982. The Logical Foundations of Mathematics. Pergamon. Derives the Peano axioms (called S) from several axiomatic set theories and from category theory.
• David Hilbert,1901, "Mathematische Probleme". Archiv der Mathematik und Physik 3(1): 44–63, 213–37. English translation by Maby Winton, 1902, "Mathematical Problems," Bulletin of the American Mathematical Society 8: 437–79.
• Kaye, Richard, 1991. Models of Peano arithmetic. Oxford University Press. ISBN 0-19-853213-X.
• Mendelson, Elliott, 1997. Introduction to Mathematical Logic, 4th ed. Chapman & Hall.
• Reprinted (CP 3.252-88), (W 4:299-309).
• Paul Shields. (1997), "Peirce's Axiomatization of Arithmetic", in Houser et al., eds., Studies in the Logic of Charles S. Peirce.
• Patrick Suppes, 1972 (1960). Axiomatic Set Theory. Dover. ISBN 0-486-61630-4. Derives the Peano axioms from ZFC.
• Alfred Tarski, and Givant, Steven, 1987. A Formalization of Set Theory without Variables. AMS Colloquium Publications, vol. 41.
• Edmund Landau, 1965 Grundlagen Der Analysis. AMS Chelsea Publishing. Derives the basic number systems from the Peano axioms. English/German vocabulary included. ISBN 978-0-8284-0141-8
• Contains translations of the following two papers, with valuable commentary:
• Richard Dedekind, 1890, "Letter to Keferstein." pp. 98–103. On p. 100, he restates and defends his axioms of 1888.
• Giuseppe Peano, 1889. Arithmetices principia, nova methodo exposita (The principles of arithmetic, presented by a new method), pp. 83–97. An excerpt of the treatise where Peano first presented his axioms, and recursively defined arithmetical operations.