# 1.12: Special Set Structures

- Page ID
- 10127

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\id}{\mathrm{id}}\)

\( \newcommand{\Span}{\mathrm{span}}\)

\( \newcommand{\kernel}{\mathrm{null}\,}\)

\( \newcommand{\range}{\mathrm{range}\,}\)

\( \newcommand{\RealPart}{\mathrm{Re}}\)

\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

\( \newcommand{\Argument}{\mathrm{Arg}}\)

\( \newcommand{\norm}[1]{\| #1 \|}\)

\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)

\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)

\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vectorC}[1]{\textbf{#1}} \)

\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)There are several other types of algebraic set structures that are weaker than \( \sigma \)-algebras. These are not particularly important in themselves, but are important for constructing \( \sigma \)-algebras and the measures on these \( \sigma \)-algebras. You may want to skip this section if you are not intersted in questions of existence and uniqueness of positive measures.

## Basic Theory

### Definitions

Throughout this section, we assume that \( S \) is a set and \( \mathscr{S} \) is a nonempty collection of subsets of \( S \). Here are the main definitions we will need.

\( \mathscr{S} \) is a \( \pi \)-system if \( \mathscr{S} \) is closed under finite intersections: if \( A, \, B \in \mathscr{S} \) then \( A \cap B \in \mathscr{S} \).

Closure under intersection is clearly a very simple property, but \( \pi \) systems turn out to be useful enough to deserve a name.

\( \mathscr{S} \) is a \( \lambda \)-system if it is closed under complements and countable *disjoint* unions.

- If \( A \in \mathscr{S} \) then \( A^c \in \mathscr{S} \).
- If \( A_i \in \mathscr{S}\) for \( i \) in a countable index set \( I \) and \( A_i \cap A_j = \emptyset \) for \( i \ne j \) then \( \bigcup_{i \in I} A_i \in \mathscr{S} \).

\( \mathscr{S} \) is a semi-algebra if it is closed under intersection and if complements can be written as finite, disjoint unions:

- If \( A, \, B \in \mathscr{S} \) then \( A \cap B \in \mathscr{S} \).
- If \( A \in \mathscr{S} \) then there exists a finite, disjoint collection \( \{B_i: i \in I\} \subseteq \mathscr{S} \) such that \( A^c = \bigcup_{i \in I} B_i \).

For our final structure, recall that a sequence \( (A_1, A_2, \ldots) \) of subsets of \( S \) is increasing if \( A_n \subseteq A_{n+1} \) for all \( n \in \N_+ \). The sequence is decreasing if \( A_{n+1} \subseteq A_n \) for all \( n \in \N_+ \). Of course, these are the standard meanings of *increasing* and *decreasing* relative to the ordinary order \( \le \) on \( \N_+ \) and the subset partial order \( \subseteq \) on \( \mathscr{P}(S) \).

\( \mathscr{S} \) is a monotone class if it is closed under increasing unions and decreasing intersections:

- If \( (A_1, A_2, \ldots) \) is an increasing sequence of sets in \( \mathscr{S} \) then \( \bigcup_{n=1}^\infty A_n \in \mathscr{S} \).
- If \( (A_1, A_2, \ldots) \) is a decreasing sequence of sets in \( \mathscr{S} \) then \( \bigcap_{n=1}^\infty A_n \in \mathscr{S} \).

If \( (A_1, A_2, \ldots) \) is an increasing sequence of sets then we sometimes write \( \bigcup_{n=1}^\infty A_n = \lim_{n \to \infty} A_n \). Similarly, if \( (A_1, A_2 \ldots) \) is a decreasing sequence of sets we sometimes write \( \bigcap_{n=1}^\infty A_n = \lim_{n \to \infty} A_n \). The reason for this notation will become clear in the section on Convergence in the chapter on Probability Spaces. With this notation, a monotone class \( \mathscr{S} \) is defined by the condition that if \( (A_1, A_2, \ldots) \) is an increasing or decreasing sequence of sets in \( \mathscr{S} \) then \( \lim_{n \to \infty} A_n \in \mathscr{S} \).

### Basic Theorems

Our most important set structure, the \( \sigma \)-algebra, has all of the properties in the definitions above.

If \( \mathscr{S} \) is a \( \sigma \)-algebra then \( \mathscr{S} \) is a \( \pi \)-system, a \( \lambda \)-system, a semi-algebra, and a monotone class.

If \( \mathscr{S} \) is a \( \lambda \)-system then \( S \in \mathscr{S} \) and \( \emptyset \in \mathscr{S} \).

## Proof

The proof is just like the one for an algebra. There exists \( A \in \mathscr{S} \) since \( \mathscr{S} \) is non-empty. Hence \( A^c \in \mathscr{S} \) and so \( S = A \cup A^c \in \mathscr{S} \). Finally \( \emptyset = S^c \in \mathscr{S} \).

Any type of algebraic structure on subsets of \( S \) that is defined purely in terms of closure properties will be preserved under intersection. That is, we will have results that are analogous to how \( \sigma \)-algebras are generated from more basic sets, with completely straightforward and analgous proofs. In the following two theorems, the term *system* could mean \( \pi \)-system, \( \lambda \)-system, or monotone class of subsets of \( S \).

If \( \mathscr{S}_i \) is a system for each \( i \) in an index set \( I \) and \( \bigcap_{i \in I} \mathscr{S}_i \) is nonempty, then \( \bigcap_{i \in I} \mathscr{S}_i \) is a system of the same type.

The condition that \( \bigcap_{i \in I} \mathscr{S}_i \) be nonempty is unnecessary for a \( \lambda \)-system, by the result above. Now suppose that \( \mathscr{B} \) is a nonempty collection of subsets of \( S \), thought of as basic sets of some sort. Then the system generated by \( \mathscr{B} \) is the intersection of all systems that contain \( \mathscr{B} \).

The system \( \mathscr{S} \) generated by \( \mathscr{B} \) is the smallest system containing \( \mathscr{B} \), and is characterized by the following properties:

- \( \mathscr{B} \subseteq \mathscr{S} \).
- If \( \mathscr{T} \) is a system and \( \mathscr{B} \subseteq \mathscr{T} \) then \( \mathscr{S} \subseteq \mathscr{T} \).

Note however, that the previous two results do not apply to semi-algebras, because the semi-algebra is not defined purely in terms of closure properties (the condition on \( A^c \) is not a closure property).

If \( \mathscr{S} \) is a monotone class and an algebra, then \( \mathscr{S} \) is a \( \sigma \)-algebra.

## Proof

All that is needed is to prove closure under countable unions. Thus, suppose that \( A_i \in \mathscr{S} \) for \( i \in \N_+ \). Then \( B_n = \bigcup_{i=1}^n A_i \in \mathscr{S} \) since \( \mathscr{S} \) is an algebra. The sequence \( (B_1, B_2, \ldots) \) is increasing, so \( \bigcup_{n=1}^\infty B_n \in \mathscr{S} \), since \( \mathscr{S} \) is a monotone class. But \( \bigcup_{n=1}^\infty B_n = \bigcup_{i=1}^\infty A_i \).

By definition, a semi-algebra is a \( \pi \)-system. More importantly, a semi-algebra can be used to construct an algebra.

Suppose that \( \mathscr{S} \) is a semi-algebra of subsets of \( S \). Then the collection \( \mathscr{S}^* \) of finite, disjoint unions of sets in \( \mathscr{S} \) is an algebra.

## Proof

Suppose that \( A, \, B \in \mathscr{S}^* \). Then there exist finite, disjoint collections \( \{A_i: i \in I\} \subseteq \mathscr{S} \) and \( \{B_j: j \in J\} \subseteq \mathscr{S} \) such that \( A = \bigcup_{i \in I} A_i \) and \( B = \bigcup_{j \in J} B_j \). Hence \[ A \cap B = \bigcup_{(i, j) \in I \times J} (A_i \cap B_j) \] But \( \{A_i \cap B_j: (i, j) \in I \times J\} \) is a finite, disjoint collection of sets in \( \mathscr{S} \), so \( A \cap B \in \mathscr{S}^* \). Suppose \( A \in \mathscr{S}^* \), so that there exists a finite, disjoint collection \( \{A_i: i \in I\} \) such that \( A = \bigcup_{i \in I} A_i \). Then \( A^c = \bigcap_{i \in I} A_i^c \). But \( A_i^c \in \mathscr{S}^* \) by definition of semi-algebra, and we just showed that \( \mathscr{S}^* \) is closed under finite intersections, so \( A^c \in \mathscr{S}^* \).

We will say that our nonempty collection \( \mathscr{S} \) is closed under proper set difference if \( A, \, B \in \mathscr{S} \) and \( A \subseteq B \) implies \( B \setminus A \in \mathscr{S} \). The following theorem gives the basic relationship between \( \lambda \)-systems and monotone classes.

Suppose that \( \mathscr{S} \) is a nonempty collection of subsets of \( S \).

- If \( \mathscr{S} \) is a \( \lambda \)-system then \( \mathscr{S} \) is a monotone class and is closed under proper set difference.
- If \( \mathscr{S} \) is a monotone class, is closed under proper set difference, and contains \( S \), then \( \mathscr{S} \) is a \( \lambda \)-system.

## Proof

- Suppose that \( \mathscr{S} \) is a \( \lambda \)-system. Suppose that \( A, \, B \in \mathscr{S} \) and \( A \subseteq B \). Then \( B^c \in \mathscr{S} \), and \( A \) and \( B^c \) are disjoint, so \( A \cup B^c \in \mathscr{S} \). But then \( (A \cup B^c)^c = B \cap A^c = B \setminus A \in \mathscr{S} \). Hence \( \mathscr{S} \) is closed under proper set difference. Next suppose that \( (A_1, A_2, \ldots) \) is an increasing sequence of sets in \( \mathscr{S} \). Let \( B_1 = A_1 \) and \( B_n = A_n \setminus A_{n-1} \) for \( n \in \{2, 3, \ldots\} \). Then \( B_i \in \mathscr{S} \) for each \( i \in \N_+ \). But the sequence \( (B_1, B_2, \ldots) \) is disjoint and has the same union as \( (A_1, A_2, \ldots) \). Hence \( \bigcup_{i=1}^\infty A_i = \bigcup_{i=1}^\infty B_i \in \mathscr{S} \). Finally, suppose that \( (A_1, A_2, \ldots) \) is a decreasing sequence of sets in \( \mathscr{S} \). Then \( A_i^c \in \mathscr{S} \) for each \( i \in \N_+ \) and \( (A_1^c, A_2^c, \ldots) \) is increasing. Hence \( \bigcup_{i=1}^\infty A_i^c \in \mathscr{S} \) and therefore \( \left(\bigcup_{i=1}^\infty A_i^c\right)^c = \bigcap_{i=1}^\infty A_i \in \mathscr{S} \).
- Suppose that \( \mathscr{S} \) is a monotone class, is closed under proper set difference, and \( S \in \mathscr{S} \). If \( A \in \mathscr{S} \) then trivially \( A \subseteq S \) so \( A^c = S \setminus A \in \mathscr{S} \). Next, suppose that \( A, \; B \in \mathscr{S} \) are disjoint. Then \( A^c \in \mathscr{S} \) and \( B \subseteq A^c \), so \( A^c \setminus B = A^c \cap B^c \in \mathscr{S} \). Hence \( A \cup B = (A^c \cap B^c)^c \in \mathscr{S} \). Finally, suppose that \( (A_1, A_2, \ldots) \) is a disjoint sequence of sets in \( \mathscr{S} \). We just showed that \( \mathscr{S} \) is closed under finite, disjoint unions, so \( B_n = \bigcup_{i=1}^n A_i \in \mathscr{S} \). But the sequence \( (B_1, B_2, \ldots) \) is increasing, and hence \( \bigcup_{n=1}^\infty B_n = \bigcup_{i=1}^\infty A_i \in \mathscr{S} \).

The following theorem is known as the monotone class theorem, and is due to the mathematician Paul Halmos.

Suppose that \( \mathscr{A} \) is an algebra, \( \mathscr{M} \) is a monotone class, and \( \mathscr{A} \subseteq \mathscr{M} \). Then \( \sigma(\mathscr{A}) \subseteq \mathscr{M} \).

## Proof

First let \( m(\mathscr{A}) \) denote the monotone class generated by \( \mathscr{A} \), as defined above. The outline of the proof is to show that \( m(\mathscr{A}) \) is an algebra, so that by (9), \( m(\mathscr{A}) \) is a \( \sigma \)-algebra. It then follows that \( \sigma(\mathscr{A}) \subseteq m(\mathscr{A}) \subseteq \mathscr{M} \). To show that \( m(\mathscr{A}) \) is an algebra, we first show that it is closed under complements and then under simple union.

Since \( m(\mathscr{A}) \) is a monotone class, the collection \( m^*(\mathscr{A}) = \{A \subseteq S: A^c \in m(\mathscr{A})\} \) is also a monotone class. Moreover, \( \mathscr{A} \subseteq m^*(\mathscr{A}) \) so it follows that \( m(\mathscr{A}) \subseteq m^*(\mathscr{A}) \). Hence if \( A \in m(\mathscr{A}) \) then \( A \in m^*(\mathscr{A}) \) so \( A^c \in m(\mathscr{A}) \). Thus \( m(\mathscr{A}) \) is closed under complements.

Let \( \mathscr{M}_1 = \{A \subseteq S: A \cup B \in m(\mathscr{A}) \text{ for all } B \in \mathscr{A}\} \). Then \( \mathscr{M}_1 \) is a monotone class and \( \mathscr{A} \subseteq \mathscr{M}_1 \) so \( m(\mathscr{A}) \subseteq \mathscr{M}_1 \). Next let \( \mathscr{M}_2 = \{A \subseteq S: A \cup B \in m(\mathscr{A}) \text{ for all } B \in m(\mathscr{A})\} \). Then \( \mathscr{M}_2 \) is also a monotone class. Let \( A \in \mathscr{A} \). If \( B \in m(\mathscr{A})\) then \( B \in \mathscr{M}_1 \) and hence \( A \cup B \in m(\mathscr{A}) \). Hence \( A \in \mathscr{M}_2 \). Thus we have \( \mathscr{A} \subseteq \mathscr{M}_2 \), so \( m(\mathscr{A}) \subseteq \mathscr{M}_2 \). Finally, let \( A, \, B \in m(\mathscr{A}) \). Then \( A \in \mathscr{M}_2 \) so \( A \cup B \in m(\mathscr{A}) \) and therefore \( m(\mathscr{A}) \) is closed under simple union.

As noted in (5), a \( \sigma \)-algebra is both a \( \pi \)-system and a \( \lambda \)-system. The converse is also true, and is one of the main reasons for studying these structures.

If \( \mathscr{S} \) is a \( \pi \)-system and a \( \lambda \)-system then \( \mathscr{S} \) is a \( \sigma \)-algebra.

## Proof

\( S \in \mathscr{S} \), and if \( A \in \mathscr{S} \) then \( A^c \in \mathscr{S} \) by definition of a \( \lambda \)-system. Thus, all that is left is to show closure under countable unions. Thus, suppose that \( (A_1, A_2, \ldots) \) is a sequence of sets in \( \mathscr{S} \). Then \( A_i^c \in \mathscr{S} \) for each \( i \in \N_+ \). Since \( \mathscr{S} \) is also a \( \pi \)-system, it follows that for each \( n \in \N_+ \), \( B_n = A_n \cap A_1^c \cap \cdots \cap A_{n-1}^c \in \mathscr{S} \) (by convention \( B_1 = A_1 \)). But the sequence \( (B_1, B_2, \ldots) \) is disjoint and has the same union as \( (A_1, A_2, \ldots) \). Hence \( \bigcup_{i=1}^\infty A_i = \bigcup_{i=1}^\infty B_i \in \mathscr{S} \).

The importance of \( \pi \)-systems and \( \lambda \)-systems stems in part from Dynkin's \( \pi \)-\( \lambda \) theorem given next. It's named for the mathematician Eugene Dynkin.

Suppose that \( \mathscr{A} \) is a \( \pi \)-system of subsets of \( S \), \( \mathscr{B} \) is a \( \lambda \)-system of subsets of \( S \), and \( \mathscr{A} \subseteq \mathscr{B} \). Then \( \sigma(\mathscr{A}) \subseteq \mathscr{B} \).

## Proof

Let \( \mathscr{L} \) denote the \( \lambda \)-system generated by \( \mathscr{A} \). Then of course \( \mathscr{A} \subseteq \mathscr{L} \subseteq \mathscr{B} \). For \( A \in \mathscr{L} \), let \[ \mathscr{L}_A = \{B \subseteq S: B \cap A \in \mathscr{L}\}\] We will show that \( \mathscr{L}_A \) is a \( \lambda \)-system. Note that \( S \cap A = A \in \mathscr{L}\) and therefore \( S \in \mathscr{L}_A \). Next, suppose that \( B_1, \, B_2 \in \mathscr{L}_A \) and that \( B_1 \subseteq B_2 \). Then \( B_1 \cap A \in \mathscr{L} \) and \( B_2 \cap A \in \mathscr{L} \) and \( B_1 \cap A \subseteq B_2 \cap A \). Hence \( (B_2 \setminus B_1) \cap A = (B_2 \cap A) \setminus (B_1 \cap A) \in \mathscr{L} \). Hence \( B_2 \setminus B_1 \in \mathscr{L}_A \). Finally, suppose that \( \{B_i: i \in I\} \) is a countable, disjoint collection of sets in \( \mathscr{L}_A \). Then \( B_i \cap A \in \mathscr{L} \) for each \( i \in I \), and \( \{B_i \cap A: i \in I\} \) is also a disjoint collection. Therefore, \( \bigcup_{i \in I} (B_i \cap A) = \left(\bigcup_{i \in I} B_i \right) \cap A \in \mathscr{L} \). Hence \( \bigcup_{i \in I} B_i \in \mathscr{L}_A \).

Next fix \( A \in \mathscr{A} \). If \( B \in \mathscr{A} \) then \( A \cap B \in \mathscr{A} \), so \( A \cap B \in \mathscr{L} \) and hence \( B \in \mathscr{L}_A \). But \( \mathscr{L} \) is the smallest \( \lambda \)-system containing \( \mathscr{A} \) so we have shown that \( \mathscr{L} \subseteq \mathscr{L}_A \) for every \( A \in \mathscr{A} \). Now fix \( B \in \mathscr{L}\). If \( A \in \mathscr{A} \) then \( B \in \mathscr{L}_A \) so \( A \cap B \in \mathscr{L} \) and therefore \( A \in \mathscr{L}_B \). Again, \( \mathscr{L} \) is the smallest \( \lambda \)-system containing \( \mathscr{A} \) so we have now shown that \( \mathscr{L} \subseteq \mathscr{L}_B \) for every \( B \in \mathscr{L} \). Finally, let \( B, \, C \in \mathscr{L} \). Then \( C \in \mathscr{L}_B \) and hence \( B \cap C \in \mathscr{L} \). It now follows that \( \mathscr{L} \) is a \( \pi \)-system, as well as a \( \lambda \)-system, and therefore by the theorem above, \( \mathscr{L} \) is a sigma-algebra. But \( \mathscr{A} \subseteq \mathscr{L} \) and hence \( \sigma(\mathscr{A}) \subseteq \mathscr{L} \).

## Examples and Special Cases

Suppose that \( S \) is a set and \( \mathscr{A} \) is a finite partition of \( S \). Then \( \mathscr{S} = \{\emptyset\} \cup \mathscr{A} \) is a semi-algebra of subsets of \( S \).

## Proof

If \( A, \, B \in \mathscr{A} \) then \( A \cap B = \emptyset \in \mathscr{S} \). If \( A \in \mathscr{S} \) then \( A^c = \bigcup\{B \in \mathscr{A}: B \neq A \}\)

### Euclidean Spaces

The following example is particulalry important because it will be used to construct positive measures on \( \R \). Let \[ \mathscr{B} = \{(a, b]: a, \, b \in \R, \; a \lt b\} \cup \{(-\infty, b]: b \in \R\} \cup \{(a, \infty): a \in \R \} \]

\( \mathscr{B} \) is a semi-algebra of subsets of \( \R \).

## Proof

Note that the intersection of two intervals of the type in \( \mathscr{B} \) is another interval of this type. The complement of an interval of this type is either another interval of this type or the union of two disjoint intervals of this type.

It follows from the theorem above that the collection \( \mathscr{A} \) of finite disjoint unions of intervals in \( \mathscr{B} \) is an algebra. Recall also that \( \sigma(\mathscr{B}) = \sigma(\mathscr{A}) \) is the Borel \( \sigma \)-algebra of \( \R \), named for Émile Borel. We can generalize all of this to \( \R^n \) for \( n \in \N_+ \)

The collection \( \mathscr{B}_n = \left\{\prod_{i=1}^n A_i: A_i \in \mathscr{B} \text{ for each } i \in \{1, 2, \ldots, n\} \right\} \) is a semi-algebra of subsets of \( \R^n \).

Recall also that \( \sigma(\mathscr{B}_n) \) is the \( \sigma \)-algebra of Borel sets of \( \R^n \).

### Product Spaces

The examples in this discussion are important for constructing positive measures on product spaces.

Suppose that \(\mathscr S\) is a semi-algebra of subsets of a set \( S \) and that \(\mathscr T\) is a semi-algebra of subsets of a set \( T \). Then \[ \mathscr U = \{A \times B: A \in \mathscr S, B \in \mathscr T\} \] is a semi-algebra of subsets of \( S \times T \).

## Proof

- Suppose that \( A \times B, \, C \times D \in \mathscr U \), so that \( A, \, C \in \mathscr S \) and \( B, \, D \in \mathscr T \). Recall that \( (A \times B) \cap (C \times D) = (A \cap C) \times (B \cap D) \). But \( A \cap C \in \mathscr S \) and \( B \cap D \in \mathscr T \) so \( (A \times B) \cap (C \times D) \in \mathscr U \).
- Suppose that \( A \times B \in \mathscr B \) so that \( A \in \mathscr S \) and \( B \in \mathscr T \). Then \[ (A \times B)^c = (A^c \times B) \cup (A \times B^c) \cup (A^c \times B^c) \] There exists a finite, disjoint collection \( \{A_i: i \in I\} \) of sets in \( \mathscr S \) and a finite, disjoint collection \( \{B_j: j \in J\} \) of sets in \( \mathscr T \) such that \( A^c = \bigcup_{i \in I} A_i\) and \( B^c = \bigcup_{j \in J} B_j \). Hence \[ (A \times B)^c = \left[\bigcup_{i \in I} (A_i \times B)\right] \cup \left[\bigcup_{j \in J} (A \times B_j)\right] \cup \left[\bigcup_{i \in I} \bigcup_{j \in J} (A_i \times B_j)\right] \] All of the product sets in this union are in \( \mathscr U \) and the product sets are disjoint.

This result extends in a completely straightforward way to a product of a finite number of sets.

Suppose that \( n \in \N_+ \) and that \( \mathscr S_i \) is a semi-algebra of subsets of a set \( S_i \) for \( i \in \{1, 2, \ldots, n\} \). Then \[ \mathscr U = \left\{\prod_{i=1}^n A_i: A_i \in \mathscr S_i \text{ for all } i \in \{1, 2, \ldots, n\}\right\} \] is a semi-algebra of subsets of \( \prod_{i=1}^n S_i \).

Note that the semi-algebra of products of intervals in \( \R^n \) described above is a special case of this result. For the product of an infinite sequence of sets, the result is bit more tricky.

Suppose that \( \mathscr S_i \) is a semi-algebra of subsets of a set \( S_i \) for \( i \in \N_+ \). Then \[ \mathscr U = \left\{\prod_{i=1}^\infty A_i: A_i \in \mathscr S_i \text{ for all } i \in \N_+ \text{ and } A_i = S_i \text{ for all but finitely many } i \in \N_+\right\} \] is a semi-algebra of subsets of \( \prod_{i=1}^n S_i \).

## Proof

The proof is very much like the previous ones.

- Suppose that \( A = \prod_{i=1}^\infty A_i \in \mathscr U \) and \( B = \prod_{i=1}^\infty B_i \in \mathscr U \), so that \( A_i, \, B_i \in \mathscr S_i \) for \( i \in \N_+ \) and \( A_i = S_i \) for all but finitely many \( i \in \N_+ \) and \( B_i = S_i \) for all but finitely many \( i \in \N_+ \). Then \( A \cap B = \prod_{i=1}^\infty (A_i \cap B_i) \). Also, \( A_i \cap B_i \in \mathscr S_i \) for \( i \in \N_+ \) and \( A_i \cap B_i = S_i \) for all but finitely many \( in \in \N_+ \). So \( A \cap B \in \mathscr U \).
- Suppose that \( A = \prod_{i=1}^\infty A_i \in \mathscr U \), where \( A_i \in \mathscr S_i \) for \( i \in \N_+ \) and \( A_i = S_i \) for \( i \gt n \), for some \( n \in \N_+ \). Then \( A^c = \bigcup_{j=1}^n B_j \) where \[ B_j = A_1 \times \cdots \times A_{j-1} \times A_j^c \times S_{j+1} \times S_{j+2} \times \cdots, \quad j \in \{1, 2, \ldots, n\}\] Note that the product sets in this union are disjoint. But for each \( j \in \{1, 2, \ldots, n\} \) there exists a finite disjoint collection \( \{C_{j,k}: k \in K_j\} \) such that \( A_j^c = \bigcup_{k \in K_j} C_{j,k} \). Substituting and distributing then gives \( A^c \) as a finite, disjoint union of sets in \( \mathscr U \).

Note that this result would not be true with \( \mathscr U = \left\{\prod_{i=1}^\infty A_i: A_i \in \mathscr S_i \text{ for all } i \in \N_+\right\}\). In general, the complement of a set in \( \mathscr U \) cannot be written as a finite disjoint union of sets in \( \mathscr U \).