Subset of separable space is separable

  • Thread starter Thread starter homesick
  • Start date Start date
  • Tags Tags
    Separable Space
homesick
Messages
2
Reaction score
0

Homework Statement


Show that if X\subsetM and (M,d) is separable, then (X,d) is separable. [This may be a little bit trickier than it looks - E may be a countable dense subset of M with X \cap E = Ø.]

Homework Equations


No equations, but there are relevant definitions. Per our book:
A metric space (M,d) is separable if \exists a countable dense E \subset M.
E\subsetM is dense in M if \forallx\inM and \forall \epsilon > 0, \exists e \in E st d(x,e)< \epsilon

The Attempt at a Solution


My best attempt was doomed from the start, because I don't quite understand the hint. My thought process went as follows:
since X \subset M, \forallx\inX, x\inM. Thus, since M is dense in E, \forallx\inX, \forall\epsilon>0, \existse\inE st d(x,e)<\epsilon. At this point, I was done, because the set of e's satisfying the above, is a subset of E, a countable set. So a subset of a countable set is dense in X, and X is separable. This is incorrect, but I cannot see why.
Any help clearing up the confusion would be greatly appreciated.
Thanks!
 
Last edited:
Physics news on Phys.org
homesick said:

Homework Statement


Show that if X\subsetM and (M,d) is separable, then (X,d) is separable. [This may be a little bit trickier than it looks - E may be a countable dense subset of M with X \cap E = Ø.]

Homework Equations


No equations, but there are relevant definitions. Per our book:
A metric space (M,d) is separable if \exists a countable dense E \subset M.
E\subsetM is dense in M if \forallx\inM and \forall \epsilon > 0, \exists e \in E st d(x,e)< \epsilon

The Attempt at a Solution


My best attempt was doomed from the start, because I don't quite understand the hint. My thought process went as follows:
since X \subset M, \forallx\inX, x\inM. Thus, since M is dense in E, \forallx\inX, \forall\epsilon>0, \existse\inE st d(x,e)<\epsilon. At this point, I was done, because the set of e's satisfying the above, is a subset of E, a countable set. So a subset of a countable set is dense in X, and X is separable. This is incorrect, but I cannot see why.
Any help clearing up the confusion would be greatly appreciated.
Thanks!

The problem statement already warned you what could go wrong with an approach like that. Suppose X is M-E. Your countable dense set, call it F, has to be a subset of M-E. But M-E doesn't contain any elements of E, so you can't use them. You have to prove M-E contains a different countable dense set. Try to construct one.
 
Yes, I know the hint clearly stated that this could cause issues. I said that above. I asked *why* this hint is there. The fact that I believe my proof is complete, means that I do not understand the hint. I don't understand at all what you mean by trying to construct a countable dense set that is in M-E. I have no idea what M is, all I know is that it contains 1 countable dense set.
 
homesick said:
Yes, I know the hint clearly stated that this could cause issues. I said that above. I asked *why* this hint is there. The fact that I believe my proof is complete, means that I do not understand the hint. I don't understand at all what you mean by trying to construct a countable dense set that is in M-E. I have no idea what M is, all I know is that it contains 1 countable dense set.

Then the first step is to figure why you think your proof is complete. Take a concrete example. Q (the rational numbers) is a countable dense set of R (the real numbers) so R is separable. Now take the set R-Q (the irrational numbers). You need to show that's separable too and contains a countable dense set. But none of those points can be rational, so they can't be elements of your original countable dense set Q. Try running through the steps of your proof with that example.
 
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