Countability (Mathematics)

From Conservapedia
Jump to: navigation, search
While some details remain, such as eliminating reducible fractions, this picture shows the idea behind a numbering of all fractions.

In mathematics, a set is called countable if it can be numbered in such a way that every element will eventually receive a unique number.

Georg Cantor developed the concept of countability—and lack of countability—in the late 19th century.

Examples of Countable Sets

Obviously, the numbers 1, 2, 3, etc., are countable, but so are all the integers: 0 we call first, 1, second, -1, third, 2, fourth, -2, fifth, 3, sixth, and so on, going outwards. We're sure to hit every integer this way.

Somewhat surprisingly, the rational numbers, also called fractions, are countable as well. See the picture, right.

Examples of Uncountable Sets

The real numbers are not countable, nor is any set with positive Lebesgue measure. This is because any countable set of numbers can be completely contained within a set of arbitrarily small measure. A short proof follows:

Let be a countable set, and let be some arbitrarily small number. Construct the interval .

Obviously, is contained in this interval, and this interval has length .

But around , we can construct the interval , around , and in general, around , we can construct .

The sum of all these lengths will be , but remember, was chosen to be arbitrarily small, and so a countable set can be contained in a set of arbitrarily small measure.

Since the real numbers, or any set of positive measure, cannot, they must not be countable.