Section 1.1

π\pi-Systems, λ\lambda-Systems, And Semirings

[21/100%]
Show
LaTeX
Problem 1.1.1

Let Ω=(α,β]\Omega =(\alpha , \beta ]. Let P\mathcal{P} consists of ∅\varnothing along with the rsc subintervals of Ω.P\Omega . \mathcal{P} is a π\pi-system of subsets of (α,β](\alpha , \beta ].

?
Problem 1.1.2

Must ∅\varnothing be in every π\pi-system?

?
Problem 1.1.3

List all π\pi-systems consisting of at least two subsets of {ω1,ω2,ω3}\left\{ \omega_{1}, \omega_{2}, \omega_{3}\right\}.

?
Problem 1.1.4

If Pk\mathcal{P}_{k} consists of the empty set and the kk-dimensional rectangles of any one form, then Pk\mathcal{P}_{k} is a π\pi-system of subsets of Rk\mathbb {R}^{k}.

?
Problem 1.1.5

Let P\mathcal{P} consist of ∅\varnothing and all subsets of Rk\mathbb {R}^{k} that are neither open nor closed. Then P\mathcal{P} is not a π\pi-system of subsets of Rk\mathbb {R}^{k}.

?
Problem 1.1.6

For each α\alpha in a nonempty index set AA, let Pα\mathcal{P}_{\alpha } be a π\pi-system over Ω\Omega.

?
(a)

The collection ⋂α∈APα\bigcap_{\alpha \in A} \mathcal{P}_{\alpha } is a π\pi-system on Ω\Omega.

(b)

Let A⊆2Ω\mathcal{A} \subseteq 2^{\Omega }. Suppose that {Pα:α∈A}\left\{ \mathcal{P}_{\alpha }: \alpha \in A\right\} is the "exhaustive list" of all the π\pi system that contain A\mathcal{A}. In other words, each Pα⊇A\mathcal{P}_{\alpha } \supseteq \mathcal{A}, and any π\pi-system that contains A\mathcal{A} coincides with some Pα\mathcal{P}_{\alpha }. Then ⋂α∈APα\bigcap_{\alpha \in A} \mathcal{P}_{\alpha } is a π\pi-system that contains A. If QQ is a π\pi-system containing A\mathcal{A}, then ⋂α∈APα⊆Q\bigcap_{\alpha \in A} \mathcal{P}_{\alpha } \subseteq Q. The minimal π\pi-system generated by A always exists.

(c)

Suppose that P\mathcal{P} is a π\pi-system with P⊇A\mathcal{P} \supseteq \mathcal{A}, and suppose that P\mathcal{P} is contained in any other π\pi-system that contains A\mathcal{A}. Then P=⋂α∈APα\mathcal{P}=\bigcap_{\alpha \in A} \mathcal{P}_{\alpha }, with notation as in (b). The minimal π\pi-system containing A [which always exists] is also unique.

Problem 1.1.7

This exercise explores some equivalent definitions of a λ\lambda-system. 1{ }^{1}

?
(a)

L\mathscr {L} is a λ\lambda-system iff L\mathscr {L} satisfies ( λ1\lambda_{1} ), ( λ2′\lambda_{2}^{\prime } ), and ( λ3\lambda_{3} ).

(b)

Every λ\lambda-system additionally satisfies ( λ4\lambda_{4} ), ( λ5\lambda_{5} ), and ( λ6\lambda_{6} ).

(c)

L\mathscr {L} is a λ\lambda-system iff L\mathscr {L} satisfies ( λ1\lambda_{1} ), ( λ2′\lambda_{2}^{\prime } ), and ( λ5\lambda_{5} ).

1{ }^{1} The conditions are: (λ1)Ω∈L\left(\boldsymbol {\lambda }_{\mathbf{1}}\right) \quad \Omega \in \mathscr {L}; ( λ2\boldsymbol {\lambda }_{\mathbf{2}}) A∈L⟹Ac∈LA \in \mathscr {L} \Longrightarrow A^{c} \in \mathscr {L}; ( λ2′\boldsymbol {\lambda }_{\mathbf{2}}^{\prime }) A,B∈L&A⊆B⟹B\A∈L\quad A, B \in \mathscr {L} \& A \subseteq B \Longrightarrow B \backslash A \in \mathscr {L}; ( λ3\boldsymbol {\lambda }_{\mathbf{3}}) For any disjoint {An}n=1∞⊆L,⋃n=1∞An∈L\left\{ A_{n}\right\}_{n=1}^{\infty } \subseteq \mathscr {L}, \bigcup_{n=1}^{\infty } A_{n} \in \mathscr {L}; (λ4) A,B∈L&A∩B=∅⟹A∪B∈L\quad A, B \in \mathscr {L} \& A \cap B=\varnothing \Longrightarrow A \cup B \in \mathscr {L}; ( h 5 _{\text{5 }}) ∀{An}n=1∞⊆L,An↑⟹⋃n=1∞An∈L\forall \left\{ A_{n}\right\}_{n=1}^{\infty } \subseteq \mathscr {L}, A_{n} \uparrow \Longrightarrow \bigcup_{n=1}^{\infty } A_{n} \in \mathscr {L}; ( λ6\boldsymbol {\lambda }_{\mathbf{6}}) ∀{An}n=1∞⊆L,An↓⟹⋂n=1∞An∈L\quad \forall \left\{ A_{n}\right\}_{n=1}^{\infty } \subseteq \mathscr {L}, A_{n} \downarrow \Longrightarrow \bigcap_{n=1}^{\infty } A_{n} \in \mathscr {L}.

(d)

If a collection L\mathscr {L} is nonempty and satisfies ( λ2\lambda_{2} ) and ( λ3\lambda_{3} ), then L\mathscr {L} is a λ\lambda-system.

Problem 1.1.8

If L\mathscr {L} is a λ\lambda-system and a π\pi-system, then ⋃n=1∞An∈L\bigcup_{n=1}^{\infty } A_{n} \in \mathscr {L} whenever An∈LA_{n} \in \mathscr {L} for all n∈Nn \in \mathbb {N}. That is, L\mathscr {L} is closed under countable unions.

?
Problem 1.1.9

A λ\lambda-system is not necessarily a π\pi-system.

?
Problem 1.1.10

Find all λ\lambda-systems over Ω={ω1,ω2,ω3,ω4}\Omega =\left\{ \omega_{1}, \omega_{2}, \omega_{3}, \omega_{4}\right\} with at least three elements.

?
Problem 1.1.11

The collection consisting of ∅\varnothing and the rsc intervals is not a λ\lambda-system on R\mathbb {R}.

?
Problem 1.1.12

Suppose that for each α\alpha in a nonempty index set AA, Lα\mathscr {L}_{\alpha } is a λ\lambda-system over Ω\Omega.

?
(a)

The collection ⋂α∈ALα\bigcap_{\alpha \in A} \mathscr {L}_{\alpha } is a λ\lambda-system on Ω\Omega.

(b)

Suppose that A⊆2Ω\mathcal{A} \subseteq 2^{\Omega } is such that A\mathcal{A} is contained in each Lα\mathscr {L}_{\alpha }, and suppose that {Lα:α∈A}\left\{ \mathscr {L}_{\alpha }: \alpha \in A\right\} is the "exhaustive list" of all the λ\lambda-system that contain A\mathcal{A}. Then ⋂α∈ALα\bigcap_{\alpha \in A} \mathscr {L}_{\alpha } is a λ\lambda-system that contains A\mathcal{A}. If Q\mathcal{Q} is a λ\lambda-system on Ω\Omega that contains A\mathcal{A}, then ⋂α∈ALα⊆Q\bigcap_{\alpha \in A} \mathscr {L}_{\alpha } \subseteq \mathcal{Q}. The minimal λ\lambda-system generated by A\mathcal{A} always exists.

(c)

Let L\mathscr {L} denote a λ\lambda-system over Ω\Omega with L⊇A\mathscr {L} \supseteq \mathscr {A} and where L\mathscr {L} is contained in any other λ\lambda-system also containing A\mathcal{A}. Then L=⋂α∈ALα\mathscr {L}=\bigcap_{\alpha \in A} \mathscr {L}_{\alpha }, with notation as in (b). Therefore, the λ\lambda-system generated by Always exists and is unique.

Problem 1.1.13

Is A={∅}∪{(0,x]:0<x⩽1}\mathcal{A}=\left\{ \varnothing \right\} \cup \left\{ (0, x]: 0<x \leqslant 1\right\} a semiring over (0,1](0,1] ?

?
Problem 1.1.14

This exercise explores some alternative definitions of a semiring.

?
(a)

Some define AA to be a semiring iff AA is a nonempty π\pi-system such that both E,F∈AE, F \in \mathcal{A} and E⊆FE \subseteq F imply the existence of a finite collection C0,C1,…,Cn∈C_{0}, C_{1}, \ldots , C_{n} \in A with E=C0⊆C1⊆…⊆Cn⊆FE=C_{0} \subseteq C_{1} \subseteq \ldots \subseteq C_{n} \subseteq F and Ci\Ci−1∈AC_{i} \backslash C_{i-1} \in \mathcal{A} for i=1,…,ni=1, \ldots , n. This definition of a semiring is equivalent to our definition of a semiring.

(b)

Some define A\mathcal{A} to be a semiring by stipulating (SR1), (SR2), and the following property: A,B∈AA, B \in \mathcal{A} implies the existence of disjoint A\mathcal{A}-sets C0,C1,…,CnC_{0}, C_{1}, \ldots , C_{n} with B\A=⋃i=0nCiB \backslash A=\bigcup_{i=0}^{n} C_{i}. Note that here B\AB \backslash A is not necessarily a proper difference. If A\mathcal{A} is a semiring by this definition, then A\mathcal{A} is a semiring by our definition, but the converse is not necessarily true.

Problem 1.1.15

Let A consist of ∅\varnothing as well as all rsc rectangles (a,b](\boldsymbol {a}, \boldsymbol {b}]. The collection of all finite disjoint unions of A-sets is a semiring over Rk\mathbb {R}^{k}.

?
Problem 1.1.16

An arbitrary intersection of semirings on Ω\Omega is not necessarily a semiring on Ω\Omega.

?
Problem 1.1.17

If A is a semiring over Ω\Omega, must Ω∈A\Omega \in \mathcal{A} ?

?
Problem 1.1.18

Let A denote a semiring. Pick n∈Nn \in \mathbb {N}, and let A,A1,…,An∈AA, A_{1}, \ldots , A_{n} \in A. Then there exists a finite collection {C1,…,Cm}\left\{ C_{1}, \ldots , C_{m}\right\} of disjoint A-sets with A\⋃i=1nAi=⋃j=1mCjA \backslash \bigcup_{i=1}^{n} A_{i}=\bigcup_{j=1}^{m} C_{j}.

?
Problem 1.1.19

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 R\mathcal{R} of subsets of a nonempty set Ω\Omega is called a ring of subsets of Ω\Omega iff (R1) R≠∅\quad R \neq \varnothing, (R2) A,B∈RA, B \in \mathcal{R} implies A∪B∈RA \cup B \in \mathcal{R}, and (R3) A,B∈RA, B \in \mathcal{R} implies A\B∈RA \backslash B \in \mathcal{R}. That is, a ring is a nonempty collection of subsets closed under unions and differences.

?
(a)

∅\varnothing is in every ring.

(b)

R\mathcal{R} is a ring iff R\mathcal{R} satisfies (R1), (R2), and (R4) A,B∈RA, B \in \mathcal{R} with A⊆BA \subseteq B implies B\A∈RB \backslash A \in \mathcal{R}.

(c)

Every ring satisfies (R5) A,B∈RA, B \in \mathcal{R} implies AΔB∈RA \Delta B \in \mathcal{R}.

(d)

Every ring is a π\pi-system.

(e)

Every ring is closed under finite unions and finite intersections.

(f)

R\mathcal{R} is a ring iff R\mathcal{R} a nonempty π\pi-system that satisfies ( R4R 4 ) along with (R6) A,B∈RA, B \in \mathcal{R} and A∩B=∅A \cap B=\varnothing imply A∪B∈RA \cup B \in \mathcal{R}.

(g)

R\mathcal{R} is a ring iff R\mathcal{R} is a nonempty π\pi-system that satisfies (R5).

(h)

Suppose that {Rα:α∈A}\left\{ \mathcal{R}_{\alpha }: \alpha \in A\right\} is the "exhaustive list" of all rings that contain A\mathcal{A}. Then ⋂α∈ARα\bigcap_{\alpha \in A} \mathcal{R}_{\alpha } is a ring that contains A\mathcal{A}, and ⋂α∈ARα\bigcap_{\alpha \in A} \mathcal{R}_{\alpha } is contained in any ring that contains A\mathcal{A}. The minimal ring containing A\mathcal{A} is always exists and is unique.

(i)

The collection of finite unions of rsc intervals is a ring on R\mathbb {R}.

(j)

Let Ω\Omega be uncountable. The collection of all amc subsets of Ω\Omega is a ring on Ω\Omega.

Remark.
?

(c) AΔBA \Delta B is the usual symmetric difference of AA and BB, the set of elements that are in exactly one of AA or BB. That is, AΔB=(A\B)∪(B\A)A \Delta B=(A \backslash B) \cup (B \backslash A).

Problem 1.1.20

This problem explores the relationship between semirings and rings.

2{ }^{2} For A\B=A\(A∩B)A \backslash B=A \backslash (A \cap B), see part (g) of this exercise 3{ }^{3} Vestrup (2003, p.6) hints that A\B=AΔ(A∩B)A \backslash B=A \Delta (A \cap B).

?
(a)

Every ring is a semiring. However, not every semiring is a ring.

(b)

Let A\mathcal{A} denote a semiring on Ω\Omega, and let R\mathcal{R} consist of the finite disjoint unions of AA-sets. Then R\mathcal{R} is closed under finite intersections and disjoint unions.

(c)

If A,B∈AA, B \in \mathcal{A} and A⊆BA \subseteq B, then B−A∈RB-A \in \mathcal{R}.

(d)

A∈A,B∈RA \in \mathcal{A}, B \in \mathcal{R}, and A⊆BA \subseteq B imply B−A∈RB-A \in \mathcal{R}.

(e)

A,B∈RA, B \in \mathcal{R} and A⊆BA \subseteq B imply B−A∈RB-A \in \mathcal{R}.

(f)

R\mathcal{R} is the minimal ring generated by A\mathcal{A}.

(g)

A semiring that satisfies (R2) is a ring.

Problem 1.1.21

Let Ω\Omega be infinite, and let A⊆2Ω\mathcal{A} \subseteq 2^{\Omega } have cardinality ℵ0\aleph_{0}. We will show that the ring generated by A\mathcal{A} has cardinality ℵ0\aleph_{0}.

?
(a)

Given C⊆2Ω\mathscr {C} \subseteq 2^{\Omega }, let C∗\mathscr {C}^{*} denote the collection of all finite unions of differences of C\mathscr {C}-sets. If card⁡(C)=ℵ0\operatorname {card}(\mathscr {C})=\aleph_{0}, then card⁡(C∗)=ℵ0\operatorname {card}\left(\mathscr {C}^{*}\right)=\aleph_{0}. Also, ∅∈C\varnothing \in \mathscr {C} implies C⊆C∗\mathscr {C} \subseteq \mathscr {C}^{*}.

(b)

Let A0=A\mathcal{A}_{0}=\mathcal{A}, and define An=An−1∗\mathcal{A}_{n}=\mathcal{A}_{n-1}^{*} for n⩾1n \geqslant 1. Then A⊆⋃n=0∞An⊆R(A)\mathcal{A} \subseteq \bigcup_{n=0}^{\infty } \mathcal{A}_{n} \subseteq \mathfrak {R}(\mathcal{A}), where R(A)\mathfrak {R}(\mathcal{A}) is the minimal ring generated by A\mathcal{A}, and where [without loss of generality] ∅∈A\varnothing \in \mathcal{A}. Also, card⁡(⋃n=0∞An)=ℵ0\operatorname {card}\left(\bigcup_{n=0}^{\infty } \mathcal{A}_{n}\right)=\aleph_{0}.

(c)

⋃n=0∞An\bigcup_{n=0}^{\infty } \mathcal{A}_{n} is a ring on Ω\Omega, and from the fact that R(A)\mathfrak {R}(\mathcal{A}) is the minimal ring containing A\mathcal{A}, we have ⋃n=0∞An=R(A)\bigcup_{n=0}^{\infty } \mathcal{A}_{n}=\mathfrak {R}(\mathcal{A}), and thus card⁡(R(A))=ℵ0\operatorname {card}(\mathfrak {R}(\mathcal{A}))=\aleph_{0}.

(d)

We may generalize: if A\mathcal{A} is infinite, then card⁡(A)=card⁡(R(A))\operatorname {card}(\mathcal{A})=\operatorname {card}(\mathfrak {R}(\mathcal{A})).