Q.State which of the following sets are finite or infinite :
🔒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 Membership
Set Membership
The idea in plain words
Every set is defined by exactly one question: "does this object belong to the set, or not?" That yes/no relationship between an object and a set is called membership. If an object is in the set, it is a member (or element) of the set; if it isn't, it simply is not.
A set is only "well-defined" if this question always has a clear answer for every possible object — that's what makes membership testable.
The notation
For a set A and an object x:
- x∈A reads "x belongs to A" or "x is an element of A" — TRUE membership.
- x∈/A reads "x does not belong to A" — FALSE membership.
Example. Let A={2,4,6,8}.
4∈A(4 is listed inside A)
5∈/A(5 is not listed inside A)
Testing membership: roster form vs. set-builder form
Roster form — just look for the object in the list.
B={1,3,5,7},3∈B,4∈/B
Set-builder form — plug the candidate into the defining rule and check if it's satisfied.
C={x∣x is a prime number less than 10}
Is 7∈C? Check: is 7 prime and less than 10? Yes → 7∈C.
Is 9∈C? Check: 9 is less than 10 but not prime (9=3×3) → 9∈/C.
Properties every student must know
- Each element is either in or out — never "partly in." Membership is binary, not a matter of degree.
- Repetition doesn't affect membership. {1,1,2}={1,2} — asking "is 1 a member?" gives the same YES either way.
- Order never affects membership. 2∈{1,2,3} is exactly the same fact as 2∈{3,2,1}.
- Nothing belongs to the empty set. For any x, x∈/∅ — there is nothing inside to belong to.
- A set can be an element of another set. If D={1,{2,3}}, then 1∈D is true, and {2,3}∈D is true, but 2∈D is false — 2 is not directly listed in D; it is only inside the set that is listed.
A common slip
Students often confuse x∈A (membership: is the object present?) with B⊆A (subset: is every element of B also in A?). The two symbols compare different kinds of things:
- ∈ / ∈/ compares an element to a set.
- ⊆ / ⊆ compares a set to a set. …
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. …
A set is finite if its elements can be counted to an end (even 0 counts); it is infinite if the count never stops. Work each condition in N={1,2,3,…}:
(i) (x−1)(x−2)=0⟹x=1,2⟹{1,2}, finite (2 elements).
(ii) x2=4⟹ only x=2∈N⟹{2}, finite (1 element).
(iii) 2x−1=0⟹x=21∈/N⟹∅, finite (0 elements — the empty set is finite, not infinite). …
A set is finite if its elements can be counted completely and the counting reaches an end; it is infinite if the counting never stops. Checking each condition for x∈N={1,2,3,…}: sets (i), (ii), and (iii) turn out finite (with 2, 1, and 0 elements respectively), while sets (iv) and (v) are infinite.
Understanding finite and infinite sets
A set is finite if you can count its elements and reach a final count — even zero is a valid, finite count. A set is infinite if listing its elements never comes to an end. For each part below, we first solve the condition to find which natural numbers satisfy it, then count how many there are.
(i) {x:x∈N and (x−1)(x−2)=0}
- (x−1)(x−2)=0 means x−1=0 or x−2=0.
- So x=1 or x=2.
- Both 1 and 2 are natural numbers, so the set is {1,2}.
- This set has exactly 2 elements — it is finite.
(ii) {x:x∈N and x2=4}
- x2=4 gives x=2 or x=−2.
- Since N={1,2,3,…} contains no negative numbers, only x=2 qualifies.
- The set is {2}, with exactly 1 element.
- This set is finite.
(iii) {x:x∈N and 2x−1=0}
- 2x−1=0 gives x=21.
- 21 is not a natural number, so no x∈N satisfies this condition.
- The set is the empty set, ∅.
The empty set has 0 elements, and 0 is a finite count — so the empty set is finite, not infinite. Don't mistake "empty" for "infinite."
- This set is finite (0 elements).
(iv) {x:x∈N and x is prime}
- This is the set of prime numbers in N: {2,3,5,7,11,13,…}. …
Here’s a clear, concept-first solution method for listing elements of a set from its set-builder form.
Method Name: Roster Form Conversion (Set-Builder to Roster)
Core Concept:
A set defined in set-builder notation (e.g., {x:condition on x}) is a description. To list its elements, you must identify every distinct object that satisfies the given condition, within the implied universal set (natural numbers, integers, letters, etc.).
Steps for Roster Form Conversion
- Identify the domain (what kind of objects x can be: natural numbers, integers, letters, months).
- Interpret the condition precisely. Translate any inequality or property into a clear range or list.
- Generate candidates systematically (start from the smallest, move step-by-step).
- Test each candidate against the condition. Include it only if it satisfies.
- Write the final list inside curly braces {}, separated by commas. If no elements exist, write {} or ∅.
Applying the Method to Each Set
(i) A={x:x is an odd natural number}
- Domain: Natural numbers (N). Usually N={1,2,3,…}.
- Condition: x is odd.
- Generate: 1,2,3,4,5,…
- Test: 1 (odd ✓), 2 (even ✗), 3 (odd ✓), 4 (even ✗), …
- Result: The set is infinite. In roster form, we show the pattern.
Answer:
A={1,3,5,7,9,…}
(ii) B={x:x is an integer, −21<x<29}
- Domain: Integers (Z={…,−2,−1,0,1,2,…}).
- Condition: −21<x<29.
- −21=−0.5
- 29=4.5
- Generate integers between -0.5 and 4.5: 0,1,2,3,4.
- Test: All satisfy (0 > -0.5, 4 < 4.5).
Answer:
B={0,1,2,3,4}
(iii) C={x:x is an integer, x2≤4}
- Domain: Integers.
- Condition: x2≤4.
- Generate: Start from 0, then positive and negative integers.
- 02=0≤4 ✓
- 12=1≤4 ✓, (−1)2=1≤4 ✓
- 22=4≤4 ✓, (−2)2=4≤4 ✓
- 32=9>4 ✗ (stop expanding outward).
- Result: Integers whose square is at most 4.
Answer:
C={−2,−1,0,1,2}
(iv) D={x:x is a letter in the word “LOYAL”}
- Domain: Letters of the English alphabet.
- Condition: x appears in the word “LOYAL”.
- List letters in order: L, O, Y, A, L.
- Remove duplicates (sets contain distinct elements): L, O, Y, A. …
Here are the common mistakes students make when matching roster form to set-builder form, along with how to avoid each.
Mistake 1: Ignoring the Order of Elements in the Roster Form
- The Mistake: Students see
{P, R, I, N, C, A, L}and immediately look for a set-builder form that lists the letters in the same order. They might incorrectly match it with{x : x is a letter of the word PRINCIPAL}because the word "PRINCIPAL" has repeated letters (P, I) and a different order. - Why it’s wrong: A set is defined by its elements, not by the order they are listed. The roster form
{P, R, I, N, C, A, L}contains 7 distinct letters. The word "PRINCIPAL" has 9 letters, including two P's and two I's. The set of letters in "PRINCIPAL" is{P, R, I, N, C, A, L}— the same set. - How to Avoid: Always list the distinct elements of the word or condition first. For a word, write down each unique letter once. Then compare that list to the roster form given.
Mistake 2: Misinterpreting the Condition x + 1 = 1
- The Mistake: Students solve
x + 1 = 1and getx = 0. They then see the roster form{0}and match it with this condition. While this is correct, the mistake is often made when students confuse this with other simple equations or forget to check if the solution is an integer. - Why it’s wrong (in context of other options): The real danger is not in matching (ii) with (c), but in not checking the other options. For example, a student might see
{0}and think it matches{x : x is a positive integer and is a divisor of 18}because 0 is an integer, forgetting the "positive" condition. - How to Avoid: Solve the condition completely and then check the domain (e.g., "positive integer", "integer"). For
x + 1 = 1, the solution isx = 0, and 0 is an integer. That matches{0}perfectly.
Mistake 3: Forgetting the Domain (e.g., "positive integer")
- The Mistake: A student sees
{1, 2, 3, 6, 9, 18}and knows these are divisors of 18. They match it with{x : x is a positive integer and is a divisor of 18}. This is correct. The mistake happens when a student matches{3, -3}with the same divisor set because 3 is a divisor, ignoring the "-3" and the "positive" condition. - Why it’s wrong: The set-builder form explicitly says "positive integer". Negative numbers like -3 are not positive. The set
{3, -3}comes from solving x2−9=0, which givesx = 3orx = -3. - How to Avoid: Read every word in the set-builder form. Underline keywords like "positive", "integer", "natural", "real". Then check if every element in the roster form satisfies all parts of the condition.
Mistake 4: Confusing "Divisor" with "Multiple"
- The Mistake: A student sees
{1, 2, 3, 6, 9, 18}and thinks, "These are multiples of 18" or "These are factors of 18". They might match it with a different condition or get confused. - Why it’s wrong: A divisor (or factor) of 18 is a number that divides 18 exactly. 1, 2, 3, 6, 9, and 18 all divide 18. A multiple of 18 would be 18, 36, 54, etc. The set
{1, 2, 3, 6, 9, 18}is exactly the set of positive divisors of 18. - How to Avoid: Memorize the definition: "a is a divisor of b" means
b ÷ ais an integer. Practice listing divisors of small numbers (like 12, 18, 24) until it becomes automatic. …
- CBSE 2024Set ANNUAL1 markMCQQ.If B={x:x∈Z and x2<16}, then n(B) is(a) 3(b) 4(c) 6(d) 7
›Reveal solutionSolution
List the integers satisfying x2<16 and count them.
x2<16⟹−4<x<4. The integers strictly between −4 and 4 are −3,−2,−1,0,1,2,3.
…
- CBSE 2023Set ANNUAL1 markMCQQ.If A={x:x∈W,x<3}, then n(A) is(a) 1(b) 2(c) 3(d) 4
›Reveal solutionSolution
List the whole numbers less than 3 and count them.
The set of whole numbers is W={0,1,2,3,4,…}.
…
- CBSE 2022Set ANNUAL1 markMCQQ.If B={x:x is a natural number less than 6}, then n(B) is(a) 4(b) 5(c) 6(d) 8
›Reveal solutionSolution
Listing the natural numbers less than 6 gives n(B)=5.
A natural number less than 6 means the numbers 1,2,3,4,5 (natural numbers start at 1 and stop before 6).
…
🎓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.