Countable set

In mathematics the term countable set is used to describe the size of a set, e.g. the number of elements it contains. The notion of an infinite set is not elementary; it requires a strong sense of abstraction and precision, both from the beginning the distinguishing faculties of mathematicians.
A set is called countable if the number of elements is finite or if it has the same number of elements as the natural numbers. The term countable stems from the fact that the natural numbers are often called counting numbers. A set with more elements is called uncountable. Not all uncountable sets have the same size. The different sizes of infinite sets are investigated in the theory of cardinal numbers.
Definition
A set S is called countable if there exists an injective function
 <math>f\colon S \to \mathbb{N} <math>
If f is even bijective then S is called countably infinite or denumerable.
Terminology is not universal: some authors define denumerable to mean what we have called "countable"; some define countable to mean what we have called "countably infinite".
Gentle introduction
The elements of a finite set can be listed, say { a_{1}, a_{2}, ..., a_{n}}. However, not all sets are finite: for instance, the set of all integers or the set of all real numbers. It might then 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 is not tenable, however, under the natural definition of size.
To elaborate this we need the concept of a bijection. Do the sets { 1, 2, 3 } and { a, b, c } have the same size?
 "Obviously, yes."
 "How do you know?"
 "Well it's obvious. Look, they've both got 3 elements".
 "What's a 3?"
This may seem a strange situation but, although a "bijection" seems a more advanced concept than a "number", the usual development of mathematics in terms of set theory defines functions before numbers, as they are based on much simpler sets. This is where the concept of a bijection comes in: define the correspondence
 a ↔ 1, b ↔ 2, c ↔ 3
Since every element of { a, b, c } is paired with precisely one element of { 1, 2, 3 } (and vice versa) this defines a bijection.
We now generalise this situation and define two sets to be of the same size precisely when there is a bijection between them. For all finite sets this gives us the usual definition of "the same size". What does it tell us about the size of infinite sets?
Consider the sets A = { 1, 2, 3, ... }, the set of positive integers and B = {2,4,6,...}, the set of even positive integers. We claim that, under our definition, these sets have the same size, and that therefore B is countably infinite. Recall that to prove this we need to exhibit a bijection between them. But this is easy: 1 ↔ 2, 2 ↔ 4, 3 ↔ 6, 4 ↔ 8, ...
As in the earlier example every element of A has been paired off with precisely one element of B, and vice versa. Hence they have the same size. This gives an example of a set which is of the same size as one of its proper subsets, a situation which is impossible for finite sets.
Likewise, the set of all ordered pairs of natural numbers is countably infinite, as can be seen by following a path like this one:
 <math>\begin{matrix}
(0,0) & \rightarrow & (0,1) & & (0,2) & \rightarrow & (0,3) & \\
& \swarrow & & \nearrow & & \swarrow & & \\
(1,0) & & (1,1) & & (1,2) & & \ddots & \\ \downarrow & \nearrow & & \swarrow & & & & \\ (2,0) & & (2,1) & & \ddots & & & \\
& \swarrow & & & & & & \\
(3,0) & & \ddots & & & & & \\ \downarrow & & & & & & & \\ \vdots & & & & & & & \end{matrix}<math>
The resulting mapping is like this: 0 ↔ (0,0), 1 ↔ (0,1), 2 ↔ (1,0), 3 ↔ (2,0), 4 ↔ (1,1), 5 ↔ (0,2), … It is evident that this mapping will cover all such ordered pairs.
THEOREM: The Cartesian product of finitely many countable sets is countable.
This triangular mapping recursively generalizes to vectors of finitely many natural numbers by repeatedly mapping the first two elements to a natural number. For example, (2,0,3) maps to (5,3) which maps to 41.
Sometimes it is useful to use more than one mapping. This is where you map the set you want to show as countably infinite to another set. You then map this other set to the natural numbers. For example, the positive rational numbers can easily be mapped to (a subset of) the pairs of natural numbers through p/q maps to (p,q).
What about infinite subsets of countably infinite sets? Do these have less elements than N?
THEOREM: Every subset of a countable set is countable. In particular, every infinite subset of a countably infinite set is countably infinite.
For example, the set of prime numbers is countable, by mapping the nth prime number to n:
 2 maps to 1
 3 maps to 2
 5 maps to 3
 7 maps to 4
 11 maps to 5
 13 maps to 6
 17 maps to 7
 19 maps to 8
 23 maps to 9
 etc.
What about sets being "larger than" N? An obvious place to look would be Q, the set of all rational numbers, which is "clearly" much bigger than N. But looks can be deceiving, for we assert
THEOREM: Q (the set of all rational numbers) is countable.
Q can be defined as the set of all fractions a/b where a and b are integers and b > 0. This can be mapped onto the subset of ordered triples of natural numbers (a, b, c) such that b > 0, a and b are coprime, and c ∈ {0, 1}, and if a = 0 then c = 0.
 0 maps to (0,1,0)
 1 maps to (1,1,0)
 −1 maps to (1,1,1)
 1/2 maps to (1,2,0)
 −1/2 maps to (1,2,1)
 2 maps to (2,1,0)
 −2 maps to (2,1,1)
 1/3 maps to (1,3,0)
 −1/3 maps to (1,3,1)
 3 maps to (3,1,0)
 −3 maps to (3,1,1)
 1/4 maps to (1,4,0)
 −1/4 maps to (1,4,1)
 2/3 maps to (2,3,0)
 −2/3 maps to (2,3,1)
 3/2 maps to (3,2,0)
 −3/2 maps to (3,2,1)
 4 maps to (4,1,0)
 −4 maps to (4,1,1)
 ...
By a similar development, the set of algebraic numbers is countable, and so is the set of definable numbers.
THEOREM: (Assuming the Axiom of Choice) The union of countably many countable sets is countable.
For example, given countable sets a, b, c ...
Using a variant of the triangular enumeration we saw above:
 a_{0} maps to 0
 a_{1} maps to 1
 b_{0} maps to 2
 a_{2} maps to 3
 b_{1} maps to 4
 c_{0} maps to 5
 a_{3} maps to 6
 b_{2} maps to 7
 c_{1} maps to 8
 d_{0} maps to 9
 a_{4} maps to 10
 ...
Note that this only works if the sets a, b, c,... are disjoint. If not, then the union is even smaller and is therefore also countable by a previous theorem.
THEOREM: The set of all finitelength sequences of natural numbers is countable.
This set is the union of the length1 sequences, the length2 sequences, the length3 sequences, each of which is a countable set (finite Cartesian product). So we are talking about a countable union of countable sets, which is countable by the previous theorem.
THEOREM: The set of all finite subsets of the natural numbers is countable.
If you have a finite subset, you can order the elements to get a finite sequence. There are only countably many finite sequences, so there are also only countably many finite subsets.
Further theorems about uncountable sets:
 The set of real numbers is uncountable, and so is the set of all sequences of natural numbers and the set of all subsets of N (see Cantor's diagonal argument).
See also
de:Abzählbarkeit fr:Ensemble dénombrable is:Teljanlegt mengi it:Insieme numerabile he:קבוצה בת מניה nl:Aftelbare verzameling ja:可算無限集合 no:Tellbar pl:Zbiór przeliczalny ru:Счётное множество sv:Uppräknelig zh:可數集