Skip to main content

MATH 308 — Lec 2 — Sets II (Indexed Families, Partitions, Cartesian Products)

Math 308 · September 4, 2026

Lecture 2 — Sets II: Indexed Families, Partitions, Cartesian Products
MATH 308  Bridge to Advanced Mathematics  Chartrand §1.4–1.6

Goals for today. By the end of this lecture you should be able to:

  • read an indexed family {Aα}α∈I\{A_\alpha\}_{\alpha \in I}{Aα​}α∈I​ and compute ⋃α∈IAα\bigcup_{\alpha \in I} A_\alpha⋃α∈I​Aα​ and ⋂α∈IAα\bigcap_{\alpha \in I} A_\alpha⋂α∈I​Aα​;

  • check whether a collection of subsets is a partition of a set;

  • form the Cartesian product A×BA \times BA×B, list its elements, and count them.

Indexed collections of sets (§1.4)

Often we have not two or three sets but a whole family of them, one for each element of an index set III. We write {Aα}α∈I\{A_\alpha\}_{\alpha \in I}{Aα​}α∈I​ (read “the sets AαA_\alphaAα​, as α\alphaα ranges over III”). Union and intersection extend naturally:

⋃α∈IAα={ x  :  x∈Aα for some α∈I },⋂α∈IAα={ x  :  x∈Aα for every α∈I }.\bigcup_{\alpha \in I} A_\alpha = \left\{\, x \;:\; x \in A_\alpha \text{ for \emph{some} } \alpha \in I \,\right\}, \qquad \bigcap_{\alpha \in I} A_\alpha = \left\{\, x \;:\; x \in A_\alpha \text{ for \emph{every} } \alpha \in I \,\right\}.α∈I⋃​Aα​={x:x∈Aα​ for some α∈I},α∈I⋂​Aα​={x:x∈Aα​ for every α∈I}.

Notice the quiet appearance of some and every — exactly the quantifiers we take up next week.

Example 1. Let An=[0,1n]A_n = [0, \tfrac{1}{n}]An​=[0,n1​] for each n∈Nn \in \mathbb{N}n∈N. Every AnA_nAn​ contains 000, and as nnn grows the intervals shrink toward {0}\{0\}{0}:

⋃n∈NAn=[0,1],⋂n∈NAn={0}.\bigcup_{n \in \mathbb{N}} A_n = [0,1], \qquad \bigcap_{n \in \mathbb{N}} A_n = \{0\}.n∈N⋃​An​=[0,1],n∈N⋂​An​={0}.

The intersection is not empty: 000 lies in every AnA_nAn​; but no positive number does, since 1n→0\tfrac1n \to 0n1​→0.

The nested intervals An=(0,1n) (top to bottom: A1,A2,A3,A4). Only 0 survives every one: An=0.

The nested intervals An=[0,1n]A_n=[0,\tfrac1n]An​=[0,n1​] (top to bottom: A1,A2,A3,A4A_1,A_2,A_3,A_4A1​,A2​,A3​,A4​). Only 000 survives every one: ⋂nAn={0}\bigcap_n A_n=\{0\}⋂n​An​={0}.

Partitions of a set (§1.5)

Definition 1. A partition of a nonempty set SSS is a collection P\mathcal{P}P of nonempty subsets of SSS such that

  1. every element of SSS lies in some member of P\mathcal{P}P (the members cover SSS), and

  2. distinct members are disjoint (any two members are equal or share no element).

Equivalently: each element of SSS lies in exactly one member. The members are called the cells (or blocks) of the partition.

A partition of S into three cells: they cover S and are pairwise disjoint.

A partition of SSS into three cells: they cover SSS and are pairwise disjoint.

Example 2. The sets E={ n∈Z  :  n even }E = \left\{\, n \in \mathbb{Z} \;:\; n \text{ even} \,\right\}E={n∈Z:n even} and O={ n∈Z  :  n odd }O = \left\{\, n \in \mathbb{Z} \;:\; n \text{ odd} \,\right\}O={n∈Z:n odd} form a partition {E,O}\{E, O\}{E,O} of Z\mathbb{Z}Z: every integer is even or odd (cover), and none is both (disjoint). This is the seed of an equivalence relation — “same parity” — which we develop in Lecture 14.

Cartesian products (§1.6)

Definition 2. The Cartesian product of sets AAA and BBB is the set of ordered pairs

A×B={ (a,b)  :  a∈A and b∈B }.A \times B = \left\{\, (a,b) \;:\; a \in A \text{ and } b \in B \,\right\}.A×B={(a,b):a∈A and b∈B}.

Order matters: (a,b)=(c,d)(a,b) = (c,d)(a,b)=(c,d) means a=ca=ca=c and b=db=db=d. If A,BA,BA,B are finite then ∣A×B∣=∣A∣⋅∣B∣\left\lvert A \times B \right\rvert = \left\lvert A \right\rvert\cdot\left\lvert B \right\rvert∣A×B∣=∣A∣⋅∣B∣.

Example 3. With A={1,2,3}A = \{1,2,3\}A={1,2,3} and B={a,b}B = \{a,b\}B={a,b},

A×B={(1,a),(1,b),(2,a),(2,b),(3,a),(3,b)},∣A×B∣=3⋅2=6.A \times B = \{(1,a),(1,b),(2,a),(2,b),(3,a),(3,b)\}, \qquad \left\lvert A \times B \right\rvert = 3 \cdot 2 = 6.A×B={(1,a),(1,b),(2,a),(2,b),(3,a),(3,b)},∣A×B∣=3⋅2=6.

The most important instance is R×R=R2\mathbb{R}\times \mathbb{R}= \mathbb{R}^2R×R=R2, the coordinate plane: a point is an ordered pair (x,y)(x,y)(x,y).

1,2,3 cross a,b as a grid of 6 ordered pairs.

{1,2,3}×{a,b}\{1,2,3\} \times \{a,b\}{1,2,3}×{a,b} as a grid of 666 ordered pairs.

Homework problems

  1. Let An={ k∈N  :  k≥n }A_n = \left\{\, k \in \mathbb{N} \;:\; k \ge n \,\right\}An​={k∈N:k≥n} for n∈Nn \in \mathbb{N}n∈N. Find ⋃nAn\bigcup_{n} A_n⋃n​An​ and ⋂nAn\bigcap_{n} A_n⋂n​An​.

  2. Is {{1,2},{2,3},{3}}\bigl\{\{1,2\},\{2,3\},\{3\}\bigr\}{{1,2},{2,3},{3}} a partition of {1,2,3}\{1,2,3\}{1,2,3}? If not, which condition fails?

  3. Give a partition of Z\mathbb{Z}Z into three cells. (Hint: remainders on division by 333.)

  4. List A×BA \times BA×B and B×AB \times AB×A for A={0,1}A=\{0,1\}A={0,1}, B={x,y}B=\{x,y\}B={x,y}. Is A×B=B×AA \times B = B \times AA×B=B×A?

  5. If ∣A∣=4\left\lvert A \right\rvert=4∣A∣=4 and ∣B∣=3\left\lvert B \right\rvert=3∣B∣=3, how many elements does A×BA \times BA×B have? How many subsets does it have?

  6. If AAA, BBB, CCC are sets, show that (A−B)×C=(A×C)−(B×C)(A - B) \times C = (A \times C) - (B \times C)(A−B)×C=(A×C)−(B×C).

  7. Let III be a nonempty set and for each i∈Ii \in Ii∈I let XiX_iXi​ be a set. Prove that

    1. for any set BBB,  B∩⋃i∈IXi=⋃i∈I(B∩Xi)\displaystyle B \cap \bigcup_{i \in I} X_i = \bigcup_{i \in I} (B \cap X_i)B∩i∈I⋃​Xi​=i∈I⋃​(B∩Xi​);

    2. if each XiX_iXi​ is a subset of a given set SSS, then  (⋃i∈IXi)c=⋂i∈IXic\displaystyle \Bigl(\bigcup_{i \in I} X_i\Bigr)^{c} = \bigcap_{i \in I} X_i^{c}(i∈I⋃​Xi​)c=i∈I⋂​Xic​.

Suggested textbook exercises (Chartrand §1.4–1.6): 1.40, 1.46, 1.54, 1.60, 1.66, 1.72.

← Back to Math 308