On the canvas of a universal set, combine two sets three ways — intersection, union, complement — and read it all off a Venn diagram.
Once we can compare sets, we can combine them. First we fix the whole field of play — the universal set U — and draw it as a rectangle; inside it, two overlapping circles for A and B carve the universe into four regions. Three operations are all you need: intersection A ∩ B (in both), union A ∪ B (in either), and complement ∁A (everything in U outside A). The beauty is that every identity — even the famous De Morgan laws — becomes obvious once you shade the Venn diagram. This is set algebra you can see.
Every conversation has a scope. When we talk about the whole numbers from 1 to 10, or about all real numbers, or about the students in one class, that backdrop — the collection of all objects currently in play — is the universal set U. We draw it as a rectangle, the frame of the whole picture, and every set we discuss lives inside it.
Inside U we draw a circle for each set. When two circles overlap, they split the universe into exactly four regions: the part in A only, the part in B only, the part in both (the lens in the middle), and the part in neither (the corners of U, outside both circles). A picture like this is a Venn diagram, and it makes every combination of two sets visible at a glance.
Always say what U is before you operate — "the integers 1 to 10," "all real numbers," "the class roster." The complement, especially, is meaningless until U is fixed: outside A only makes sense once we know the whole.
The intersection of A and B is the set of objects that lie in both:
A ∩ B = { x | x ∈ A and x ∈ B }.
On the Venn diagram it is exactly the lens where the two circles overlap. Take the working sets we'll use all lesson — U = {1, 2, 3, 4, 5, 6, 7, 8, 9}, A = {1, 2, 3, 4, 6}, B = {2, 4, 5, 6, 8}. Which numbers are in both? Scan A and keep only those also in B: 2 ✓, 4 ✓, 6 ✓ — and that's all. So
A ∩ B = {2, 4, 6}.
If two sets share nothing, their lens is empty: A ∩ B = ∅, and we call A and B disjoint. For example {1, 3} ∩ {2, 4} = ∅ — the circles don't overlap at all.
The union of A and B is the set of objects in at least one of them:
A ∪ B = { x | x ∈ A or x ∈ B }.
On the Venn diagram it is both circles together — the whole shaded blob. Sweep up everything in A or in B, and remember that a set never repeats a member, so the overlap is counted just once:
A ∪ B = {1, 2, 3, 4, 5, 6, 8}.
(7 and 9 are in neither circle, so they stay out.)
"Or" in mathematics is inclusive: in A, or in B, or in both. It is not the everyday "either-or that excludes both." So 2 ∈ A ∪ B even though 2 lives in both circles.
Against the universe U, the complement of A is everything in U that is not in A:
∁UA = { x ∈ U | x ∉ A }.
On the Venn diagram it is the whole rectangle with the A circle cut out. With U = {1,…,9} and A = {1, 2, 3, 4, 6}, remove A's members from U and keep the rest:
∁A = {5, 7, 8, 9}.
Two facts fall out immediately, and both are visible in the picture. Nothing can be inside and outside A at once, so A ∩ ∁A = ∅. And A together with its complement fills the whole universe, so A ∪ ∁A = U.
The complement is always taken relative to U. Change the universe and you change ∁A: outside A among {1,…,9} is {5,7,8,9}, but outside A among all of ℝ is a very different (infinite) set.
Real problems chain the operations — and the wonderful thing is that the Venn diagram doesn't just illustrate an identity, it proves it. Shade the left-hand side and the right-hand side separately; if the two pictures shade the same region, the identity holds for any two sets. Two pairs of laws are worth knowing.
The De Morgan laws say the complement flips union and intersection:
∁(A ∪ B) = ∁A ∩ ∁B and ∁(A ∩ B) = ∁A ∪ ∁B.
Read the first one in words: to be outside "A or B" means being outside A and outside B — exactly the same condition. The widget below shades both routes of that law; flip the toggle and the amber region never moves.
The other useful pair is the distributive laws, which let intersection and union pass through one another the way × passes through +:
P ∩ (Q ∪ R) = (P ∩ Q) ∪ (P ∩ R).
You can check it with a fresh trio of sets — say P = {1,2,3,4}, Q = {3,4,5}, R = {4,6}. Then Q ∪ R = {3,4,5,6}, so P ∩ (Q ∪ R) = {3,4}; and P ∩ Q = {3,4}, P ∩ R = {4}, whose union is {3,4} again. Same set both ways ✓.
A Venn picture that shades the same region by two different symbolic routes is a proof of the identity for two sets. Set algebra is one of the rare places where a careful drawing settles the matter.
Fix a universal set U and draw it as a rectangle; two overlapping circles give four regions. Then:
| Operation | In words | Set-builder | For our A, B |
|---|---|---|---|
| A ∩ B | in both | { x | x∈A and x∈B } | {2, 4, 6} |
| A ∪ B | in either (inclusive) | { x | x∈A or x∈B } | {1,2,3,4,5,6,8} |
| ∁UA | in U, not in A | { x∈U | x∉A } | {5, 7, 8, 9} |
Two always-true facts: A ∩ ∁A = ∅ and A ∪ ∁A = U. The laws you can see: De Morgan ∁(A∪B) = ∁A ∩ ∁B, ∁(A∩B) = ∁A ∪ ∁B; distributive A ∩ (B∪C) = (A∩B) ∪ (A∩C). Disjoint sets are those with A ∩ B = ∅.
Take U = {1, 2, 3, 4, 5, 6, 7, 8}, A = {1, 2, 3, 4}, B = {3, 4, 5, 6} for the first three.
Find A ∩ B.
Keep the numbers in both: 3 and 4 are in A and in B. A ∩ B = {3, 4}.
Find A ∪ B.
Sweep up everything in either circle, the overlap counted once: A ∪ B = {1, 2, 3, 4, 5, 6}.
Find ∁UA.
Everything in U but not in A: drop 1, 2, 3, 4 from {1,…,8}. ∁A = {5, 6, 7, 8}.
If A ∩ B = ∅, what are A and B called?
Disjoint — they share no element, so their circles don't overlap.
Rewrite ∁(A ∩ B) using ∁A and ∁B.
By De Morgan, the complement flips ∩ to ∪: ∁(A ∩ B) = ∁A ∪ ∁B.
For the sets above, is 7 ∈ A ∪ B?
No. 7 is in neither A nor B, so 7 ∉ A ∪ B (it does lie in U, and in ∁A and ∁B).
Six questions to lock it in. Tap the answer you think is right.
The big idea of this lesson is that two overlapping circles inside a universe carve it into four regions, and that intersection, union, and complement are nothing more than choices of which regions to shade. Insist students always state the universe U first — the complement is undefined without it — and have them read the symbols aloud: "A intersect B," "A union B," "the complement of A." Most of the difficulty in this stage is the notation, not the ideas.
The misconceptions to watch: reading "or" as exclusive (it is inclusive — "in A, or in B, or in both"); double-counting the overlap when writing a union (sets have no repeats, so 2 appears once in A∪B); forgetting to bound the complement by U; and mixing up which operation De Morgan flips (∁ turns ∪ into ∩, and ∩ into ∪). A quick cure for that last one: read "outside A-or-B" in plain English — it forces "outside A and outside B."
This lesson supports the high-school treatment of set operations and Venn diagrams, and aligns with CCSS S-CP.A.1 — describe events as subsets of a sample space using unions, intersections, and complements. The shading-is-a-proof move previews how identities are justified throughout discrete math and probability.