This is just a review day, but I'm a bit under-prepared and haven't done these, so I'll be doing brief notes on hints towards selected problems:
1.5.4: Consider the construction we did in here. Now do the same construction for the interval rather than . You get . Then map values in to and apply in the same way. Namely use .
You'll need to show surjectivity, so . Namely solve for to choose it:
Here if then . If then:
which is the you choose. For your proof start at the bottom and show that as well as .
1.5.8: Let's do the problem:
Question
Let be a set of positive real numbers with the property that adding together any finite subset of elements from always gives a sum of or less. Show must be finite or countable.
Proof
Here where . Let's sketch it out:
The idea is that for any then the interval is still uncountable infinite.
Here has at most 1 element its' countable), ex . Also has finitely many elements. Repeat for all have finitely many elements. Note that:
Then so clearly we can count the finite union of subsets, so it is countable.
☐
Exam will be next Tuesday. Everything is fair game, but the proofs will be small and doable.