Natural number

An intuitive and implicit understanding of natural numbers is developed naturally through using numbers for counting, ordering and basic arithmetic. Within this are two closely related aspects of what a natural number is: the size of a collection; and a position in a sequence. Size of a collection Natural numbers can be used to answer questions like "how many apples are on the table?" A natural number used in this way describes a characteristic of a finite collection of objects. This characteristic, the size of a collection, is called cardinality and a natural number used to describe or measure it is a cardinal number. Two finite collections have the same size or cardinality if they have a one-to-one correspondence, meaning the objects can be arranged in pairs (one from each collection), with every object in exactly one pair. In the adjacent image every apple is paired with exactly one orange and every orange is paired with exactly one apple. As such, the group of apples has the same cardinality as the group of oranges, or put more simply the number of apples is the same as the number of oranges. Because this equality can be established without counting or using any prior notion of number, it can form the definition of a cardinal number. In this case, the number of apples, oranges - and of any other collection that could be paired off to either group - is 3. If two collections do not have the same cardinality, pairing will leave one of the collections with objects that are unpaired and this can be used to define a size relationship between them. The collection in which all objects are paired is said to be "smaller" and the one left with unpaired objects "larger", than the other. Position in a sequence A sequence is a list of objects in a specific order. More precisely, a sequence is a function that assigns an object to each position in that list. The positions themselves are labeled using a well-ordered set; every element always has a clear next element. Every well-ordered set has an order type, which is the ordinal number that describes its shape of ordering. The position labels here are not counts or size like with the cardinal numbers, just ordered elements. The natural numbers are the most common choice for labeling infinite sequences because they form the simplest infinite well-ordered set, with order type ω. They start at either 0 or 1 and continue in their familiar fixed order — 1, 2, 3, and so on — with no end point. Each natural number labels a specific position in the sequence based on where it falls relative to all other positions. For example, 1 is the first position, 2 is the position right after 1, and 3 is the position after both 1 and 2 and before 4, 5, and so on. This ordering matches the usual ordering, smaller numbers before larger ones. But the natural numbers are simply the most familiar example; any well-ordered set would work equally well for indexing a sequence, for example the set of letters a, b, c, and so on. == Terminology and notation ==

The term natural numbers has two common definitions: either or . Because there is no universal convention, the definition can be chosen to suit the context of use. To eliminate ambiguity, the sequences and are often called the positive integers and the non-negative integers, respectively. The phrase whole numbers is frequently used for the natural numbers that include 0, although it may also mean all integers, positive and negative. The set of all natural numbers is typically denoted or in blackboard bold as \mathbb N. Whether 0 is included is often determined by the context but may also be specified by using \mathbb N or \mathbb Z (the set of all integers) with a subscript or superscript. Examples include \mathbb{N}_1, or \mathbb Z^+ (for the set starting at 1) and \mathbb{N}_0 or \mathbb Z^{0+} (for the set including 0). Numeral A numeral is a symbol or grouping of symbols used to express a natural number in writing, and a particular set of symbols with specific rules for using them is a numeral system. Each symbol in a numeral system represents a unique natural number - said to be its value - and can be used alone as a numeral, or in a string with other symbols which together form a numeral. The decimal system which uses Arabic numerals and positional notation rules is the universal standard for representing natural numbers in mathematics and in common use. In part because of this universal standard, the distinction between an abstract number (a value) and its symbol (a numeral) is generally unimportant so numerals are frequently referred to simply as "numbers". This is sometimes done even where the distinction is relevant, as with binary numerals which are often called "binary numbers". == Use of natural numbers ==

Natural numbers are used for counting and the four basic operations of arithmetic: addition; subtraction; multiplication; and division. Counting Counting is the process of iterating through the natural numbers in sequential order starting at 1. It can be done using numbers alone (as in "counting to 10"), or by applying the count to objects (as in "counting the students in the class"). When applied to a collection of objects, counting determines the cardinality of the collection by establishing a one-to-one correspondence between the objects and the natural numbers. This involves consecutively "tagging" each object with a number while maintaining a running partition of the tagged objects from those not yet tagged. The numbers must be assigned in order starting at 1 - so they are ordinal numbers - but the order of the objects chosen is arbitrary as long as each object receives one and only one number. The cardinality principle is the understanding that the ordinal number assigned to the final object gives the result of the count: the cardinal number of the collection. ==Formal definitions==

Formal definitions take the existing, intuitive notion of natural numbers together with the rules of arithmetic and define them both in the more fundamental terms of mathematical logic. Formal systems typically assume that the defining characteristic of natural numbers is their fixed order and establish this order using the primitive notion of a successor. Every natural number has a successor, which is another unique natural number that it is followed by. Two standard formal definitions are based on the Peano axioms and set theory. The Peano axioms (named for Giuseppe Peano) do not explicitly define what the natural numbers are, but instead comprise a list of statements or axioms that must be true of natural numbers, however they are defined. In contrast, set theory defines each natural number as a particular set, in which a set can be generally understood as a collection of distinct objects or elements. While the two methods are different, they are consistent in that the natural number sets collectively satisfy the Peano axioms. Peano axioms The five Peano axioms are: • 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 x equals the successor of y , then x equals y. • 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 x is x + 1. Set-theoretic definition In set theory each natural number is defined as a specific set. A variety of constructions have been proposed, however the standard solution (due to John von Neumann) is: • Call , the empty set. • Define the successor of any set by . • By the axiom of infinity, there exist sets which contain 0 and are closed under the successor function. Such sets are said to be inductive. The intersection of all inductive sets is still an inductive set. • This intersection is the set of the natural numbers. This produces an iterative definition of the natural numbers called the von Neumann ordinals: \begin{alignat}{2} 0 & && {} = \{\} && {} = \varnothing \\ 1 & = 0 \cup \{0\} && {} = \{0\} && = \{ \varnothing\} \\ 2 & = 1 \cup \{1\} && {} = \{0,1\} && {} = \{\varnothing,\{\varnothing\}\}\\ 3 & = 2 \cup \{2\} && {} = \{0,1,2\} && {} = \{\varnothing,\{\varnothing\},\{\varnothing,\{\varnothing\}\}\} \\ n & = n-1 \cup \{n-1\} && {} = \{0,1, ...,n-1\} && {} = \{\varnothing,\{\varnothing\},...,\{\varnothing,\{\varnothing\},...\}\}\\ \end{alignat} In this construction every natural number is a set containing elements, where each element is a natural number less than . From this, the intuitive concepts of cardinality and order can be formally defined as: • Cardinality: a set has elements if there is a one-to-one correspondence or bijection from to . • Order: if and only if is a subset of . Another construction sometimes called '''''' defines and and is now largely only of historical interest. ==Properties==

This section uses the convention that 0 is a natural number: \mathbb{N}=\mathbb{N}_0. Addition Given the set \mathbb{N} of natural numbers and the successor function S \colon \mathbb{N} \to \mathbb{N} sending each natural number to the next one, addition (+) is defined by:\begin{align} a + 0 & = a & \textrm{(1)}\\ a + S(b) & = S(a+b) & \textrm{(2)}\\ \end{align}In the statements above, (1) explicitly defines addition for the first natural number and (2) gives a recursive definition for each subsequent number in terms of previous definitions, as illustrated below.\begin{alignat}{2} & a + 1 = a + S(0) = S(a+0) = S(a) \\ & a + 2 = a + S(1) = S(a+1) = S(S(a)) \\ & a + 3 = a + S(2) = S(a+2) = S(S(S(a))) \end{alignat}In this way, addition can be seen as repeated application of the successor function. Intuitively, is evaluated by applying the successor function to as many times as it must be applied to to produce . The algebraic structure (\mathbb{N}, +) is a commutative monoid with identity element 0. It is a free monoid on one generator. This commutative monoid satisfies the cancellation property, so it can be embedded in a group. The smallest group containing the natural numbers is the integers. Multiplication Analogously, given that addition has been defined, a multiplication operator \times can be defined via and . This turns (\mathbb{N}^*, \times) into a free commutative monoid with identity element 1; a generator set for this monoid is the set of prime numbers. Relationship between addition and multiplication Addition and multiplication are compatible, which is expressed in the distribution law: . These properties of addition and multiplication make the natural numbers an instance of a commutative semiring. Semirings are an algebraic generalization of the natural numbers where multiplication is not necessarily commutative. The lack of additive inverses, which is equivalent to the fact that \mathbb{N} is not closed under subtraction (that is, subtracting one natural from another does not always result in another natural), means that \mathbb{N} is not a ring; instead it is a semiring (also known as a rig). If the natural numbers are taken as "excluding 0", and "starting at 1", the definitions of + and × are as above, except that they begin with and . Furthermore, (\mathbb{N^*}, +) has no identity element. Order A total order on the natural numbers is defined by letting if and only if there exists another natural number where . This order is compatible with the arithmetical operations in the following sense: if , and are natural numbers and , then and . An important property of the natural numbers is that they are well-ordered: every non-empty set of natural numbers has a least element. The rank among well-ordered sets is expressed by an ordinal number; for the natural numbers, this is denoted as (omega). Division While it is in general not possible to divide one natural number by another and get a natural number as result, the procedure of division with remainder or Euclidean division is available as a substitute: for any two natural numbers and with there are natural numbers and such that :a = b \times q + r \text{ and } r The number is called the quotient and is called the remainder of the division of by . The numbers and are uniquely determined by and . This Euclidean division is key to the several other properties (divisibility), algorithms (such as the Euclidean algorithm), and ideas in number theory. Algebraic properties satisfied by the natural numbers The addition (+) and multiplication (×) operations on natural numbers as defined above have several algebraic properties: • Closure under addition and multiplication: for all natural numbers and , both and are natural numbers. • Associativity: for all natural numbers , , and , and . • Commutativity: for all natural numbers and , and . • Existence of identity elements: for every natural number , and . • If the natural numbers are taken as "excluding 0", and "starting at 1", then for every natural number , . However, the "existence of additive identity element" property is not satisfied • Distributivity of multiplication over addition for all natural numbers , , and , . • No nonzero zero divisors: if and are natural numbers such that , then or (or both). ==History==

For most of history, what are now called natural numbers were simply numbers. Between the late middle ages and end of the 17th century, the concept of number expanded to include negative, rational and irrational numbers, becoming what we now call the real numbers. With this came the need to distinguish between the original numbers and these new types. Nicolas Chuquet used the term progression naturelle (natural progression) in 1484. The earliest known use of "natural number" as a complete English phrase is in 1763. The 1771 Encyclopaedia Britannica defines natural numbers in the logarithm article. Leopold Kronecker summarized his belief as "God made the integers, all else is the work of man". The constructivists saw a need to improve upon the logical rigor in the foundations of mathematics. In the 1860s, Hermann Grassmann suggested a recursive definition for natural numbers, thus stating they were not really natural—but a consequence of definitions. Later, two classes of such formal definitions emerged, using set theory and Peano's axioms respectively. Later still, they were shown to be equivalent in most practical applications. Set-theoretical definitions of natural numbers were initiated by Frege. He initially defined a natural number as the class of all sets that are in one-to-one correspondence with a particular set. However, this definition turned out to lead to paradoxes, including Russell's paradox. To avoid such paradoxes, the formalism was modified so that a natural number is defined as a particular set, and any set that can be put into one-to-one correspondence with that set is said to have that number of elements. In 1881, Charles Sanders Peirce provided the first axiomatization of natural-number arithmetic. In 1888, Richard Dedekind proposed another axiomatization of natural-number arithmetic, and in 1889, Peano published a simplified version of Dedekind's axioms in his book The principles of arithmetic presented by a new method (). This approach is now called Peano arithmetic. It is based on an axiomatization of the properties of ordinal numbers: each natural number has a successor and every non-zero natural number has a unique predecessor. Peano arithmetic is equiconsistent with several weak systems of set theory. One such system is ZFC with the axiom of infinity replaced by its negation. Theorems that can be proved in ZFC but cannot be proved using the Peano Axioms include Goodstein's theorem. Zero as natural number Starting at 0 or 1 has long been a matter of convention. In 1727, Bernard Le Bovier de Fontenelle argued both ways, that 0 could be a term as in a sequence 0, 1, 2, ..., but that 1 was a basic element out of which other numbers could be formed by repeated addition. In 1889, Giuseppe Peano used N for the positive integers and started at 1, but he later changed to using N0 and N1. Most early authors excluded 0, but many mathematicians such as George A. Wentworth, Bertrand Russell, Nicolas Bourbaki, Paul Halmos, Stephen Cole Kleene, and John Horton Conway included 0. ==Generalizations==

The most common number systems used throughout mathematics are extensions of the natural numbers, in the sense that each of them contains a subset which has the same arithmetical structure. These number systems can also be formally defined in terms of natural numbers (though they need not be). If the difference of every two natural numbers is considered to be a number, the result is the integers, which include zero and negative numbers. If the quotient of every two integers is considered to be a number, the result is the rational numbers, including fractions. If every infinite decimal is considered to be a number, the result is the real numbers. If every solution of a polynomial equation is considered to be a number, the result is the complex numbers. Other generalizations of natural numbers are discussed in . ==See also==