Countable set

Although the terms "countable" and "countably infinite" as defined here are quite common, the terminology is not universal. An alternative style uses countable to mean what is here called countably infinite, and at most countable to mean what is here called countable. The terms enumerable and denumerable may also be used, e.g. referring to countable and countably infinite respectively, definitions vary and care is needed respecting the difference with recursively enumerable. ==Definition==

A set S is countable if: • Its cardinality |S| is less than or equal to \aleph_0 (aleph-null), the cardinality of the set of natural numbers \N. • S is empty or there exists a surjective function from \N to S. • S is either finite (|S|) or countably infinite. • The elements of S can be arranged in an infinite sequence a_0, a_1, a_2, \ldots, where a_i is distinct from a_j for i\neq j and every element of S is listed. A set is uncountable if it is not countable, i.e. its cardinality is strictly greater than \aleph_0. That us, there is an injection from \N to S, but no injection from S to \N. In models where the axiom of choice fails, there might also be sets which are incomparable to \N, the so-called Dedekind finite infinite sets. ==History==

In 1874, in his first set theory article, Cantor proved that the set of real numbers is uncountable, thus showing that not all infinite sets are countable. In 1878, he used one-to-one correspondences to define and compare cardinalities. In 1883, he extended the natural numbers with his infinite ordinals, and used sets of ordinals to produce an infinity of sets having different infinite cardinalities. ==Introduction==

A set is a collection of elements, and may be described in many ways. One way is simply to list all of its elements; for example, the set consisting of the integers 3, 4, and 5 may be denoted \{3, 4, 5\}, called roster form. This is only effective for small sets, however; for larger sets, this would be time-consuming and error-prone. Instead of listing every single element, sometimes an ellipsis ("...") is used to represent many elements between the starting element and the end element in a set, if the writer believes that the reader can easily guess what "..." represents; for example, \{1, 2, 3, \dots, 100\} presumably denotes the set of integers from 1 to 100. Even in this case, however, it is still possible to list all the elements, because the number of elements in the set is finite. If we number the elements of the set 1, 2, and so on, up to n, this gives us the usual definition of "sets of size n". Some sets are infinite; these sets have more than n elements where n is any integer that can be specified. (No matter how large the specified integer n is, such as n=10^{1000}, infinite sets have more than n elements.) For example, the set of natural numbers, denotable by \{0, 1, 2, 3, 4, 5,\dots\},{{efn|name=ZeroN|Since there is an obvious bijection between \N and \N^*=\{1,2,3,\dots\}, it makes no difference whether one considers 0 a natural number or not. In any case, this article follows ISO 31-11 and the standard convention in mathematical logic, which takes 0 as a natural number.}} has infinitely many elements, and we cannot use any natural number to give its size. It might seem natural to divide the sets into different classes: put all the sets containing one element together; all the sets containing two elements together; ...; finally, put together all infinite sets and consider them as having the same size. This view works well for countably infinite sets and was the prevailing assumption before Georg Cantor's work. For example, there are infinitely many odd integers, infinitely many even integers, and also infinitely many integers overall. We can consider all these sets to have the same "size" because we can arrange things such that, for every integer, there is a distinct even integer: \ldots \, -\! 2\! \rightarrow \! - \! 4, \, -\! 1\! \rightarrow \! - \! 2, \, 0\! \rightarrow \! 0, \, 1\! \rightarrow \! 2, \, 2\! \rightarrow \! 4 \, \cdots or, more generally, n \rightarrow 2n (see picture). What we have done here is arrange the integers and the even integers into a one-to-one correspondence (or bijection), which is a function that maps between two sets such that each element of each set corresponds to a single element in the other set. This mathematical notion of "size", cardinality, is that two sets are of the same size if and only if there is a bijection between them. We call all sets that are in one-to-one correspondence with the integers countably infinite and say they have cardinality \aleph_0. Georg Cantor showed that not all infinite sets are countably infinite. For example, the real numbers cannot be put into one-to-one correspondence with the natural numbers (non-negative integers). The set of real numbers has a greater cardinality than the set of natural numbers and is said to be uncountable. Cantor's diagonal argument, provides the formal proof by using a ad absurdum strategy. It begin with the assumption that the set of real numbers within the interval (0,1) is countable. If this were true, every real number in that range could be arranged into a sequential list (s1,s2,s3, ...) where each number is represented as an infinite decimal expansion. This structured list is the basis for constructing a specific real number that is logically guaranteed to be missing from the sequence, thereby invalidating the initial premise of countability. The contradiction is formed when defining this new real number, x, where each n-th decimal digit is chosen specifically to differ from the n-th digit of the n-th number in the list. By ensuring each digit x_n is not equal to d_n (while avoiding 0 or 9 to prevent ambiguities with repeating decimals), the resulting number x is distinct from every element in the sequence by at least one decimal place. Since x is a real number between 0 and 1 that does not appear in the assumed to complete list, it follows that bijection cannot exist between the natural numbers and the real numbers. ==Formal overview==

By definition, a set S is countable if there exists a bijection between S and a subset of the natural numbers \N=\{0,1,2,\dots\}. For example, define the correspondence a \leftrightarrow 1,\ b \leftrightarrow 2,\ c \leftrightarrow 3 Since every element of S=\{a,b,c\} is paired with precisely one element of \{1,2,3\}, and vice versa, this defines a bijection, and shows that S is countable. Similarly we can show all finite sets to be countable. As for the case of infinite sets, a set S is countably infinite if there is a bijection between S and all of \N. As examples, consider the sets A=\{1,2,3,\dots\}, the set of positive integers, and B=\{0,2,4,6,\dots\}, the set of even integers. We can show these sets are countably infinite by exhibiting a bijection to the natural numbers. This can be achieved using the assignments n \leftrightarrow n+1 and n \leftrightarrow 2n, so that \begin{matrix} 0 \leftrightarrow 1, & 1 \leftrightarrow 2, & 2 \leftrightarrow 3, & 3 \leftrightarrow 4, & 4 \leftrightarrow 5, & \ldots \\[6pt] 0 \leftrightarrow 0, & 1 \leftrightarrow 2, & 2 \leftrightarrow 4, & 3 \leftrightarrow 6, & 4 \leftrightarrow 8, & \ldots \end{matrix} Every countably infinite set is countable, and every infinite countable set is countably infinite. Furthermore, any subset of the natural numbers is countable, and more generally: The set of all ordered pairs of natural numbers (the Cartesian product of two sets of natural numbers, \N\times\N) is countably infinite, as can be seen by following a path like the one in the picture: assigns one natural number (blue) to each pair of natural numbers (horizontal,vertical coordinates). The resulting mapping proceeds as follows: 0 \leftrightarrow (0, 0), 1 \leftrightarrow (1, 0), 2 \leftrightarrow (0, 1), 3 \leftrightarrow (2, 0), 4 \leftrightarrow (1, 1), 5 \leftrightarrow (0, 2), 6 \leftrightarrow (3, 0), \ldots This mapping covers all such ordered pairs. This form of triangular mapping recursively generalizes to n-tuples of natural numbers, i.e., (a_1,a_2,a_3,\dots,a_n) where a_i and n are natural numbers, by repeatedly mapping the first two elements of an n-tuple to a natural number. For example, (0, 2, 3) can be written as ((0, 2), 3). Then (0, 2) maps to 5 so ((0, 2), 3) maps to (5, 3), then (5, 3) maps to 39. Since a different 2-tuple, that is a pair such as (a,b), maps to a different natural number, a difference between two n-tuples by a single element is enough to ensure the n-tuples being mapped to different natural numbers. So, an injection from the set of n-tuples to the set of natural numbers \N is proved. For the set of n-tuples made by the Cartesian product of finitely many different sets, each element in each tuple has the correspondence to a natural number, so every tuple can be written in natural numbers then the same logic is applied to prove the theorem. }} The set of all integers \Z and the set of all rational numbers \Q may intuitively seem much bigger than \N. But looks can be deceiving. If a pair is treated as the numerator and denominator of a vulgar fraction (a fraction in the form of a/b where a and b\neq 0 are integers), then for every positive fraction, we can come up with a distinct natural number corresponding to it. This representation also includes the natural numbers, since every natural number n is also a fraction n/1. So we can conclude that there are exactly as many positive rational numbers as there are positive integers. This is also true for all rational numbers, as can be seen below. In a similar manner, the set of algebraic numbers is countable.{{efn|1=Proof: Per definition, every algebraic number (including complex numbers) is a root of a polynomial with integer coefficients. Given an algebraic number \alpha, let a_0x^0 + a_1 x^1 + a_2 x^2 + \cdots + a_n x^n be a polynomial with integer coefficients such that \alpha is the k-th root of the polynomial, where the roots are sorted by absolute value from small to big, then sorted by argument from small to big. We can define an injection (i. e. one-to-one) function f:\mathbb{A}\to\Q given by f(\alpha) = 2^{k-1} \cdot 3^{a_0} \cdot 5^{a_1} \cdot 7^{a_2} \cdots {p_{n+2}}^{a_n}, where p_n is the n-th prime.}} Sometimes more than one mapping is useful: if a set A to be shown as countable is one-to-one mapped (injection) to another set B, then A is proved as countable if B is one-to-one mapped to the set of natural numbers. For example, the set of positive rational numbers can easily be one-to-one mapped to the set of natural number pairs (2-tuples) because p/q maps to (p,q). Since the set of natural number pairs is one-to-one mapped (actually one-to-one correspondence or bijection) to the set of natural numbers as shown above, the positive rational number set is proved as countable. {{math theorem G : I \times \mathbf{N} \to \bigcup_{i \in I} A_i, given by G(i,m)=g_i(m) is a surjection. Since I\times \N is countable, the union \bigcup_{i \in I} A_i is countable. }} }} With the foresight of knowing that there are uncountable sets, we can wonder whether or not this last result can be pushed any further. The answer is "yes" and "no", we can extend it, but we need to assume a new axiom to do so. For example, given countable sets \textbf{a},\textbf{b},\textbf{c},\dots, we first assign each element of each set a tuple, then we assign each tuple an index using a variant of the triangular enumeration we saw above: \begin{array}{ c|c|c } \text{Index} & \text{Tuple} & \text {Element} \\ \hline 0 & (0,0) & \textbf{a}_0 \\ 1 & (0,1) & \textbf{a}_1 \\ 2 & (1,0) & \textbf{b}_0 \\ 3 & (0,2) & \textbf{a}_2 \\ 4 & (1,1) & \textbf{b}_1 \\ 5 & (2,0) & \textbf{c}_0 \\ 6 & (0,3) & \textbf{a}_3 \\ 7 & (1,2) & \textbf{b}_2 \\ 8 & (2,1) & \textbf{c}_1 \\ 9 & (3,0) & \textbf{d}_0 \\ 10 & (0,4) & \textbf{a}_4 \\ \vdots & & \end{array} We need the axiom of countable choice to index all the sets \textbf{a},\textbf{b},\textbf{c},\dots simultaneously. This set is the union of the length-1 sequences, the length-2 sequences, the length-3 sequences, and so on, each of which is a countable set (finite Cartesian product). Thus the set is a countable union of countable sets, which is countable by the previous theorem. The elements of any finite subset can be ordered into a finite sequence. There are only countably many finite sequences, so also there are only countably many finite subsets. These follow from the definitions of countable set as injective / surjective functions. '''Cantor's theorem''' asserts that if A is a set and \mathcal{P}(A) is its power set, i.e. the set of all subsets of A, then there is no surjective function from A to \mathcal{P}(A). A proof is given in the article Cantor's theorem. As an immediate consequence of this and the Basic Theorem above we have: For an elaboration of this result see Cantor's diagonal argument. The set of real numbers is uncountable, and so is the set of all infinite sequences of natural numbers. ==Minimal model of set theory is countable==

If there is a set that is a standard model (see inner model) of ZFC set theory, then there is a minimal standard model (see Constructible universe). The Löwenheim–Skolem theorem can be used to show that this minimal model is countable. The fact that the notion of "uncountability" makes sense even in this model, and in particular that this model M contains elements that are: • subsets of M, hence countable, • but uncountable from the point of view of M, was seen as paradoxical in the early days of set theory; see Skolem's paradox for more. The minimal standard model includes all the algebraic numbers and all effectively computable transcendental numbers, as well as many other kinds of numbers. ==Total orders==

Countable sets can be totally ordered in various ways, for example: • Well-orders (see also ordinal number): • The usual order of natural numbers (0, 1, 2, 3, 4, 5, ...) • The integers in the order (0, 1, 2, 3, ...; −1, −2, −3, ...) • Other (not well orders): • The usual order of integers (..., −3, −2, −1, 0, 1, 2, 3, ...) • The usual order of rational numbers (Cannot be explicitly written as an ordered list!) In both examples of well orders here, any subset has a least element; and in both examples of non-well orders, some subsets do not have a least element. This is the key definition that determines whether a total order is also a well order. ==See also==