7.2 Set Operations (Union, Intersection, Complement) & Venn Diagrams

7.2 Set Operations (Union, Intersection, Complement) & Venn Diagrams

Set operations allow mathematicians to combine, filter, and compare collections of data. On the CLEP College Mathematics exam, questions involving unions, intersections, complements, and 2-set/3-set Venn diagrams are among the most frequently tested logic topics. Mastering systematic problem-solving workflows ensures quick, error-free execution on survey and word problems.

---

1. Fundamental Set Operations

Let $U$ be the universal set, and let $A$ and $B$ be arbitrary subsets of $U$.

+-----------------------------------------------------------------------------+
|                        CORE SET OPERATIONS SUMMARY                          |
|                                                                             |
|   Operation      Notation        Set-Builder Definition      Logical Link   |
|   ---------      --------        ----------------------      ------------   |
|   Union          A \cup B        {x | x in A or x in B}      Disjunction    |
|   Intersection   A \cap B        {x | x in A and x in B}     Conjunction    |
|   Difference     A \setminus B   {x | x in A and x notin B}  Negation       |
|   Complement     A' or A^c       {x in U | x notin A}        Absolute NOT   |
+-----------------------------------------------------------------------------+

Union ($A \cup B$)

The union of $A$ and $B$ is the set of all elements that belong to $A$, to $B$, or to both (inclusive OR): $A \cup B = \{x \mid x \in A \lor x \in B\}$

• Key Property: $|A \cup B| \ge \max(|A|, |B|)$.

Intersection ($A \cap B$)

The intersection of $A$ and $B$ is the set of all elements that belong simultaneously to both $A$ and $B$ (AND): $A \cap B = \{x \mid x \in A \land x \in B\}$

• Key Property: $|A \cap B| \le \min(|A|, |B|)$. If $A \cap B = \emptyset$, then $A$ and $B$ are disjoint.

Set Difference / Relative Complement ($A \setminus B$ or $A - B$)

The relative complement of $B$ in $A$ consists of all elements that belong to $A$ but do NOT belong to $B$: $A \setminus B = \{x \mid x \in A \land x \notin B\} = A \cap B'$

• Note: $A \setminus B \neq B \setminus A$ in general (set difference is non-commutative).

Absolute Complement ($A'$ or $A^c$ or $\overline{A}$)

The absolute complement of $A$ consists of all elements in the universal set $U$ that are not in $A$: $A' = U \setminus A = \{x \in U \mid x \notin A\}$

Essential Complement Algebraic Identities

• Double Complement: $(A')' = A$
• Universal Bounds: $U' = \emptyset$ and $\emptyset' = U$
• Union with Complement: $A \cup A' = U$
• Intersection with Complement: $A \cap A' = \emptyset$

---

2. De Morgan's Laws & Distributive Laws for Sets

De Morgan's Laws for Sets

De Morgan's Laws describe how complementation interacts with unions and intersections by "flipping" the operation:

1. Complement of a Union: $(A \cup B)' = A' \cap B'$ Interpretation: The set of elements that are NOT in $A$ or $B$ equals the set of elements that are outside $A$ AND outside $B$.

2. Complement of an Intersection: $(A \cap B)' = A' \cup B'$ Interpretation: The set of elements NOT in both $A$ and $B$ equals the set of elements outside $A$ OR outside $B$.

Distributive Laws for Sets

• Intersection over Union: $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$
• Union over Intersection: $A \cup (B \cap C) = (A \cup B) \cap (A \cup C)$

---

3. The Principle of Inclusion-Exclusion (PIE)

When calculating the cardinality of a union, simply adding $|A| + |B|$ double-counts the elements in the overlapping intersection $A \cap B$. PIE corrects for this overlap.

Two-Set Inclusion-Exclusion Formula

$|A \cup B| = |A| + |B| - |A \cap B|$

Rearranging to solve for the intersection: $|A \cap B| = |A| + |B| - |A \cup B|$

+-----------------------------------------------------------------------------+
|                        TWO-SET VENN DIAGRAM REGIONS                         |
|                                                                             |
|   +-------------------------- Universal Set U --------------------------+   |
|   |                                                                     |   |
|   |        Set A                             Set B                      |   |
|   |    +-----------+                     +-----------+                  |   |
|   |   /   Region I  \                   /  Region III \                 |   |
|   |  /   (A only)    \   Region II     /   (B only)    \                |   |
|   | |   A \setminus B | (A \cap B)    |     B \setminus A |             |   |
|   |  \               /                 \               /                |   |
|   |   +-------------+-------------------+-------------+                 |   |
|   |                                                                     |   |
|   |               Region IV: (A \cup B)'  (Neither A nor B)             |   |
|   +---------------------------------------------------------------------+   |
+-----------------------------------------------------------------------------+

• Region I ($A$ only): $|A| - |A \cap B|$
• Region II ($A \cap B$): Common to both $A$ and $B$
• Region III ($B$ only): $|B| - |A \cap B|$
• Region IV (Neither): $|U| - |A \cup B|$

Three-Set Inclusion-Exclusion Formula

$|A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C|$

+-----------------------------------------------------------------------------+
|                       THREE-SET VENN DIAGRAM (8 REGIONS)                    |
|                                                                             |
|   +-------------------------- Universal Set U --------------------------+   |
|   |                                                                     |   |
|   |                 /-------------\     /-------------\                 |   |
|   |                /    Set A      \   /     Set B     \                |   |
|   |               /     (I)         \ /      (III)      \               |   |
|   |              |                   X                   |              |   |
|   |              |     A only       / \      B only      |              |   |
|   |              |                 / (II)\               |              |   |
|   |               \               /  A^B  \             /               |   |
|   |                \      (IV)   |---------|   (VI)    /                |   |
|   |                 \     A^C    |  (VII)  |   B^C    /                 |   |
|   |                  \          / | A^B^C | \        /                  |   |
|   |                   \--------+--+-------+--+------/                   |   |
|   |                            |    (V)      |                          |   |
|   |                            |   C only    |                          |   |
|   |                             \           /                           |   |
|   |                              \  Set C  /                            |   |
|   |                               \-------/                             |   |
|   |                                                                     |   |
|   |                  Region VIII: Outside (A \cup B \cup C)'            |   |
|   +---------------------------------------------------------------------+   |
+-----------------------------------------------------------------------------+

---

4. Step-by-Step Methodology for Venn Diagram Survey Problems

To solve 3-set survey word problems without error, follow the Innermost-to-Outermost Algorithm:

+-----------------------------------------------------------------------------+
|                   INNERMOST-TO-OUTERMOST SURVEY ALGORITHM                   |
|                                                                             |
|   Step 1: Fill the Central Triple Intersection:                             |
|           Region VII = |A \cap B \cap C|                                    |
|                                                                             |
|   Step 2: Fill the Three Two-Set Intersections:                             |
|           Region II  = |A \cap B| - Region VII                              |
|           Region IV  = |A \cap C| - Region VII                              |
|           Region VI  = |B \cap C| - Region VII                              |
|                                                                             |
|   Step 3: Fill the Three Single-Set Exclusive Regions:                      |
|           Region I   (A only) = |A| - (Region II + Region IV + Region VII)  |
|           Region III (B only) = |B| - (Region II + Region VI + Region VII)  |
|           Region V   (C only) = |C| - (Region IV + Region VI + Region VII)  |
|                                                                             |
|   Step 4: Fill the Exterior Complement:                                     |
|           Region VIII (None) = |U| - Sum(Regions I through VII)             |
+-----------------------------------------------------------------------------+

---

5. Worked Examples

Worked Example 1: Set Operations on Discrete Sets

Problem: Let $U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}$, $A = {2, 3, 5, 7}$, and $B = {1, 3, 5, 7, 9}$. Determine:

1. $A \cap B$
2. $A \cup B$
3. $A \setminus B$
4. $(A \cup B)'$

Solution:

1. Elements common to both $A$ and $B$: $A \cap B = {3, 5, 7}$.
2. Combine all elements in $A$ or $B$: $A \cup B = {1, 2, 3, 5, 7, 9}$.
3. Elements in $A$ that are not in $B$: $A \setminus B = {2}$.
4. Elements in $U$ not in $A \cup B$: $(A \cup B)' = {4, 6, 8, 10}$.

Worked Example 2: Comprehensive 3-Set Survey Problem

Problem: A survey of $150$ college students regarding their course enrollment reveals:

• $70$ take Mathematics ($M$)
• $65$ take Computer Science ($C$)
• $55$ take Physics ($P$)
• $30$ take Mathematics and Computer Science ($M \cap C$)
• $25$ take Mathematics and Physics ($M \cap P$)
• $20$ take Computer Science and Physics ($C \cap P$)
• $10$ take all three courses ($M \cap C \cap P$)

Determine:

1. How many students take Computer Science ONLY?
2. How many students take exactly two of the three subjects?
3. How many students take none of these three courses?

Solution: Apply the Innermost-to-Outermost Algorithm:

1. Region VII (All 3): $|M \cap C \cap P| = 10$
2. Two-set exclusive overlaps:
   • $M \cap C$ only $= 30 - 10 = 20$
   • $M \cap P$ only $= 25 - 10 = 15$
   • $C \cap P$ only $= 20 - 10 = 10$
3. Single-subject exclusive regions:
   • $M$ only $= 70 - (20 + 15 + 10) = 70 - 45 = 25$
   • $C$ only $= 65 - (20 + 10 + 10) = 65 - 40 = 25$
   • $P$ only $= 55 - (15 + 10 + 10) = 55 - 35 = 20$
4. Sum of all students taking at least one course (Union): $|M \cup C \cup P| = 25 + 25 + 20 + 20 + 15 + 10 + 10 = 125$
5. Exterior Region (None of the three): $\text{None} = 150 - 125 = 25$

Answers:

1. Computer Science only $= 25$ students.
2. Exactly two subjects $= 20 + 15 + 10 = 45$ students.
3. None of the three courses $= 25$ students.

---

6. Common CLEP Traps & Strategic Checkpoints

• Trap 1: Forgetting to Subtract the Overlap in Survey Problems: If $65$ take CS and $30$ take Math & CS, the number taking CS only is NOT $65 - 30$. You must account for the triple intersection before isolating regions.
• Trap 2: "Or" Means Inclusive Disjunction: In mathematics and on the CLEP, "$A$ or $B$" always includes elements in both $A$ and $B$ unless the word "exclusive" is specifically stated.
• Trap 3: Set Difference Order: $A \setminus B \neq B \setminus A$. Always take elements from the first set and remove those belonging to the second set.
• Trap 4: Misinterpreting De Morgan's Laws: $(A \cup B)' = A' \cap B'$, NOT $A' \cup B'$. The union symbol flips to an intersection under negation.