Q.If X= { a, b, c, d } and Y = { f, b, d, g}, find
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — Set Difference
Set Difference
The idea in plain words
Imagine two groups of students: those who play cricket (A) and those who play football (B). The set difference A−B (also written A∖B) answers one specific question: "Who plays cricket but NOT football?" You start with everything in A, then remove whatever also happens to be in B.
Set difference is a one-way street: A−B keeps only what's uniquely in A. It has nothing to do with what's uniquely in B.
The precise definition
For two sets A and B:
A−B={x∣x∈A and x∈/B}
Read as: "the set of all x such that x is in A but x is not in B."
Worked example
Let:
A={1,2,3,4,5},B={3,4,5,6,7}
Step 1: Go through each element of A.
Step 2: Keep it only if it is NOT also in B.
- 1∈A, 1∈/B → keep
- 2∈A, 2∈/B → keep
- 3∈A, 3∈B → remove
- 4∈A, 4∈B → remove
- 5∈A, 5∈B → remove
A−B={1,2}
Now compute the other direction:
B−A={6,7}
Notice A−B=B−A — set difference is not commutative.
Key properties
| Property | Statement |
|---|---|
| Not commutative | A−B=B−A in general |
| Difference with itself | A−A=∅ |
| Difference with empty set | A−∅=A, and ∅−A=∅ |
| Difference with universal set | U−A=Ac (the complement of A) |
| Disjoint sets | If A∩B=∅, then A−B=A |
The last property is worth pausing on: if two sets share nothing in common, subtracting one from the other changes nothing — there was nothing to remove.
Set difference vs. complement — the classic mix-up
Students frequently confuse A−B with Ac (complement of A). The difference is what you're comparing against:
- Complement Ac is always relative to the universal set U: everything outside A.
- Difference A−B is relative to whatever second set you name: everything in A that isn't in B.
In fact, complement is just a special case: Ac=U−A.
Set difference vs. symmetric difference …
Why this formula?
Let's break down the definition of a set — not as a formula to memorise, but as a fundamental idea that underpins all of mathematics.
1. What is a Set? (The Core Idea)
A set is a well-defined collection of distinct objects.
The "why" here is about clarity and precision — we need to know exactly what belongs and what does not.
- Well-defined: For any object, we can say yes or no — no ambiguity.
- Distinct: No duplicates — each object appears only once.
Why? Because if we couldn't decide membership, we couldn't do any logical operations. Sets are the building blocks of all mathematical structures.
2. The Key "Formula": Set-Builder Notation
The most common way to define a set is:
S={x∣P(x)}
This reads: "S is the set of all objects x such that property P(x) is true."
Why does this work?
- x is a placeholder for any object.
- P(x) is a logical condition (a predicate) that is either true or false for each x.
- The vertical bar ∣ means "such that".
Example:
A={n∣n∈N,n is even}
Here, P(n) is "n is a natural number and n is even".
Only those n that satisfy both conditions are included.
Why this form? It avoids listing infinitely many elements. It gives a rule — a decision procedure — for membership.
3. The Two Fundamental Properties (Axioms)
Every set definition relies on two intuitive truths:
(a) Extensionality — Two sets are equal if they have the same elements.
A=B⟺(∀x)(x∈A⟺x∈B)
Why? A set is completely determined by its members. There is no other hidden property.
If you know what's inside, you know the set.
(b) Membership — The only relation is ∈ (belongs to).
x∈Sorx∈/S
Why? Because a set is just a container. The only question we can ask is: "Is this object inside?"
4. Why Can't We Just List Everything?
For small sets, listing works:
{1,2,3}
But for infinite sets (like all natural numbers), listing is impossible.
Set-builder notation solves this by giving a rule instead of a list.
Example:
N={n∣n is a positive integer}
This is not a formula to memorise — it's a definition by property.
5. The "Empty Set" — Why It Exists
The empty set ∅ (or {}) is the set with no elements. …
The set difference A−B contains all elements in A that are not in B. The intersection A∩B contains elements common to both sets.
Step 1. Identify elements in X but not in Y:
X−Y={a,c} (we exclude b and d since they appear in Y).
Step 2. Identify elements in Y but not in X:
Y−X={f,g} (we exclude b and d since they appear in X). …
Set difference removes elements of one set from another; intersection keeps only common elements. We get X−Y={a,c}, Y−X={f,g}, and X∩Y={b,d}.
Understanding Set Operations
When we work with sets, three fundamental operations let us compare and combine them in different ways. The set difference X−Y (also written X∖Y) contains everything in X that is not in Y—think of it as removing Y's elements from X. The intersection X∩Y does the opposite: it keeps only what both sets share.
The key insight is to scan each element and ask: "Where does this belong?" For difference, we're filtering; for intersection, we're finding common ground.
Given X={a,b,c,d} and Y={f,b,d,g}, let's work through each operation.
(i) Finding X−Y
-
List all elements of X: We have a,b,c,d.
-
Check each against Y:
- Is a∈Y? No, Y contains only f,b,d,g. So a stays.
- Is b∈Y? Yes, b appears in Y. Remove it.
- Is c∈Y? No. So c stays.
- Is d∈Y? Yes, d is in Y. Remove it.
-
Collect what remains: Only a and c survived the filter.
Therefore, X−Y={a,c}.
(ii) Finding Y−X
-
List all elements of Y: We have f,b,d,g.
-
Check each against X:
- Is f∈X? No, X={a,b,c,d} doesn't contain f. So f stays.
- Is b∈X? Yes. Remove it.
- Is d∈X? Yes. Remove it.
- Is g∈X? No. So g stays.
-
Collect what remains: f and g are the survivors.
Therefore, Y−X={f,g}. …
Understanding Set Intersection and Difference
1. Concept First — The Idea Being Tested
This question tests set operations — specifically set difference and set intersection. These are fundamental concepts in set theory, a building block for probability, logic, and many competitive exams.
Intuition / Why
Imagine you have two groups of friends:
- X = {a, b, c, d} — your friends from school
- Y = {f, b, d, g} — your friends from the neighbourhood
Now, think about these questions:
- X – Y means: "Who are your school friends that are not also neighbourhood friends?" → You remove anyone who appears in both groups.
- Y – X means: "Who are your neighbourhood friends that are not also school friends?" → Same idea, but from the other side.
- X ∩ Y means: "Who are the common friends — the ones in both groups?" → You keep only the people who belong to both sets.
So, the core idea is:
- Set difference removes common elements from one set.
- Set intersection keeps only the common elements.
2. Step-by-Step Solution
Step 1: Write down the given sets clearly
We have:
- X={a,b,c,d}
- Y={f,b,d,g}
Reasoning: Always start by listing the elements exactly as given. This avoids confusion later.
Step 2: Find X−Y (elements in X but not in Y)
What we do:
Take each element of X and check if it is present in Y. If it is not in Y, we keep it. If it is in Y, we remove it.
- a is in X. Is a in Y? No → keep a.
- b is in X. Is b in Y? Yes → remove b.
- c is in X. Is c in Y? No → keep c.
- d is in X. Is d in Y? Yes → remove d.
So, the elements that remain are a and c.
Result:
X−Y={a,c}
Reasoning for this step:
Set difference is like "subtracting" the common elements. We only keep what is unique to X.
Step 3: Find Y−X (elements in Y but not in X)
What we do:
Take each element of Y and check if it is present in X. If it is not in X, we keep it. If it is in X, we remove it.
- f is in Y. Is f in X? No → keep f.
- b is in Y. Is b in X? Yes → remove b.
- d is in Y. Is d in X? Yes → remove d.
- g is in Y. Is g in X? No → keep g.
So, the elements that remain are f and g.
Result:
Y−X={f,g}
Reasoning for this step:
Notice that X−Y and Y−X are different — they are not the same. This is because set difference is not commutative (order matters).
Step 4: Find X∩Y (elements common to both sets)
What we do:
Look for elements that appear in both X and Y. We compare the two lists:
- a is in X but not in Y → not common.
- b is in X and in Y → common.
- c is in X but not in Y → not common.
- d is in X and in Y → common. …
Here are the common mistakes students make with set intersection problems, specifically using the sets you provided, and how to avoid each.
Mistake 1: Forgetting the Definition of "Natural Number" (N)
The Error: Students often assume natural numbers start from 0 or include negative numbers. In the Indian curriculum (NCERT/CBSE), natural numbers are defined as {1,2,3,4,...}.
How it affects the answer: If you include 0, then A∩B might incorrectly include 0. If you include negatives, the intersection with primes (D) becomes confusing.
How to Avoid: Memorize the standard definition. For Class 11 NCERT, N={1,2,3,...}. Always write this set down before solving.
Mistake 2: Confusing "Even" and "Odd" with "Prime"
The Error: Students think that because a number is prime, it cannot be even (or odd). They forget that 2 is the only even prime number.
The Consequence: For question (v) B∩D, students often write ϕ (empty set) instead of {2}.
How to Avoid: List the first few elements of each set.
- B={2,4,6,8,10,...}
- D={2,3,5,7,11,...} Now, visually scan for common elements. The only common element is 2.
Mistake 3: Assuming "Odd" and "Prime" are Mutually Exclusive
The Error: Students think that since most primes are odd, the intersection C∩D must be all odd primes. They forget that 2 is prime but not odd.
The Consequence: For question (vi) C∩D, students write {3,5,7,11,...} (all odd primes) but forget to explicitly exclude 2. While the set of odd primes is correct, the reasoning is flawed if they don't mention that 2 is excluded.
How to Avoid: Always check the boundary case (the number 2).
- C={1,3,5,7,9,...}
- D={2,3,5,7,11,...} The intersection is {3,5,7,11,...} (all odd primes). This is correct, but be explicit: "All prime numbers except 2."
Mistake 4: Writing the Answer in Roster Form Incorrectly
The Error: For infinite sets like A∩B (which is just B), students try to list all elements or write an incomplete roster like {2,4,6}.
The Consequence: Marks are deducted for not showing the pattern or using the wrong notation.
How to Avoid: Use set-builder notation for infinite answers, or use roster form with an ellipsis (...).
- Correct: A∩B={2,4,6,8,...} or A∩B={x:x is an even natural number}.
- Incorrect: A∩B={2,4,6} (this implies the set stops at 6).
Mistake 5: Misinterpreting the Intersection Symbol (∩) …
- COMEDK 2026Set 2026-A1 markMCQQ.Let A and B be two subsets of ξ={1,2,3,−−−−−−−,44,45} such that A={x:x is divisible by 3 and 4} B={x:x is a perfect square number } Then n(B−A) equals (A) 2 (B) 9 (C) 5 (D) 1
›Reveal solutionSolution
The problem asks for the number of perfect squares (set B) that are NOT divisible by both 3 and 4 (set A). We find B = {1,4,9,16,25,36} within 1–45, and A = {12,24,36}. Removing the overlap (36) leaves 5 elements, so n(B−A) = 5.
Concept & Intuition
We have two sets defined on the universal set ξ = {1,2,…,45}.
- Set A: numbers divisible by both 3 and 4. Since 3 and 4 are coprime, “divisible by both” means divisible by their product, 12. So A = multiples of 12 up to 45.
- Set B: perfect squares from 1² up to the largest square ≤ 45. We want the number of elements in B that are not in A — that is, the perfect squares that are not multiples of 12. This is simply the size of B minus the size of the intersection A∩B.
Step-by-step solution
-
Find set B (perfect squares ≤ 45)
The squares are:
1² = 1, 2² = 4, 3² = 9, 4² = 16, 5² = 25, 6² = 36, 7² = 49 (too big).
So B = {1, 4, 9, 16, 25, 36}.
Hence n(B)=6.
-
Find set A (multiples of 12 up to 45)
Multiples of 12: 12, 24, 36, 48 (too big).
So A = {12, 24, 36}.
Hence n(A)=3.
-
Find the intersection A ∩ B
Look for numbers that are in both lists: the only common element is 36. …
- COMEDK 2024Set 2024-A1 markMCQQ.
[!FORMULA] Let A and B be two sets then A−(A∩B) is equal to
(A) (A∩B)′ (B) ∅ (C) A−B (D) B−A›Reveal solutionSolution
The expression A−(A∩B) simplifies to the set of elements in A that are not in B, which is exactly A−B. The correct option is (C).
The key idea is to understand what each set operation means in plain English.
- A−(A∩B) means: take all elements of A, and remove those that are also in B (since A∩B is the overlap).
- That’s exactly the definition of A−B: elements in A but not in B.
So the answer should be A−B. Let’s verify step by step.
- Write the definition of set difference For any sets X and Y,
X−Y={x∣x∈X and x∈/Y}.
So A−(A∩B)={x∣x∈A and x∈/(A∩B)}.
-
Interpret the condition x∈/(A∩B)
x∈A∩B means x∈A and x∈B.
So x∈/(A∩B) means it is not true that both hold. That is: either x∈/A or x∈/B (or both).
But we already know x∈A from the first condition. So the only way x∈/(A∩B) can be true is if x∈/B.
-
Combine the conditions
Therefore,
x∈A and x∈/B.
That is exactly the definition of A−B.
- Check the options
- (A) (A∩B)′ is the complement of the intersection — this includes elements outside A∩B, even those not in A. So it’s too large. …
- COMEDK 2021Set 2021-B1 markMCQQ.If P={x:x<3,x∈N}, Q={x:x≤2,x∈W}. Then (P∪Q)−(P∩Q)= (A) {1,2} (B) {2} (C) {0} (D) {1}
›Reveal solutionSolution
(P∪Q)−(P∩Q)={0}.
P={x:x<3,x∈N}={1,2} (natural numbers start at 1).
Q={x:x≤2,x∈W}={0,1,2} (whole numbers include 0).
Then P∪Q={0,1,2} and P∩Q={1,2}. …
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.