|
|
Recall the definition of being dense, i.e. $E \subset A$ is dense in $A$ if $\overline E = A$, or in other words, that every point of $A$ is the limit of some convergent sequence from which the elements come from $E$. Again, in other words,
$$
\forall x \in A,\quad \exists \{x_n \} \subset E \quad s.t. \quad x_n \to x.
$$
Note that the subset $E \subseteq S^1$ is dense if and only if under the map $\varphi : \mathbb R / \mathbb Z \to S^1$ which sends $x \mapsto e^{2i\pi x}$ (which is a bijection), $\varphi^{-1}(E)$ is dense in $\mathbb R / \mathbb Z$. Also note that a reformulation of this is that a subset $F$ of $\mathbb R / \mathbb Z$ is dense in $\mathbb R / \mathbb Z$ if and only if its image $\varphi(F)$ is dense in $S^1$. What will be useful to understand this is that your map $\varphi$ is an homeomorphism, i.e. continuous with an inverse that is also continuous, so that you can map back and forth limits of convergent sequences.
Now that you know this, try to show that a subset $E$ of $\mathbb R / \mathbb Z$ is dense in $\mathbb R / \mathbb Z$ if and only if the set $E + \mathbb Z = \{ x + n \, | \, \overline x \in E \text{ and } x \in [0,1[, n \in \mathbb Z \}$ is dense in $\mathbb R$. (Note that you need to take care of the fact that by defining this set you're "undoing a quotient".)
All of this being done, all you need is a dense subset of $\mathbb R$. Your favorite seems to be $\{ m + n \sqrt 2 \}$, but my favorite is definitely $\mathbb Q$. You want a discrete set? Fine... just spread them all over the place. What I mean by that is this : find a sequence that order the elements of $]0,1[ \, \cap \, \mathbb Q$ (for instance, $\frac 12, \frac 13, \frac 23, \frac 14, \frac 34, \dots$ could be one way to do this ; call them $x_1, x_2, x_3, \dots$). Consider the set $E = \{ x_n + n \, | \, n \in \mathbb N \} \cup \{0\}$. This is clearly a discrete set, and when you look at it in $\mathbb R / \mathbb Z$, you obtain $\mathbb Q / \mathbb Z$. Therefore its image $\varphi(E)$ is dense in $S^1$.
Hope that helps,
|
|
answered
Apr 25 '12 at 7:53
|
|