I have read everything in Folland's real analysis book up to Proposition 1.23, but I have a very hard time understanding this proposition and what immediately precedes it using the set theory introduced by the author. I'm paraphrasing now:
Consider a set $X$ and family of sets $\mathcal E\subset\mathcal P(X)$. Let $\mathcal E_1=\mathcal{E}\cup\{E^c:E\in\mathcal E\}$ and then for $j>1$ define $\mathcal E_j$ to be the collection of all sets that are countable unions of sets in $\mathcal E_{j-1}$ or complements of such. Let $\mathcal E_\omega=\bigcup_1^\infty\mathcal E_j$. If $E\in \mathcal E_\omega$, it is in one of the $\mathcal E_j$'s, but then $E^c\in\mathcal E_{j+1}$, so $E^c\in\mathcal E_\omega$. Apparently the set is not closed under countable unions. The claim is that if $E_j\in\mathcal E_j\setminus\mathcal E_{j-1}$ for each $j$, there's no reason for $\bigcup_1^\infty E_j$ to be in $\mathcal E_\omega$.
- My first question is, why not? Is there an easy-to-understand counterexample for when $\bigcup_1^\infty E_j\notin\mathcal E_\omega$?
The author goes on to say one must start all over again and define $\mathcal E_\alpha$ for each countable ordinal $\alpha$ by transfinite induction: If $\alpha$ has an immediate predecessor $\beta$, $\mathcal E_\alpha$ is the collection of sets that are countable unions of sets in $\mathcal E_\beta$ or complements of such; otherwise, $\mathcal E_\alpha=\bigcup_{\beta<\alpha}\mathcal E_\beta$.
- The author hasn't really defined what a countable ordinal is nor what a predecessor is (or if there isn't a predecessor). I gather a countable ordinal is an initial segment of $\Omega$, the set of countable ordinals, but I'm not sure what he means by predecessor (or if there isn't one). Moreover, where in defining $\mathcal E_\alpha$ did we use transfinite induction? Transfinite induction has barely been used in the book so far, so I'm sorry if I don't see this immediately.
Finally,
1.23 Proposition. $\mathcal M(\mathcal E)=\bigcup_{\alpha\in\Omega} \mathcal E_\alpha$ where $\mathcal M(\mathcal E)$ is the $\sigma$-algebra generated by $\mathcal E$.
Proof. Transfinite induction shows that $\mathcal E_\alpha\subset \mathcal M(\mathcal E)$ for all $\alpha\in\Omega$, and hence $\bigcup_{\alpha\in\Omega} \mathcal E_\alpha\subset \mathcal M(\mathcal E)$. The reverse inclusion follows from the fact that any sequence in $\Omega$ has a supremum in $\Omega$ (Proposition 0.19): If $E_j\in\mathcal E_{\alpha_j}$ for $j\in\mathbb N$ and $\alpha=\sup\{a_j\}$, then $E_j\in\mathcal E_\alpha$ for all $j$ and hence $\bigcup_1^\infty E_j\in\mathcal E_\beta$ where $\beta$ is the successor of $\alpha$.
- How does it follow from transfinite induction that $\mathcal E_\alpha\subset \mathcal M(\mathcal E)$ for all $\alpha\in\Omega$? Why is $E_j\in\mathcal E_\alpha$ for all $j$ and why does it follow that $\bigcup_1^\infty E_j\in\mathcal E_\beta$? What's the definition of a successor?
For reference, here's the statement of transfinite induction in the book. Let $X$ be a well ordered set and $x\in X$, then $I_x=\{y\in X:y<x\}$ is an initial segment of $x$.
0.15 The Principle of Transfinite Induction. Let $X$ be a well ordered set. If $A$ is a subset of $X$ such that $x\in A$ whenever $I_x\subset A$, then $A=X$.