Is this correct Baire's Theorem?

  • Thread starter Thread starter julypraise
  • Start date Start date
  • Tags Tags
    Theorem
julypraise
Messages
104
Reaction score
0

Homework Statement



Baire's Theorem
Let X be a complete metric space. Suppose E \subseteq X and

E = \bigcup_{n \in \mathbb{N}} F_{n}

where F_{n} \subseteq X is closed in X. If all X \backslash F_{n} are dense then X \backslash E is dense.

Homework Equations


The Attempt at a Solution



Nothing much...

I know there may be a stronger version. But at this stage, all I need to do is to check this theorem is correct.
 
Physics news on Phys.org
Looks like Baire to me. You've got a countable intersection of dense open sets, right? And you are stating the result must be dense since a complete metric space is Baire. Don't you agree?
 
Actually, there are two Baire theorems who state exactly the same thing. One deals with complete metric spaces, the other deals with compact Hausdorff spaces.
 
micromass said:
Actually, there are two Baire theorems who state exactly the same thing. One deals with complete metric spaces, the other deals with compact Hausdorff spaces.

Sure. Being "Baire" is a property of a topological space. Complete metric spaces aren't the only example of Baire spaces. The OP indicated it was probably a special case.
 
Dick said:
Looks like Baire to me. You've got a countable intersection of dense open sets, right? And you are stating the result must be dense since a complete metric space is Baire. Don't you agree?

Yes the statement that you statetd, i.e., the intersection of open dense subsets is also dense, is equivalent to mine.

But is the theorem correct then?

(I've learned this from lectures and the lecturer sometimes does not specify everything like a set should not be empty or etc. So I worry about this theorem too and I've used this in my assignment too.)
 
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