Q.Let A = {1, 2, 3, 4, 5, 6}. Insert the appropriate symbol ∈ or ∉ in the blank spaces:
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.
So for A={1,2,3}: writing 1∈A is correct, but 1⊆A is technically wrong notation (1 is an element, not a set) — although {1}⊆A is correct, because now both sides being compared are sets.
Why it matters
Membership is the single test every other set idea is built on — union, intersection, subset, and complement are all ultimately defined by asking "x∈A?" and "x∈B?" for every candidate x. Get comfortable with ∈/∈/ first, and every later operation becomes just a combination of membership questions.
Takeaway
Membership answers one question only: is this exact object listed in this exact set? Everything else in set theory is built from asking that question, over and over, about different sets.
"Set membership symbol meaning" and "element vs subset difference class 11" are common queries around this idea, which forms the very first building block of the Sets chapter in the NCERT/CBSE Class 11 Mathematics curriculum. Getting the ∈ vs ⊆ distinction right is a small but frequent trap in board and competitive exam questions.
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 membership – an element either belongs to a set (∈) or does not (∈/).
The set A={1,2,3,4,5,6} contains exactly six elements. We check each given number against this list.
Step 1. Elements present in A: 1,2,3,4,5,6 all satisfy membership.
Step 2. Elements not in A: any number outside this list (like 0,8,10) does not belong.
Applying this:
- (i) 5∈A ✓
- (ii) 8∈/A ✓
- (iii) 0∈/A ✓
- (iv) 4∈A ✓
- (v) 2∈A ✓
- (vi) 10∈/A ✓
The completed statements are: (i) 5∈A,
(ii) 8∈/A,
(iii) 0∈/A,
(iv) 4∈A,
(v) 2∈A,
(vi) 10∈/A.
Set membership asks whether an element belongs to a collection. We check each number against A={1,2,3,4,5,6} and use ∈ if it appears in the set, ∈/ if it doesn't.
Understanding Set Membership
A set is simply a well-defined collection of distinct objects. When we write A={1,2,3,4,5,6}, we're listing exactly which elements belong to this set. The symbol ∈ (read "belongs to" or "is an element of") tells us that something is inside the set, while ∈/ (read "does not belong to") tells us it's absent.
The test is straightforward: scan the list of elements in the set. If you find the number, it's a member. If you don't, it isn't.
Checking Each Element
Let's examine each number against our set A={1,2,3,4,5,6}.
-
For 5: Looking at the elements {1,2,3,4,5,6}, we see 5 listed explicitly. Therefore 5∈A.
-
For 8: Scanning through {1,2,3,4,5,6}, the number 8 appears nowhere. The set contains only the first six positive integers. Therefore 8∈/A.
-
For 0: Zero is not among the elements {1,2,3,4,5,6}. The set starts at 1, not 0. Therefore 0∈/A.
-
For 4: The number 4 is clearly present in {1,2,3,4,5,6}. Therefore 4∈A.
-
For 2: We find 2 in the second position of {1,2,3,4,5,6}. Therefore 2∈A.
-
For 10: The number 10 exceeds the largest element in our set, which is 6. It does not appear in {1,2,3,4,5,6}. Therefore 10∈/A.
Don't confuse "close to" with "belongs to." Even though 0 is close to 1 and 8 is close to 6, proximity doesn't matter — only exact membership counts.
The completed statements are: (i) 5∈A,
(ii) 8∈/A,
(iii) 0∈/A,
(iv) 4∈A,
(v) 2∈A,
(vi) 10∈/A.
Method: Set Membership Test
Concept: The symbol ∈ means "is an element of" and ∈/ means "is not an element of." We check whether the given number appears in the set A.
Steps:
-
Write down the set
A={1,2,3,4,5,6}
-
For each number, check if it is listed in A
- If the number is present in the set → use ∈
- If the number is absent from the set → use ∈/
-
Apply to each case:
- 5 is in A → 5∈A
- 8 is not in A → 8∈/A
- 0 is not in A → 0∈/A
- 4 is in A → 4∈A
- 2 is in A → 2∈A
- 10 is not in A → 10∈/A
Final Answer:
| (i) | (ii) | (iii) | (iv) | (v) | (vi) |
|---|---|---|---|---|---|
| 5∈A | 8∈/A | 0∈/A | 4∈A | 2∈A | 10∈/A |
Key idea: Membership is simply about whether the element is listed inside the curly braces of the set. No calculation needed — just look and decide.
Here are the common mistakes students make with Set Membership problems like this one, and how to avoid each.
Mistake 1: Confusing the symbol direction (∈ vs. ∉)
- The error: Writing
5 ∈ Aas5 ∉ Aor vice versa. Students often mix up which symbol means "belongs to" and which means "does not belong to." - How to avoid: Remember the mnemonic: ∈ looks like a stylized "E" for "Element of" or think of it as a small "c" for "contains" (the element is in the set). The slash
/through ∉ means "not." Always double-check: if the number is listed inside the curly braces{...}, use ∈; if not, use ∉.
Mistake 2: Forgetting that 0 is not the same as "nothing"
- The error: Writing
0 ∈ Abecause students think "0 is nothing, so it's in the set." The set A = {1, 2, 3, 4, 5, 6} does not contain 0. - How to avoid: Treat 0 as a specific number, just like 1 or 5. Look at the list: if 0 is not written inside the braces, it is not an element. The set has six numbers; 0 is not one of them.
Mistake 3: Assuming the set includes all numbers "up to" the last element
- The error: Writing
8 ∈ Aor10 ∈ Abecause students think "the set goes from 1 to 6, so maybe it includes everything up to 6." The set A is explicitly listed — it contains only the numbers 1, 2, 3, 4, 5, 6. - How to avoid: Read the set notation literally.
A = {1, 2, 3, 4, 5, 6}means exactly those six numbers. No other numbers (like 0, 7, 8, 10) are included. If the number is not in the list, the answer is always ∉.
Mistake 4: Misreading the question — inserting the symbol in the wrong blank
- The error: Writing the symbol in the space before the number (e.g.,
∈ 5 A) instead of between the number and the set name (e.g.,5 ∈ A). - How to avoid: The blank is always between the element and the set name. Read the question format carefully:
(i) 5. . .Ameans you fill the blank with ∈ or ∉ so it reads5 ∈ Aor5 ∉ A. Practice writing it in the correct order.
Mistake 5: Overthinking — applying rules from other topics (like subsets)
- The error: Writing
{5} ∈ Aor thinking "5 is a subset of A" and using the wrong symbol (⊂ or ⊆). This question is about membership (∈), not subsets. - How to avoid: Remember: ∈ is for elements (individual objects, no curly braces around them). Subset symbols (⊂, ⊆) are for sets within sets. Here, every item (5, 8, 0, 4, 2, 10) is a single number, so only ∈ or ∉ apply.
Quick Reference: Correct Answers
| (i) | 5∈A | (ii) | 8∈/A | (iii) | 0∈/A |
|---|---|---|---|---|---|
| (iv) | 4∈A | (v) | 2∈A | (vi) | 10∈/A |
Final tip: Before writing, physically scan the set {1, 2, 3, 4, 5, 6} and check if the given number appears. If yes → ∈, if no → ∉. No shortcuts.
- COMEDK 2024Set 2024-M1 markMCQQ.Express the set A={1,7,17,31,49} in set builder form (A) {x∣x=2n2−1, where n∈N and n<5} (B) {x∣x=2n2−3, where n∈N and 2≤n≤8} (C) {x∣x=2n2+1, where n∈N and n≤7} (D) {x∣x=2n2−1, where n∈N and n≤5}
›Reveal solutionSolution
The set A={1,7,17,31,49} matches the formula x=2n2−1 for n=1,2,3,4,5, so the correct option is (D).
We need to express the given set {1,7,17,31,49} in set-builder form. The key is to find a pattern: each number is one less than twice a perfect square. Let’s check:
- 1=2(1)2−1
- 7=2(2)2−1
- 17=2(3)2−1
- 31=2(4)2−1
- 49=2(5)2−1
So the pattern is x=2n2−1 with n taking natural numbers from 1 to 5. Now we examine each option.
-
Option (A): x=2n2−1, n∈N, n<5.
This gives n=1,2,3,4 → values: 1,7,17,31. Missing 49. So incorrect.
-
Option (B): x=2n2−3, n∈N, 2≤n≤8.
For n=2: 2(4)−3=5 (not in set). So incorrect.
-
Option (C): x=2n2+1, n∈N, n≤7.
For n=1: 2+1=3 (not in set). So incorrect.
-
Option (D): x=2n2−1, n∈N, n≤5.
This gives n=1,2,3,4,5 → exactly 1,7,17,31,49. Correct.
Watch outA common mistake is to misread “n<5” as including 5 — it does not. Option (A) fails because it stops at n=4, missing 49.
TipAlways test the smallest and largest elements of the set against the formula and the range of n. Here, 49 is the key: only n=5 produces it, so the range must include 5.
✓Final answerThe correct option is (D).
ANSWER: D
- COMEDK 2023Set 2023-E1 markMCQQ.Which of the following is a singleton set? (A) {x:x2=4,x∈R} (B) {x:∣x∣<4,x∈N} (C) {x:∣x∣<−4,x∈N} (D) {x:x2=4,x∈N}
›Reveal solutionSolution
{x:x2=4, x∈N}={2} has exactly one element.
- (A) {x:x2=4, x∈R}={2,−2} — two elements.
- (B) {x:∣x∣<4, x∈N}={1,2,3} — three elements.
- (C) {x:∣x∣<−4, x∈N}=∅ — empty (no modulus is negative).
- (D) {x:x2=4, x∈N}={2} — exactly one element.
Only (D) is a singleton.
✓Final answerThe correct option is (D) — {x:x2=4, x∈N}
- KCET 2019Set A-11 markMCQQ.If U is the universal set with 100 elements; A and B are two sets such that n(A)=50, n(B)=60, n(A∩B)=20 then n(A′∩B′)= (A) 40 (B) 20 (C) 90 (D) 10
›Reveal solutionSolution
Use De Morgan’s law: A′∩B′=(A∪B)′. Find n(A∪B) via the inclusion-exclusion principle, then subtract from the total. The answer is 10.
The core idea here is that the complement of the union is exactly the region outside both sets. Instead of trying to count elements outside A and outside B separately, we use De Morgan’s law to turn the problem into one we already know how to solve: finding the size of the union.
When you see A′∩B′, always think: “this is everything that is not in A and not in B” — which is the same as “everything that is not in (A or B)”. That’s the complement of the union.
- Find n(A∪B) using the inclusion-exclusion formula. For any two sets,
n(A∪B)=n(A)+n(B)−n(A∩B)
Substitute the given values:
n(A∪B)=50+60−20=90
- Apply De Morgan’s law.
A′∩B′=(A∪B)′
This is a set identity — it always holds, no matter what the sets are.
- Find the size of the complement. The universal set U has 100 elements. The complement of any set X has size:
n(X′)=n(U)−n(X)
So:
n(A′∩B′)=n((A∪B)′)=n(U)−n(A∪B)=100−90=10
Watch outA common mistake is to think n(A′∩B′)=n(U)−n(A)−n(B). That would give 100−50−60=−10, which is impossible. The error is double-counting the intersection — elements in both A and B get subtracted twice. Always use the union first.
TipIf you prefer a visual approach: draw a Venn diagram with three regions — only A (30), only B (40), and both (20). The union fills 30+40+20=90 elements. The remaining 10 are outside both circles, which is exactly A′∩B′.
✓Final answerThe value is 10, which corresponds to option (D).
🎓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.