Showing that a particular G_delta set exists with a measure property

jdinatale
Messages
153
Reaction score
0
png_zps63374024.png


Ok, I don't think I'm on the right track here. I ASSUMED that the set of all countable collections \{I_k\}_{k = 1}^\infty of nonempty open, bounded intervals such that E \subseteq \bigcup_{k = 1}^\infty I_k is a countable set itself, which it probably isn't.

I'm not even sure where to start on this problem. I feel like I need to use the assumption that E is bounded. I know if E is bounded, then E can be covered by a finite number of nonempty open, bounded intervals.
 
Physics news on Phys.org
jdinatale said:
png_zps63374024.png

Ok, I don't think I'm on the right track here. I ASSUMED that the set of all countable collections \{I_k\}_{k = 1}^\infty of nonempty open, bounded intervals such that E \subseteq \bigcup_{k = 1}^\infty I_k is a countable set itself, which it probably isn't.

It's not. If you had a countable family of covers of this type, could you show that their intersection was a G_\delta set? Presumably that's the direction that you were going with this part of the argument. Then you'd at least have a G_\delta cover, and all that is left is to rig it so that it has the correct measure.

I'm not even sure where to start on this problem. I feel like I need to use the assumption that E is bounded. I know if E is bounded, then E can be covered by a finite number of nonempty open, bounded intervals.

You have a decent start. You just don't have any control (measure-wise) over your covers. You need to use the assumption that E is bounded to get that control. If E is bounded, what can you say about its outer measure?
 
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