SOLVER7 Study. Nothing Else.
Exercise 1.3 Q4(iii)

Write down all the subsets of the following sets \(\{1,2,3\}\)

CBSE Class 11 Maths · Sets

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have three toys: a ball, a car, and a doll. A subset is any group you can pick from these toys, including picking none at all. You could pick zero toys, just one toy, any two toys, or all three toys. Every possible combination counts as its own group. When you count all these groups for three toys, you get exactly 8 different groups in total.

Answer: The subsets of \( \{1, 2, 3\} \) are: \( \emptyset \), \( \{1\} \), \( \{2\} \), \( \{3\} \), \( \{1, 2\} \), \( \{1, 3\} \), \( \{2, 3\} \), and \( \{1, 2, 3\} \). In total there are \( 8 \) subsets.

📖 All Subsets of {1, 2, 3}

Detailed Explanation

A set \( A \) is called a subset of a set \( B \) if every element of \( A \) is also an element of \( B \); we write \( A \subseteq B \). Two important facts help us list all subsets. First, the empty set \( \emptyset \) is a subset of every set. Second, every set is a subset of itself. To list all subsets of a set, we organise them by the number of elements they contain: subsets with 0 elements, then 1 element, then 2 elements, and finally the whole set. The collection of all subsets is called the power set.

Formula Used

If a set has \( n \) elements, then the number of subsets is \( 2^n \). Here \( n = 3 \), so the number of subsets is \( 2^3 = 8 \).

Solution

  1. Step 1: Identify the set and its number of elements. The given set is \( \{1, 2, 3\} \), which has \( 3 \) elements. So we expect \( 2^3 = 8 \) subsets in total. Listing them by size makes sure none are missed.
  2. Step 2: Write the subset with 0 elements. The empty set is a subset of every set, so we start with \( \emptyset \). That gives us 1 subset so far.
  3. Step 3: Write the subsets with exactly 1 element. Each single element forms one subset: \( \{1\} \), \( \{2\} \), \( \{3\} \). That gives 3 more subsets.
  4. Step 4: Write the subsets with exactly 2 elements. Choose every possible pair: \( \{1, 2\} \), \( \{1, 3\} \), \( \{2, 3\} \). That gives 3 more subsets.
  5. Step 5: Write the subset with all 3 elements. The set itself is always a subset of itself: \( \{1, 2, 3\} \). That gives the final subset.
  6. Step 6: Count to confirm. We have \( 1 + 3 + 3 + 1 = 8 \) subsets, which matches \( 2^3 = 8 \). This confirms we have listed every subset.

Final Answer

The subsets of \( \{1, 2, 3\} \) are: \( \emptyset \), \( \{1\} \), \( \{2\} \), \( \{3\} \), \( \{1, 2\} \), \( \{1, 3\} \), \( \{2, 3\} \), and \( \{1, 2, 3\} \). In total there are \( 8 \) subsets.

Common Mistake

A very common mistake is forgetting to include the empty set \( \emptyset \) and the set itself \( \{1, 2, 3\} \) as subsets. Both must always be counted, which is why the total is \( 8 \) and not \( 6 \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and count its elements. The given set is \( \\{1, 2, 3\\} \), which contains \( 3 \) elements, so \( n = 3 \). — Reason: Knowing \( n \) lets us predict the total number of subsets using the formula \( 2^n \), so we can verify our list is complete.
  2. Step 2: Apply the subset-count formula. The total number of subsets is \( 2^3 = 8 \). — Reason: This tells us exactly how many subsets to expect, so we know when to stop listing and can check we have missed nothing.
  3. Step 3: Write the subset with 0 elements. The empty set \( \emptyset \) is always included because it is a subset of every set by definition. Running total: 1 subset. — Reason: The empty set contributes one entry to our list and must never be forgotten; it is the most commonly omitted subset.
  4. Step 4: List all subsets with exactly 1 element. Picking one element at a time from \( \\{1, 2, 3\\} \) gives: \( \\{1\\} \), \( \\{2\\} \), \( \\{3\\} \). Running total: \( 1 + 3 = 4 \) subsets. — Reason: Each individual element of the original set forms its own valid subset, and there are exactly \( 3 \) such singletons.
  5. Step 5: List all subsets with exactly 2 elements. Choosing every distinct pair from \( \\{1, 2, 3\\} \) gives: \( \\{1, 2\\} \), \( \\{1, 3\\} \), \( \\{2, 3\\} \). Running total: \( 4 + 3 = 7 \) subsets. — Reason: We systematically pair each element with every other element that comes after it in the set, ensuring no pair is repeated or skipped.
  6. Step 6: Write the subset with all 3 elements. The set itself, \( \\{1, 2, 3\\} \), is always a subset of itself. Running total: \( 7 + 1 = 8 \) subsets. — Reason: Every set is defined to be a subset of itself, so the original set must appear in our list as the final entry.
  7. Step 7: Verify the count. We listed subsets grouped by size: 1 (empty) + 3 (size 1) + 3 (size 2) + 1 (size 3) = \( 8 \) subsets in all, which matches the predicted value \( 2^3 = 8 \). — Reason: Confirming the total ensures no subset has been accidentally missed or counted twice.

Final Answer

The subsets of \( \{1, 2, 3\} \) are: \( \emptyset \), \( \{1\} \), \( \{2\} \), \( \{3\} \), \( \{1, 2\} \), \( \{1, 3\} \), \( \{2, 3\} \), and \( \{1, 2, 3\} \). In total there are \( 8 \) subsets.

Common Mistake

One common mistake: students forget to include the empty set \( \emptyset \) and the set itself \( \\{1, 2, 3\\} \), ending up with only 6 subsets instead of the correct 8.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given set: \( \\{1, 2, 3\\} \), \( n = 3 \), total subsets \( = 2^3 = 8 \)
  2. Step 2: 0-element subset: \( \emptyset \); 1-element subsets: \( \\{1\\} \), \( \\{2\\} \), \( \\{3\\} \)
  3. Step 3: 2-element subsets: \( \\{1, 2\\} \), \( \\{1, 3\\} \), \( \\{2, 3\\} \); 3-element subset: \( \\{1, 2, 3\\} \)

Answer: The subsets of \( \{1, 2, 3\} \) are: \( \emptyset \), \( \{1\} \), \( \{2\} \), \( \{3\} \), \( \{1, 2\} \), \( \{1, 3\} \), \( \{2, 3\} \), and \( \{1, 2, 3\} \). In total there are \( 8 \) subsets.

➕ More Examples

More Examples

Example 1

Question: Write down all the subsets of the set \( A = \{p, q, r, s\} \).

Solution: The set \( A = \{p, q, r, s\} \) has \( n = 4 \) elements. Total number of subsets = \( 2^4 = 16 \). We list them systematically: Subsets with 0 elements (the empty set): \[ \emptyset \] Subsets with 1 element (singleton subsets): \[ \{p\},\ \{q\},\ \{r\},\ \{s\} \] Subsets with 2 elements: \[ \{p, q\},\ \{p, r\},\ \{p, s\},\ \{q, r\},\ \{q, s\},\ \{r, s\} \] Subsets with 3 elements: \[ \{p, q, r\},\ \{p, q, s\},\ \{p, r, s\},\ \{q, r, s\} \] Subset with 4 elements (the set itself): \[ \{p, q, r, s\} \] Total count: \( 1 + 4 + 6 + 4 + 1 = 16 \), which confirms \( 2^4 = 16 \).

Answer: All 16 subsets are: \( \emptyset,\ \{p\},\ \{q\},\ \{r\},\ \{s\},\ \{p,q\},\ \{p,r\},\ \{p,s\},\ \{q,r\},\ \{q,s\},\ \{r,s\},\ \{p,q,r\},\ \{p,q,s\},\ \{p,r,s\},\ \{q,r,s\},\ \{p,q,r,s\} \)

Example 2

Question: List all the subsets of the set \( B = \{2, 5, 9\} \). Also verify the total number of subsets using the formula.

Solution: The set \( B = \{2, 5, 9\} \) has \( n = 3 \) elements. By the formula, total number of subsets = \( 2^3 = 8 \). We now list all subsets systematically: Subset with 0 elements: \[ \emptyset \] Subsets with 1 element: \[ \{2\},\ \{5\},\ \{9\} \] Subsets with 2 elements: \[ \{2, 5\},\ \{2, 9\},\ \{5, 9\} \] Subset with 3 elements (the set itself): \[ \{2, 5, 9\} \] Counting all subsets: \( 1 + 3 + 3 + 1 = 8 \). This matches \( 2^3 = 8 \), so the listing is complete.

Answer: All 8 subsets are: \( \emptyset,\ \{2\},\ \{5\},\ \{9\},\ \{2,5\},\ \{2,9\},\ \{5,9\},\ \{2,5,9\} \)

🎯 Try a Similar Question

Try a Similar Question

Question: Write down all the subsets of the set \( A = \{a, b, c, d\} \). Also state the total number of subsets.

Solution

  1. Step 1: Identify the number of elements: The set is \( A = \{a, b, c, d\} \), which has \( n = 4 \) elements.
  2. Step 2: Use the formula for total number of subsets: Total number of subsets = \( 2^n = 2^4 = 16 \).
  3. Step 3: List subsets with 0 elements: There is exactly 1 subset with 0 elements (the empty set): \( \emptyset \).
  4. Step 4: List subsets with 1 element: Subsets with 1 element: \( \{a\} \), \( \{b\} \), \( \{c\} \), \( \{d\} \). That gives \( \binom{4}{1} = 4 \) subsets.
  5. Step 5: List subsets with 2 elements: Subsets with 2 elements: \( \{a, b\} \), \( \{a, c\} \), \( \{a, d\} \), \( \{b, c\} \), \( \{b, d\} \), \( \{c, d\} \). That gives \( \binom{4}{2} = 6 \) subsets.
  6. Step 6: List subsets with 3 elements: Subsets with 3 elements: \( \{a, b, c\} \), \( \{a, b, d\} \), \( \{a, c, d\} \), \( \{b, c, d\} \). That gives \( \binom{4}{3} = 4 \) subsets.
  7. Step 7: List subsets with 4 elements: The only subset with all 4 elements is the set itself: \( \{a, b, c, d\} \). That gives \( \binom{4}{4} = 1 \) subset.
  8. Step 8: Verify the count: Total subsets = \( 1 + 4 + 6 + 4 + 1 = 16 = 2^4 \). The count is confirmed.

Answer: The 16 subsets of \( A = \{a, b, c, d\} \) are: \( \emptyset \); \( \{a\} \), \( \{b\} \), \( \{c\} \), \( \{d\} \); \( \{a, b\} \), \( \{a, c\} \), \( \{a, d\} \), \( \{b, c\} \), \( \{b, d\} \), \( \{c, d\} \); \( \{a, b, c\} \), \( \{a, b, d\} \), \( \{a, c, d\} \), \( \{b, c, d\} \); and \( \{a, b, c, d\} \). The total number of subsets is \( 2^4 = 16 \).

Everything you get with Solver7

More questions in Sets