A Class of Ethereal Borel Sets
[10/0%]Find the smallest so that
.
Each finite subset of is in .
Each countable subset of is in .
Directly prove that .
contains every subinterval of of every form.
If for all , then for all .
Let be generic and let be such that the 's are disjoint and nonempty with . Show that . Therefore, in this very special case, sets in a generated -field can be conveniently described in terms of sets in the generating class.
Instantly construct other sets in .
for all , , and . The Borel sets constructible by the seemingly comprehensive procedure given at the beginning of this section form but a negligible'' subcollection of $\mathscr {B}_{(0,1]}$. That is, most'' elements of are not describable by the construction given at the beginning of this section.
Let , and let denote the class consisting of and all rsc subintervals of with , so that . Construct a set in by modifying where appropriate this section's developments.
For each , write , where each represents the th digit in the dyadic expansion of and thus is either 0 or 1. For definiteness, we restrict ourselves to take the expansion that has a non-terminating sequence of 1's: if [say] we write instead of . For each , define , so that denotes the number of 1's in the first digits of the dyadic expansion of . The famous set of normal numbers as studied by Borel is . Demonstrate that , and show that .
An even more extreme set in can be constructed. This exercise will provide an outline for constructing this set.
Let . There exist such that . There exist such that .
Let . Each -set has the form for some appropriately chosen .
Let . If , then .
for all .
For all and sequences of positive integers,
For each , .
We use the notation for ordinals as given in Section 1.6, where lowercase Greek letters such as , , and denote ordinal numbers, and denote the usual order relations among ordinals (with equality denoted by ), and for each ordinal , denotes the set of ordinal predecessors of . Here we let denote the first uncountable ordinal number (the ordinal called in Section 1.6's own notation, renamed here to to avoid clashing with this section's use of for a point of ).
For each , find a sequence of ordinals such that (i) for all and (ii) the set is infinite for all . Let be as before, except the subscript is now the ordinal number . For each , with defined for each , define . This is a transfinitely inductive definition that produces the nondecreasing class . Next, given sets , define as before. Define . We define for all as follows: if is defined for all , write
where is as given in this section.
Parts (a) and (b) correspond to Lemmas 1 and 2 of this section (Lemma 1: for we can find with , and we can find with ; Lemma 2: for each -set has the form for some appropriately chosen ). No analog of Lemma 3 is needed. Part (c) corresponds to Lemma 5 (if , then for all ); no analog of Lemma 6 is needed. The notation preceding Lemma 7 and Lemma 7 itself (existence and uniqueness of the sequence corresponding to ) remain unchanged. We again let denote a fixed listing of the countably many sets comprising . For each , define the function by writing whenever . Next, for each , let denote the set . Part (d) is the analog of Lemma 8 (the set constructed in this section lies outside ). The sets and remain the same for all ; Lemmas 9, 10, and 11 (establishing , and are -sets) remain unchanged. Lemma 12 (the identity used to rewrite of the 's in terms of of the 's) is modified as in part (e). Finally, Lemma 13 () is modified to part (f).