Topology question; derived pts and closure

  • Thread starter Thread starter Unassuming
  • Start date Start date
  • Tags Tags
    closure Topology
Unassuming
Messages
165
Reaction score
0

Homework Statement


If A is a discrete subset of the reals,

prove that

A'=cl_x A \backslash A

is a closed set.


Homework Equations


A' = the derived set of A
x is a derived pt of A if U \cap (A \backslash \{x\}) \neq \emptyset for every open U such that x is in U.

Thrm1. A is closed iff A=cl(A)
Thrm2. cl(emptyset)=emptyset


The Attempt at a Solution



"Proof". Using Thrm1 with A' we can see that A' is closed iff A'=cl(A'). Since A is a discrete subset of the Reals we know that the set consists of isolated pts. Since there are no derived pts in A, then A'= emptyset. Using Thrm2 we know that cl(emptyset)=emptyset. Therefore A'=cl(A'). And thus A' is closed.

Does this proof work?
 
Physics news on Phys.org
I think so. Is there any difference between cl_x(A) and cl(A)? A' is closed because it's empty.
 
Well, a classmate pointed out to me that the set B={1/n : n in Naturals}, has a derived point of {0}. I feel like this set is discrete, yet it's derived points are not the empty set.

I thought I had this one. Any ideas of where I have gone wrong? My guess would be assuming that discrete subsets have no derived points but then what direction do I take?
 
Whoa. You're right. You caught me. I thought the proof sounded a little vacuous. So you want to prove that if x is not in A', then there is a neighborhood of x that does not intersect A'. If x is in A, use that A is discrete. If x is not in A, then use that A is closed. Can you take it from there?
 
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