The Overlap Between Two Collections
Imagine two clubs at a school — the Chess Club and the Robotics Club. Some students belong to one. Some belong to the other. A few belong to both. The "both" group is the intersection of sets — the overlap.
The intersection picks out exactly the elements that appear in every set being intersected. Symbolically:
$$A \cap B = {x : x \in A \text{ and } x \in B}.$$
If no elements are shared, $A \cap B = \emptyset$ (the empty set), and the sets are called disjoint.
The Symbol and Formal Definition
The intersection symbol is $\cap$ — a downward-pointing arc that looks like an upside-down U. It can be read as "intersected with" or simply "and."
$$x \in A \cap B \quad\Longleftrightarrow\quad x \in A \text{ and } x \in B.$$
The intersection extends to any number of sets: $A_1 \cap A_2 \cap \cdots \cap A_n$ is the set of elements that belong to every $A_i$.
Properties at a glance
Property | Statement | Meaning |
|---|---|---|
Commutative | $A \cap B = B \cap A$ | Order doesn't matter |
Associative | $(A \cap B) \cap C = A \cap (B \cap C)$ | Grouping doesn't matter |
Identity | $A \cap U = A$ | Intersecting with the universal set $U$ returns the original set |
Domination | $A \cap \emptyset = \emptyset$ | Intersection with empty set is empty |
Idempotent | $A \cap A = A$ | Intersecting a set with itself returns itself |
Distributive | $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$ | Intersection distributes over union |
De Morgan | $(A \cap B)' = A' \cup B'$ | Complement of intersection equals union of complements |
Intersection vs Other Set Operations — Side by Side
Operation | Symbol | What it contains | Example: $A = {1, 2, 3}$, $B = {2, 3, 4}$ |
|---|---|---|---|
Union | $A \cup B$ | Elements in $A$ or $B$ (or both) | ${1, 2, 3, 4}$ |
Intersection | $A \cap B$ | Elements in both $A$ and $B$ | ${2, 3}$ |
Difference | $A - B$ (or $A \setminus B$) | Elements in $A$ but not in $B$ | ${1}$ |
Symmetric difference | $A \triangle B$ | Elements in $A$ or $B$ but not both | ${1, 4}$ |
Complement | $A'$ or $A^c$ | Elements in the universe $U$ but not in $A$ | Depends on $U$ |
Cartesian product | $A \times B$ | All ordered pairs $(a, b)$ with $a \in A$, $b \in B$ | ${(1,2), (1,3), (1,4), (2,2), \dots}$ |
The pattern: union, intersection, and difference are the three "basic" Boolean operations; complement is the unary one; symmetric difference and Cartesian product are derived. CBSE and IB syllabi typically introduce union and intersection together, then the rest follows.
The cardinality formula
For finite sets,
$$|A \cup B| = |A| + |B| - |A \cap B|.$$
This is the inclusion-exclusion principle for two sets. Rearranged:
$$|A \cap B| = |A| + |B| - |A \cup B|.$$
The principle generalises to three or more sets — but with alternating-sign terms for triple intersections, quadruple, and so on. Almost every Grade 11 board question on sets uses inclusion-exclusion for two or three sets.
Three Worked Examples — Quick, Standard, Stretch
Quick. Find $A \cap B$ for $A = {1, 2, 3, 4, 5}$ and $B = {4, 5, 6, 7, 8}$.
Scan for elements in both. $4$ is in both. $5$ is in both. Everything else is in one set only.
$$A \cap B = {4, 5}.$$
Final answer: $A \cap B = {4, 5}$.
Standard (From Easy to Tricky — Examples). Out of 100 students in a class, 60 like maths and 45 like science; 25 like both. How many like neither?
Let $M$ = set of maths-likers ($|M| = 60$), $S$ = set of science-likers ($|S| = 45$), $|M \cap S| = 25$.
A wrong-path attempt. A student adds $60 + 45 = 105$, gets a number bigger than the class, and freezes. The student then guesses "5 students like neither" without showing work.
The rescue — inclusion-exclusion. The number who like at least one is:
$$|M \cup S| = |M| + |S| - |M \cap S| = 60 + 45 - 25 = 80.$$
The number who like neither is $100 - |M \cup S| = 100 - 80 = 20$.
Final answer: 20 students like neither.
Sanity check by Venn-diagram regions:
Only maths: $60 - 25 = 35$.
Only science: $45 - 25 = 20$.
Both: $25$.
Neither: $20$.
Total: $35 + 20 + 25 + 20 = 100$ ✓.
Stretch. Find $A \cap B \cap C$ for $A = {x \in \mathbb{N} : x \leq 20}$, $B = {x : x \text{ is a multiple of } 3}$, $C = {x : x \text{ is a multiple of } 4}$.
The intersection requires elements in all three sets. So $x$ must be: a natural number $\leq 20$, a multiple of 3, and a multiple of 4.
A number that is a multiple of both 3 and 4 is a multiple of their LCM, which is 12. So we want multiples of 12 that are $\leq 20$. Just ${12}$.
Final answer: $A \cap B \cap C = {12}$.
Why Intersection Matters
Intersection is one of the three foundational set operations — without it, set theory is just collections.
Probability. The probability of two events both happening is the probability of the intersection of the events: $P(A \cap B)$. Independence is the property $P(A \cap B) = P(A) \cdot P(B)$.
Database queries. Every SQL
INNER JOINis an intersection — return only rows where the matching key exists in both tables. The query planner literally builds the intersection set.Logic and computer science. Boolean AND is intersection. A program that returns "true if the user is logged in AND has admin privileges" is computing membership in the intersection of two sets.
Statistics. Confidence intervals from two independent samples are tightened by intersecting them — the result is the set of parameter values consistent with both samples.
Geometry. Two lines meet at a single point (their intersection); a line and a circle meet in two points (or one tangent, or none); planes intersect in lines or points. Geometric "intersection" is a special case of set intersection where the sets are the points making up each figure.
For Bhanzu Grade 11 cohorts, set operations are the language the rest of Class 11 Mathematics speaks — relations, functions, probability all start by defining their objects as sets.
Where to Watch Your Step on Intersection
Mistake 1: Confusing $\cap$ with $\cup$.
Where it slips in: A student reads $A \cap B$ and writes the union — all elements that appear in either set.
Don't do this: Swap the symbols. The two arcs look similar.
The correct way: $\cap$ (intersection) is the downward arc — and it means "and." $\cup$ (union) is the upward arc — like a cup that holds everything. Memory aid: ∩ is the narrow one (fewer elements); ∪ is the wide one (more or equal elements). The Bhanzu Grade 11 cohort sees this mix-up most in week one of sets — by week three the symbols feel distinct.
Mistake 2: Listing duplicate elements.
Where it slips in: A student computes ${1, 2, 2, 3} \cap {2, 3, 4}$ and writes ${2, 2, 3}$, copying the duplicate $2$ from the first set.
Don't do this: Carry duplicates into the result.
The correct way: Sets have no duplicate elements — ${1, 2, 2, 3}$ is the same set as ${1, 2, 3}$. The intersection is ${2, 3}$, with each element appearing exactly once.
Mistake 3: Forgetting that the intersection can be empty.
Where it slips in: A student computes ${1, 3, 5} \cap {2, 4, 6}$, finds no common elements, and writes "no answer" or leaves the question blank.
Don't do this: Treat "no overlap" as undefined.
The correct way: The intersection of disjoint sets is the empty set, written $\emptyset$ or ${}$. $\emptyset$ is a valid set and a valid answer.
Conclusion
The intersection of sets $A$ and $B$, written $A \cap B$, is the set of elements in both.
The intersection symbol $\cap$ reads as "intersection" or "and"; the dual symbol $\cup$ is union (or).
The cardinality formula $|A \cup B| = |A| + |B| - |A \cap B|$ is the workhorse of Grade 11 set problems.
Intersection of disjoint sets is $\emptyset$ — the empty set is a valid answer.
Intersection generalises to any number of sets and is the foundation of Boolean AND, SQL inner joins, probability of joint events, and geometric meeting points.
Try Intersection Yourself — Three Problems
Find $A \cap B$ for $A = {2, 4, 6, 8, 10}$ and $B = {1, 4, 9, 16, 25}$.
In a survey of 80 households, 50 own a car and 35 own a bicycle; 20 own both. How many own neither?
Given $A = {x : 1 \leq x \leq 10}$ and $B = {x : x \text{ is prime}}$, find $A \cap B$.
If Problem 2 takes you more than three minutes, walk back through the inclusion-exclusion step in the Standard worked example.
Was this article helpful?
Your feedback helps us write better content