Show That the Stone–Čech Compactification βℤ Is Not Metrizable
At a glance
- 1. Use discrete subsets
Every subset of discrete ℤ has a continuous characteristic function with values in {0,1}.
- 2. Extend to βℤ
The Stone–Čech property extends each characteristic function continuously to the compactification.
- 3. Count clopen sets
Distinct subsets of ℤ give distinct clopen subsets of βℤ, so there are uncountably many.
- 4. Compare with metric spaces
A compact metric space has a countable base and therefore only countably many clopen subsets.
Assume that has the discrete topology, as is standard when writing . The key is to compare the number of clopen subsets of with the number possible in a compact metric space. The Stone–Čech extension property gives far too many clopen sets for it to be metrizable.
The key idea
For every subset of , its characteristic function
is continuous from discrete to the two-point discrete space . By the defining extension property of the Stone–Čech compactification, this function extends to a continuous function .
The inverse image is clopen: is both open and closed in , and continuous inverse images preserve both properties. Moreover, this clopen set intersects exactly in , because the extension agrees with on . Thus different subsets give different clopen subsets of .
There are uncountably many subsets of . So has uncountably many clopen subsets.
Why a compact metric space has only countably many clopen sets
Every compact metric space is second countable: it has a countable base of open sets. Let be any clopen subset. It is compact, since it is closed in a compact space. For each point of , choose a basis element containing that point and contained in . These basis elements cover . Compactness gives a finite subcover, so is a finite union of elements of .
There are only countably many finite collections of elements of a countable base. Hence there can be only countably many such finite unions, and therefore only countably many clopen subsets.
This applies to any compact metric space, not just to . If were metrizable, its compactness would force it to have only countably many clopen subsets. The extension argument shows it has uncountably many. The contradiction proves that is not metrizable.
A concrete example
Take to be the even integers. The function that is 1 on even integers and 0 on odd integers extends continuously from to . The inverse image of under that extension is a clopen subset of whose intersection with the embedded copy of is precisely the even integers.
Now do the same for the odd integers, or for any other subset, such as the multiples of 3. The resulting clopen subsets are distinct whenever the original subsets of are distinct: their intersections with differ. This illustrates how every subset—not only familiar arithmetic subsets—produces a separate clopen set.
Common mistakes
- Using uncountability of alone. An uncountable compact metric space can exist; for example, the interval is one. The contradiction requires the stronger fact that has uncountably many clopen subsets.
- Assuming a countable dense subset rules out metrizability. It does not. Compact metric spaces are separable, and some have countable dense subsets. The fact that is countable and dense in is not enough to settle the question.
- Forgetting the topology on . The argument uses the discrete topology, which makes every characteristic function continuous. conventionally denotes the Stone–Čech compactification of with this topology.
- Treating the extension as automatically a -valued function without justification. The extension property can be applied directly with as its compact Hausdorff target. Its extension therefore takes values in , so the inverse image used above is clopen.
The proof depends only on the extension property and the countability of a metric space’s base. The same argument works for the Stone–Čech compactification of any infinite discrete space : every subset of yields a distinct clopen subset of , so is not metrizable.
References
- General Topology — John L. Kelley
- Rings of Continuous Functions — Leonard Gillman and Meyer Jerison
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.