Q.Show that the set of letters needed to spell “ CA TARACT ” and the set of letters needed to spell “ TRACT” are equal
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
A−B only keeps the "A-only" region. If you want both one-sided regions together (everything in exactly one of the two sets), that's the symmetric difference A△B=(A−B)∪(B−A) — a different, related, but distinct operation.
Why it matters
Set difference shows up constantly in exam problems: "find the elements in A but not in B," Venn-diagram shading questions, and as a building block for symmetric difference and complement. Getting the direction right (A−B vs. B−A) is the single most common source of lost marks.
Takeaway
A−B keeps only what's uniquely in A, throwing away anything shared with B. Always check which set you're subtracting from — the direction changes the answer.
This topic regularly comes up in searches like "set difference formula A minus B" and "set difference vs complement class 11 maths," both grounded in the Sets chapter of the NCERT/CBSE Class 11 Mathematics syllabus. Getting the direction of subtraction right is a classic source of lost marks in board exams and a frequent JEE Main conceptual question.
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.
∅={x∣x=x}
Why is this allowed?
Because the condition x=x is always false — no object satisfies it.
This is a logical necessity: if we can define a set by a property, we must allow the possibility that nothing satisfies it.
Key insight: The empty set is not "nothing" — it's a set that contains nothing. It's a mathematical object.
6. Summary: The "Why" Behind the Definition
| Concept | Why it's defined this way |
|---|---|
| Set | To have a precise, unambiguous collection — no guesswork. |
| Set-builder | To define infinite or complex sets without listing. |
| Membership (∈) | The only question that matters — is it inside or not? |
| Empty set | Logical completeness — a property may have no objects. |
Final takeaway: The definition of a set is not a formula to plug numbers into. It's a logical framework for saying: "These objects, and only these, belong here." Every formula you see later (union, intersection, complement) builds on this single idea.
Concept: Set Equality via Set Difference
Two sets are equal if and only if they contain exactly the same elements (ignoring repetition and order).
First, identify the distinct letters in each word:
- "CATARACT" uses the letters {C,A,T,R}
- "TRACT" uses the letters {T,R,A,C}
Both sets contain the four letters C, A, T, and R. Even though "CATARACT" has repeated letters (three A's, two T's, two C's), a set records only distinct elements. Similarly, "TRACT" has repeated letters (T appears twice), but the set is {T,R,A,C}.
Since both sets have identical elements, they are equal: {C,A,T,R}={T,R,A,C}.
The two sets are equal because both contain exactly the letters {C,A,T,R}.
Two sets are equal when they contain exactly the same elements (repetition doesn't matter in sets). Both "CATARACT" and "TRACT" require the letters {C,A,T,R}, so the sets are equal.
The heart of this problem lies in understanding what a set is. A set is a collection of distinct objects — each element either belongs or it doesn't, and listing an element multiple times doesn't change the set. When we ask for "the set of letters needed to spell" a word, we're asking: which distinct letters appear at least once?
Let's identify the letters in each word carefully.
-
Find the distinct letters in "CATARACT".
Write out the word: C-A-T-A-R-A-C-T.
Now list each letter that appears, ignoring repetitions:
- C appears (twice, but we count it once)
- A appears (three times, but we count it once)
- T appears (twice, but we count it once)
- R appears (once)
So the set of letters is {C,A,T,R}.
-
Find the distinct letters in "TRACT".
Write out the word: T-R-A-C-T.
List each distinct letter:
- T appears (twice, but we count it once)
- R appears (once)
- A appears (once)
- C appears (once)
So the set of letters is {T,R,A,C}.
-
Compare the two sets.
We have:
Letters in "CATARACT"={C,A,T,R}
Letters in "TRACT"={T,R,A,C}
Sets have no inherent order, so {C,A,T,R} and {T,R,A,C} are the same set — they contain exactly the same four elements.
A common mistake is to think that because "CATARACT" has more letters (8) than "TRACT" (5), the sets must be different. But sets ignore multiplicity: {A,A,A}={A}.
The set of letters needed to spell "CATARACT" is {C,A,T,R}, which equals the set of letters needed to spell "TRACT", namely {T,R,A,C}={C,A,T,R}.
Method: Set Equality via Element Listing
We will use the Listing Method — write both sets explicitly by listing their distinct elements, then compare.
Step 1: Write the first set (from “CATARACT”)
Take the word CATARACT and list each distinct letter (ignore repetitions):
- C, A, T, A, R, A, C, T
- Distinct letters: C, A, T, R
So,
S1={C,A,T,R}
Step 2: Write the second set (from “TRACT”)
Take the word TRACT and list each distinct letter:
- T, R, A, C, T
- Distinct letters: T, R, A, C
So,
S2={T,R,A,C}
Step 3: Compare the two sets
- S1={C,A,T,R}
- S2={T,R,A,C}
Both contain exactly the same four letters. Order does not matter in a set, and repetitions are ignored.
Step 4: Conclusion
Since every element of S1 is in S2 and every element of S2 is in S1, we have:
S1=S2
Therefore, the set of letters needed to spell “CATARACT” equals the set of letters needed to spell “TRACT”.
Here are the most common mistakes students make on this Set Difference / Set Equality problem, along with how to avoid each.
Mistake 1: Counting repeated letters as separate elements
The error:
Students write the set for “CATARACT” as {C,A,T,A,R,A,C,T} and then think the two sets are different because “CATARACT” has more letters.
Why it’s wrong:
A set does not contain duplicates. Each element appears only once. The letter A appears three times in “CATARACT”, but in the set it is listed just once.
How to avoid:
Always write the roster form of a set by listing each distinct letter only once.
- For “CATARACT”: distinct letters are C,A,T,R → set = {C,A,T,R}
- For “TRACT”: distinct letters are T,R,A,C,T → set = {T,R,A,C}
Both sets are {A,C,R,T} — equal.
Mistake 2: Confusing “set of letters” with “multiset” or “word”
The error:
Students think the order or frequency matters (e.g., “CATARACT” has 3 A’s, “TRACT” has 1 A, so they can’t be equal).
Why it’s wrong:
A set is unordered and has no multiplicity. The question explicitly says “set of letters”, not “list of letters” or “multiset”.
How to avoid:
Remember the definition:
A set is a collection of distinct objects, with no order.
If the problem meant frequency, it would say “multiset” or “bag of letters”.
Mistake 3: Forgetting to check both subset directions
The error:
Students only check that every letter in “TRACT” is in “CATARACT” (true), but don’t check the reverse.
Why it’s wrong:
Set equality requires A⊆B and B⊆A. If you only check one direction, you might miss that “CATARACT” has a letter not in “TRACT” (it doesn’t, but the habit is important).
How to avoid:
Always do the two-way check:
-
Forward: Is every letter of “TRACT” in “CATARACT”?
- T ✓, R ✓, A ✓, C ✓ → Yes.
-
Backward: Is every letter of “CATARACT” in “TRACT”?
- C ✓, A ✓, T ✓, R ✓ → Yes.
Since both hold, the sets are equal.
Mistake 4: Writing the set in the wrong order and thinking order matters
The error:
A student writes {C,A,T,R} for “CATARACT” and {T,R,A,C} for “TRACT”, then says they are different because the order is different.
Why it’s wrong:
Sets are unordered. {C,A,T,R}={T,R,A,C}.
How to avoid:
When comparing two sets, sort the elements alphabetically (or by any fixed rule) before comparing. This makes equality obvious.
- Sorted: both become {A,C,R,T}.
Mistake 5: Including spaces or punctuation as “letters”
The error:
The word “CATARACT” is written with a space in the problem: “CA TARACT”. Some students include the space as an element.
Why it’s wrong:
The problem says “letters needed to spell” — spaces are not letters.
How to avoid:
Ignore spaces, hyphens, apostrophes, etc. Only consider the alphabet characters (A–Z).
Quick Summary Table
| Mistake | Why it’s wrong | How to avoid |
|---|---|---|
| Counting duplicates | Sets have no repeats | List each distinct letter once |
| Treating order as important | Sets are unordered | Sort before comparing |
| Only checking one subset direction | Equality needs both directions | Do A⊆B and B⊆A |
| Including spaces/punctuation | Only letters count | Ignore non-alphabet characters |
Final takeaway:
The set of distinct letters in “CATARACT” is {A,C,R,T}.
The set of distinct letters in “TRACT” is also {A,C,R,T}.
They are equal because they contain exactly the same elements — no more, no less.
- Council of Higher Secondary Education, Manipur (Higher Secondary 1st Year) 2026Set ANNUAL1 markMCQQ.If A and B are two sets, then A – B is equal to(a) A ∪ B(b) A ∩ B(c) B – A(d) A ∩ B′
›Reveal solutionSolution
A – B is the set of elements in A that are not in B, written as A ∩ B′.
By definition, A – B = {x : x ∈ A and x ∉ B}. Since x ∉ B means x ∈ B′ (the complement of B), we can rewrite this as A – B = {x : x ∈ A and x ∈ B′} = A ∩ B′.
Checking the options: (a) A∪B is the union, not the difference.
(b) A∩B is the common part, not what's exclusive to A.
(c) B–A is the reverse difference.
(d) A∩B′ matches the definition exactly.
✓Final answerThe correct option is (d) A ∩ B′.
- Council of Higher Secondary Education, Manipur (Higher Secondary 1st Year) 2026Set ANNUAL1 markQ.If A is the set of real numbers and B is the set of rational numbers, then what is A – B?
›Reveal solutionSolution
A − B, the reals minus the rationals, is precisely the set of irrational numbers.
By definition, A−B={x:x∈A and x∈/B}. Here A is all real numbers and B is all rational numbers, so A−B consists of every real number that is NOT rational.
By definition, a real number that is not rational is called an irrational number (numbers like √2, π, e, etc., that cannot be written as a ratio of integers).
✓Final answerA − B is the set of irrational numbers, i.e., A − B = set of irrational numbers.
- Council of Higher Secondary Education, Manipur (Higher Secondary 1st Year) 2021Set ANNUAL1 markQ.If n(A)=30 and n(A∩B)=20, find n(A−B).
›Reveal solutionSolution
n(A−B)=n(A)−n(A∩B)=30−20=10.
A−B is the set of elements that belong to A but not to B. Every element of A either lies in A∩B (also in B) or lies in A−B (not in B), and these two parts partition A:
n(A)=n(A∩B)+n(A−B).
Substituting the given values:
n(A−B)=n(A)−n(A∩B)=30−20=10.
✓Final answern(A−B)=10.
🎓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.