Notation and Conventions
[5/100%]Let denote a nonempty set, and let denote a nonempty collection of subsets of . Let denote a nonempty set, and let denote a nonempty collection of subsets of .
Let be nonempty. Then .
.
Prove the claim in the Identification Lemma for the case where is a two-element set, which case is really the only one that we use.
Identification Lemma: Let denote a disjoint family of nonempty subsets of with . Define for every by the rule . Then: (a) is one-to-one and onto . Let denote the -field of subsets of generated by sets of the form , where for each and for at most finitely many . (b) For every set in there is a unique corresponding set in , and vice versa; i.e., establishes a one-to-one correspondence between and .
Prove the Identification Lemma in full generality for the case where is an arbitrary set.
Identification Lemma: Let denote a disjoint family of nonempty subsets of with . Define for every by the rule . Then: (a) is one-to-one and onto . Let denote the -field of subsets of generated by sets of the form , where for each and for at most finitely many . (b) For every set in there is a unique corresponding set in , and vice versa; i.e., establishes a one-to-one correspondence between and .
Show that is a semiring on .
Let denote a semiring on , and let denote a semiring on . Then is a semiring on .