Can all open sets in R^n be expressed as countable union of open cubes?

  • Level: Graduate 
  • Thread starter Thread starter CantorSet
  • Start date Start date
  • Tags Tags
    Sets Union
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
5 replies · 12K views
CantorSet
Messages
44
Reaction score
0
Hi everyone,

I came across a problem that requires knowing this fact.

But can any open set in [tex]R^n[/tex] be expressed as the countable union of "cubes". That is subsets of the form [tex](a_1,b_1) \times ... \times (a_n, b_n)[/tex].
 
Physics news on Phys.org
Hi CantorSet! :smile:

The answer is yes! For notational purposes, I'll do this is one dimension, but multiple dimensions is quite analogous.

So, take G open, then around every [itex]x\in G[/itex], we can find an open interval such that

[tex]x\in ]a,b[\subseteq G[/tex]

By shrinking the interval, we can assume the endpoints to be rational. Thus

[tex]G=\bigcup\{]a,b[~\vert~a,b\in \mathbb{Q},~]a,b[\subseteq G\}[/tex]

We can even take the intervals/cubes to be disjoint, but that's somewhat more difficult...
 
Thanks for the response, micromass!

I see that we can express any open set as the union of open intervals. But can we express it as a countable union of open intervals. What if the number of points in G is uncountably infinite?

You mention that we can even use disjoint intervals. Would this guarantee the union is over countably many?
 
CantorSet said:
What if the number of points in G is uncountably infinite?

Doesn't the same proof apply regardless on the number of elements in G?
 
CantorSet, what micromass didn't mention is that when you write an open set as a union of open cubes with rational endpoints, then the result is a union of countably many sets. This is because there are only countably many cubes with rational endpoints (something you can prove for yourself probably). In his procedure, you have your open set [itex]G[/itex], a point [itex]x \in G[/itex], and then you choose an open interval, [itex]x \in ]a_x, b_x[ \in G[/itex]. Then you shrink [itex]]a_x, b_x[[/itex] to an interval with rational endpoints, say [itex]]p_x, q_x[[/itex]. If [itex]G[/itex] is uncountable, and you do this for every [itex]x \in G[/itex], then since there are only countably many intervals with rational endpoints, it means that for many different [itex]x \neq y \in G[/itex], you'll have ended up choosing the same interval: [itex]p_x = p_y,\ q_x = q_y[/itex].