Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

I'm trying to show that if $A$ is a countable subset of $\mathbb{R}^{2}$ then $\mathbb{R}^{2}\backslash A$ is path connected. I already have the idea of the proof. It is clear to me that for every two points in the plane there is an uncountable collection of paths between them that intersect only at the edges. Thus given two points not in $A$ since $A$ is countable it is impossible that all these paths intersect $A$. Thus for every two points in $\mathbb{R}^{2}\backslash A$ there is path between them that doesn't intersect $A$

What I want is an explicit construction of such a collection of paths given two points $\left(x_{1},y_{1}\right),\left(x_{2},y_{2}\right)\in\mathbb{R}^{2}$. Help would be appreciated.

share|cite|improve this question

marked as duplicate by Asaf Karagila, Brian M. Scott, Serpahimz, Start wearing purple, Martin Jun 25 '13 at 10:28

This question was marked as an exact duplicate of an existing question.

I think this was answered before. – Asaf Karagila Jun 25 '13 at 9:58
Thanks Asaf. I did do a search for "countable path connected" but I didn't look into that first post since it wasn't marked as answered :( From all the posts you referred to only the first one (which isn't marked answered) offers an explicit construction by the way. – Serpahimz Jun 25 '13 at 10:07
@Serpahimz: It’s no more constructive than the argument suggested in my hint for the second one: in one you have to pick a point on a specific line in such a way that two line segments miss $A$, and in the other you have to pick two angles to accomplish the same end. Neither can be made constructive unless you have a precise description of $A$. – Brian M. Scott Jun 25 '13 at 19:00