Homepage › Solution manuals › Stephen Abbott › Understanding Analysis › Exercise 3.4.9
Exercise 3.4.9
Let be an enumeration of the rational numbers, and for each set . Define , and let .
- (a)
- Argue that is a closed, nonempty set consisting only of irrational numbers.
- (b)
- Does contain any nonempty open intervals? Is totally disconnected? (See Exercise 3.4.7 for the definition.)
- (c)
- Is it possible to know whether is perfect? If not, can we modify this construction to produce a nonempty perfect set of irrational numbers?
Answers
- (a)
-
is a union of an arbitrary collection of open sets and therefore is open; therefore
is closed.
contains all rational numbers, therefore
must consist only of irrational numbers. Intuitively,
must be nonempty, because the sum of the lengths of the intervals in
is 2 and can’t cover the infinite real line - but the properties of interval lengths haven’t been rigorously defined, and maybe something weird can happen (e.g. Banach-Tarski paradox), so it’s best to prove it.
Let , , and . Clearly and is compact, so if we can show is always nonempty, we can use the Nested Compact Set Property to show is nonempty.
Consider the set , a set of evenly spaced numbers with between each number. Some arithmetic shows that there are elements in . Since the length of is , there can only be at most elements of in , and therefore elements of in . Since , is nonempty, completing the proof.
- (b)
- Since contains no rational numbers, and any nonempty open interval will contain rational numbers (since is dense in ), cannot contain any open interval. The proof that is totally disconnected is the same as that for in Exercise 3.4.7b.
- (c)
-
It is possible for
to be not perfect. Our approach will be to create an isolated point in
, say,
. To do so, we need to spilt the sequence of sets in
into three parts; the first will have their upper limits approach
from below, the second will have their lower limits approach
from above, and the third will be used to enumerate through the rest of the rational numbers.
First, we prove the following lemma - for any and a positive sequence , it is possible to construct a sequence such that . (We’ll use this lemma for the sequences isolating .) To do so, let . Choose .
We show by induction that . The base case is trivial. For the inductive case: assume . Then
Since , . Recall also that , and therefore , completing the inductive step.
Now, for any , since there must be some so that and , and therefore
Also, since , . This completes the proof of the lemma.
Returning to the original problem of making not perfect, we will construct a sequence which isolates . Start with any enumeration of the rational numbers . Our lemma above means we can assign and for to ensuring but itself not in . Similarly, a slight modification to the lemma lets us assign and for to ensuring while leaving out. Finally, we assign to enumerating through the elements of , skipping over any elements that will be present in and , and deferring any elements that would cause until becomes small enough that this is no longer the case.
In this manner, has been surrounded, and will have as an isolated point, and thus is not perfect.
We can also construct so that is perfect. (Note: To simplify the notation a bit let .) Define , with . We will rely on the lemma that is perfect if for all , either or . Informally, if isn’t redundant (in that it covers new numbers), then it is disjoint from all previous . To prove this lemma, consider any element and let be arbitrary. Consider the interval , and ignore any if . Since none of overlap partially, this interval cannot be covered completely by some union of several since any union would have gaps. Moreover, cannot be covered entirely by a single , since then would be centered on which is irrational. Thus, there must be some other element so that and therefore is not an isolated point and must be perfect.
To construct an which satisfies this condition, we start with an arbitrary . Define . For each element of , we add to only if either or . Otherwise, we procrastinate on adding by appending any rational number . Clearly, for any there will eventually be small enough that can be added to without violating our restrictions, and we don’t need to worry about ’s being added since they’re far enough away from everything that they can’t affect the restrictions.