5.5: Indexed Families of Sets
 Page ID
 7064
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{\!\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
Preview Activity \(\PageIndex{1}\): The Union and Intersection of a Family of Sets
In Section 5.3, we discussed various properties of set operations. We will now focus on the associative properties for set union and set intersection. Notice that the definition of “set union” tells us how to form the union of two sets. It is the associative law that allows us to discuss the union of three sets. Using the associate law, if \(A\), \(B\), and \(C\) are subsets of some universal set, then we can define \(A \cup B \cup C\) to be \((A \cup B) \cup C\) or \(A \cup ( B \cup C)\). That is,
\(A \cup B \cup C = (A \cup B) \cup C = A \cup (B \cup C).\)
For this activity, the universal set is N and we will use the following four sets:
\(A =\) {1, 2, 3, 4, 5}
\(B =\) {2, 3, 4, 5, 6}
\(C =\) {3, 4, 5, 6, 7}
\(D =\) {4, 5, 6, 7, 8}

Use the roster method to specify the sets \(A \cup B \cup C\), \(B \cup C \cup D\), \(A \cap B \cap C\), and \(B \cap C \cap D\).

Use the roster method to specify each of the following sets. In each case, be sure to follow the order specified by the parentheses.
(a) \((A \cup B \cup C) \cup D\)
(b) \(A \cup (B \cup C \cup D)\)
(c) \(A \cup (B \cup C) \cup D\)
(d) \((A \cup B) \cup (C \cup D)\)
(e) \((A \cap B \cap C) \cap D\)
(f) \(A \cap (B \cap C \cap D)\)
(g) \(A \cap (B \cap C) \cap D\)
(h) \((A \cap B) \cap (C \cap D)\) 
Based on the work in Part (2), does the placement of the parentheses matter when determining the union (or intersection) of these four sets? Does this make it possible to define \(A \cup B \cup C \cup D\) and \(A \cap B \cap C \cap D\)?
We have already seen that the elements of a set may themselves be sets. For example, the power set of a set \(T\), \(\mathcal{P}(T)\), is the set of all subsets of \(T\). The phrase, “a set of sets” sounds confusing, and so we often use the terms collection and family when we wish to emphasize that the elements of a given set are themselves sets. We would then say that the power set of \(T\) is the family (or collection) of sets that are subsets of \(T\).
One of the purposes of the work we have done so far in this preview activity was to show that it is possible to define the union and intersection of a family of sets.
Definition
Let \(\mathcal{C}\) be a family of sets. The union over \(\mathcal{C}\) is defined as the set of all elements that are in at least one of the sets in \(\mathcal{C}\). We write
\(\bigcup_{X \in \mathcal{C}}^{} X = \{x \in U\ \ x \in X \text{ for some } X \in \mathcal{C}\}\)
The intersection over \(\mathcal{C}\) is defined as the set of all elements that are in all of the sets in \(\mathcal{C}\). That is,
\(\bigcap_{X \in \mathcal{C}}^{} X = \{x \in U\ \ x \in X \text{ for some } X \in \mathcal{C}\}\)
For example, consider the four sets \(A\), \(B\), \(C\), and \(D\) used earlier in this preview activity and the sets
\(S =\) {5, 6, 7, 8, 9} and \(T =\) {6, 7, 8, 9, 10}
We can then consider the following families of sets: \(\mathcal{A} = \{A, B, C, D\}\) and \(\mathcal{B} = \{A, B, C, D, S, T\}\)

Explain why
\(\bigcup_{X \in \mathcal{A}}^{} X = A \cup B \cup C \cup D\) and \(\bigcap_{X \in \mathcal{A}}^{} X = A \cap B \cap C \cap D\)
and use your work in (1), (2), and (3) to determine \(\bigcup_{X \in \mathcal{A}}^{} X\) and \(\bigcap_{X \in \mathcal{A}}^{} X\).

Use the roster method to specify \(\bigcup_{X \in \mathcal{B}}^{} X\) and \(\bigcap_{X \in \mathcal{B}}^{} X\)
6. Use the roster method to specify the sets \((\bigcup_{X \in \mathcal{A}}^{} X)^c\) and \(\bigcap_{X \in \mathcal{A}}^{} X^c\). Remember that the universal set is \(\mathbb{N}\).
Preview Activity \(\PageIndex{2}\): An Indexed Family of Sets
We often use subscripts to identify sets. For example, in Preview Activity \(\PageIndex{1}\), instead of using \(A\), \(B\), \(C\), and \(D\) as the names of the sets, we could have used \(A_1\), \(A_2\), \(A_3\), and \(A_4\). When we do this, we are using the subscript as an identifying tag, or index, for each set. We can also use this idea to specify an infinite family of sets. For example, for each natural number \(n\), we define
\(C_n = \{n, n + 1, n + 2, n + 3, n + 4\}.\)
So if we have a family of sets \(\mathcal{C} = \{C_1, C_2, C_3, C_4\}\), we use the notation \(\bigcup_{j = 1}^{4} C_j\) to mean the same thing as \(\bigcup_{x \in \mathcal{C}}^{} X\).
 Determine \(\bigcup_{j = 1}^{4} C_j\) and \(\bigcap_{j = 1}^{4} C_j\)
We can see that with the use of subscripts, we do not even have to define the family of sets \(\mathcal{A}\). We can work with the infinite family of sets
\[\mathcal{C} ^{\ast} = \{A_n\ \ n \in \mathbb{N}\}\]
and use the subscripts to indicate which sets to use in a union or an intersection.  Use the roster method to specify each of the following pairs of sets. The universal set is \(\mathbb{N}\).
(a) \(\bigcup_{j = 1}^{6} C_j\) and \(\bigcap_{j = 1}^{6} C_j\)
(b) \(\bigcup_{j = 1}^{8} C_j\) and \(\bigcap_{j = 1}^{8} C_j\)
(c) \(\bigcup_{j = 4}^{8} C_j\) and \(\bigcap_{j = 4}^{8} C_j\)
(d) \((\bigcap_{j = 1}^{4} C_j)^c\) and \(\bigcup_{j = 1}^{4} C_j ^c\)
The Union and Intersection over an Indexed Family of Sets
One of the purposes of the preview activities was to show that we often encounter situations in which more than two sets are involved, and it is possible to define the union and intersection of more than two sets. In Preview Activity \(\PageIndex{2}\), we also saw that it is often convenient to “index” the sets in a family of sets. In particular, if \(n\) is a natural number and \(\mathcal{A} = \{A_1, A_2, ..., A_n\}\) is a family of \(n\) sets, then the union of these \(n\) sets, denoted by \(A_1 \cup A_2 \cup \cdot\cdot\cdot \cup A_n\) or \(\bigcup_{j = 1}^{n} A_j\), is defined as
\[\bigcup_{j = 1}^{n} A_j = \{x \in U\ \ x \in A_j, \text{ for some } j \text{ with } 1 \le j \le n\}.\]
We can also defined the intersection of these \(n\) sets, denoted by \(A_1 \cap A_2 \cap \cdot\cdot\cdot \cap A_n\) or \(\bigcap_{j = 1}^{n} A_j\), as
\[\bigcap_{j = 1}^{n} A_j = \{x \in U\ \ x \in A_j, \text{ for some } j \text{ with } 1 \le j \le n\}.\]
We can also extend this idea to define the union and intersection of a family that consists of infinitely many sets. So if \(\mathcal{B} = \{B_1, B_2, ..., B_n, ...\}\), then
\(\bigcup_{j = 1}^{\infty} B_j = \{x \in U\ \ x \in B_j, \text{ for some } j \text{ with } j \ge 1\}\), and
\(\bigcap_{j = 1}^{\infty} B_j = \{x \in U\ \ x \in B_j, \text{ for all } j \text{ with } j \ge 1\}\).
Progress Check 5.26 (An Infinite Family of Sets)
For each natural number \(n\), let \(A_n = \{1, n, n^2\}\). For example,
\(A_1 = \{1\}\), \(A_2 = \{1, 2, 4\}\), \(A_3 = \{1, 3, 9\}\),
and
\(\bigcup_{j = 1}^{3} A_j = \{1, 2, 3, 4, 9\}\), \(\bigcap_{j = 1}^{3} A_j = \{1\}\).
Determine each of the following sets:
 \(\bigcup_{j = 1}^{6} A_j\)
 \(\bigcap_{j = 1}^{6} A_j\)
 \(\bigcup_{j = 3}^{6} A_j\)
 \(\bigcap_{j = 3}^{6} A_j\)
 \(\bigcup_{j = 1}^{\infty} A_j\)
 \(\bigcap_{j = 1}^{\infty} A_j\)
 Answer

Add texts here. Do not delete this text first.
In all of the examples we have studied so far, we have used \(\mathbb{N}\) or a subset of \(\mathbb{N}\) to index or label the sets in a family of sets. We can use other sets to index or label sets in a family of sets. For example, for each real number \(x\), we can define \(B_x\) to be the closed interval [x, x + 2]. That is,
\(B_x = \{y \in \mathbb{R}\ \ x \le y \le x + 2\}\).
So we make the following definition. In this definition,\(\wedge\) is the uppercase Greek letter lambda and \(\alpha\) is the lowercase Greek letter alpha.
Definition
Let \(\Lambda\) be a nonempty set and suppose that for each \(\alpha \in \wedge\), there is a corresponding set \(A_{\alpha}\). The family of sets \(\{A_{\alpha}\ \ \alpha \in \wedge\}\) is called an indexed family of sets indexed by \(\wedge\). Each \(\alpha \in \wedge\) is called an index and \(\Lambda\) is called an indexing set.
Progress Check 5.27 (Indexed Families of Sets)
In each of the indexed families of sets that we seen so far, if the indices were different, then the sets were different. That is, if \(\Lambda\) is an indexing for the family of sets \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \wedge\}\), then if \(\alpha, \beta \in \wedge\) and \(\alpha \ne \beta\), then \(A_{\alpha} \ne A_{\beta}\). (Note: The letter \(\beta\) is the Greek lowercase beta.)
 Let \(\Lambda = \{1, 2, 3, 4\}\), and for each \(n \in \Lambda\), let \(A_n = \{2n + 6, 16  3n\}\), and let \(\mathcal{A} = \{A_1, A_2, A_3, A_4\}\). Determine \(A_1\), \(A_2\), \(A_3\), and \(A_4\).
 Is the following statement true or false for the indexed family \(\mathcal{A}\) in (1)?
 Now let \(\Lambda = \mathbb{R}\). For each \(x \in \mathbb{R}\), define \(B_x = \{0, x^2, x^4\}\). Is the following statement true for the indexed family of set \(\mathcal{B} = \{B_x\ \ x \in \mathbb{R}\}\)?
For all \(x, y \in \mathbb{R}\), if \(x \ne y\), then \(B_x \ne B_y\).
 Answer

Add texts here. Do not delete this text first.
We now restate the definitions of the union and intersection of a family of sets for an indexed family of sets.
Definition
Let \(\Lambda\) be a nonempty indexing set and let \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) be an indexed family of sets. The union over \(\mathcal{A}\) is defined as the set of all elements that are in at least one of sets \(A_{\alpha}\), where \(\alpha \in \wedge\). We write
\(\bigcup_{\alpha \in \Lambda}^{} A_{\alpha} = \{x \in U\ \ \text{ there exits an } \alpha \in \Lambda \text{ with } x \in A_{\alpha}\}\).
The intersection over (\mathcal{A}\) is the set of all elements that are in all of the sets \(A_{\alpha}\) for each \(\alpha \in \Lambda\). That is,
\(\bigcap_{\alpha \in \wedge}^{} A_{\alpha} = \{x \in U\ \ \text{ for all } \alpha \in \wedge, x \in A_{\alpha}\}\).
Example 5.28 (A Family of Sets Indexed by the Positive Real Numbers)
For each positive real numbe \(\alpha\), let \(A_{\alpha}\) be the interval (1, \(\alpha\)]. That is,
\(A_{\alpha} = \{x \in \mathbb{R}\ \ 1 < x \le \alpha\}.\)
If we let \(\mathbb{R} ^{+}\) be the set of positive real numbers, then we have a family of sets indexed by \(\mathbb{R} ^{+}\). We will first determine the union of this family of sets. Notice that for each \(\alpha \in mathbb{R} ^{+}\), \(\alpha \in A_{\alpha}\), and if \(y\) is a real number with \(1 < y \le 0\), then \(y \in A_{\alpha}\). Also notice that if \(y \in \mathbb{R}\) and \(y < 1\), then for each \(\alpha \in mathbb{R} ^{+}\), \(y \notin A_{\alpha}\). With these observations, we conclude that
\(\bigcup_{\alpha \in \mathbb{R} ^{+}}^{} A_{\alpha} = (1, \infty) = \{x \in \mathbb{R}\ \ 1 < x\}.\)
To determine the intersection of this family, notice that
 if \(y \in \mathbb{R}\) and \(y < 1\), then for each \(\alpha \in \mathbb{R} ^{+}\), \(y \notin A_{\alpha}\);
 if \(y \in \mathbb{R}\) and \(1 < y \le 0\), then \(y \in A_{\alpha}\) for each \(\alpha \in mathbb{R} ^{+}\); and
 if \(y \in \mathbb{R}\) and \(y > 0\), then of we let \(\beta = \dfrac{y}{2}\), \(y > \beta\) and \(y \notin A_{\beta}\).
From these observations, we conclude that
\(\bigcap_{\alpha \in \mathbb{R} ^{+}}^{} A_{\alpha} = (1, 0] = \{x \in \mathbb{R}\ \ 1 < x \le 0\}.\)
Progress Check 5.29 (A Continuation of Example 5.28)
Using the family of sets from Example 5.28, for each \(\alpha \in mathbb{R} ^{+}\), we see that
\(A_{\alpha} ^c = (\infty, 1] \cup (\alpha, \infty).\)
Use the results from Example 5.28 to help determine each of the following sets. For each set, use either interval notation or set builder notation.
 \((\bigcup_{\alpha \in \mathbb{R} ^{+}}^{} A_{\alpha})^c\)
 \((\bigcap_{\alpha \in \mathbb{R} ^{+}}^{} A_{\alpha})^c\)
 \(\bigcap_{\alpha \in \mathbb{R} ^{+}}^{} A_{\alpha} ^c\)
 \(\bigcup_{\alpha \in \mathbb{R} ^{+}}^{} A_{\alpha} ^c\)
 Answer

Add texts here. Do not delete this text first.
Properties of Union and Intersection
In Theorem 5.30, we will prove some properties of set operations for indexed families of sets. Some of these properties are direct extensions of corresponding properties for two sets. For example, we have already proved De Morgan’s Laws for two sets in Theorem 5.20. The work in the preview activities and Progress Check 5.29 suggests that we should get similar results using set operations with an indexed family of sets. For example, in Preview Activity \(\PageIndex{2}\), we saw that
\((\bigcap_{j = 1}^{4} A_j)^c = \bigcup_{j = 1}^{4} A_j ^c.\)
Theorem 5.30.
Let \(\Lambda\) be a nonempty indexing set and let \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \wedge\}\) be an indexed family of sets. Then
 For each \(\beta \in \Lambda\), \(\bigcap_{\alpha \in \Lambda} A_{\alpha} \subseteq A_{\beta}\)
 For each \(\beta \in \Lambda\), \(A_{\beta} \subseteq \bigcup_{\alpha \in \Lambda} A_{\alpha}\)
 \((\bigcap_{\alpha \in \Lambda}^{} A_{\alpha})^c = \bigcup_{\alpha \in \Lambda}^{} A_{\alpha} ^c\)
 \((\bigcup_{\alpha \in \Lambda}^{} A_{\alpha})^c = \bigcap_{\alpha \in \Lambda}^{} A_{\alpha} ^c\)
Parts (3) and (4) are known as De Morgan's Laws.
 Proof

We will prove Parts (1) and (3). The proofs of Parts (2) and (4) are included in Exercise (4). So we let \(\Lambda\) be a nonempty indexing set and let \(mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) be an indexed family of sets. To prove Part (1), we let \(\beta \in \Lambda\) and note that if \(x \in \bigcap_{\alpha \in \Lambda}^{} A_{\alpha}\), then \(x \in A_{\alpha}\), for all \(\alpha \in \Lambda\). Since \(\beta\) is one element in \(\Lambda\), we may conclude that \(x \in A_{\beta}\). This proves that \(\bigcap_{\alpha \in \Lambda}^{} A_{\alpha} \subseteq A_{\beta}\).
To prove Part (3), we will prove that each set is a subset of the other set. We first let \(x \in (\bigcap_{\alpha \in \Lambda}^{} A_{\alpha})^c\). This means that \(x \notin (\bigcap_{\alpha \in \Lambda}^{} A_{\alpha})\), and this means that
there exists a \(\beta \in \Lambda\) such that \(x \notin A_{\beta}\).
Hence, \(x \in A_{\beta} ^c\), which implies that \(x \in \bigcup_{\alpha \in \Lambda}^{} A_{\alpha} ^c\). Therefore, we have proved that
\[(\bigcap_{\alpha \in \Lambda}^{} A_{\alpha})^c \subseteq \bigcup_{\alpha \in \Lambda}^{} A_{\alpha} ^c.\]
We now let \(y \in \bigcup_{\alpha \in \Lambda}^{} A_{\alpha} ^c\). This means that there exists a \(\beta \in \Lambda\) such that \(y \in A_{\beta} ^c\) or \(y \notin A_{\beta}\). However, since \(y \notin A_{\beta}\), we may conclude that \(y \notin \bigcap_{\alpha \in \Lambda}^{} A_{\alpha}\) and, hence, \(y \in (\bigcap_{\alpha \in \Lambda}^{} A_{\alpha})^c\). This proves that
\[\bigcup_{\alpha \in \Lambda}^{} A_{\alpha} ^c \subseteq (\bigcap_{\alpha \in \Lambda}^{} A_{\alpha})^c.\]
Using the results in (5.5.4) and (5.5.5), we have proved that \((\bigcap_{\alpha \in \Lambda}^{} A_{\alpha})^c = \bigcup_{\alpha \in \Lambda}^{} A_{\alpha} ^c.\)
Many of the other properties of set operations are also true for indexed families of sets. Theorem 5.31 states the distributive laws for set operations.
Theorem 5.31.
Let \(\Lambda\) be a nonempty indexing set and let \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) be an indexed family of sets, and let \(B\) be a set. Then
 \(B \cap (\bigcup_{\alpha \in \Lambda}^{} A_{\alpha}) = \bigcup_{\alpha \in \Lambda}^{} (B \cap A_{\alpha})\), and
 \(B \cup (\bigcap_{\alpha \in \Lambda}^{} A_{\alpha}) = \bigcap_{\alpha \in \Lambda}^{} (B \cup A_{\alpha})\).
 Proof

The proof of Theorem 5.31 is Exercise (5).
Pairwise Disjoint Families of Sets
In Section 5.2, we defined two sets \(A\) and \(B\) to be disjoint provided that \(A \cap B = \emptyset\). In a similar manner, if \(\Lambda\) is a nonempty indexing set and \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) is an indexed family of sets, we can say that this indexed family of sets is disjoint provided that \(\bigcap_{\alpha \in \Lambda}^{} A_{\alpha} = \emptyset\). However, we can use the concept of two disjoint sets to define a somewhat more interesting type of “disjointness” for an indexed family of sets.
Definition
Let \(\Lambda\) be a nonempty indexing set, and let \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) be an indexed family of sets. We say that \(\mathcal{A}\) is pair wise disjoint provided that for all \(\alpha\) and \(\beta\) in \(\Lambda\), if \(A_{\alpha} \ne A_{\beta}\), then \(A_{\alpha} \cap A_{\beta} = \emptyset\).
Progress Check 5.32 (Disjoint Families of Sets)
Figure 5.7 shows two families of sets,
\(\mathcal{A} = \) {\(A_1\), \(A_2\), \(A_3\), \(A_4\)} and \(\mathcal{B} = \) {\(B_1\), \(B_2\), \(B_3\), \(B_4\)}.

Is the family of sets \(\mathcal{A}\) a disjoint family of sets? A pairwise disjoint family of sets?

Is the family of sets \(\mathcal{B}\) a disjoint family of sets? A pairwise disjoint family of sets?
Now let the universal be \(\mathbb{R}\). For each \(n \in \mathbb{N}\), let \(C_n =\ (n, \infty)\), and let \(\mathcal{C} = \{C_n\ \ n \in \mathbb{N}\}\). 
Is the family of sets \(\mathcal{C}\) a disjoint family of sets? A pairwise disjoint family of sets?
 Answer

Add texts here. Do not delete this text first.
Exercise \(\PageIndex{1}\)
 For each natural number \(n\), let \(A_n = \{n, n + 1, n + 2, n + 3\}\). Use the roster method to specify each of the following sets:
(a) \(\bigcap_{j = 1}^{3} A_j\)
(b) \(\bigcup_{j = 1}^{3} A_j\)
(c) \(\bigcap_{j = 3}^{7} A_j\)
(d) \(\bigcup_{j = 3}^{7} A_j\)
(e) \(A_9 \cap (\bigcup_{j = 3}^{7} A_j)\)
(f) \(\bigcup_{j = 3}^{7} (A_9 \cap A_j)\)  For each natural number \(n\), let \(A_n = \{k \in \mathbb{N}\ \ k \ge n\}\). Use the roster method or set builder notation to specify each of the following sets:
(a) \(\bigcap_{j = 1}^{5} A_j\)
(b) \((\bigcap_{j = 1}^{5} A_j)^c\)
(c) \(\bigcap_{j = 1}^{5} A_j ^c\)
(d) \(\bigcup_{j = 1}^{5} A_j ^c\)
(e) \(\bigcup_{j = 1}^{5} A_j\)
(f) \((\bigcup_{j = 1}^{5} A_j)^c\)
(g) \(\bigcap_{j \in \mathbb{N}^{} A_j\)
(h) \(\bigcup_{j \in \mathbb{N}^{} A_j\)  For each positive real number \(r\), define \(T_r\) to be the closed interval \([r^2, r^2]\). That is
\[T_r = \{x \in \mathbb{R}\ \ r^2 \le x \le r^2\}.\]
Let \(\wedge = \{m \in \mathbb{N}\ \ 1 \le m \le 10\}\). Use either interval notation or set builder notation to specify each of the following sets:
(a) \(\bigcup_{k \in \wedge}^{} T_k\)
(b) \(\bigcap_{k \in \wedge}^{} T_k\)
(c) \(\bigcup_{r \in \mathbb{R}^+}^{} T_k\)
(d) \(\bigcap_{r \in \mathbb{R}^+}^{} T_k\)
(e) \(\bigcup_{r \in \mathbb{N}}^{} T_k\)
(f) \(\bigcap_{r \in \mathbb{N}}^{} T_k\)  Prove Parts (2) and (4) of Theorem 5.30. Let \(\Lambda\) be a nonempty indexing set and let \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) be an indexed family of sets.
(a) For each \(\beta \in \Lambda\), \(A_{\beta} \subseteq \bigcup_{\alpha \in \Lambda}^{} A_{\alpha}\).
(b) \((\bigcup_{\alpha \in \Lambda}^{} A_{\alpha})^c = \bigcap_{\alpha \in \Lambda}^{} A_{\alpha} ^c\) 
Prove Theorem 5.31. Let \(\Lambda\) be a nonempty indexing set, let \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) be an indexed family of sets, and let \(B\) be a set. Then
(a) \(B \cap (\bigcup_{\alpha \in \Lambda}^{} A_{\alpha}) = \bigcup_{\alpha \in \Lambda}^{} (B \cap A_{\alpha})\), and
(b) \(B \cup (\bigcap_{\alpha \in \Lambda}^{} A_{\alpha}) = \bigcap_{\alpha \in \Lambda}^{} (B \cup A_{\alpha})\). 
Let \(\Lambda\) and \(\Gamma\) be nonempty indexing sets and let \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) and \(\mathcal{B} = \{B_{\beta}\ \ \beta \in \Gamma\}\) be indexed families of sets. Use the distributive laws in Exercise (5) to:
(a) Write \((\bigcup_{\alpha \in \Lambda}^{} A_{\alpha}) \cap (\bigcup_{\beta \in \Gamma}^{} B_{\beta}) as a union of intersections of two sets.
(b) Write \((\bigcap_{\alpha \in \Lambda}^{} A_{\alpha}) \cup (\bigcap_{\beta \in \Gamma}^{} B_{\beta}) as a union of intersections of two sets. 
Let \(\Lambda\) be a nonempty indexing set and let \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) be an indexed family of sets. Also, assume that \(\Gamma \subseteq \Lambda\) and \(\Gamma \ne \emptyset\). (Note: The letter \(\Gamma\) is the uppercase Greek letter gamma.) Prove that
(a) \(\bigcup_{\alpha \in \Gamma}^{} A_{\alpha} \subseteq \bigcup_{\alpha \in \Lambda}^{} A_{\alpha}\)
(b) \(\bigcap_{\alpha \in \Lambda}^{} A_{\alpha} \subseteq \bigcap_{\alpha \in \Gamma}^{} A_{\alpha}\) 
Let \(\Lambda\) be a nonempty indexing set and let \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) be an indexed family of sets.
(a) Prove that if \(B\) is a set such that \(B \subseteq A_{\alpha}\) for every \(\alpha \in \Lambda\), then \(B \subseteq \bigcap_{\alpha \in \Lambda}^{} A_{\alpha}\).
(b) Prove that if \(C\) is a set such that \(A_{\alpha} \subseteq C\) for every \(\alpha \in \Lambda\), then \(\bigcap_{\alpha \in \Lambda}^{} A_{\alpha} \subseteq C\). 
For each natural number \(n\), let \(A_n = \{x \in \mathbb{R}\ \ n  1 < x < n\}\). Prove that \(\{A_n\ \ n \in \mathbb{N}\}\) is a pairwise disjoint family of sets and that \(\bigcup_{n \in \mathbb{N}}^{} A_n = (\mathbb{R} ^{+}  \mathbb{N})\).

For each natural number \(n\), let \(A_n = \{k \in \mathbb{N}\ \ k \ge n\}\). Determine if the following statements are true or false. Justify each conclusion.
(a) For all \(j, k \in \mathbb{N}\), if \(j \ne k\), then \(A_j \cap A_k \ne \emptyset\).
(b) \(\bigcap_{k \in \mathbb{N}}^{} A_k = \emptyset\). 
Give an example of an indexed family of sets \(\{A_n\ \ n \in \mathbb{N}\}\) such all three of the following conditions are true:
(i) For each \(m \in \mathbb{N}\), \(A_m \subseteq (0,1)\);
(ii) For each \(j, k \in \mathbb{N}\), if \(j \ne k\), then \(A_j \cap A_k \ne \emptyset\); and
(iii) \(\bigcap_{k \in \mathbb{N}}^{} A_k = \emptyset\). 
Let \(\Lambda\) be a nonempty indexing set, let \(\mathcal{A} = \{A_{\alpha}\ \ \alpha \in \Lambda\}\) be an indexed family of sets, and let \(B\) be a set. Use the results of Theorem 5.30 and Theorem 5.31 to prove each of the following:
(a) \((\bigcup_{\alpha \in \Lambda}^{} A_{\alpha})  B = \bigcup_{\alpha \in \Lambda}^{} (A_{\alpha}  B)\)
(b) \((\bigcap_{\alpha \in \Lambda}^{} A_{\alpha})  B = \bigcap_{\alpha \in \Lambda}^{} (A_{\alpha}  B)\)
(c) \(B  (\bigcup_{\alpha \in \Lambda}^{} A_{\alpha}) = \bigcap_{\alpha \in \Lambda}^{} B  (A_{\alpha})\)
(d) \(B  (\bigcap_{\alpha \in \Lambda}^{} A_{\alpha}) = \bigcup_{\alpha \in \Lambda}^{} B  (A_{\alpha})\)
Explorations and Activities 
An Indexed Family of Subsets of the Cartesian Plane. Let \(\mathbb{R} ^{\ast}\) be the set of nonnegative real numbers, and for each \(r \in \mathbb{R} ^{\ast}\), let
\[\begin{array} {rcl} {C_r} &= & {\{(x, y) \in \mathbb{R} \times \mathbb{R}\ \ x^2 + y^2 = r^2\}} \\ {D_r} &= & {\{(x, y) \in \mathbb{R} \times \mathbb{R}\ \ x^2 + y^2 \le r^2\}} \\ {T_r} &= & {\{(x, y) \in \mathbb{R} \times \mathbb{R}\ \ x^2 + y^2 > r^2\} = D_r ^c.} \end{array}\]If \(r > 0\), then the set \(C_r\) is the circle of radius \(r\) with center at the origin as shown in Figure 5.8, and the set \(D_r\) is the shaded disk (including the boundary) shown in Figure 5.8.
(a) Determine \(\bigcup_{r \in \mathbb{R} ^{\ast}}^{} C_r\) and \(\bigcap_{r \in \mathbb{R} ^{\ast}}^{} C_r\)
(b) Determine \(\bigcup_{r \in \mathbb{R} ^{\ast}}^{} D_r\) and \(\bigcap_{r \in \mathbb{R} ^{\ast}}^{} D_r\)
(c) Determine \(\bigcup_{r \in \mathbb{R} ^{\ast}}^{} T_r\) and \(\bigcap_{r \in \mathbb{R} ^{\ast}}^{} T_r\)
(d) Let \(\mathcal{C} = \{C_r\ \ r \in \mathbb{R} ^{\ast}\}\), \(\mathcal{D} = \{D_r\ \ r \in \mathbb{R} ^{\ast}\}\), and \(\mathcal{T} = \{T_r\ \ r \in \mathbb{R} ^{\ast}\}\). Are any of these indexed families of sets pairwise disjoint? Explain.
Now let \(I\) be the closed interval [0, 2] and let \(J\) be the closed interval [1, 2].
(e) Determine \(\bigcup_{r \in I}^{} C_r\), \(\bigcap_{r \in I}^{} C_r\), \(\bigcup_{r \in J}^{} C_r\), and \(\bigcap_{r \in J}^{} C_r\)
(f) Determine \(\bigcup_{r \in I}^{} D_r\), \(\bigcap_{r \in I}^{} D_r\), \(\bigcup_{r \in J}^{} D_r\), and \(\bigcap_{r \in J}^{} D_r\)
(g) Determine \((\bigcup_{r \in I}^{} D_r)^c\), \((\bigcap_{r \in I}^{} D_r)^c\), \((\bigcup_{r \in J}^{} D_r)^c\), and \((bigcap_{r \in J}^{} D_r)^c\)
(h) Determine \(\bigcup_{r \in I}^{} T_r\), \(\bigcap_{r \in I}^{} T_r\), \(\bigcup_{r \in J}^{} T_r\), and \(\bigcap_{r \in J}^{} T_r\)
(i) Use De Morgan's Laws to explain the relationship between your answers in Parts (13g) and (13h).
 Answer

Add texts here. Do not delete this text first.