Intersection of Sets
What You'll Learn
You'll learn how to find the intersection of sets—the elements that appear in all the sets at once—and understand what happens when sets have nothing in common.
The Core Idea
The intersection of two or more sets is a new set containing only the elements that belong to every one of the original sets simultaneously.
We write the intersection of sets A and B as A ∩ B (read "A intersect B").
Formal definition:
A ∩ B = {x : x ∈ A and x ∈ B}
In plain English: an element is in the intersection if and only if it's in A and in B (and in C, D, etc., if more sets are involved).
Examples
- If A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, then A ∩ B = {3, 4} (only 3 and 4 appear in both)
- If C = {a, b, c} and D = {d, e, f}, then C ∩ D = ∅ (the empty set—they have nothing in common)
When two sets have no elements in common, we call them disjoint sets. Their intersection is the empty set.
Intersection of Multiple Sets
For three or more sets, the intersection contains only elements present in all of them:
- A = {1, 2, 3}, B = {2, 3, 4}, C = {2, 5}
- A ∩ B ∩ C = {2} (only 2 is in all three)
Analogy
Think of intersection like a Venn diagram where circles overlap. The intersection is the overlapping region—where all circles meet. If circles don't touch at all, there's no overlap: the sets are disjoint.
Key Takeaway: The intersection A ∩ B contains exactly those elements common to both A and B; if no such elements exist, the intersection is empty and the sets are disjoint.