examples of countable sets
This entry lists some common examples of countable sets.
Derived Examples
-
1.
any finite set, including the empty set (proof (http://planetmath.org/AlternativeDefinitionsOfCountable)).
-
2.
any subset of a countable set (proof (http://planetmath.org/SubsetsOfCountableSets)).
-
3.
any finite product of countable sets (proof (http://planetmath.org/UnionOfCountableSets)).
-
4.
any countable union of countable sets (proof (http://planetmath.org/ProductOfCountableSets)).
-
5.
the set of all finite subsets of a countable set.
Proof.
Let be a countable set, and the set of all finite subsets of . Let be the set of all subsets of of cardinality at most . Then is countable, since is. Suppose now that is countable. The function where is easily seen to be onto. Since is countable, so is . Now, is just the union of all the countable sets , and this union is a countable union, we see that is countable too. ∎
-
6.
the set of all cofinite subsets of a countable set. This is true, because there is a one-to-one correspondence between the set of finite sets and the set of cofinite sets: .
-
7.
the set of all finite sequences over a countable set.
Proof.
Let be a countable set, and the set of all finite sequences over . An element of can be identified with an element of , and vice versa (the bijection is clear). Therefore, can be identified with the union of , for . Since each is countable (because is), and we are taking a countable union, is countable as a result. ∎
-
8.
fix countable sets . The set of all functions from finite subsets of into is countable.
Proof.
For each finite subset of , the set of all functions from to is just , which has cardinality , and thus is countable since is. Since is just the union of all , where ranges over the finite subsets of , and there are countably many of them (as is countable), is also countable. ∎
-
9.
fix countable sets and an element . The set of all functions from to such that for all but a finite number of is countable.
Proof.
For any , call the support of the set , and denote it by . Then every has finite support. The map (where is defined in the last example) given by is an injection: if , then for any , and otherwise, whence . But since is countable, so is . ∎
Concrete Examples
-
1.
the sets (natural numbers), (integers), and (rational numbers)
-
2.
the set of all algebraic numbers
Proof.
Let be the set of all algebraic numbers over . For each polynomial (in one variable ) over , let be the set of roots of over . By definition, is the union of all , where ranges over the set of all polynomials over . For any of degree , we may associate a vector :
The association can be reversed. So the set of all polynomials of degree is equinumerous to , and therefore countable. As is just the countable union of all , is countable, which means is countable also. ∎
-
3.
the set of all algebraic integers, because every algebraic integer is an algebraic number.
-
4.
the set of all words over an alphabet, because ever word can be thought of as a finite sequence over the alphabet, which is finite.
Title | examples of countable sets |
---|---|
Canonical name | ExamplesOfCountableSets |
Date of creation | 2013-03-22 19:02:59 |
Last modified on | 2013-03-22 19:02:59 |
Owner | CWoo (3771) |
Last modified by | CWoo (3771) |
Numerical id | 10 |
Author | CWoo (3771) |
Entry type | Example |
Classification | msc 03E10 |
Related topic | AlgebraicNumbersAreCountable |