Finding accumulation points of ##S=\{\frac{1}{n}+\frac{1}{m}\}##

  • Thread starter Thread starter mahler1
  • Start date Start date
  • Tags Tags
    Points
mahler1
Messages
217
Reaction score
0
Homework Statement .
Let ##S==\{\frac{1}{n}+\frac{1}{m}, n,m \in \mathbb N\}##, find all the accumulation points of ##S## and decide whether ##S## is compact or not. The attempt at a solution.

I've found that the points of the form ##\frac{1}{n}## and ##0## are accumulation points. For the first, given ##ε>0##, take the point ##\frac{1}{n}+\frac{1}{m}## such that ##m>\frac{1}{ε}##.
Then, ##|\frac{1}{n}-(\frac{1}{n}+\frac{1}{m})|=|\frac{1}{m})|<ε##. To prove ##0## is an accumulation point, given ##ε>0##, take ##n: n>\frac{1}{ε} \implies \frac{1}{n}<ε##.

How can I prove that these are the only accumulation points of ##S##?

For compactness, by the Heine Borel theorem, ##S## is compact ##\iff## ##S## is closed and bounded. But ##0 \in \overline S## and clearly ##0## doesn't exist in ##S##, this means ##S## is not closed so ##S## is not compact.
 
Physics news on Phys.org
Without loss of generality, assume m <= n. If a > 0 is an accumulation point, can you find an upper bound on m?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top