A natural number is traditionally one of the numbers , , , and so on. It is now common in many fields of mathematics to include as a natural number as well. One advantage of doing so is that a natural number can then be identified with the cardinality of a finite set, as well as a finite ordinal number. One can distinguish these as the nonnegative integers (with ) and the positive integers (without ), 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 ).
The set of natural numbers is often written , , , , or . The last two notations refer to this set's structure as an ordinal number or cardinal number respectively, and they often (usually for ) have a subscript 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). At a foundational level, it's completely irrelevant whether counts as a natural number or not; as sets (and even as natural numbers objects), the two options are equivalent, so we are really talking about the choice of rig structure (or inclusion map into the set of integers, etc).
is a natural numbers object in Set; indeed, it is the original example. This consists of an initial element (or if is not used) and a successor operation (or simply ; in computer science, one often writes ) such that, for a set , an element , and a function , there exists a unique function such that and . This function is said to be constructed by primitive recursion. (Fancier forms of recursion are also possible.)
The basic idea is that we define the values of one by one, starting with , then , , 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.
(a Brouwerian counterexample)
If any inhabited subset of the natural numbers possesses a minimal element, then the law of excluded middle holds.
Let be an arbitrary arithmetical formula. Then the subset
is inhabited. By assumption, it possesses a minimal element . By discreteness of the natural numbers, either or . In the first case, holds. In the second case, holds.
In this sense, the natural numbers are not complete, and it’s fruitful to study their completion: For instance, the global sections of the completed natural numbers object in the sheaf topos on a topological space are in one-to-one correspondence with upper semicontinuous functions (details at one-sided real number).
We can salvage the minimum principle in two ways:
Any detachable inhabited subset of the natural numbers possesses a minimal element.
Any inhabited subset of the natural numbers does not not possess a minimal element.
For instance, any finitely generated vector space over a residue field does not not possess a finite basis (pick a minimal generating set, guaranteed to not not exist). Interpreting this in the internal language of the sheaf topos of a reduced scheme , one obtains the well-known fact that any -module locally of finite type over is locally free on a dense open subset.
Classically, any weakly decreasing sequence of natural numbers is eventually constant, i.e. admits an index such that . Constructively, one can only prove that there exists an index such that (by induction on ); the classical principle is equivalent to the limited principle of omniscience for .
This is relevant to constructive algebra, as this shows that formulating chain conditions needs some care.