-Systems, -Systems, And Semirings
[21/100%]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 .