Uncountable family of disjoint closed sets

  • Thread starter Thread starter sazanda
  • Start date Start date
  • Tags Tags
    Closed Sets
sazanda
Messages
11
Reaction score
0

Homework Statement


Determine whether the following statements are true or false
a) Every pairwise disjoint family of open subsets of ℝ is countable.
b) Every pairwise disjoint family of closed subsets of ℝ is countable.

Homework Equations


part (a) is true. we can find 1-1 correspondence with rational numbers

But part (b) I know it is false. I need a counter example. Could you help me with that?


The Attempt at a Solution

 
Physics news on Phys.org
sazanda said:

Homework Statement


Determine whether the following statements are true or false
a) Every pairwise disjoint family of open subsets of ℝ is countable.
b) Every pairwise disjoint family of closed subsets of ℝ is countable.

Homework Equations


part (a) is true. we can find 1-1 correspondence with rational numbers

But part (b) I know it is false. I need a counter example. Could you help me with that?


The Attempt at a Solution


You are probably thinking too hard. Think of sets consisting of a single element. Those are closed, yes?
 
Dick said:
You are probably thinking too hard. Think of sets consisting of a single element. Those are closed, yes?

Let me clarify myself.
let X be a collection of disjoint closed sets. Define X := { {x} such that x in ℝ }
{x}_1 is the one of the disjoint closed set.
{x}_2 is another disjoint closed set.
and so fourth
{x}_i is the another disjoint closed set
Since ℝ is uncountable X must be uncountable.

Is this what you mean?
 
the way you are listing the {x}_i, makes it look as if X is countable.

but in fact, |X| = |U(x in R){x}| = |R|, because we have a bijection from X to R:

{x}<---> x
 
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