Study guide

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

CLEP College Mathematics Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Structure, TI-30XS Calculator & Study Strategy

1.1 CLEP College Mathematics Overview, Exam Format & TI-30XS Calculator 1.2 Scoring, Diagnostic Assessment & Study Plan (ACE 50 Benchmark)

2 Chapter 2: Numbers and Number Theory

2.1 The Real Number System, Properties & Operations 2.2 Divisibility, Prime Factorization, Factors, and Multiples 2.3 Unit Conversion, Scientific Notation, Numerical Precision & Absolute Value

3 Chapter 3: Equations, Inequalities & Linear Systems

3.1 Linear Equations, Linear Inequalities & Absolute Value Equations 3.2 Systems of Linear Equations & Coordinate Graphing Methods

4 Chapter 4: Functions, Graphs & Growth Models

4.1 Function Notation, Domain, Range & Evaluation 4.2 Function Graphs, Transformations, Reflections & Symmetries 4.3 Linear vs. Exponential Growth, Logarithms & Applied Modeling

5 Chapter 5: Commercial Math & Interest Calculations

5.1 Percents, Percent Change, Markups, Discounts, Taxes & Profit/Loss 5.2 Simple Interest and Compound Interest 5.3 Continuous Compounding & Effective Annual Yield (APY vs. APR)

6 Chapter 6: Present/Future Value, Annuities & Loan Applications

6.1 Present Value and Future Value of Cash Flows and Ordinary Annuities 6.2 Loans, Mortgages, Credit Cards & Amortization Concepts

7 Chapter 7: Logic and Sets

7.1 Sets, Subsets, Disjoint Sets, and Set Notation 7.2 Set Operations (Union, Intersection, Complement) & Venn Diagrams 7.3 Logical Statements, Connectives, Conditionals & Truth Tables 7.4 Converses, Inverses, Contrapositives, Equivalence & Valid Arguments

8 Chapter 8: Data Analysis and Statistics

8.1 Data Visualizations: Tables, Bar/Line Graphs, Pie Charts & Histograms 8.2 Measures of Central Tendency: Mean, Median & Mode 8.3 Measures of Dispersion: Range, Quartiles, IQR & Boxplots 8.4 Standard Deviation & The Normal Distribution (Empirical Rule)

9 Chapter 9: Counting and Probability

9.1 Fundamental Counting Principle, Permutations & Combinations 9.2 Basic Probability, Sample Spaces, Complementary Events & Odds 9.3 Compound Probability: Addition Rule, Multiplication Rule & Conditional Probability 9.4 Expected Value and Applied Probabilistic Decision-Making

10 Chapter 10: Geometry and Measurement

10.1 Lines, Angles, Parallel and Perpendicular Line Relationships 10.2 Triangles, Similarity, Congruence & The Pythagorean Theorem 10.3 Quadrilaterals, Polygons, Perimeter & Area 10.4 Circles (Circumference, Area, Arcs, Sectors) & 3D Geometry

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

Key Takeaways Explain This Topic AI

The union A ∪ B A \cup B A ∪ B contains elements in A A A , in B B B , or in both (inclusive OR); the intersection A ∩ B A \cap B A ∩ B contains elements in both A A A and B B B simultaneously (AND).

The relative complement (difference) A ∖ B A \setminus B A ∖ B consists of elements in A A A but not in B B B ( A ∖ B = A ∩ B ′ A \setminus B = A \cap B' A ∖ B = A ∩ B ′ ), while the absolute complement A ′ A' A ′ consists of all elements in universal set U U U that do not belong to A A A .

The Principle of Inclusion-Exclusion (PIE) for two sets is ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ |A \cup B| = |A| + |B| - |A \cap B| ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ ; for three sets, ∣ A ∪ B ∪ C ∣ = ∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ∣ A ∩ B ∣ − ∣ A ∩ C ∣ − ∣ B ∩ C ∣ + ∣ A ∩ B ∩ C ∣ |A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C| ∣ A ∪ B ∪ C ∣ = ∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ∣ A ∩ B ∣ − ∣ A ∩ C ∣ − ∣ B ∩ C ∣ + ∣ A ∩ B ∩ C ∣ .

Solving multi-set Venn diagram survey problems requires working systematically from the innermost triple intersection outward to pairwise overlaps, single-set regions, and the exterior complement.

De Morgan's Laws for sets establish that ( A ∪ B ) ′ = A ′ ∩ B ′ (A \cup B)' = A' \cap B' ( A ∪ B ) ′ = A ′ ∩ B ′ (the complement of a union is the intersection of complements) and ( A ∩ B ) ′ = A ′ ∪ B ′ (A \cap B)' = A' \cup B' ( A ∩ B ) ′ = A ′ ∪ B ′ (the complement of an intersection is the union of complements).

Last updated: August 2026

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 U U be the universal set, and let A A A and B B B be arbitrary subsets of U U 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 ∪ B A \cup B A ∪ B )

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

Key Property: ∣ A ∪ B ∣ ≥ max ⁡ ( ∣ A ∣ , ∣ B ∣ ) |A \cup B| \ge \max(|A|, |B|) ∣ A ∪ B ∣ ≥ max ( ∣ A ∣ , ∣ B ∣ ) .

Intersection ( A ∩ B A \cap B A ∩ B )

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

Key Property: ∣ A ∩ B ∣ ≤ min ⁡ ( ∣ A ∣ , ∣ B ∣ ) |A \cap B| \le \min(|A|, |B|) ∣ A ∩ B ∣ ≤ min ( ∣ A ∣ , ∣ B ∣ ) . If A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ , then A A A and B B B are disjoint.

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

The relative complement of B B B in A A A consists of all elements that belong to A A A but do NOT belong to B B B : A ∖ B = { x ∣ x ∈ A ∧ x ∉ B } = A ∩ B ′ A \setminus B = \{x \mid x \in A \land x \notin B\} = A \cap B' A ∖ B = { x ∣ x ∈ A ∧ x ∈ / B } = A ∩ B ′

Note: A ∖ B ≠ B ∖ A A \setminus B \neq B \setminus A A ∖ B  = B ∖ A in general (set difference is non-commutative).

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

The absolute complement of A A A consists of all elements in the universal set U U U that are not in A A A : A ′ = U ∖ A = { x ∈ U ∣ x ∉ A } A' = U \setminus A = \{x \in U \mid x \notin A\} A ′ = U ∖ A = { x ∈ U ∣ x ∈ / A }

  • Essential Complement Algebraic Identities
  • Double Complement: ( A ′ ) ′ = A (A')' = A ( A ′ ) ′ = A
  • Universal Bounds: U ′ = ∅ U' = \emptyset U ′ = ∅ and ∅ ′ = U \emptyset' = U ∅ ′ = U
  • Union with Complement: A ∪ A ′ = U A \cup A' = U A ∪ A ′ = U
  • Intersection with Complement: A ∩ A ′ = ∅ A \cap A' = \emptyset A ∩ A ′ = ∅
  • 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:

Complement of a Union: ( A ∪ B ) ′ = A ′ ∩ B ′ (A \cup B)' = A' \cap B' ( A ∪ B ) ′ = A ′ ∩ B ′

Interpretation: The set of elements that are NOT in A A A or B B B equals the set of elements that are outside A A A AND outside B B B .

Complement of an Intersection: ( A ∩ B ) ′ = A ′ ∪ B ′ (A \cap B)' = A' \cup B' ( A ∩ B ) ′ = A ′ ∪ B ′

Interpretation: The set of elements NOT in both A A A and B B B equals the set of elements outside A A A OR outside B B B .

Distributive Laws for Sets

Intersection over Union: A ∩ ( B ∪ C ) = ( A ∩ B ) ∪ ( A ∩ C ) A \cap (B \cup C) = (A \cap B) \cup (A \cap C) A ∩ ( B ∪ C ) = ( A ∩ B ) ∪ ( A ∩ C )

Union over Intersection: A ∪ ( B ∩ C ) = ( A ∪ B ) ∩ ( A ∪ C ) A \cup (B \cap C) = (A \cup B) \cap (A \cup C) A ∪ ( B ∩ C ) = ( A ∪ B ) ∩ ( A ∪ C )

3. The Principle of Inclusion-Exclusion (PIE)

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

Two-Set Inclusion-Exclusion Formula ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ |A \cup B| = |A| + |B| - |A \cap B| ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣

Rearranging to solve for the intersection: ∣ A ∩ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∪ B ∣ |A \cap B| = |A| + |B| - |A \cup B| ∣ A ∩ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∪ 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 A A only): ∣ A ∣ − ∣ A ∩ B ∣ |A| - |A \cap B| ∣ A ∣ − ∣ A ∩ B ∣
  • Region II ( A ∩ B A \cap B A ∩ B ): Common to both A A A and B B B
  • Region III ( B B B only): ∣ B ∣ − ∣ A ∩ B ∣ |B| - |A \cap B| ∣ B ∣ − ∣ A ∩ B ∣
  • Region IV (Neither): ∣ U ∣ − ∣ A ∪ B ∣ |U| - |A \cup B| ∣ U ∣ − ∣ A ∪ B ∣

Three-Set Inclusion-Exclusion Formula ∣ A ∪ B ∪ C ∣ = ∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ∣ A ∩ B ∣ − ∣ A ∩ C ∣ − ∣ B ∩ C ∣ + ∣ A ∩ B ∩ C ∣ |A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C| ∣ A ∪ B ∪ C ∣ = ∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ∣ A ∩ B ∣ − ∣ A ∩ C ∣ − ∣ B ∩ C ∣ + ∣ A ∩ B ∩ 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 } U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\} U = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 } , A = { 2 , 3 , 5 , 7 } A = \{2, 3, 5, 7\} A = { 2 , 3 , 5 , 7 } , and B = { 1 , 3 , 5 , 7 , 9 } B = \{1, 3, 5, 7, 9\} B = { 1 , 3 , 5 , 7 , 9 } . Determine:

  • A ∩ B A \cap B A ∩ B
  • A ∪ B A \cup B A ∪ B
  • A ∖ B A \setminus B A ∖ B
  • ( A ∪ B ) ′ (A \cup B)' ( A ∪ B ) ′

Solution:

Elements common to both A A A and B B B : A ∩ B = { 3 , 5 , 7 } A \cap B = \{3, 5, 7\} A ∩ B = { 3 , 5 , 7 } .

Combine all elements in A A A or B B B : A ∪ B = { 1 , 2 , 3 , 5 , 7 , 9 } A \cup B = \{1, 2, 3, 5, 7, 9\} A ∪ B = { 1 , 2 , 3 , 5 , 7 , 9 } .

Elements in A A A that are not in B B B : A ∖ B = { 2 } A \setminus B = \{2\} A ∖ B = { 2 } .

Elements in U U U not in A ∪ B A \cup B A ∪ B : ( A ∪ B ) ′ = { 4 , 6 , 8 , 10 } (A \cup B)' = \{4, 6, 8, 10\} ( A ∪ B ) ′ = { 4 , 6 , 8 , 10 } .

Worked Example 2: Comprehensive 3-Set Survey Problem

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

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

Determine:

How many students take Computer Science ONLY?

How many students take exactly two of the three subjects?

How many students take none of these three courses?

Solution: Apply the Innermost-to-Outermost Algorithm:

Region VII (All 3): ∣ M ∩ C ∩ P ∣ = 10 |M \cap C \cap P| = 10 ∣ M ∩ C ∩ P ∣ = 10

Two-set exclusive overlaps:

  • M ∩ C M \cap C M ∩ C only = 30 − 10 = 20 = 30 - 10 = 20 = 30 − 10 = 20
  • M ∩ P M \cap P M ∩ P only = 25 − 10 = 15 = 25 - 10 = 15 = 25 − 10 = 15
  • C ∩ P C \cap P C ∩ P only = 20 − 10 = 10 = 20 - 10 = 10 = 20 − 10 = 10

Single-subject exclusive regions:

M M M only = 70 − ( 20 + 15 + 10 ) = 70 − 45 = 25 = 70 - (20 + 15 + 10) = 70 - 45 = 25 = 70 − ( 20 + 15 + 10 ) = 70 − 45 = 25

C C C only = 65 − ( 20 + 10 + 10 ) = 65 − 40 = 25 = 65 - (20 + 10 + 10) = 65 - 40 = 25 = 65 − ( 20 + 10 + 10 ) = 65 − 40 = 25

P P P only = 55 − ( 15 + 10 + 10 ) = 55 − 35 = 20 = 55 - (15 + 10 + 10) = 55 - 35 = 20 = 55 − ( 15 + 10 + 10 ) = 55 − 35 = 20

Sum of all students taking at least one course (Union): ∣ M ∪ C ∪ P ∣ = 25 + 25 + 20 + 20 + 15 + 10 + 10 = 125 |M \cup C \cup P| = 25 + 25 + 20 + 20 + 15 + 10 + 10 = 125 ∣ M ∪ C ∪ P ∣ = 25 + 25 + 20 + 20 + 15 + 10 + 10 = 125

Exterior Region (None of the three): None = 150 − 125 = 25 \text{None} = 150 - 125 = 25 None = 150 − 125 = 25

Answers:

Computer Science only = 25 = 25 = 25 students.

Exactly two subjects = 20 + 15 + 10 = 45 = 20 + 15 + 10 = 45 = 20 + 15 + 10 = 45 students.

None of the three courses = 25 = 25 = 25 students.

6. Common CLEP Traps & Strategic Checkpoints

Trap 1: Forgetting to Subtract the Overlap in Survey Problems: If 65 65 65 take CS and 30 30 30 take Math & CS, the number taking CS only is NOT 65 − 30 65 - 30 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 A A or B B B " always includes elements in both A A A and B B B unless the word "exclusive" is specifically stated.

Trap 3: Set Difference Order: A ∖ B ≠ B ∖ A A \setminus B \neq B \setminus A A ∖ B  = B ∖ A . Always take elements from the first set and remove those belonging to the second set.

Trap 4: Misinterpreting De Morgan's Laws: ( A ∪ B ) ′ = A ′ ∩ B ′ (A \cup B)' = A' \cap B' ( A ∪ B ) ′ = A ′ ∩ B ′ , NOT A ′ ∪ B ′ A' \cup B' A ′ ∪ B ′ . The union symbol flips to an intersection under negation.