-Fields
[21/52%]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.