I've been stuck on this proof for quite a while. While I realize it is much easier to show using arcwise connectedness or pathwise connectedness, I would like to complete the proof without resorting to more powerful results. I do know that $\mathbb{R}$ is connected.
2026-03-29 17:27:36.1774805256
On
Prove that $\mathbb{R}^{n}-A$ with the standard topology is connected where $n \geq 2$ and $A \subset \mathbb{R}^{n}$ is countable.
221 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
1
On
Given two points $x$ and $y$ we find a path from $x$ to $y$ avoiding $A$. Consider perpendicular bisector of the segment form $x$ to $y$. For each point $z$ on this line take the straight line from $x$ to $z$ then the straight line from $z$ to $y$. As $z$ varied these paths are all disjoint. Since there are uncountablely many $z$ and $A$ is countable one of these paths will not contain any point for $A$.
Since you know that $\mathbb{R}$ is connected, let's use that.
The underlying idea will come from the following (pretty horrible) proof that $\mathbb{R}^2$ is connected. Just to set up some notation, given any $D \subseteq \mathbb{R}^2$ and $a,b \in \mathbb{R}$ I'll denote $$ D_{\langle a,- \rangle} := \{ y \in \mathbb{R} : \langle a,y \rangle \in D \}; \qquad D_{\langle -,b \rangle} := \{ x \in \mathbb{R} : \langle x,b \rangle \in D \}. $$
Now we'll modify the above to show that $X := \mathbb{R}^2 \setminus A$ is connected for countable $A \subseteq \mathbb{R}^2$. The trick will be to avoid the set $A$ in order to arrive at the same contradictory conclusion as above.
The basic idea can be extended (it won't be pretty, though) to show that $\mathbb{R}^n \setminus A$ is connected for all $n \geq 2$ and countable $A$.