I am reading the book General Topology by Stephen Willard and I have seen the theorem
Every compact metric space is a continuous image of the Cantor set.
The book also presents its proof. The proof is very lengthy and I am struggling to understand it. Could someone provide an outline of the general structure of the proof?
The essential property is that given a compact metric space $X$ and $r>0$ there is a finite number of balls covering $X$. Let $0<\lambda<1$ and make the simplifying assumption that $X$ may be covered by two closed balls $B_0$ and $B_1$ of size 1. Then assume (again for simplicity) that each of $\Lambda_0=B_0$ and $\Lambda_1=B_1$ (both are compact since closed) may be covered by two closed balls $B_{00}, B_{01}$ and $B_{10},B_{11}$, respectively, of size $\lambda^1$. We set $\Lambda_{i_1i_2}= B_{i_1}\cap B_{i_1i_2}$. Proceeding inductively we assume that $$\Lambda_{i_1...i_{n-1}}=B_{i_1}\cap ...\cap B_{i_1 ... i_n}$$ is non-empty (finite intersection property, FIP) and may be covered by two closed balls $B_{i_1...i_{n}0}$ and $B_{i_1...i_n 1}$ of radius $\lambda^n$.
If all this is possible then for every infinite sequence $s=(i_1i_2...)\in \Sigma =\{0,1\}^{\mathbb N}$ there is a unique intersection point $$\{\phi(s)\}=\cap_n \Lambda_{i_1... i_n} $$ (this follows from compactness and the FIP). The map $\phi: \Sigma \rightarrow X$ is continuous for the weak topology on $\Sigma$ (simply because the balls are shrinking). It is surjective since given $x\in X$ for each $n$ the set $$F_n(x)=\{ (i_1,i_2,...)\in \Sigma: x\in \Lambda_{i_1,...,i_n}\}$$ is a shrinking sequence of compact non-empty subsets of $\Sigma$. Again from compactness, but this time of $\Sigma$, the intersection $F(x)=\cap F_n(x)$ is non-empty and $\phi(s)=x$ for each $s\in F(x)$. So $X$ is the continuous image of the Cantor set $\Sigma\ $ (if you agree to this being a representation of a Cantor set?). In general the map is not bijective.
Difficulties arise because you may need more than two balls in each step of refinement (so you have to use trunks of symbols). Also some of the sets $\Lambda_{i_1...i_n}$ may suddenly turn out to be empty. So you need to decide what to do then. Hope nevertheless that the above may give an idea ? Obviously the answer ressembles previous ones already given...