# Prove that $R^n \backslash C$ is connected for $n\geq 2$ and that it's simply connected if $n\geq 3$

Let $C$ be a compact subset of $R^n$ such that for all $\epsilon>0$ there exists a finite number of open balls $\{B_i\}$ that covers $C$ and $\sum_i r_i\leq \epsilon$, where $r_i$ is the radius of $B_i$. Prove that $R^n \backslash C$ is connected for $n\geq 2$ and that it's simply connected if $n\geq 3$.

-
What is the number $r_i$? –  Daniel Rust Aug 15 '13 at 9:38
$r_i$ is the radius of $B_i$. –  user62138 Aug 15 '13 at 9:39
The connectivity case $n\geq2$ follows directly from the classical Kuratowski theorem, implying that if $M\subset\mathbb{R}^{n}$ and $\dim M\leq n-2$, then $\mathbb{R}^{n}\backslash M$ is connected. Now, as $C$ is totally disconnected, $\dim C=0$ and we are done. –  simeon Aug 16 '13 at 16:03