7.2 Set Theory, Operations, & Venn Diagrams

Set Theory Foundations & Notation

Set theory is the mathematical language used to organize, classify, and analyze collections of objects. On the ACCUPLACER Quantitative Reasoning, Algebra, and Statistics (QAS) exam, set theory provides the structural framework for categorical logic, algebraic domains, and probability spaces.

1. What is a Set?

A set is a well-defined collection of distinct objects called elements (or members). "Well-defined" means that given any object, there is an unambiguous rule determining whether that object belongs to the set.

• Distinctness: Elements in a set are never duplicated. The collection $\{3, 3, 5, 7\}$ is written simply as $\{3, 5, 7\}$.
• Order Irrelevance: The sequence in which elements are listed does not matter: $\{a, b, c\} = \{c, a, b\}$.

2. Set Specification Notations

• Roster (Listing) Notation: Elements are explicitly enumerated within curly braces separated by commas. $A = \{2, 4, 6, 8, 10\}$
• Set-Builder Notation: Specifies a variable, a vertical bar $|$ (meaning "such that"), and a governing algebraic condition. $B = \{x \in \mathbb{Z} \mid 1 \le x \le 10 \text{ and } x \text{ is even}\}$

---

3. Fundamental Set Symbols & Terminology

Cardinality & Subset Theorems

1. The Empty Set Theorem: The empty set is a subset of every set: $\emptyset \subseteq A$ for any set $A$.
2. Total Subsets Formula: A finite set with cardinality $n$ ($|A| = n$) possesses exactly $2^n$ distinct subsets and $2^n - 1$ proper subsets.
   • Example: For set $S = \{x, y, z\}$ ($n = 3$), there are $2^3 = 8$ subsets: $\emptyset, \; \{x\}, \; \{y\}, \; \{z\}, \; \{x, y\}, \; \{x, z\}, \; \{y, z\}, \; \{x, y, z\}$

---

The Four Core Set Operations

Set operations allow you to combine, intersect, and isolate subsets within a universal set $U$.

      Union: A ∪ B                   Intersection: A ∩ B             Complement: A' (or A^c)
  ┌─────────────────────┐          ┌─────────────────────┐          ┌─────────────────────┐
  │  /█████\   /█████\  │          │  /     \ /█████\ /  │          │ ███████████████████ │
  │ │███████╳████████│ │          │ │       │█████│   │ │          │ ████/     \████████ │
  │  \█████/   \█████/  │          │  \     / \███/ \  │ │          │ ███│   A   │███████ │
  │     A         B     │          │     A       B     │ │          │ ████\     /████████ │
  │      All shaded     │          │    Only overlap     │          │ ███████████████████ │
  └─────────────────────┘          └─────────────────────┘          └─────────────────────┘

1. Union ($A \cup B$)

The union of sets $A$ and $B$ is the set of all elements that belong to set $A$, OR set $B$, OR both. $A \cup B = \{x \in U \mid x \in A \text{ or } x \in B\}$

• Key Word: "OR".

2. Intersection ($A \cap B$)

The intersection of sets $A$ and $B$ is the set of all elements that belong to BOTH set $A$ AND set $B$ simultaneously. $A \cap B = \{x \in U \mid x \in A \text{ and } x \in B\}$

• Key Word: "AND".
• Disjoint Sets: If $A \cap B = \emptyset$, the sets are disjoint (mutually exclusive) and share no elements.

3. Complement ($A'$ or $A^c$ or $\bar{A}$)

The complement of set $A$ is the set of all elements in the universal set $U$ that do NOT belong to $A$. $A' = \{x \in U \mid x \notin A\} = U \setminus A$

• Key Word: "NOT".
• Fundamental Identity: $|A| + |A'| = |U|$ and $A \cup A' = U$.

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

The difference of sets $A$ and $B$ (also called the relative complement of $B$ in $A$) is the set of all elements that belong to $A$ but do NOT belong to $B$. $A \setminus B = \{x \in U \mid x \in A \text{ and } x \notin B\} = A \cap B'$

• Interpretation: "Only $A$" (stripping all shared elements of $B$ out of set $A$).

---

The Principle of Inclusion-Exclusion (PIE)

When combining sets, simply adding $|A| + |B|$ counts elements in the overlapping intersection twice. The Principle of Inclusion-Exclusion (PIE) corrects for this overlap.

PIE for Two Sets

$|A \cup B| = |A| + |B| - |A \cap B|$ $n(A \cup B) = n(A) + n(B) - n(A \cap B)$

Algebraic Rearrangements of PIE

By isolating different terms, PIE can solve for any unknown component:

• Solving for the Intersection: $|A \cap B| = |A| + |B| - |A \cup B|$
• Solving for "Only Set A": $|A \setminus B| = |A| - |A \cap B|$
• Accounting for the Exterior ("Neither Set"): $|(A \cup B)'| = |U| - |A \cup B| = |U| - (|A| + |B| - |A \cap B|)$

---

Venn Diagram Anatomy & The Inside-Out Solution Algorithm

A Venn diagram visually maps the logical relations among sets enclosed within a rectangular bounding box representing the universal set $U$.

2-Set Venn Diagram Region Anatomy

A two-set Venn diagram partitions the universal set $U$ into four mutually disjoint regions:

┌────────────────────────────────────────────────────────┐
│ Universal Set U                                        │
│     ┌───────────────┐     ┌───────────────┐            │
│     │   Region I    │     │  Region III   │            │
│     │   (Only A)    │ Reg │   (Only B)    │            │
│     │   A \ B       │ II  │   B \ A       │            │
│     │               │A ∩ B│               │            │
│     └───────────────┘     └───────────────┘            │
│                      Set A       Set B                 │
│                                                        │
│               Region IV: Neither A nor B               │
│               (A ∪ B)' = U \ (A ∪ B)                   │
└────────────────────────────────────────────────────────┘

• Region I (Only $A$): $|A \setminus B| = |A| - |A \cap B|$
• Region II (Both $A$ and $B$): $|A \cap B|$
• Region III (Only $B$): $|B \setminus A| = |B| - |A \cap B|$
• Region IV (Neither $A$ nor $B$): $|(A \cup B)'| = |U| - (|\text{Region I}| + |\text{Region II}| + |\text{Region III}|)$

The Strict "Inside-Out" Solution Algorithm for Word Problems

When solving complex multi-set survey word problems on the ACCUPLACER exam, follow this systematic inside-out sequence:

1. Identify the Universal Set Total: Note $|U|$ (the total population surveyed).
2. Populate the Innermost Core First: Enter the value for the full intersection ($A \cap B$ for two sets, or $A \cap B \cap C$ for three sets).
3. Calculate Double-Overlap Regions (for 3 sets): Subtract the 3-way center from each 2-way intersection.
4. Calculate Single-Set-Only Regions: Subtract all inner overlapping numbers from the total given for that individual set.
5. Sum All Interior Disjoint Regions: Compute the total union count $|A \cup B|$ (or $|A \cup B \cup C|$).
6. Determine the Exterior Region: Subtract the total union from $|U|$ to find the count of individuals satisfying "none of the categories."

---

Connecting Set Theory Directly to Probability

Set theory and probability theory share an isomorphic (one-to-one) relationship. Every probability formula is a normalized set cardinality expression scaled by the size of the sample space $|S|$:

---

Step-by-Step Worked Examples

Worked Example 1: Set Operations on Discrete Number Sets

Let the universal set be the first $12$ positive integers: $U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12\}$ Define two subsets:

• Set $A$ (Even integers): $A = \{2, 4, 6, 8, 10, 12\}$
• Set $B$ (Multiples of $3$): $B = \{3, 6, 9, 12\}$

Determine the elements and cardinality for each of the following:

1. Intersection ($A \cap B$): Elements common to both sets: $A \cap B = \{6, 12\} \implies |A \cap B| = 2$.

2. Union ($A \cup B$): Combine all elements without duplication: $A \cup B = \{2, 3, 4, 6, 8, 9, 10, 12\} \implies |A \cup B| = 8$ Verification via PIE: $|A \cup B| = |A| + |B| - |A \cap B| = 6 + 4 - 2 = 8$.

3. Difference ($A \setminus B$): Elements in $A$ that are not multiples of $3$: $A \setminus B = \{2, 4, 8, 10\} \implies |A \setminus B| = 4$

4. Complement of Union ($(A \cup B)'$): Elements in $U$ not in $A \cup B$: $(A \cup B)' = \{1, 5, 7, 11\} \implies |(A \cup B)'| = 12 - 8 = 4$

---

Worked Example 2: Two-Set College Survey Problem

A college surveyed $180$ incoming freshmen regarding course registrations:

• $110$ students registered for an English course ($E$).
• $85$ students registered for a Mathematics course ($M$).
• $45$ students registered for both English and Mathematics.

1. How many students registered for ONLY English ($E \setminus M$)? $|E \setminus M| = |E| - |E \cap M| = 110 - 45 = 65$

2. How many students registered for ONLY Mathematics ($M \setminus E$)? $|M \setminus E| = |M| - |E \cap M| = 85 - 45 = 40$

3. How many students registered for at least one of these courses ($E \cup M$)? $|E \cup M| = |E| + |M| - |E \cap M| = 110 + 85 - 45 = 150$ (Alternative check: $65 \text{ [only } E] + 45 \text{ [both]} + 40 \text{ [only } M] = 150$).

4. How many students registered for NEITHER course ($(E \cup M)'$)? $|(E \cup M)'| = |U| - |E \cup M| = 180 - 150 = 30$

5. If a student who registered for Mathematics is chosen at random, what is the probability that they also registered for English? $P(E \mid M) = \frac{|E \cap M|}{|M|} = \frac{45}{85} = \frac{9}{17} \approx 0.5294$

---

Worked Example 3: Three-Set Survey Problem

A technology firm surveyed $120$ software engineers regarding their programming language proficiencies in Python ($P$), Java ($J$), and C++ ($C$):

• $65$ know Python ($|P| = 65$)
• $55$ know Java ($|J| = 55$)
• $50$ know C++ ($|C| = 50$)
• $30$ know both Python and Java ($|P \cap J| = 30$)
• $25$ know both Python and C++ ($|P \cap C| = 25$)
• $20$ know both Java and C++ ($|J \cap C| = 20$)
• $12$ know all three languages ($|P \cap J \cap C| = 12$)

Step 1: Calculate the two-language-only regions

• Only Python & Java: $|(P \cap J) \setminus C| = 30 - 12 = 18$
• Only Python & C++: $|(P \cap C) \setminus J| = 25 - 12 = 13$
• Only Java & C++: $|(J \cap C) \setminus P| = 20 - 12 = 8$

Step 2: Calculate the single-language-only regions

• Only Python: $65 - (18 + 13 + 12) = 65 - 43 = 22$
• Only Java: $55 - (18 + 8 + 12) = 55 - 38 = 17$
• Only C++: $50 - (13 + 8 + 12) = 50 - 33 = 17$

Step 3: Calculate the total union ($|P \cup J \cup C|$) Sum all $7$ disjoint internal regions: $|P \cup J \cup C| = \underbrace{22 + 17 + 17}_{\text{Exactly 1}} + \underbrace{18 + 13 + 8}_{\text{Exactly 2}} + \underbrace{12}_{\text{All 3}} = 56 + 39 + 12 = 107$

Step 4: Answer key analytical questions

1. How many engineers know NONE of these three languages? $|(P \cup J \cup C)'| = |U| - |P \cup J \cup C| = 120 - 107 = 13$
2. How many engineers know EXACTLY ONE language? $\text{Only } P + \text{Only } J + \text{Only } C = 22 + 17 + 17 = 56$
3. How many engineers know EXACTLY TWO languages? $18 + 13 + 8 = 39$

---

Common Pitfalls & ACCUPLACER Exam Traps

1. Confusing "Set $A$" with "ONLY Set $A$": In a survey, stating that "$50$ people drink coffee" does not mean $50$ people drink only coffee; some of those $50$ also drink tea. You must subtract the intersection to find the "coffee only" group.
2. Adding Direct Counts in Survey Totals: Summing $|A| + |B| + |C|$ directly often yields a sum exceeding the total population $|U|$. This is expected because overlapping individuals are counted multiple times. Always use the Principle of Inclusion-Exclusion.
3. Misinterpreting the Empty Set vs. Zero: The number $0$ is an integer element, whereas $\emptyset = \{\}$ is a set with cardinality $0$. Note that $\{0\} \neq \emptyset$ because $\{0\}$ contains one element (the number $0$), meaning $|\{0\}| = 1$.
4. Neglecting the Exterior Region: When finding the union from survey data, students often forget that $|U| - |A \cup B|$ represents the exterior population who participate in neither activity.