Set Systems
[81/60%]Let . Let consists of along with the rsc subintervals of is a -system of subsets of .
Must be in every -system?
List all -systems consisting of at least two subsets of .
If consists of the empty set and the -dimensional rectangles of any one form, then is a -system of subsets of .
Let consist of and all subsets of that are neither open nor closed. Then is not a -system of subsets of .
For each in a nonempty index set , let be a -system over .
The collection is a -system on .
Let . Suppose that is the "exhaustive list" of all the system that contain . In other words, each , and any -system that contains coincides with some . Then is a -system that contains A. If is a -system containing , then . The minimal -system generated by A always exists.
Suppose that is a -system with , and suppose that is contained in any other -system that contains . Then , with notation as in (b). The minimal -system containing A [which always exists] is also unique.
This exercise explores some equivalent definitions of a -system.
is a -system iff satisfies ( ), ( ), and ( ).
Every -system additionally satisfies ( ), ( ), and ( ).
is a -system iff satisfies ( ), ( ), and ( ).
The conditions are: ; ( ) ; ( ) ; ( ) For any disjoint ; (λ4) ; ( h ) ; ( ) .
If a collection is nonempty and satisfies ( ) and ( ), then is a -system.
If is a -system and a -system, then whenever for all . That is, is closed under countable unions.
A -system is not necessarily a -system.
Find all -systems over with at least three elements.
The collection consisting of and the rsc intervals is not a -system on .
Suppose that for each in a nonempty index set , is a -system over .
The collection is a -system on .
Suppose that is such that is contained in each , and suppose that is the "exhaustive list" of all the -system that contain . Then is a -system that contains . If is a -system on that contains , then . The minimal -system generated by always exists.
Let denote a -system over with and where is contained in any other -system also containing . Then , with notation as in (b). Therefore, the -system generated by Always exists and is unique.
Is a semiring over ?
This exercise explores some alternative definitions of a semiring.
Some define to be a semiring iff is a nonempty -system such that both and imply the existence of a finite collection A with and for . This definition of a semiring is equivalent to our definition of a semiring.
Some define to be a semiring by stipulating (SR1), (SR2), and the following property: implies the existence of disjoint -sets with . Note that here is not necessarily a proper difference. If is a semiring by this definition, then is a semiring by our definition, but the converse is not necessarily true.
Let A consist of as well as all rsc rectangles . The collection of all finite disjoint unions of A-sets is a semiring over .
An arbitrary intersection of semirings on is not necessarily a semiring on .
If A is a semiring over , must ?
Let A denote a semiring. Pick , and let . Then there exists a finite collection of disjoint A-sets with .
Other books deal with a system called a ring. We will not deal with rings of sets in this text, but since the reader might refer to other books that deal with rings, it is worthy to discuss the concept. A collection of subsets of a nonempty set is called a ring of subsets of iff (R1) , (R2) implies , and (R3) implies . That is, a ring is a nonempty collection of subsets closed under unions and differences.
is in every ring.
is a ring iff satisfies (R1), (R2), and (R4) with implies .
Every ring satisfies (R5) implies .
Every ring is a -system.
Every ring is closed under finite unions and finite intersections.
is a ring iff a nonempty -system that satisfies ( ) along with (R6) and imply .
is a ring iff is a nonempty -system that satisfies (R5).
Suppose that is the "exhaustive list" of all rings that contain . Then is a ring that contains , and is contained in any ring that contains . The minimal ring containing is always exists and is unique.
The collection of finite unions of rsc intervals is a ring on .
Let be uncountable. The collection of all amc subsets of is a ring on .
(c) is the usual symmetric difference of and , the set of elements that are in exactly one of or . That is, .
This problem explores the relationship between semirings and rings.
For , see part (g) of this exercise Vestrup (2003, p.6) hints that .
Every ring is a semiring. However, not every semiring is a ring.
Let denote a semiring on , and let consist of the finite disjoint unions of -sets. Then is closed under finite intersections and disjoint unions.
If and , then .
, and imply .
and imply .
is the minimal ring generated by .
A semiring that satisfies (R2) is a ring.
Let be infinite, and let have cardinality . We will show that the ring generated by has cardinality .
Given , let denote the collection of all finite unions of differences of -sets. If , then . Also, implies .
Let , and define for . Then , where is the minimal ring generated by , and where [without loss of generality] . Also, .
is a ring on , and from the fact that is the minimal ring containing , we have , and thus .
We may generalize: if is infinite, then .
The collection is a field on .
Let be such that and whenever . Then is a field on .
Every -system that is closed under arbitrary differences is a field.
Let satisfy (F1) and (F2), and suppose that is closed under finite disjoint unions. Then is not necessarily a field.
Suppose that , where is a field on for each . Then is a field on .
The collection consisting of , and all -dimensional rectangles of all forms fails to be a field on .
The collection consisting of and the finite disjoint unions of -dimensional rsc subrectangles of the given -dimensional rsc rectangle is a field on .
An arbitrary intersection of fields on is a field on .
Let be arbitrary, and let . There exists a unique field on with the properties that (i) , and (ii) if is a field with , then . This field is called the [minimal] field [on ] generated by A.
Let be disjoint. What does a typical element in the minimal field generated by look like?
Let be finite, and denote the set of sequences of elements of . For each , write
so that denotes the -th term of for all . For and , let
Let
Then is a field of subsets of . [The sets are called cylinders of rank , and is collection of all cylinders of all ranks.]
Suppose that is a semiring on with . The collection of finite disjoint unions of -sets is a field on . [Compare with Example 3 and Exercise 1.2.7.]
Let . Given , let , where is the usual inverse image of under .
If is a field on , then is a field on .
may not be a field over even if is a field on .
Let be infinite, and let have cardinality . Let denote the minimal field generated by [Exercise 1.2.9]. We will show that .
a. Given a collection , let denote the collection of
-
finite unions of -sets,
-
finite unions of differences of -sets, and
-
finite unions of complements of -sets.
If , then . If , then .
Some books work with a system of sets called an algebra. An algebra on is a nonempty collection of subsets of that satisfies (F2) and (F3).
is an algebra on iff is a ring on with .
is an algebra iff is a field. Thus algebra and field are synonymous. proof. (a: ⟹) Suppose is an algebra. Then, (R1) by assumption. (R2) is -stable follows (F3). (R3) The assumption of and (F2) imply that if , then and . Then
This proves that is closed under difference. (a: ⇐) Suppose is a ring and . To prove is an algebra on , note that (A1) since is a ring. (F2) Let . Because and (R3), we have . This proves that is closed under difference. (F3) -stability follows (R2). (b) We need only to prove that is an field if is an algebra since the reverse direction is trivial.
Suppose is an algebra. We want to show . Since by definition of an algebra, there must exist . Then by (F2), and so by (F3).
A collection of sets is called a monotone class iff (MC1) for every nondecreasing sequence of -sets we have , and (MC2) for every nonincreasing sequence of -sets we have .
If is both a field and a monotone class, then is a -field.
A field is a monotone class if and only if it is a -field.
This problem discusses some equivalent formulations of a -field.
satisfies (S1), (S2), and closure under amc intersections iff is a -field.
Every field that is closed under countable disjoint unions is a -field.
If satisfies (S1), closure under differences, and closure under countable unions or closure under countable intersections, then is a -field.
Prove the following claims.
A finite union of -fields on is not necessarily a field on .
If a finite union of -fields on is a field, then it is a -field as well.
Given -fields on , it is not necessarily the case that is a -field.
Does problem 1.2.11 hold when field is replaced with a -field?
A subset is called nowhere dense iff every open interval I contains an open interval J such that J . Clearly and all subsets of a nowhere dense set are nowhere dense. A subset is called a set of the first category iff is a countable union of nowhere dense sets.
An amc union of sets of the first category is of the first category.
Let . Then is a -field of subsets of .
A -ring of subsets of is a nonempty collection of subsets of that is closed under differences as well as countable unions.
Every -ring is closed under finite unions and amc intersections.
is a -field iff is a -ring with .
State and prove an existence and uniqueness result regarding the [minimal] -ring generated by a collection of subsets of .
This problem continues problem 1.3.6. Let denote a collection of subsets of some set , and let denote the minimal -ring that contains .
For any collection of sets, let denote the collection of all countable unions of differences of -sets. Define , and for any ordinal , define . Then implies .
Letting denote the first uncountable ordinal, show that .
If , then .
We will show that no -field can ever be countably infinite.
If is finite, then any -field on is finite.
For the remainder, assume that is infinite and that there is a countably infinite -field on . For each , let . For any distinct , either or .
From (b), there exists a disjoint collection of nonempty -sets with .
For each sequence of 0's and 1's, let . Then forces , and a contradiction ensues. Hence, there cannot exist a countably infinite -field on our infinite .
If , then .
For any collection .
If the nonempty collection is finite, then .
For arbitrary collection , we have .
For arbitrary collection , we have .
We will show that is the class of sets of the form , where for each pair either or is in , and where are disjoint.
Let denote the class of sets of the stated form. Then and is closed under intersection.
Show that is closed under complementation by first showing that
where if , is defined as , .
For , . Also, by closure under intersection, we have .
is a field that contains , and thus .
Every -set must be in any field containing , hence .
If , then .
Use problem 1.3.10.
When , has at most sets. The bound is achieved if are disjoint.
Let , where as usual denotes a nonempty set.
.
When is amc, .
For general , .
Suppose that is a sequence of -fields on with the property that each is generated by a countable collection of subsets of . Then the minimal -field containing each of , that is, the intersection of all -fields on that contain each of , is generated by an amc collection of subsets of .
Let denote any -field on other than , and let be such that . Then .
Let , where . For each there exists a countable subcollection with .
The following parts are of a similar flavor.
Suppose that is such that . For each distinct pair there exists with but .
Let be countable, and suppose that for each distinct pair , there exists a set such that but . Then .
Given and , let and let .
is a -field on .
Next, define to be the minimal -field over generated by the class . Then .
Suppose that is a disjoint sequence of subsets of with . Then each -set is the union of an at most countable subcollection of .
Let denote a -system on , and let denote a -system on with . We will show that . Let denote the -system generated by , and for each subset we define .
Let denote a field on , and let denote a monotone class on [See Exercise 1.3.1]. We will show that implies that . Let denote the minimal monotone class on generated by . That is, is the intersection of all monotone classes on containing the collection .
To prove the claim, it is sufficient to show that .
If is a field, then .
.
Let is a monotone class on and .
is indeed closed under complements.
Let \mathscr {H}_{1}=\left\{ A \subseteq \Omega : A \cup B \in m(\mathcal{F}) for all B \in \mathcal{F}\right\}. Then is a monotone class such that and .
Let \mathscr {E}_{2}=\left\{ B \subseteq \Omega : A \cup B \in m(\mathcal{F}) for all A \in m(\mathcal{F})\right\}. Then is a monotone class such that , and .
is closed under finie unions, and hence is a field.
Show directly that , and .
Notation: intervals of the form , intervals of the form , intervals of the form , and closed subsets of . An asterisk on a collection (e.g. , ) denotes the same form of interval restricted to rational endpoints.
All amc subsets of are Borel sets. All subsets of that differ from a Borel set by at most countably many points are Borel sets. That is, if the symmetric difference is amc and , then .
The Borel -field on is denoted by and is defined as the -field on generated by the rsc subintervals of may be equivalently defined by .
is generated by the compact subsets of .
is not generated by the following:
Any finite collection of subsets of .
The collection of real singletons.
The collection of all finite subsets of .
The collection of all amc subsets of .
The representations (1)-(5) give equivalent formulations of .
Definition: the extended Borel -field on is denoted by , and is defined by . Sets in are called extended Borel sets.
Just as different authors use different definitions for , so too has various definitions. Some other definitions are (1) the class of sets that are -sets or are -sets enlarged by one or both of , (2) the -field on generated by the class of intervals of the form , , and , where , (3) the -field on generated by intervals of the form , , (4) , and (5) the -field on generated by the open subsets of , sets of the form , , , and , where is an open subset of and .
Claim 2 (Section 1.4): , where and are the classes of intervals defined in the remark to problem 1.4.1 (with the same form as but with rational endpoints, for ).
The natural extension of Claim 2 to holds in the extended Borel setting: is generated by any of the analogously-extended versions of as well.
For each and , every -dimensional hyperplane is in .
Consider the circumference of the unit circle in , the set of points with . The set of points on the circumference of the unit circle having at least one irrational coordinate is a two-dimensional Borel set.
The set of points in having all transcendental coordinates is in .
For any rectangle [of any form] , we define the -dimensional Borel -field over to be the -field generated by all -dimensional rsc subrectangles of ; call this class . may be equivalently defined as .
is generated by a countable class.
Show that is not generated by the singletons of , nor by the finite subsets of , nor by the amc subsets of .
Here are five extra definitions of that are found elsewhere. These five definitions are equivalent to our definition of .
-
The class of subsets of that are -sets or are sets augmented by points that have in at least one coordinate.
-
The -field of subsets of generated by the class of open rectangles in of the form , , and , where .
-
The -field on generated by .
-
.
-
The -field on generated by the open subsets of , that is, the sets of the form , , , and , where is an open subset of and .
Let and be sets, and let and denote fields over and , respectively. Let denote the collection of all finite disjoint unions of sets of the form where and .
is a field over .
.
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).