Countable set

From Citizendium
Revision as of 18:11, 12 June 2009 by imported>Peter Schmitt (→‎Union of to countable sets: editing)
Jump to navigation Jump to search
This article has a Citable Version.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article has an approved citable version (see its Citable Version subpage). While we have done conscientious work, we cannot guarantee that this Main Article, or its citable version, is wholly free of mistakes. By helping to improve this editable Main Article, you will help the process of generating a new, improved citable version.

In mathematics, a set is said to be countable if its elements can be "numbered" using the natural numbers. More precisely, this means that there exists a one-to-one mapping from set to the set of natural numbers.

A countable set is either finite or countably infinite. A set which is not countable is called uncountable.

Any subset of a countable set is countable.
The image of a countable set (under any function) is a countable set.
The countable union (i.e., the union of a countable family) of countable sets is countable.
The Cartesian product of finitely many countable sets is countable.

Examples of countably infinite sets

Integers

The set of integers is countable (countably infinite). Indeed, the function

is a one-to-one correspondence between all natural numbers and all integers:

n 0 1 2 3 4 5
f(n) 0 -1 1 -2 2 -3

Union of to countable sets

The union of the set of natural numbers and any finite set is countable. For instance, given the finite set

of n elements, the function

shows that is countable.

More generally, consider two countably infinite sets:

and

then

is a one-to-one correspondence between and . (Note that this is the same method as in the example of the integers: Let A be the positive integers and B be the negative integers.)
This situation is addressed in the example of Hilbert's hotel.

Rational numbers

In fact, the union of an enumerable number of enumerable sets is still enumerable. Suppose we have a collection of sets . Then we can create a bijection between the whole numbers and all the elements of all the as follows:

Notice that this concept is used in the proof of the enumerability of the rational numbers, given below. e set of rational numbers is an enumerable set. Envision a table which contains all rational numbers (below). One can make a function that dovetails back and forth across the entire area of the table. This function enumerates all rational numbers.

Table of all rational numbers
0 1 2
1
2
3

Counterexamples

An uncountable set is one which is not countable. One example is the set of real numbers is not enumerable, which we will prove by contradiction. Suppose you had an infinitely long list of all real numbers (below), in no particular order, expressed in decimal notation. This table, itself, is an enumeration function. We demonstrate the absurdity of such a list by finding a number which is not in the list.

Enumeration of all real numbers
Order Real Number
0 0.32847...
1 0.48284...
2 0.89438...
3 0.00154...
4 0.32425...
... ...

Specifically, we construct a number which differs from each real number by at least one digit, using this procedure: If the ith digit after the decimal place in the ith number in the list is a five, then our constructed number will have a four in the ith place, otherwise a five. From our example list, we would construct the number 0.55544... By construction, this number is a real number, but not in our list. As a result, the enumeration function is not onto.

This is known as Cantor's diagonalization argument. It is important to note that this argument assumes that two different decimal notations represent two different numbers. This is generally true, with one notable exception. Any digit followed by an infinite series of nines is equivalent to the same digit, increased by one, followed by an infinite series of zeros. For example, 0.3999… is equivalent to 0.4000…. This argument converts individual digits to either fours or fives, thereby avoiding any complications that could arise from this detail.