I was having "trouble" with two problems. Well, i got a solution for the first (a while ago, i hope i can remember it for today), for the second i was not sure how to approach it.
1) Prove that any set in a metric space is an intersection of open sets.
Yes, a basic question, i know. but that's the problem. my professor said i'm thinking way too hard, and there is a very easy, elegant solution to this.
2) Let be a finite open subset of a metric space . Prove that every point in is an isolated point of
Definitions and theorems that may come in handy:
Definition: A point in a metric space is called isolated if the set consisting of alone is open.
Theorem: A subset of a metric space is open if and only if it is expressible as a union of open balls.
(i think we can use this for the first problem, to prove the claim for singleton points).
Theorem: In a metric space any union of open sets is open.
Theorem: In a metric space a finite intersection of open sets is open.
If any other definitions or theorems are required, i can supply them. just ask. i think this should be enough though
Nov 14th 2007, 09:46 AM
I have a solution for problem one. However, it can be regarded as an ugly proof because it is set theory and nothing about metric spaces plus I think it uses the axiom of choice.
First note that any singelton element can be expressed as an intersection of infinitely disks skrinking to that point.
Next (key step) if we have a union of an intersection of sets we can write it as an intersection of union of sets. So for example, (this is verified by the distribution law of unions and intersections). However, the problem is what happens if we have infinitely sets, possibly uncountably many, does this still work. I think it still works but the problem is that it is not longer a topology question now it is a set theory question, that is the ugliness of my solution because I change one area in math into another area in math.
But now we can prove it. Say is an non-empty set. Pick any then we can write (a singleton) as where are open disks skrinking to . Pick another point and do the same idea. Now define but here it can be an uncountable intersection :eek:, but using the thing that I said above we can write this union of intersections as intersections of union of sets. BUT, the union of open sets is open so we are taking an intersection of open sets. Q.E.D.
(What an ugly construction. (Puke) )
Nov 14th 2007, 11:29 AM
For #2, I am not sure what theorems you have.
I accustomed to seeing that definition used for general top-spaces but not metric spaces. For finite sets there is a finite collection of open balls that are pair-wise disjoint which covers the set. (i.e. each point is in its own ball and no two balls intersect.) Because A is open M\A is closed. So any point of A is not a limit point of M\A. For any there must be an open set . But that means .
Nov 14th 2007, 11:34 AM
My DSL has gone haywire!
Sorry about that DSL goof; I misread your #1 the first time.
It is a theorem that the closure of any set is the intersection of open sets.
PROOF: Suppose that A is a closed set. Let be the ball centered at x with radius r.
Now define .
It is easy to see that
Now suppose that then there is a ball .
There is a positive integer N such .
If then which is a contradiction.
Thus and so .
In the case that A is open just add to the collection.