Natural Numbers:Postulates
Contents
Formal definitions
Peano's Axioms
Many properties of the natural numbers can be derived from the five Peano axioms:
- 0 is a natural number.
- Every natural number has a successor which is also a natural number.
- 0 is not the successor of any natural number.
- If the successor of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle x } equals the successor of , then equals .
- The axiom of induction: If a statement is true of 0, and if the truth of that statement for a number implies its truth for the successor of that number, then the statement is true for every natural number.
These are not the original axioms published by Peano, but are named in his honor. Some forms of the Peano axioms have 1 in place of 0. In ordinary arithmetic, the successor of is . Replacing axiom 5 by an axiom schema, one obtains a (weaker) first-order theory called Peano arithmetic.
Constructions based on set theory
Von Neumann ordinals
In the area of mathematics called set theory, a specific construction due to John von Neumann defines the natural numbers as follows:
- Set , the empty set,
- Define for every set . is the successor of , and is called the successor function.
- By the axiom of infinity, there exists a set which contains 0 and is closed under the successor function. Such sets are said to be inductive. The intersection of all such inductive sets is defined to be the set of natural numbers. It can be checked that the set of natural numbers satisfies the Peano axioms.
- It follows that each natural number is equal to the set of all natural numbers less than it:
- ,
- ,
- ,
- Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 3 = 2 \cup \{2\} = \{0, 1, 2\} = \{\{ \}, \{\{ \}\}, \{\{ \}, \{\{ \}\}\}\} } ,
- Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n = n-1 \cup \{n-1\} = \{0, 1, ..., n-1\} = \{\{ \}, \{\{ \}\}, ..., \{\{ \}, \{\{ \}\}, ...\}\} } , etc.
With this definition, a natural number Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n} is a particular set with Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n} elements, and Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n\leq m} if and only if Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n} is a subset of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle m} . The standard definition, now called definition of von Neumann ordinals, is: "each ordinal is the well-ordered set of all smaller ordinals."
Also, with this definition, different possible interpretations of notations like ℝn (n-tuples versus mappings of n into ℝ) coincide.
Even if one does not accept the axiom of infinity and therefore cannot accept that the set of all natural numbers exists, it is still possible to define any one of these sets.
Zermelo ordinals
Although the standard construction is useful, it is not the only possible construction. Ernst Zermelo's construction goes as follows:
- Set Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 0 = \{ \}}
- Define Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle S(a) = \{a\}} ,
- It then follows that
- Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 0 = \{ \}} ,
- Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 1 = \{0\} = \{\{ \}\}} ,
- Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 2 = \{1\} = \{\{\{ \}\}\}} ,
- Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n = \{n-1\} = \{\{\{...\}\}\}} , etc.
- Each natural number is then equal to the set containing just the natural number preceding it. This is the definition of Zermelo ordinals. Unlike von Neumann's construction, the Zermelo ordinals do not account for infinite ordinals.
Resources
- Course Textbook, pages 196-201