What Does A Intersection B Complement Mean?
A Intersection B Complement points to two set expressions that look almost identical yet mean different things: $(A \cap B)'$ and $A \cap B'$. The difference is the placement of the small mark called the prime symbol, written $'$, which stands for "complement." Where the prime sits decides which set gets flipped.
In $(A \cap B)'$, the prime is outside the bracket, so you first find the intersection and then take the complement of the whole thing. In $A \cap B'$, the prime sits only on $B$, so you flip $B$ first and then intersect it with $A$. Same letters, same symbols, two different answers.
Both ideas rest on three building blocks: the intersection of two sets $A \cap B$ (elements in both), the complement of a set (everything outside it), and the universal set $U$ that a complement is measured against. Get those three straight and the rest of this article is bookkeeping.
Why Does Every Complement Need A Universal Set?
A complement is meaningless without a universal set. The complement $A'$ means "everything not in $A$," and "everything" has to be a defined collection, or the answer could be anything at all.
The universal set $U$ is the full pool of elements under discussion. Once $U$ is fixed, the complement of any set $A$ is whatever is left after removing $A$:
$$A' = U - A = {, x \in U : x \notin A ,}$$
Throughout this article we use one running universal set and two running sets:
$$U = {1,2,3,4,5,6,7,8,9,10}, \quad A = {1,2,3,4,5,6}, \quad B = {4,5,6,7,8}$$
From these, the two complements are $A' = {7,8,9,10}$ and $B' = {1,2,3,9,10}$. Change $U$ and both complements change, which is exactly why the universal set must be stated before any complement is computed.
What Is (A ∩ B)′, The Complement Of The Intersection?
$(A \cap B)'$ is everything in the universal set that is not in the overlap of $A$ and $B$. Read it aloud as "the complement of A intersect B."
Work it in two steps, intersection first, then complement:
$$A \cap B = {4,5,6}$$
$$(A \cap B)' = U - {4,5,6} = {1,2,3,7,8,9,10}$$
So $(A \cap B)'$ collects every element that fails to be in both sets at once. An element is thrown out only when it belongs to $A$ and $B$ together; everything else stays in.
Notice the size. The overlap had 3 elements, the universal set has 10, so the complement of the intersection has $10 - 3 = 7$ elements. The complement of a small overlap is usually large.
What Is A ∩ B′, The Intersection With B Complement?
$A \cap B'$ keeps only the elements that are in $A$ and not in $B$. Read it aloud as "A intersect B complement."
Flip $B$ first, then intersect with $A$:
$$B' = U - B = {1,2,3,9,10}$$
$$A \cap B' = {1,2,3,4,5,6} \cap {1,2,3,9,10} = {1,2,3}$$
This is the sliver from the hook image, the part of $A$ that pokes outside $B$. It is the same set you get from the difference of sets $A - B$, "the elements in $A$ but not in $B$." That identity is worth stating on its own line:
$$A \cap B' = A - B$$
The reason is short. Saying "in $A$ but not in $B$" is the same as saying "in $A$ and in $B'$," because "not in $B$" is precisely what $B'$ means. Some textbooks write the set difference as $A \setminus B$; it names the identical set.
How Do (A ∩ B)′ And A ∩ B′ Differ?
Side by side, the two expressions from our sample sets could hardly be less alike: one has 7 elements, the other has 3, and they share only the elements $1, 2, 3$.
Table: How (A ∩ B)′ and A ∩ B′ differ in meaning and in the sample sets.
Feature | $(A \cap B)'$ | $A \cap B'$ |
|---|---|---|
Reads as | Complement of A intersect B | A intersect B complement |
In words | In $U$, but not in both $A$ and $B$ | In $A$, but not in $B$ |
What gets flipped | The whole intersection | Only $B$ |
Equivalent to | $A' \cup B'$ (De Morgan) | $A - B$ (set difference) |
Result in our example | ${1,2,3,7,8,9,10}$ | ${1,2,3}$ |
Size in our example | 7 elements | 3 elements |
A Venn diagram makes the contrast obvious. Shade the two circles for $A$ and $B$ inside a box for $U$, and each expression lights up a different region.
If the prime is outside the bracket, shade everything except the middle. If the prime rides only on $B$, shade the part of $A$ that sits outside $B$. One glance at the shading settles which expression you are looking at.
What Is De Morgan's Law For (A ∩ B)′?
De Morgan's laws give a shortcut for the complement of an intersection or a union. The one that matters here is the first:
$$(A \cap B)' = A' \cup B'$$
In words, the complement of the intersection equals the union of the complements. The intersection flips to a union when the complement moves inside, and that flip is the whole point of the law.
Check it against our sets. We already found $(A \cap B)' = {1,2,3,7,8,9,10}$. Now build $A' \cup B'$ from the two complements:
Table: Verifying (A ∩ B)′ = A′ ∪ B′ with the sample sets.
Expression | Result |
|---|---|
$A \cap B$ | ${4,5,6}$ |
$(A \cap B)'$ | ${1,2,3,7,8,9,10}$ |
$A'$ | ${7,8,9,10}$ |
$B'$ | ${1,2,3,9,10}$ |
$A' \cup B'$ | ${1,2,3,7,8,9,10}$ |
The last two rows that matter agree exactly, so $(A \cap B)' = A' \cup B'$ holds. The partner law, worth memorising alongside it, is $(A \cup B)' = A' \cap B'$: the complement of a union is the intersection of the complements. Union and intersection swap places whenever the complement crosses the bracket.
Why Does Moving The Complement Change The Answer?
The prime is not a decoration you can slide around. Its position changes the order of operations on the sets, and order changes the result. Think of it as the set-theory version of $(2 + 3)^2$ against $2 + 3^2$: the same numbers, a different grouping, a different answer.
Two reasons capture why the two expressions diverge:
They flip different things. $(A \cap B)'$ flips the overlap, so it reports "not in both." $A \cap B'$ flips only $B$, so it reports "in $A$ but not in $B$." One statement is about a shared region, the other is about one set minus another.
They live in different sizes. $(A \cap B)'$ is measured against the whole universal set, so it is usually large. $A \cap B'$ is trapped inside $A$, so it can never be bigger than $A$. A large answer and a small answer cannot be the same set.
There is one case where the two happen to touch. When $A$ and $B$ do not overlap at all, the intersection $A \cap B$ is the empty set, so $(A \cap B)'$ becomes the entire universal set, while $A \cap B'$ collapses to all of $A$. Even then they are equal only if $A$ itself fills the universe. The coincidence is rare, which is exactly why treating the two as interchangeable is a reliable way to lose marks.
Who Invented Set Theory And The Complement?
The symbols on this page are younger than they look. Sets became a formal branch of mathematics only in the late nineteenth century, and the complement law that anchors this article carries the name of a man born half a world away from where he worked.
Two other names shaped the tools on this page:
Georg Cantor (1845–1918, born in Russia, worked in Germany) founded set theory in the 1870s and 1880s, and gave mathematics the language of sets, elements, and membership that complements are built from.
John Venn (1834–1923, England) introduced the overlapping-circle diagram in 1880, the picture that still makes $(A \cap B)'$ and $A \cap B'$ readable at a glance.
Where Is A Intersection B Complement Used In The Real World?
The same two patterns, "not both" and "in one but not the other," run under a surprising amount of everyday technology.
Database queries: a filter written as
NOT (region = 'X' AND status = 'active')is exactly $(A \cap B)'$, whileregion = 'X' AND NOT status = 'active'is $A \cap B'$. Reporting tools live and die on this distinction.Search and shopping filters: "items in my wishlist but not yet purchased" is $A \cap B'$, the crescent from the hook image, applied to a catalogue of thousands.
Digital logic: a NAND gate outputs the complement of an AND, which is $(A \cap B)'$ in circuit form, and De Morgan's law is what lets engineers rebuild any circuit from NAND gates alone.
Probability: the chance of "not both $A$ and $B$" is $P((A \cap B)') = 1 - P(A \cap B)$, the complement rule that turns a hard event into an easy one.
Medicine and surveys: "patients with symptom $A$ but not condition $B$" is $A \cap B'$, the standard way to isolate a group for study.
One small piece of notation, sitting quietly in a set theory chapter, is the same idea a database engine, a logic chip, and a statistician each reach for. Mathematics is the shared language underneath fields that look unrelated.
What Are The Most Common A Intersection B Complement Mistakes?
Three errors account for most lost marks here, verified against SplashLearn, Cuemath, and BrightChamps set-theory guides and the "people also ask" results for this topic.
Turning $(A \cap B)'$ into $A' \cap B'$
Where it slips in:
A student pushes the complement inside the bracket and keeps the intersection sign, writing $(A \cap B)' = A' \cap B'$ as if the prime distributes like a multiplier.
Don't do this:
Do not keep the intersection when the complement moves in. $A' \cap B'$ is a different, usually much smaller set.
The correct way:
Apply De Morgan's law and flip the operation: $(A \cap B)' = A' \cup B'$. Intersection becomes union whenever the complement crosses the bracket.
Mixing up $A \cap B'$ and $(A \cap B)'$
Where it slips in:
A student reads the prime's position too quickly and computes the complement of the whole intersection when the question only flipped $B$, or the reverse.
Don't do this:
Do not treat the two as the same expression. In our sets one has 7 elements and the other has 3.
The correct way:
Read where the prime sits before computing. Prime outside the bracket means complement the whole intersection; prime on $B$ alone means intersect $A$ with $B'$, which equals $A - B$.
Taking a complement without a universal set
Where it slips in:
A student writes $B' = {9, 10}$ from memory, or leaves the universe undefined, so the complement is guessed rather than computed.
Don't do this:
Do not compute any complement until $U$ is written down. A complement measured against the wrong universe is simply wrong.
The correct way:
State $U$ first, then subtract: $B' = U - B$. For our sets that gives $B' = {1,2,3,9,10}$, not a shorter list pulled from habit.
Practice Problems On A Intersection B Complement
Use $U = {1,2,3,4,5,6,7,8,9,10}$, $P = {2,4,6,8,10}$, and $Q = {1,2,3,4,5}$ unless a problem says otherwise. Answers follow each line.
Find $P \cap Q$.
(Answer: ${2, 4}$.)Find $(P \cap Q)'$.
(Answer: $U - {2,4} = {1,3,5,6,7,8,9,10}$.)Find $Q'$.
(Answer: ${6,7,8,9,10}$.)Find $P \cap Q'$, then confirm it equals $P - Q$.
(Answer: ${6,8,10}$, and $P - Q = {6,8,10}$, so they match.)Verify De Morgan's law by computing $P' \cup Q'$ and comparing it with your answer to problem 2.
(Answer: $P' = {1,3,5,7,9}$, $Q' = {6,7,8,9,10}$, so $P' \cup Q' = {1,3,5,6,7,8,9,10}$, which matches $(P \cap Q)'$.)Is $P \cap Q'$ the same as $(P \cap Q)'$?
(Answer: No. $P \cap Q' = {6,8,10}$ has 3 elements, while $(P \cap Q)' = {1,3,5,6,7,8,9,10}$ has 8.)
Where Should You Go Next After A Intersection B Complement?
Set complements open straight into the rest of set theory, and a few natural doors lead onward from here.
Operations On Sets. The full toolkit of union, intersection, complement, and difference in one place, with how they combine.
Complement Of A Set. A deeper look at the single operation this whole article turns on, including its properties.
Difference Of Sets. More on $A - B$, the set that $A \cap B'$ is secretly equal to, with worked cases.
If your child is building these foundations, a live Bhanzu trainer teaches set complements starting from the picture (the Venn regions the symbols describe) in the Bhanzu algebra program.
Was this article helpful?
Your feedback helps us write better content