Exercise 3.4.9

Let { r 1 , r 2 , r 3 , } be an enumeration of the rational numbers, and for each n N set 𝜖 n = 1 2 n . Define O = n = 1 V 𝜖 n ( r n ) , and let F = O c .

(a)
Argue that F is a closed, nonempty set consisting only of irrational numbers.
(b)
Does F contain any nonempty open intervals? Is F totally disconnected? (See Exercise 3.4.7 for the definition.)
(c)
Is it possible to know whether F is perfect? If not, can we modify this construction to produce a nonempty perfect set of irrational numbers?

Answers

(a)
O is a union of an arbitrary collection of open sets and therefore is open; therefore O c = F is closed. O contains all rational numbers, therefore F must consist only of irrational numbers. Intuitively, F must be nonempty, because the sum of the lengths of the intervals in O 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 O n = i = 1 n V 𝜖 i ( r i ) , F n = O n c , and G n = F n [ 1 , 3 ) . Clearly G n G n + 1 and G n is compact, so if we can show G n is always nonempty, we can use the Nested Compact Set Property to show F = n = 1 F n n = 1 G n is nonempty.

Consider the set M = { m 2 n 1 : m N } [ 1 , 3 ) , a set of evenly spaced numbers with 1 2 n 1 between each number. Some arithmetic shows that there are 2 n elements in M . Since the length of O i is 1 2 i 1 , there can only be at most 2 n i elements of M in O i , and therefore 2 n 1 elements of M in O . Since G n M O , G n is nonempty, completing the proof.

(b)
Since F contains no rational numbers, and any nonempty open interval will contain rational numbers (since Q is dense in R ), F cannot contain any open interval. The proof that F is totally disconnected is the same as that for I in Exercise 3.4.7b.
(c)
It is possible for F to be not perfect. Our approach will be to create an isolated point in F , say, 2 . To do so, we need to spilt the sequence of sets in O into three parts; the first will have their upper limits approach 2 from below, the second will have their lower limits approach 2 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 L R and a positive sequence ( ζ n ) 0 , it is possible to construct a sequence ( x n ) Q such that [ L , L + 2 ζ 1 ) i = 1 V ζ i ( x i ) = { L } . (We’ll use this lemma for the sequences isolating 2 .) To do so, let V ζ n ( x n ) = ( α n , β n ) . Choose L < α n < L + 2 ζ n + 1 .

We show by induction that [ L , L + 2 ζ 1 ) i = 1 n V ζ i ( x i ) [ L , L + 2 ζ n + 1 ) . The base case n = 1 is trivial. For the inductive case: assume [ L , L + 2 ζ 1 ) i = 1 n V ζ i ( x i ) [ L , L + 2 ζ n + 1 ) . Then

[ L , L + ζ 1 ) i = 1 n + 1 V ζ i ( x i ) [ L , L + 2 ζ n + 1 ) V ζ n + 1 ( x n + 1 ) = [ L , L + 2 ζ n + 1 ) ( α n + 1 , β n + 1 )

Since α n + 1 > L , β n + 1 > L + 2 ζ n + 1 . Recall also that α n + 1 < L + 2 ζ n + 2 , and therefore [ L , L + 2 ζ n + 1 ) ( α n + 1 , β n + 1 ) [ L , L + 2 ζ n + 2 ) , completing the inductive step.

Now, for any l [ L , L + 2 ζ 1 ) > L , since ( ζ n ) 0 there must be some ζ j so that L + 2 ζ j l and j > 1 , and therefore

l [ L , L + 2 ζ j ) [ L , L + 2 ζ 1 ) i = 1 j 1 V ζ i ( x i )  (by induction above) [ L , L + 2 ζ 1 ) i = 1 V ζ i ( x i ) l [ L , L + 2 ζ 1 ) i = 1 V ζ i ( x i )

Also, since α n > L n , L [ L , L + 2 ζ 1 ) i = 1 V ζ i ( x i ) . This completes the proof of the lemma.

Returning to the original problem of making F not perfect, we will construct a sequence ( r n ) which isolates 2 . Start with any enumeration of the rational numbers q n . Our lemma above means we can assign r 3 n + 1 and 𝜖 3 n + 1 for n 0 to ensuring ( 2 , 2 + 2 𝜖 1 ) O but 2 itself not in O . Similarly, a slight modification to the lemma lets us assign r 3 n + 2 and 𝜖 3 n + 2 for n 0 to ensuring ( 2 2 𝜖 2 , 2 ) O while leaving 2 out. Finally, we assign r 3 n + 3 , n 0 to enumerating through the elements of q n , skipping over any elements that will be present in r 3 n + 1 and r 3 n + 2 , and deferring any elements that would cause 2 V ( q ) until 𝜖 becomes small enough that this is no longer the case.

In this manner, 2 has been surrounded, and F = O c will have 2 as an isolated point, and thus F is not perfect.

We can also construct ( r n ) so that F is perfect. (Note: To simplify the notation a bit let V i = V 𝜖 i ( r i ) .) Define R n = i = 1 n V i , with R 0 = . We will rely on the lemma that F is perfect if for all i N , either V i R i 1 = or V i R i 1 . Informally, if V i isn’t redundant (in that it covers new numbers), then it is disjoint from all previous V i . To prove this lemma, consider any element x F and let 𝜖 > 0 be arbitrary. Consider the interval ( x , x + 𝜖 ) , and ignore any V p if V p R p 1 . Since none of V i overlap partially, this interval cannot be covered completely by some union of several V i since any union would have gaps. Moreover, ( x , x + 𝜖 ) cannot be covered entirely by a single V 𝜖 j , since then V j would be centered on r j = x + 𝜖 j which is irrational. Thus, there must be some other element y x , y F so that y ( x , x + 𝜖 ) and therefore x is not an isolated point and F must be perfect.

To construct an ( r n ) which satisfies this condition, we start with an arbitrary ( q n ) . Define R n = i = 1 n r i . For each element of ( q n ) , we add q i to ( r n ) only if either V 𝜖 n ( q i ) R n or V 𝜖 n ( q i ) R n = . Otherwise, we procrastinate on adding q i by appending any rational number s > max ( R n ) + 2 𝜖 n . Clearly, for any q i there will eventually be 𝜖 n small enough that q i can be added to ( r n ) without violating our restrictions, and we don’t need to worry about s ’s being added since they’re far enough away from everything that they can’t affect the restrictions.

User profile picture
2022-01-27 00:00
Comments