Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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$.

share|cite|improve this question
What is the number $r_i$? – Dan Rust Aug 15 '13 at 9:38
$r_i$ is the radius of $B_i$. – user62138 Aug 15 '13 at 9:39

hint: prove first that C is totally disconnected, then try to prove directly or make use of Alexander duality theorem.

share|cite|improve this answer
Alexander duality will not suffice to establish simple connectivity. Otherwise, it is a good hint. – studiosus Aug 15 '13 at 23:44
Can I do it without Alexander duality theorem? – user62138 Aug 16 '13 at 11:16
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
@simeon: Do you mean the Kuratowski theorem on planar graphs. I don't find the relation with that. – user62138 Aug 19 '13 at 6:58

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.