Prove if $X$ is a compact metric space, then $X$ is separable.

27.3k Views Asked by At

Let $X$ be a metric space. Prove if $X$ is compact, then $X$ is separable.

  1. X separable $\iff X$ contains a countable dense subset.
  2. $E \subset X $ dense in $X \iff \overline{E} = X$.
  3. $X$ compact $\iff$ every open cover of $X$ admits a finite subcover.

one might also use that $X$ compact in a metric space implies closed and bounded.

Proof

We want to show $\exists E \subset X. X = \overline{E} = E \cup E'$ where $E'$ denotes the set of limit points. If $X$ is compact then a subset $E$ of $X$ would be compact, so that subset is closed and bounded. Since $E$ is closed, $E \supseteq E'$. Now we need to show that $E$ is a countable dense subset... But I don't know where to go from here. I have the following:

Hint: cover $X$ with neighborhoods of radius $\frac{1}{n}$ - so for every positive integer $n$, there are finitely many neighborhoods of radius $\frac{1}{n}$ whose union covers $X$. So maybe it would be better to work with the open cover definition of compact.

3

There are 3 best solutions below

7
On

Hint: For $\delta$, we see that $\{ B_{\delta}(x) : x \in X \}$ is an open cover of $X$. There is a finite subcover of this cover since $X$ is compact, so there is a finite set $E_\delta$ such that $\{B_\delta(x) : x \in E_\delta\}$ is an open cover of $X$. In particular, this means that for any $y \in X$, there exists a $x \in E_\delta$ such that $d(x,y) < \delta$.

Find a countable union of such $E_\delta$ to construct a dense subset of $X$.

2
On

What I think is an easier approach is to prove the stronger property that $X$ has a countable basis (using this hint about the covering $X$ with all open balls with a radius $1/n$ and then the existence of a countably dense subset of $X$ is a consequence of $X$ being second-countable (having a countable basis).

3
On

One approach is to prove that if $X$ is a compact metric space then $X$ is totally bounded. This means that for every $\varepsilon > 0$ there is a finite number, say $n(\varepsilon)$, of points, call them $x_1,\dots,x_{n(\varepsilon)}$, such that the balls $B_\varepsilon(x_1),\dots,B_\varepsilon(x_{n(\varepsilon)})$ cover $X$. This is actually quite simple to prove, because if $X$ is a compact metric space, then given $\varepsilon > 0$, the cover $\{ B_{\varepsilon}(x) : x \in X \}$ has a finite subcover of the desired form.

From there, cover $X$ with finitely many balls of radius $1$; extract the center of each. Now every point is within $1$ of a point in your (finite) set. Cover $X$ with finitely many balls of radius $1/2$; extract the center from each. Now every point is within $1/2$ of a point in your (still finite) set. Repeat for each $1/m$ for $m \in \mathbb{N}$ and take the countable union. A countable union of finite sets is countable, so you have your countable dense subset.