Chapter 1

Set Systems

[81/60%]
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})).

Problem 1.2.1

The collection F={A⊆Ω:A is finite or Ac is finite}\mathcal{F}=\left\{ A \subseteq \Omega : A \text{ is finite or } A^{c} \text{ is finite}\right\} is a field on Ω\Omega.

?
Problem 1.2.2

Let F⊆2Ω\mathcal{F} \subseteq 2^{\Omega } be such that Ω∈F\Omega \in \mathcal{F} and A\B∈FA \backslash B \in \mathcal{F} whenever A,B∈FA, B \in \mathcal{F}. Then F\mathcal{F} is a field on Ω\Omega.

?
Problem 1.2.3

Every λ\lambda-system that is closed under arbitrary differences is a field.

?
Problem 1.2.4

Let F⊆2Ω\mathcal{F} \subseteq 2^{\Omega } satisfy (F1) and (F2), and suppose that F\mathcal{F} is closed under finite disjoint unions. Then F\mathcal{F} is not necessarily a field.

?
Problem 1.2.5

Suppose that F1⊆F2⊆F3⊆…\mathcal{F}_{1} \subseteq \mathcal{F}_{2} \subseteq \mathcal{F}_{3} \subseteq \ldots, where Fn\mathcal{F}_{n} is a field on Ω\Omega for each n∈Nn \in \mathbb {N}. Then ⋃n=1∞Fn\bigcup_{n=1}^{\infty } \mathcal{F}_{n} is a field on Ω\Omega.

?
Problem 1.2.6

The collection consisting of Rk,∅\mathbb {R}^{k}, \varnothing, and all kk-dimensional rectangles of all forms fails to be a field on Rk\mathbb {R}^{k}.

?
Problem 1.2.7

The collection consisting of ∅\varnothing and the finite disjoint unions of kk-dimensional rsc subrectangles of the given kk-dimensional rsc rectangle (a,b](\boldsymbol {a}, \boldsymbol {b}] is a field on Ω\Omega.

?
Problem 1.2.8

An arbitrary intersection of fields on Ω\Omega is a field on Ω\Omega.

?
Problem 1.2.9

Let Ω\Omega be arbitrary, and let A⊆2Ω\mathcal{A} \subseteq 2^{\Omega }. There exists a unique field F\mathcal{F} on Ω\Omega with the properties that (i) A⊆F\mathcal{A} \subseteq \mathcal{F}, and (ii) if G\mathcal{G} is a field with A⊆G\mathcal{A} \subseteq \mathcal{G}, then F⊆G\mathcal{F} \subseteq \mathcal{G}. This field F\mathcal{F} is called the [minimal] field [on Ω\Omega ] generated by A.

?
Problem 1.2.10

Let A1,…,An⊊ΩA_{1}, \ldots , A_{n} \subsetneq \Omega be disjoint. What does a typical element in the minimal field generated by {A1,…,An}\left\{ A_{1}, \ldots , A_{n}\right\} look like?

?
Problem 1.2.11

Let SS be finite, and Ω\Omega denote the set of sequences of elements of SS. For each ω∈Ω\omega \in \Omega, write

ω=(z1(ω),z2(ω),…), \omega =\left(z_{1}(\omega ), z_{2}(\omega ), \ldots \right),

so that zk(ω)z_{k}(\omega ) denotes the kk-th term of ω\omega for all k∈Nk \in \mathbb {N}. For n∈Nn \in \mathbb {N} and H⊆SnH \subseteq S^{n}, let

Cn(H):={ω∈Ω∣z1(ω),…,zn(ω)∈H}. C_{n}(H):=\left\{ \omega \in \Omega \mid z_{1}(\omega ), \ldots , z_{n}(\omega ) \in H\right\} .

Let

F:={Cn(H)∣n∈N,H⊆Sn}. \mathcal{F}:=\left\{ C_{n}(H) \mid n \in \mathbb {N}, H \subseteq S^{n}\right\} .

Then F\mathcal{F} is a field of subsets of S∞S^{\infty }. [The sets Cn(H)C_{n}(H) are called cylinders of rank nn, and F\mathcal{F} is collection of all cylinders of all ranks.]

?
Problem 1.2.12

Suppose that A\mathcal{A} is a semiring on Ω\Omega with Ω∈A\Omega \in \mathcal{A}. The collection of finite disjoint unions of A\mathcal{A}-sets is a field on Ω\Omega. [Compare with Example 3 and Exercise 1.2.7.]

?
Problem 1.2.13

Let f:Ω→Ω′f: \Omega \rightarrow \Omega^{\prime }. Given A′⊆2Ω′\mathcal{A}^{\prime } \subseteq 2^{\Omega^{\prime }}, let f−1(A′)={f−1(A′):A′∈A′}f^{-1}\left(\mathcal{A}^{\prime }\right)= \left\{ f^{-1}\left(A^{\prime }\right): A^{\prime } \in \mathcal{A}^{\prime }\right\}, where f−1(A′)f^{-1}\left(A^{\prime }\right) is the usual inverse image of A′A^{\prime } under ff.

?
(a)

If A′\mathcal{A}^{\prime } is a field on Ω′\Omega^{\prime }, then f−1(A′)f^{-1}\left(\mathcal{A}^{\prime }\right) is a field on Ω\Omega.

(b)

f(A)f(\mathcal{A}) may not be a field over Ω′\Omega^{\prime } even if A\mathcal{A} is a field on Ω\Omega.

Problem 1.2.14

Let Ω\Omega be infinite, and let A⊆2Ω\mathcal{A} \subseteq 2^{\Omega } have cardinality ℵ0\aleph_{0}. Let f(A)f(\mathcal{A}) denote the minimal field generated by A\mathcal{A} [Exercise 1.2.9]. We will show that card⁡(f(A))=ℵ0\operatorname {card}(f(\mathcal{A}))=\aleph_{0}.

a. Given a collection C\mathscr {C}, let C∗\mathscr {C}^{*} denote the collection of

  1. finite unions of C\mathscr {C}-sets,

  2. finite unions of differences of C\mathscr {C}-sets, and

  3. finite unions of complements of C\mathscr {C}-sets.

If ∅∈C\varnothing \in \mathscr {C}, then C⊆C∗\mathscr {C} \subseteq \mathscr {C}^{*}. If card⁡(C)=ℵ0\operatorname {card}(\mathscr {C})=\aleph_{0}, then card⁡(C∗)=ℵ0\operatorname {card}\left(\mathscr {C}^{*}\right)=\aleph_{0}.

?
Problem 1.2.15

Some books work with a system of sets called an algebra. An algebra on Ω\Omega is a nonempty collection of subsets of Ω\Omega that satisfies (F2) and (F3).

?
(a)

F\mathcal{F} is an algebra on Ω\Omega iff F\mathcal{F} is a ring on Ω\Omega with Ω∈F\Omega \in \mathcal{F}.

(b)

F\mathcal{F} is an algebra iff F\mathcal{F} is a field. Thus algebra and field are synonymous. proof. (a: ⟹) Suppose F\mathcal{F} is an algebra. Then, (R1) F≠∅\quad \mathcal{F} \neq \varnothing by assumption. (R2) F\quad \mathcal{F} is ∪\cup-stable follows (F3). (R3) The assumption of Ω∈F\Omega \in \mathscr {F} and (F2) imply that if A,B∈FA, B \in \mathscr {F}, then Ac=Ω−A∈FA^{c}= \Omega -A \in \mathscr {F} and Bc=Ω−B∈FB^{c}=\Omega -B \in \mathscr {F}. Then

[(Ac∪B)∈(F3)F]⟹(F2)[(Ac∪B)c∈F]⟹[A\B∈F]. \left[\left(A^{c} \cup B\right) \stackrel{(\mathrm{F} 3)}{\in } \mathcal{F}\right] \stackrel{(\mathrm{F} 2)}{\Longrightarrow }\left[\left(A^{c} \cup B\right)^{c} \in \mathcal{F}\right] \Longrightarrow \left[A \backslash B \in \mathcal{F}\right] .

This proves that F\mathcal{F} is closed under difference. (a: ⇐) Suppose F\mathcal{F} is a ring and Ω∈F\Omega \in \mathcal{F}. To prove F\mathcal{F} is an algebra on Ω\Omega, note that (A1) F≠∅\quad \mathcal{F} \neq \varnothing since F\mathcal{F} is a ring. (F2) Let A∈FA \in \mathcal{F}. Because Ω∈F\Omega \in \mathcal{F} and (R3), we have Ac=Ω−A∈FA^{c}=\Omega -A \in \mathcal{F}. This proves that F\mathcal{F} is closed under difference. (F3) ∪\cup-stability follows (R2). (b) We need only to prove that F\mathcal{F} is an field if F\mathcal{F} is an algebra since the reverse direction is trivial.

Suppose F\mathcal{F} is an algebra. We want to show Ω∈F\Omega \in \mathcal{F}. Since F≠∅\mathcal{F} \neq \varnothing by definition of an algebra, there must exist A∈FA \in \mathcal{F}. Then Ac∈FA^{c} \in \mathcal{F} by (F2), and so Ω=A∪Ac∈F\Omega =A \cup A^{c} \in \mathcal{F} by (F3). □\square

Problem 1.3.1

A collection F\mathcal{F} of sets is called a monotone class iff (MC1) for every nondecreasing sequence {An}n=1∞\left\{ A_{n}\right\}_{n=1}^{\infty } of F\mathcal{F}-sets we have ⋃n=1∞An∈F\bigcup_{n=1}^{\infty } A_{n} \in \mathcal{F}, and (MC2) for every nonincreasing sequence {An}n=1∞\left\{ A_{n}\right\}_{n=1}^{\infty } of F\mathcal{F}-sets we have ⋂n=1∞An∈F\bigcap_{n=1}^{\infty } A_{n} \in \mathscr {F}.

?
(a)

If F\mathcal{F} is both a field and a monotone class, then F\mathcal{F} is a σ\sigma-field.

(b)

A field is a monotone class if and only if it is a σ\sigma-field.

Problem 1.3.2

This problem discusses some equivalent formulations of a σ\sigma-field.

?
(a)

F\mathcal{F} satisfies (S1), (S2), and closure under amc intersections iff F\mathcal{F} is a σ\sigma-field.

(b)

Every field that is closed under countable disjoint unions is a σ\sigma-field.

(c)

If F\mathcal{F} satisfies (S1), closure under differences, and closure under countable unions or closure under countable intersections, then F\mathcal{F} is a σ\sigma-field.

Problem 1.3.3

Prove the following claims.

?
(a)

A finite union of σ\sigma-fields on Ω\Omega is not necessarily a field on Ω\Omega.

(b)

If a finite union of σ\sigma-fields on Ω\Omega is a field, then it is a σ\sigma-field as well.

(c)

Given σ\sigma-fields F1⊊F2⊊⋯\mathcal{F}_{1} \subsetneq \mathcal{F}_{2} \subsetneq \cdots on Ω\Omega, it is not necessarily the case that ⋃n=1∞Fn\bigcup_{n=1}^{\infty } \mathcal{F}_{n} is a σ\sigma-field.

Problem 1.3.4

Does problem 1.2.11 hold when field is replaced with a σ\sigma-field?

?
Problem 1.3.5

A subset A⊆RA \subseteq \mathbb {R} is called nowhere dense iff every open interval I contains an open interval J such that J ∩A=∅\cap A=\varnothing. Clearly ∅\varnothing and all subsets of a nowhere dense set are nowhere dense. A subset A⊆RA \subseteq \mathbb {R} is called a set of the first category iff AA is a countable union of nowhere dense sets.

?
(a)

An amc union of sets of the first category is of the first category.

(b)

Let F={A⊆R:A or Ac is a set of the first category}\mathcal{F}=\left\{ A \subseteq \mathbb {R}: A \text{ or } A^{c} \text{ is a set of the first category}\right\}. Then F\mathcal{F} is a σ\sigma-field of subsets of R\mathbb {R}.

Problem 1.3.6

A σ\sigma-ring of subsets of Ω\Omega is a nonempty collection of subsets of Ω\Omega that is closed under differences as well as countable unions.

?
(a)

Every σ\sigma-ring is closed under finite unions and amc intersections.

(b)

F\mathcal{F} is a σ\sigma-field iff F\mathcal{F} is a σ\sigma-ring with Ω∈F\Omega \in \mathcal{F}.

(c)

State and prove an existence and uniqueness result regarding the [minimal] σ\sigma-ring generated by a collection AA of subsets of Ω\Omega.

Problem 1.3.7

This problem continues problem 1.3.6. Let A\mathcal{A} denote a collection of subsets of some set Ω\Omega, and let S(A)S(\mathcal{A}) denote the minimal σ\sigma-ring that contains A\mathcal{A}.

?
(a)

For any collection C\mathcal{C} of sets, let C∗\mathcal{C}^{*} denote the collection of all countable unions of differences of C\mathcal{C}-sets. Define A0=A\mathcal{A}_{0}=\mathcal{A}, and for any ordinal α≻0\alpha \succ 0, define Aα=(⋃0⪯β≺αAβ)∗\mathcal{A}_{\alpha }=\left(\bigcup_{0 \preceq \beta \prec \alpha } \mathcal{A}_{\beta }\right)^{*}. Then 0⪯α≺β0 \preceq \alpha \prec \beta implies A⊆Aα⊆Aβ⊆S(A)\mathcal{A} \subseteq \mathcal{A}_{\alpha } \subseteq \mathcal{A}_{\beta } \subseteq S(\mathcal{A}).

(b)

Letting ω\omega denote the first uncountable ordinal, show that S(A)=⋃0⪯α≺ωAαS(\mathcal{A})=\bigcup_{0 \preceq \alpha \prec \omega } \mathcal{A}_{\alpha }.

(c)

If card⁡(A)≤c\operatorname {card}(\mathcal{A}) \leq \mathfrak {c}, then card⁡(S(A))≤c\operatorname {card}(S(\mathcal{A})) \leq \mathfrak {c}.

Problem 1.3.8

We will show that no σ\sigma-field can ever be countably infinite.

?
(a)

If Ω\Omega is finite, then any σ\sigma-field on Ω\Omega is finite.

(b)

For the remainder, assume that Ω\Omega is infinite and that there is a countably infinite σ\sigma-field F={A1,A2,…}\mathcal{F}=\left\{ A_{1}, A_{2}, \ldots \right\} on Ω\Omega. For each ω∈Ω\omega \in \Omega, let Bω=⋂{An:ω∈An}B_{\omega }=\bigcap \left\{ A_{n}: \omega \in A_{n}\right\}. For any distinct ω,ω′∈Ω\omega , \omega^{\prime } \in \Omega, either Bω=Bω′B_{\omega }=B_{\omega^{\prime }} or Bω∩Bω′=∅B_{\omega } \cap B_{\omega^{\prime }}=\varnothing.

(c)

From (b), there exists a disjoint collection {C1,C2,…}\left\{ C_{1}, C_{2}, \ldots \right\} of nonempty F\mathcal{F}-sets with ⋃n=1∞Cn=Ω\bigcup_{n=1}^{\infty } C_{n}=\Omega.

(d)

For each sequence e=(e1,e2,…)e=\left(e_{1}, e_{2}, \ldots \right) of 0's and 1's, let De=⋃{Cn:en=1}D_{e}=\bigcup \left\{ C_{n}: e_{n}=1\right\}. Then e≠e′e \neq e^{\prime } forces De≠De′D_{e} \neq D_{e^{\prime }}, and a contradiction ensues. Hence, there cannot exist a countably infinite σ\sigma-field on our infinite Ω\Omega.

Problem 1.3.9
?
(a)

If A⊆A′⊆σ(A)\mathcal{A} \subseteq \mathcal{A}^{\prime } \subseteq \sigma (\mathcal{A}), then σ(A′)=σ(A)\sigma \left(\mathcal{A}^{\prime }\right)=\sigma (\mathcal{A}).

(b)

For any collection ∅≠A⊆2Ω,π(A)⊆λ(A)⊆σ(A)\varnothing \neq \mathcal{A} \subseteq 2^{\Omega }, \pi (\mathcal{A}) \subseteq \lambda (\mathcal{A}) \subseteq \sigma (\mathcal{A}).

(c)

If the nonempty collection A\mathcal{A} is finite, then σ(A)=f(A)\sigma (\mathcal{A})=f(\mathcal{A}).

(d)

For arbitrary collection A\mathcal{A}, we have σ(A)=σ(f(A))\sigma (\mathcal{A})=\sigma (f(\mathcal{A})).

(e)

For arbitrary collection A\mathcal{A}, we have f(σ(A))=σ(f(A))f(\sigma (\mathcal{A}))=\sigma (f(\mathcal{A})).

Problem 1.3.10

We will show that f(A)f(\mathcal{A}) is the class of sets of the form ⋃i=1m⋂j=1niAij\bigcup_{i=1}^{m} \bigcap_{j=1}^{n_{i}} A_{i j}, where for each (i,j)\left(i, j\right) pair either AijA_{i j} or AijcA_{i j}^{c} is in A\mathcal{A}, and where ⋂j=1n1A1j,…,⋂j=1nmAmj\bigcap_{j=1}^{n_{1}} A_{1 j}, \ldots , \bigcap_{j=1}^{n_{m}} A_{m j} are disjoint.

?
(a)

Let C\mathcal{C} denote the class of sets of the stated form. Then Ω∈C\Omega \in \mathcal{C} and C\mathcal{C} is closed under intersection.

(b)

Show that C\mathcal{C} is closed under complementation by first showing that

(⋃i=1m⋂j=1niAij)c=⋂i=1m(Ai1c∪⋃j=2ni(Aijc∩⋂k=1j−1Aik)), \left(\bigcup _{i=1}^{m} \bigcap _{j=1}^{n_{i}} A_{i j}\right)^{c}=\bigcap _{i=1}^{m}\left(A_{i 1}^{c} \cup \bigcup _{j=2}^{n_{i}}\left(A_{i j}^{c} \cap \bigcap _{k=1}^{j-1} A_{i k}\right)\right),

where if ni<2n_{i}<2, ⋃j=2ni(Aijc∩⋂k=1j−1Aik)\bigcup_{j=2}^{n_{i}}\left(A_{i j}^{c} \cap \bigcap_{k=1}^{j-1} A_{i k}\right) is defined as ∅\varnothing, i=1,…,mi=1, \ldots , m.

(c)

For i=1,…,mi=1, \ldots , m, ⋃j=2ni(Aijc∩⋂k=1j−1Aik)∈C\bigcup_{j=2}^{n_{i}}\left(A_{i j}^{c} \cap \bigcap_{k=1}^{j-1} A_{i k}\right) \in \mathcal{C}. Also, by closure under intersection, we have (⋃i=1m⋂j=1niAij)c∈C\left(\bigcup_{i=1}^{m} \bigcap_{j=1}^{n_{i}} A_{i j}\right)^{c} \in \mathcal{C}.

(d)

C\mathcal{C} is a field that contains A\mathcal{A}, and thus f(A)⊆Cf(\mathcal{A}) \subseteq \mathcal{C}.

(e)

Every C\mathcal{C}-set must be in any field containing A\mathcal{A}, hence C⊆f(A)\mathcal{C} \subseteq f(\mathcal{A}).

Problem 1.3.11

If card⁡(A)=ℵ0\operatorname {card}(\mathcal{A})=\aleph_{0}, then card⁡(f(A))=ℵ0\operatorname {card}(f(\mathcal{A}))=\aleph_{0}.

?
Remark.
?

Use problem 1.3.10.

Problem 1.3.12

When A={A1,…,An}\mathcal{A}=\left\{ A_{1}, \ldots , A_{n}\right\}, σ(A)\sigma (\mathcal{A}) has at most 22n2^{2^{n}} sets. The bound is achieved if A1,…,AnA_{1}, \ldots , A_{n} are disjoint.

?
Problem 1.3.13

Let A={{ω}:ω∈Ω}\mathcal{A}=\left\{ \left\{ \omega \right\} : \omega \in \Omega \right\}, where Ω\Omega as usual denotes a nonempty set.

?
(a)

f(A)={A⊆Ω:A is finite or Ac is finite}f(\mathcal{A})=\left\{ A \subseteq \Omega : A \text{ is finite or } A^{c} \text{ is finite}\right\}.

(b)

When Ω\Omega is amc, σ(A)=2Ω\sigma (\mathcal{A})=2^{\Omega }.

(c)

For general Ω\Omega, σ(A)={A⊆Ω:A or Ac is amc}\sigma (\mathcal{A})=\left\{ A \subseteq \Omega : A \text{ or } A^{c} \text{ is amc}\right\}.

Problem 1.3.14

Suppose that {Fn}n=1∞\left\{ \mathcal{F}_{n}\right\}_{n=1}^{\infty } is a sequence of σ\sigma-fields on Ω\Omega with the property that each Fn\mathcal{F}_{n} is generated by a countable collection of subsets of Ω\Omega. Then the minimal σ\sigma-field containing each of F1,F2,…\mathcal{F}_{1}, \mathcal{F}_{2}, \ldots, that is, the intersection of all σ\sigma-fields on Ω\Omega that contain each of F1,F2,…\mathcal{F}_{1}, \mathcal{F}_{2}, \ldots, is generated by an amc collection of subsets of Ω\Omega.

?
Problem 1.3.15

Let F\mathcal{F} denote any σ\sigma-field on Ω\Omega other than 2Ω2^{\Omega }, and let H⊊ΩH \subsetneq \Omega be such that H∉FH \notin \mathcal{F}. Then σ(F∪{H})={(H∩A)∪(Hc∩B):A,B∈F}\sigma (\mathcal{F} \cup \left\{ H\right\} )=\left\{ \left(H \cap A\right) \cup \left(H^{c} \cap B\right): A, B \in \mathcal{F}\right\}.

?
Problem 1.3.16

Let F=σ(A)\mathcal{F}=\sigma (\mathcal{A}), where ∅≠A⊆2Ω\varnothing \neq \mathcal{A} \subseteq 2^{\Omega }. For each B∈FB \in \mathcal{F} there exists a countable subcollection AB⊆A\mathcal{A}_{B} \subseteq \mathcal{A} with B∈σ(AB)B \in \sigma \left(\mathcal{A}_{B}\right).

?
Problem 1.3.17

The following parts are of a similar flavor.

?
(a)

Suppose that A\mathcal{A} is such that σ(A)=2Ω\sigma (\mathcal{A})=2^{\Omega }. For each distinct pair ω,ω′∈Ω\omega , \omega^{\prime } \in \Omega there exists A∈AA \in \mathcal{A} with ω∈A\omega \in A but ω′∉A\omega^{\prime } \notin A.

(b)

Let Ω\Omega be countable, and suppose that for each distinct pair ω,ω′∈Ω\omega , \omega^{\prime } \in \Omega, there exists a set A∈AA \in \mathcal{A} such that ω∈A\omega \in A but ω′∉A\omega^{\prime } \notin A. Then σ(A)=2Ω\sigma (\mathcal{A})=2^{\Omega }.

Problem 1.3.18

Given ∅≠A⊆2Ω\varnothing \neq \mathcal{A} \subseteq 2^{\Omega } and ∅≠B⊆Ω\varnothing \neq B \subseteq \Omega, let A∩B={A∩B:A∈A}\mathcal{A} \cap B= \left\{ A \cap B: A \in \mathcal{A}\right\} and let σ(A)∩B={A∩B:A∈σ(A)}\sigma (\mathcal{A}) \cap B=\left\{ A \cap B: A \in \sigma (\mathcal{A})\right\}.

?
(a)

σ(A)∩B\sigma (\mathcal{A}) \cap B is a σ\sigma-field on BB.

(b)

Next, define σB(A∩B)\sigma_{B}(\mathcal{A} \cap B) to be the minimal σ\sigma-field over BB generated by the class A∩B\mathcal{A} \cap B. Then σB(A∩B)=σ(A)∩B\sigma_{B}(\mathcal{A} \cap B)=\sigma (\mathcal{A}) \cap B.

Problem 1.3.19

Suppose that A={A1,A2,…}\mathcal{A}=\left\{ A_{1}, A_{2}, \ldots \right\} is a disjoint sequence of subsets of Ω\Omega with ⋃n=1∞An=Ω\bigcup_{n=1}^{\infty } A_{n}=\Omega. Then each σ(A)\sigma (\mathcal{A})-set is the union of an at most countable subcollection of A1,A2,…A_{1}, A_{2}, \ldots.

?
Problem 1.3.20

Let P\mathcal{P} denote a π\pi-system on Ω\Omega, and let L\mathscr {L} denote a λ\lambda-system on Ω\Omega with P⊆L\mathcal{P} \subseteq \mathscr {L}. We will show that σ(P)⊆L\sigma (\mathscr {P}) \subseteq \mathscr {L}. Let λ(P)\lambda (\mathscr {P}) denote the λ\lambda-system generated by P\mathcal{P}, and for each subset A⊆ΩA \subseteq \Omega we define EA={C⊆Ω:A∩C∈λ(P)}\mathscr {E}_{A}=\left\{ C \subseteq \Omega : A \cap C \in \lambda (\mathcal{P})\right\}.

?
Problem 1.3.21

Let F\mathcal{F} denote a field on Ω\Omega, and let M\mathcal{M} denote a monotone class on Ω\Omega [See Exercise 1.3.1]. We will show that F⊆M\mathcal{F} \subseteq \mathcal{M} implies that σ(F)⊆M\sigma (\mathcal{F}) \subseteq \mathcal{M}. Let m(F)m(\mathcal{F}) denote the minimal monotone class on Ω\Omega generated by F\mathcal{F}. That is, m(F)m(\mathcal{F}) is the intersection of all monotone classes on Ω\Omega containing the collection F\mathcal{F}.

?
(a)

To prove the claim, it is sufficient to show that σ(F)⊆m(F)\sigma (\mathcal{F}) \subseteq m(\mathcal{F}).

(b)

If m(F)m(\mathcal{F}) is a field, then σ(F)⊆m(F)\sigma (\mathcal{F}) \subseteq m(\mathcal{F}).

(c)

Ω∈m(F)\Omega \in m(\mathcal{F}).

(d)

Let G={A⊆Ω:Ac∈m(F)}.G\mathcal{G}=\left\{ A \subseteq \Omega : A^{c} \in m(\mathcal{F})\right\} . \mathcal{G} is a monotone class on Ω\Omega and m(F)⊆Gm(\mathcal{F}) \subseteq \mathcal{G}.

(e)

m(F)m(\mathcal{F}) is indeed closed under complements.

(f)

Let \mathscr {H}_{1}=\left\{ A \subseteq \Omega : A \cup B \in m(\mathcal{F}) for all B \in \mathcal{F}\right\}. Then H1\mathscr {H}_{1} is a monotone class such that F⊆H1\mathcal{F} \subseteq \mathscr {H}_{1} and m(F)⊆H1m(\mathcal{F}) \subseteq \mathscr {H}_{1}.

(g)

Let \mathscr {E}_{2}=\left\{ B \subseteq \Omega : A \cup B \in m(\mathcal{F}) for all A \in m(\mathcal{F})\right\}. Then E2\mathscr {E}_{2} is a monotone class such that F⊆H2\mathcal{F} \subseteq \mathscr {H}_{2}, and m(F)⊆H2m(\mathcal{F}) \subseteq \mathscr {H}_{2}.

(h)

m(F)m(\mathcal{F}) is closed under finie unions, and hence is a field.

Problem 1.4.1

Show directly that σ(A3)=σ(A3∗),σ(A4)=σ(A7)\sigma \left(\mathscr {A}_{3}\right)=\sigma \left(\mathscr {A}_{3}^{*}\right), \sigma \left(\mathscr {A}_{4}\right)=\sigma \left(\mathscr {A}_{7}\right), and σ(A4∗)=σ(A10)\sigma \left(\mathcal{A}_{4}^{*}\right)=\sigma \left(\mathcal{A}_{10}\right).

?
Remark.
?

Notation: A3=\mathscr {A}_{3}= intervals of the form [x,∞)[x, \infty ), A4=\mathscr {A}_{4}= intervals of the form (x,∞)(x, \infty ), A7=\mathscr {A}_{7}= intervals of the form [a,b)[a, b), and A10=\mathscr {A}_{10}= closed subsets of R\mathbb {R}. An asterisk on a collection (e.g. A3∗\mathscr {A}_{3}^{*}, A4∗\mathcal{A}_{4}^{*}) denotes the same form of interval restricted to rational endpoints.

Problem 1.4.2

All amc subsets of R\mathbb {R} are Borel sets. All subsets of R\mathbb {R} that differ from a Borel set by at most countably many points are Borel sets. That is, if the symmetric difference CΔBC \Delta B is amc and B∈BB \in \mathfrak {B}, then C∈BC \in \mathfrak {B}.

?
Problem 1.4.3

The Borel σ\sigma-field on (0,1](0,1] is denoted by B(0,1]\mathscr {B}_{(0,1]} and is defined as the σ\sigma-field on (0,1](0,1] generated by the rsc subintervals of (0,1].B(0,1](0,1] . \mathscr {B}_{(0,1]} may be equivalently defined by {B∩(0,1]∣B∈B}\left\{ B \cap (0,1] \mid B \in \mathscr {B}\right\}.

?
Problem 1.4.4

B\mathscr {B} is generated by the compact subsets of R\mathbb {R}.

?
Problem 1.4.5

B\mathscr {B} is not generated by the following:

?
(a)

Any finite collection of subsets of R\mathbb {R}.

(b)

The collection of real singletons.

(c)

The collection of all finite subsets of R\mathbb {R}.

(d)

The collection of all amc subsets of R\mathbb {R}.

Problem 1.4.6

The representations (1)-(5) give equivalent formulations of Bˉ\bar{\mathscr {B}}.

?
Remark.
?

Definition: the extended Borel σ\sigma-field on R‾\overline{\mathbb {R}} is denoted by Bˉ\bar{\mathscr {B}}, and is defined by Bˉ≡σ({(a,b]:a,b∈R‾,a<b})\bar{\mathscr {B}} \equiv \sigma \left(\left\{ (a, b]: a, b \in \overline{\mathbb {R}}, a<b\right\} \right). Sets in Bˉ\bar{\mathscr {B}} are called extended Borel sets.

Just as different authors use different definitions for B\mathscr {B}, so too Bˉ\bar{\mathscr {B}} has various definitions. Some other definitions are (1) the class of sets that are B\mathscr {B}-sets or are B\mathscr {B}-sets enlarged by one or both of ±∞\pm \infty, (2) the σ\sigma-field on R‾\overline{\mathbb {R}} generated by the class of intervals of the form (a,b)(a, b), [−∞,a)[-\infty , a), and (b,+∞](b,+\infty ], where a,b∈Ra, b \in \mathbb {R}, (3) the σ\sigma-field on R‾\overline{\mathbb {R}} generated by intervals of the form [−∞,x)[-\infty , x), x∈Rx \in \mathbb {R}, (4) σ(B∪{{−∞},{+∞}})\sigma \left(\mathscr {B} \cup \left\{ \left\{ -\infty \right\} ,\left\{ +\infty \right\} \right\} \right), and (5) the σ\sigma-field on R‾\overline{\mathbb {R}} generated by the open subsets of R‾\overline{\mathbb {R}}, sets of the form AA, A∪(x,∞]A \cup (x, \infty ], A∪[−∞,x)A \cup [-\infty , x), and A∪[−∞,x)∪(y,+∞]A \cup [-\infty , x) \cup (y,+\infty ], where AA is an open subset of R\mathbb {R} and x,y∈Rx, y \in \mathbb {R}.

Claim 2 (Section 1.4): B=σ(A1)=⋯=σ(A10)=σ(A1∗)=⋯=σ(A8∗)\mathscr {B}=\sigma \left(\mathcal{A}_{1}\right)=\cdots =\sigma \left(\mathcal{A}_{10}\right)=\sigma \left(\mathcal{A}_{1}^{*}\right)=\cdots =\sigma \left(\mathcal{A}_{8}^{*}\right), where A1,…,A10\mathcal{A}_{1}, \ldots , \mathcal{A}_{10} and A1∗,…,A8∗\mathcal{A}_{1}^{*}, \ldots , \mathcal{A}_{8}^{*} are the classes of intervals defined in the remark to problem 1.4.1 (with An∗\mathcal{A}_{n}^{*} the same form as An\mathcal{A}_{n} but with rational endpoints, for n=1,…,8n=1, \ldots , 8).

The natural extension of Claim 2 to R‾\overline{\mathbb {R}} holds in the extended Borel setting: Bˉ\bar{\mathscr {B}} is generated by any of the analogously-extended versions of A1,…,A10,A1∗,…,A8∗\mathcal{A}_{1}, \ldots , \mathcal{A}_{10}, \mathcal{A}_{1}^{*}, \ldots , \mathcal{A}_{8}^{*} as well.

Problem 1.5.1

For each k∈Nk \in \mathbb {N} and j=1,…,kj=1, \ldots , k, every (k−j)\left(k-j\right)-dimensional hyperplane is in Bk\mathscr {B}^{k}.

?
Problem 1.5.2

Consider the circumference of the unit circle in R2\mathbb {R}^{2}, the set of points (x,y)\left(x, y\right) with x2+y2=1x^{2}+y^{2}=1. The set of points on the circumference of the unit circle having at least one irrational coordinate is a two-dimensional Borel set.

?
Problem 1.5.3

The set of points in Rk\mathbb {R}^{k} having all transcendental coordinates is in Bk\mathscr {B}^{k}.

?
Problem 1.5.4

For any rectangle [of any form] A⊆RkA \subseteq \mathbb {R}^{k}, we define the kk-dimensional Borel σ\sigma-field over AA to be the σ\sigma-field generated by all kk-dimensional rsc subrectangles of AA; call this class BAk\mathscr {B}_{A}^{k}. BAk\mathscr {B}_{A}^{k} may be equivalently defined as {B∩A:B∈Bk}\left\{ B \cap A: B \in \mathscr {B}^{k}\right\}.

?
Problem 1.5.5

Bk\mathscr {B}^{k} is generated by a countable class.

?
Problem 1.5.6

Show that Bk\mathscr {B}^{k} is not generated by the singletons of Rk\mathbb {R}^{k}, nor by the finite subsets of Rk\mathbb {R}^{k}, nor by the amc subsets of Rk\mathbb {R}^{k}.

?
Problem 1.5.7

Here are five extra definitions of Bˉk\bar{\mathscr {B}}^{k} that are found elsewhere. These five definitions are equivalent to our definition of Bˉk\bar{\mathscr {B}}^{k}.

  1. The class of subsets of Rk‾\overline{\mathbb {R}^{k}} that are Bk\mathscr {B}^{k}-sets or are Bk\mathscr {B}^{k} sets augmented by points that have ±∞\pm \infty in at least one coordinate.

  2. The σ\sigma-field of subsets of Rk‾\overline{\mathbb {R}^{k}} generated by the class of open rectangles in Rk‾\overline{\mathbb {R}^{k}} of the form (a,b)(\boldsymbol {a}, \boldsymbol {b}), [−∞,a)[-\infty , \boldsymbol {a}), and (a,+∞](\boldsymbol {a},+\infty ], where a,b∈Rk\boldsymbol {a}, \boldsymbol {b} \in \mathbb {R}^{k}.

  3. The σ\sigma-field on Rk‾\overline{\mathbb {R}^{k}} generated by {(−∞,x]:x∈Rk‾}\left\{ (-\infty , \boldsymbol {x}]: \boldsymbol {x} \in \overline{\mathbb {R}^{k}}\right\}.

  4. σ(Bk∪{{x}:each xi freely equals +∞ or −∞})\sigma \left(\mathscr {B}^{k} \cup \left\{ \left\{ \boldsymbol {x}\right\} : \text{each } x_{i} \text{ freely equals } +\infty \text{ or } -\infty \right\} \right).

  5. The σ\sigma-field on Rk‾\overline{\mathbb {R}^{k}} generated by the open subsets of Rk‾\overline{\mathbb {R}^{k}}, that is, the sets of the form AA, A∪(x,+∞]A \cup (\boldsymbol {x},+\infty ], A∪[−∞,x)A \cup [-\infty , \boldsymbol {x}), and A∪[−∞,x)∪(y,+∞]A \cup [-\infty , \boldsymbol {x}) \cup (\boldsymbol {y},+\infty ], where AA is an open subset of Rk\mathbb {R}^{k} and x,y∈Rk\boldsymbol {x}, \boldsymbol {y} \in \mathbb {R}^{k}.

?
Problem 1.5.8

Let Ω\Omega and Ω′\Omega^{\prime } be sets, and let F\mathcal{F} and F′\mathcal{F}^{\prime } denote fields over Ω\Omega and Ω′\Omega^{\prime }, respectively. Let F∗F′\mathcal{F} * \mathcal{F}^{\prime } denote the collection of all finite disjoint unions of sets of the form A×BA \times B where A∈FA \in \mathcal{F} and B∈F′B \in \mathcal{F}^{\prime }.

?
(a)

F∗F′\mathcal{F} * \mathcal{F}^{\prime } is a field over Ω×Ω′\Omega \times \Omega^{\prime }.

(b)

σ(F)⊗σ(F′)=σ(F∗F′)\sigma (\mathcal{F}) \otimes \sigma \left(\mathcal{F}^{\prime }\right)=\sigma \left(\mathcal{F} * \mathcal{F}^{\prime }\right).

Problem 1.7.1

Find the smallest nn so that

?
(a)

{{x}:0<x≤1}⊆In\left\{ \left\{ x\right\} : 0<x \leq 1\right\} \subseteq \mathcal{I}_{n}.

(b)

Each finite subset of (0,1](0,1] is in In\mathcal{I}_{n}.

(c)

Each countable subset of (0,1](0,1] is in In\mathcal{I}_{n}.

Problem 1.7.2

Directly prove that I0⊊I1⊊I2⊊I3⊊I4\mathcal{I}_{0} \subsetneq \mathcal{I}_{1} \subsetneq \mathcal{I}_{2} \subsetneq \mathcal{I}_{3} \subsetneq \mathcal{I}_{4}.

?
Problem 1.7.3

I4\mathcal{I}_{4} contains every subinterval of (0,1](0,1] of every form.

?
Problem 1.7.4

If In⊊In+1\mathcal{I}_{n} \subsetneq \mathcal{I}_{n+1} for all n≥0n \geq 0, then IN⊊B(0,1]\mathcal{I}_{N} \subsetneq \mathscr {B}_{(0,1]} for all N∈NN \in \mathbb {N}.

?
Problem 1.7.5

Let Ω≠∅\Omega \neq \varnothing be generic and let A={A1,A2,…}\mathcal{A}=\left\{ A_{1}, A_{2}, \ldots \right\} be such that the AnA_{n}'s are disjoint and nonempty with ⋃n=1∞An=Ω\bigcup_{n=1}^{\infty } A_{n}=\Omega. Show that A∗=σ(A)\mathcal{A}^{*}=\sigma (\mathcal{A}). Therefore, in this very special case, sets in a generated σ\sigma-field can be conveniently described in terms of sets in the generating class.

?
Problem 1.7.6

Instantly construct c\mathfrak {c} other sets in B(0,1]−⋃n=0∞In\mathscr {B}_{(0,1]}-\bigcup_{n=0}^{\infty } \mathcal{I}_{n}.

?
Problem 1.7.7

card⁡(In)=c\operatorname {card}\left(\mathcal{I}_{n}\right)=\mathfrak {c} for all n∈Nn \in \mathbb {N}, card⁡(⋃n=0∞In)=c\operatorname {card}\left(\bigcup_{n=0}^{\infty } \mathcal{I}_{n}\right)=\mathfrak {c}, and card⁡(B(0,1]−⋃n=0∞In)=c\operatorname {card}\left(\mathscr {B}_{(0,1]}-\bigcup_{n=0}^{\infty } \mathcal{I}_{n}\right)=\mathfrak {c}. 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 B(0,1]\mathscr {B}_{(0,1]} are not describable by the construction given at the beginning of this section.

?
Problem 1.7.8

Let Ω=R\Omega =\mathbb {R}, and let I0\mathcal{I}_{0} denote the class consisting of ∅\varnothing and all rsc subintervals (a,b](a, b] of R\mathbb {R} with a,b∈Qa, b \in \mathbb {Q}, so that B=σ(I0)\mathscr {B}=\sigma \left(\mathcal{I}_{0}\right). Construct a set in B−⋃n=0∞In\mathscr {B}-\bigcup_{n=0}^{\infty } \mathcal{I}_{n} by modifying where appropriate this section's developments.

?
Problem 1.7.9

For each ω∈(0,1]\omega \in (0,1], write ω=0.d1(ω)d2(ω)d3(ω)⋯\omega =0.d_{1}(\omega ) d_{2}(\omega ) d_{3}(\omega ) \cdots, where each dj(ω)d_{j}(\omega ) represents the jjth digit in the dyadic expansion of ω\omega 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 ω=12\omega =\frac{1}{2} [say] we write ω=0.01‾\omega =0.0\overline{1} instead of 0.10‾0.1\overline{0}. For each n∈Nn \in \mathbb {N}, define sn(ω)=∑j=1ndj(ω)s_{n}(\omega )=\sum_{j=1}^{n} d_{j}(\omega ), so that sn(ω)s_{n}(\omega ) denotes the number of 1's in the first nn digits of the dyadic expansion of ω\omega. The famous set of normal numbers as studied by Borel is N={ω∈(0,1]:lim⁡n→∞sn(ω)n exists and equals 12}N=\left\{ \omega \in (0,1]: \lim_{n \rightarrow \infty } \frac{s_{n}(\omega )}{n} \text{ exists and equals } \frac{1}{2}\right\}. Demonstrate that N∈B(0,1]N \in \mathscr {B}_{(0,1]}, and show that N∈I6N \in \mathcal{I}_{6}.

?
Problem 1.7.10

An even more extreme set in B(0,1]\mathscr {B}_{(0,1]} can be constructed. This exercise will provide an outline for constructing this set.

?
(a)

Let α∈Pξ\alpha \in P_{\xi }. There exist A1,A2,…∈I0A_{1}, A_{2}, \ldots \in \mathcal{I}_{0} such that Φα(A1,A2,…)=(0,1]\Phi_{\alpha }\left(A_{1}, A_{2}, \ldots \right)=(0,1]. There exist A1,A2,…∈I0A_{1}, A_{2}, \ldots \in \mathcal{I}_{0} such that Φα(A1,A2,…)=∅\Phi_{\alpha }\left(A_{1}, A_{2}, \ldots \right)=\varnothing.

(b)

Let α∈Pξ\alpha \in P_{\xi }. Each Iα\mathcal{I}_{\alpha }-set has the form Φα(A1,A2,…)\Phi_{\alpha }\left(A_{1}, A_{2}, \ldots \right) for some appropriately chosen A1,A2,…∈I0A_{1}, A_{2}, \ldots \in \mathcal{I}_{0}.

(c)

Let α∈Pξ\alpha \in P_{\xi }. If A1,A2,…∈B(0,1]A_{1}, A_{2}, \ldots \in \mathscr {B}_{(0,1]}, then Φα(A1,A2,…)∈B(0,1]\Phi_{\alpha }\left(A_{1}, A_{2}, \ldots \right) \in \mathscr {B}_{(0,1]}.

(d)

Bα∉IαB_{\alpha } \notin \mathcal{I}_{\alpha } for all α∈Pξ\alpha \in P_{\xi }.

(e)

For all α∈Pξ\alpha \in P_{\xi } and sequences {uk}k=1∞\left\{ u_{k}\right\}_{k=1}^{\infty } of positive integers,

{ω∈(0,1]:ω∈Φα(Iωu1,Iωu2,…)}=Φα(Du1,Du2,…). \left\{ \omega \in (0,1]: \omega \in \Phi _{\alpha }\left(I_{\omega _{u_{1}}}, I_{\omega _{u_{2}}}, \ldots \right)\right\} =\Phi _{\alpha }\left(D_{u_{1}}, D_{u_{2}}, \ldots \right).
(f)

For each α∈Pξ\alpha \in P_{\xi }, Bα∈B(0,1]B_{\alpha } \in \mathscr {B}_{(0,1]}.

Remark.
?

We use the notation for ordinals as given in Section 1.6, where lowercase Greek letters such as α\alpha, β\beta, and ω\omega denote ordinal numbers, ≺\prec and ⪯\preceq denote the usual order relations among ordinals (with equality denoted by ≈\approx), and for each ordinal α\alpha, Pα={β:0⪯β≺α}P_{\alpha }=\left\{ \beta : 0 \preceq \beta \prec \alpha \right\} denotes the set of ordinal predecessors of α\alpha. Here we let ξ\xi denote the first uncountable ordinal number (the ordinal called ω\omega in Section 1.6's own notation, renamed here to ξ\xi to avoid clashing with this section's use of ω\omega for a point of (0,1](0,1]).

For each α∈Pξ\alpha \in P_{\xi }, find a sequence {βα(n)}n=1∞\left\{ \beta_{\alpha }(n)\right\}_{n=1}^{\infty } of ordinals such that (i) βα(n)≺α\beta_{\alpha }(n) \prec \alpha for all n∈Nn \in \mathbb {N} and (ii) the set {βα(n):n is such that βα(n)=γ}\left\{ \beta_{\alpha }(n): n \text{ is such that } \beta_{\alpha }(n)=\gamma \right\} is infinite for all γ≺α\gamma \prec \alpha. Let I0\mathcal{I}_{0} be as before, except the subscript 00 is now the ordinal number 00. For each α∈Pξ\alpha \in P_{\xi }, with Iβ\mathcal{I}_{\beta } defined for each 0⪯β≺α0 \preceq \beta \prec \alpha, define Iα=(⋃β∈PαIβ)∗\mathcal{I}_{\alpha }=\left(\bigcup_{\beta \in P_{\alpha }} \mathcal{I}_{\beta }\right)^{*}. This is a transfinitely inductive definition that produces the nondecreasing class {Iα:α∈Pξ}\left\{ \mathcal{I}_{\alpha }: \alpha \in P_{\xi }\right\}. Next, given sets A1,A2,…A_{1}, A_{2}, \ldots, define Ψ(A1,A2,…)=A1c∪A2∪A3∪⋯\Psi \left(A_{1}, A_{2}, \ldots \right)=A_{1}^{c} \cup A_{2} \cup A_{3} \cup \cdots as before. Define Φ0(A1,A2,…)=A1\Phi_{0}\left(A_{1}, A_{2}, \ldots \right)=A_{1}. We define Φα(A1,A2,…)\Phi_{\alpha }\left(A_{1}, A_{2}, \ldots \right) for all α∈Pξ\alpha \in P_{\xi } as follows: if Φβ(A1,A2,…)\Phi_{\beta }\left(A_{1}, A_{2}, \ldots \right) is defined for all 0⪯β≺α0 \preceq \beta \prec \alpha, write

Φα(A1,A2,…)=Ψ(Φβα(1)(Am11,Am12,…),Φβα(2)(Am21,Am22,…),…), \Phi _{\alpha }\left(A_{1}, A_{2}, \ldots \right)=\Psi \left(\Phi _{\beta _{\alpha }(1)}\left(A_{m_{11}}, A_{m_{12}}, \ldots \right), \Phi _{\beta _{\alpha }(2)}\left(A_{m_{21}}, A_{m_{22}}, \ldots \right), \ldots \right),

where {mij:i,j∈N}\left\{ m_{i j}: i, j \in \mathbb {N}\right\} is as given in this section.

Parts (a) and (b) correspond to Lemmas 1 and 2 of this section (Lemma 1: for n≥0n \geq 0 we can find A1,A2,…∈I0A_{1}, A_{2}, \ldots \in \mathcal{I}_{0} with Φn(A1,A2,…)=(0,1]\Phi_{n}\left(A_{1}, A_{2}, \ldots \right)=(0,1], and we can find A1,A2,…∈I0A_{1}, A_{2}, \ldots \in \mathcal{I}_{0} with Φn(A1,A2,…)=∅\Phi_{n}\left(A_{1}, A_{2}, \ldots \right)=\varnothing; Lemma 2: for n≥0n \geq 0 each In\mathcal{I}_{n}-set has the form Φn(A1,A2,…)\Phi_{n}\left(A_{1}, A_{2}, \ldots \right) for some appropriately chosen A1,A2,…∈I0A_{1}, A_{2}, \ldots \in \mathcal{I}_{0}). No analog of Lemma 3 is needed. Part (c) corresponds to Lemma 5 (if A1,A2,…∈B(0,1]A_{1}, A_{2}, \ldots \in \mathscr {B}_{(0,1]}, then Φn(A1,A2,…)∈B(0,1]\Phi_{n}\left(A_{1}, A_{2}, \ldots \right) \in \mathscr {B}_{(0,1]} for all n≥0n \geq 0); no analog of Lemma 6 is needed. The notation preceding Lemma 7 and Lemma 7 itself (existence and uniqueness of the sequence {ωk}k=1∞\left\{ \omega_{k}\right\}_{k=1}^{\infty } corresponding to ω∈(0,1]\omega \in (0,1]) remain unchanged. We again let I1,I2,…I_{1}, I_{2}, \ldots denote a fixed listing of the countably many sets comprising I0\mathcal{I}_{0}. For each α∈Pξ\alpha \in P_{\xi }, define the function φα:(0,1]→2(0,1]\varphi_{\alpha }:(0,1] \rightarrow 2^{(0,1]} by writing φα(ω)=Φα(Iω1,Iω2,…)\varphi_{\alpha }(\omega )=\Phi_{\alpha }\left(I_{\omega_{1}}, I_{\omega_{2}}, \ldots \right) whenever ω↔{ωk}k=1∞\omega \leftrightarrow \left\{ \omega_{k}\right\}_{k=1}^{\infty }. Next, for each α∈Pξ\alpha \in P_{\xi }, let BαB_{\alpha } denote the set {ω∈(0,1]:ω∉φα(ω)}\left\{ \omega \in (0,1]: \omega \notin \varphi_{\alpha }(\omega )\right\}. Part (d) is the analog of Lemma 8 (the set BB constructed in this section lies outside ⋃n=0∞In\bigcup_{n=0}^{\infty } \mathcal{I}_{n}). The sets Lk,nL_{k, n} and DkD_{k} remain the same for all k,n∈Nk, n \in \mathbb {N}; Lemmas 9, 10, and 11 (establishing Lk,n,{ω:ωk=n}L_{k,n}, \left\{ \omega : \omega_{k}=n\right\}, and DkD_{k} are B(0,1]\mathscr {B}_{(0,1]}-sets) remain unchanged. Lemma 12 (the identity used to rewrite Φn\Phi_{n} of the IωukI_{\omega_{u_{k}}}'s in terms of Φn\Phi_{n} of the DukD_{u_{k}}'s) is modified as in part (e). Finally, Lemma 13 (B∈B(0,1]B \in \mathscr {B}_{(0,1]}) is modified to part (f).