SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q10

Let \(A=\{a, e, i, o, u\}\) and \(B=\{a,b,c,d\}.\) Is \(A\) a subset of \(B\ ?\) No. (Why?). Is \(B\) a subset of \(A?\) No. (Why?)

CBSE Class 11 Maths · Sets

Solution

👶 Simple Explanation

Simple Explanation

Imagine two groups of letters. Group \( A \) has the vowels \( \{a, e, i, o, u\} \) and Group \( B \) has \( \{a, b, c, d\} \). For one group to "fit inside" the other, every single member must belong to the other group too. The letter \( e \) is in \( A \) but missing from \( B \), so \( A \) does not fit inside \( B \). The letter \( b \) is in \( B \) but missing from \( A \), so \( B \) does not fit inside \( A \) either.

Answer: \( A \) is not a subset of \( B \) because \( e \in A \) but \( e \notin B \). \( B \) is not a subset of \( A \) because \( b \in B \) but \( b \notin A \). Hence \( A \not\subseteq B \) and \( B \not\subseteq A \).

📖 Checking Subset Relations Between Two Sets

Detailed Explanation

A set \( P \) is called a subset of a set \( Q \), written \( P \subseteq Q \), if every element of \( P \) is also an element of \( Q \). This means: for \( P \subseteq Q \), there should be NO element in \( P \) that is missing from \( Q \). If we can find even a single element of \( P \) that does not belong to \( Q \), then \( P \) is NOT a subset of \( Q \). To decide whether \( A \) is a subset of \( B \), we check each element of \( A \) and see if it lies in \( B \). Similarly, to check whether \( B \) is a subset of \( A \), we check each element of \( B \) against \( A \).

Formula Used

\( P \subseteq Q \) means: for every \( x \), if \( x \in P \) then \( x \in Q \).

Solution

  1. Step 1: Write down the two sets clearly. \[A = \{a, e, i, o, u\}\] \[B = \{a, b, c, d\}\]
  2. Step 2: Check if \( A \subseteq B \). Compare each element of \( A \) with the elements of \( B \). Here \( a \in B \), but \( e \notin B \). Since the element \( e \) of \( A \) is not in \( B \), not every element of \( A \) belongs to \( B \).
  3. Step 3: Conclusion for the first part: because at least one element (namely \( e \), and also \( i, o, u \)) of \( A \) is missing from \( B \), \( A \) is NOT a subset of \( B \). We write \( A \not\subseteq B \).
  4. Step 4: Check if \( B \subseteq A \). Compare each element of \( B \) with the elements of \( A \). Here \( a \in A \), but \( b \notin A \). Since the element \( b \) of \( B \) is not in \( A \), not every element of \( B \) belongs to \( A \).
  5. Step 5: Conclusion for the second part: because at least one element (namely \( b \), and also \( c, d \)) of \( B \) is missing from \( A \), \( B \) is NOT a subset of \( A \). We write \( B \not\subseteq A \).

Final Answer

\( A \) is not a subset of \( B \) because \( e \in A \) but \( e \notin B \). \( B \) is not a subset of \( A \) because \( b \in B \) but \( b \notin A \). Hence \( A \not\subseteq B \) and \( B \not\subseteq A \).

Common Mistake

A common mistake is to think that since the two sets share the common element \( a \), one set must be a subset of the other. Sharing some elements is not enough — for a subset, EVERY element of the smaller set must be present in the larger set.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Write both sets clearly before doing any comparison. \[A = \{a, e, i, o, u\}\] \[B = \{a, b, c, d\}\] Reason: Listing the elements explicitly prevents errors when scanning membership — you can tick off each element one by one.
  2. Step 2: Test whether \( A \subseteq B \) by checking each element of \( A \) against \( B \). Start with the first element: \( a \in B \). Move to the next: \( e \notin B \). Reason: We only need one counterexample to disprove a subset relationship, so we scan \( A \) until we either exhaust all elements (subset confirmed) or find a missing one (subset denied).
  3. Step 3: Since \( e \in A \) yet \( e \notin B \), conclude \( A \not\subseteq B \). Note that \( i, o, u \) are also absent from \( B \), but finding one missing element is sufficient. Reason: The subset definition requires every element of \( A \) to be in \( B \); even a single exception breaks the rule.
  4. Step 4: Now test the reverse: check whether \( B \subseteq A \) by scanning each element of \( B \) against \( A \). First element: \( a \in A \). Second element: \( b \notin A \). Reason: The subset relation is not automatically symmetric — \( A \not\subseteq B \) tells us nothing about \( B \not\subseteq A \), so we must check independently.
  5. Step 5: Since \( b \in B \) yet \( b \notin A \), conclude \( B \not\subseteq A \). The elements \( c \) and \( d \) are similarly absent from \( A \), but again one counterexample is enough. Reason: The same logic applies — one element of \( B \) missing from \( A \) is sufficient to deny the subset relationship.
  6. Step 6: Combine both conclusions: neither set contains the other. Therefore \( A \not\subseteq B \) and \( B \not\subseteq A \). Reason: Since we found a counterexample in each direction, neither set qualifies as a subset of the other.

Final Answer

\( A \) is not a subset of \( B \) because \( e \in A \) but \( e \notin B \). \( B \) is not a subset of \( A \) because \( b \in B \) but \( b \notin A \). Hence \( A \not\subseteq B \) and \( B \not\subseteq A \).

Common Mistake

One common mistake: students sometimes assume that because \( A \not\subseteq B \), it automatically follows that \( B \subseteq A \) — this is false. Each direction must be tested separately using its own counterexample.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \[A = \\{a, e, i, o, u\\}, \quad B = \\{a, b, c, d\\}\]
  2. Step 2: Check \\ \( A \subseteq B \): \\ \( e \in A \) but \\ \( e \notin B \), so \\ \( A \not\subseteq B \).
  3. Step 3: Check \\ \( B \subseteq A \): \\ \( b \in B \) but \\ \( b \notin A \), so \\ \( B \not\subseteq A \).

Answer: \( A \) is not a subset of \( B \) because \( e \in A \) but \( e \notin B \). \( B \) is not a subset of \( A \) because \( b \in B \) but \( b \notin A \). Hence \( A \not\subseteq B \) and \( B \not\subseteq A \).

➕ More Examples

More Examples

Example 1

Question: Let \( P = \{2, 4, 6, 8, 10\} \) and \( Q = \{1, 2, 3, 4, 5\} \). Is \( P \) a subset of \( Q \)? Is \( Q \) a subset of \( P \)? Justify your answers.

Solution: We are given \( P = \{2, 4, 6, 8, 10\} \) and \( Q = \{1, 2, 3, 4, 5\} \). Checking whether \( P \subseteq Q \): For P to be a subset of Q, every element of P must belong to Q. Consider the element \( 6 \in P \). We observe that \( 6 \notin Q \) (since Q contains only 1, 2, 3, 4, 5). Since there exists an element of P that does not belong to Q, we conclude \( P \not\subseteq Q \). Checking whether \( Q \subseteq P \): For Q to be a subset of P, every element of Q must belong to P. Consider the element \( 1 \in Q \). We observe that \( 1 \notin P \) (since P contains only even numbers 2, 4, 6, 8, 10). Since there exists an element of Q that does not belong to P, we conclude \( Q \not\subseteq P \). Therefore, neither \( P \subseteq Q \) nor \( Q \subseteq P \).

Answer: P is NOT a subset of Q (since 6 ∈ P but 6 ∉ Q). Q is NOT a subset of P (since 1 ∈ Q but 1 ∉ P).

Example 2

Question: Let \( X = \{x : x \text{ is a letter in the word MATHEMATICS}\} \) and \( Y = \{M, A, T, H\} \). First list the elements of X. Then determine: Is \( X \subseteq Y \)? Is \( Y \subseteq X \)?

Solution: First, we list the distinct letters in the word MATHEMATICS: M, A, T, H, E, M, A, T, I, C, S — removing repeated letters, we get \( X = \{M, A, T, H, E, I, C, S\} \). We are also given \( Y = \{M, A, T, H\} \). Checking whether \( X \subseteq Y \): For X to be a subset of Y, every element of X must belong to Y. Consider the element \( E \in X \). We see that \( E \notin Y \) (Y contains only M, A, T, H). Since at least one element of X does not belong to Y, we conclude \( X \not\subseteq Y \). Checking whether \( Y \subseteq X \): We check each element of Y against X: \( M \in X \) — Yes. \( A \in X \) — Yes. \( T \in X \) — Yes. \( H \in X \) — Yes. Every element of Y belongs to X. Therefore \( Y \subseteq X \). So \( X \not\subseteq Y \) but \( Y \subseteq X \).

Answer: X is NOT a subset of Y (since E ∈ X but E ∉ Y). Y IS a subset of X (every element of Y belongs to X).

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( P = \{2, 3, 5, 7, 11\} \) be the set of the first five prime numbers, and let \( Q = \{1, 2, 3, 4, 5\} \). Determine whether P is a subset of Q and whether Q is a subset of P. Justify your answers.

Solution

  1. Step 1: Write out both sets clearly: We have \( P = \{2, 3, 5, 7, 11\} \) and \( Q = \{1, 2, 3, 4, 5\} \).
  2. Step 2: Check whether P ⊆ Q: For P to be a subset of Q, every element of P must also belong to Q. Consider the element \( 7 \in P \). Looking at Q, we see \( Q = \{1, 2, 3, 4, 5\} \), so \( 7 \notin Q \). Since we found an element of P that is not in Q, we conclude \( P \not\subseteq Q \).
  3. Step 3: Check whether Q ⊆ P: For Q to be a subset of P, every element of Q must also belong to P. Consider the element \( 1 \in Q \). Looking at P, we see \( P = \{2, 3, 5, 7, 11\} \), so \( 1 \notin P \). Since we found an element of Q that is not in P, we conclude \( Q \not\subseteq P \).
  4. Step 4: State the conclusion: Neither P is a subset of Q nor Q is a subset of P. That is, \( P \not\subseteq Q \) and \( Q \not\subseteq P \).

Answer: P is NOT a subset of Q because \( 7 \in P \) but \( 7 \notin Q \). Q is NOT a subset of P because \( 1 \in Q \) but \( 1 \notin P \). Hence \( P \not\subseteq Q \) and \( Q \not\subseteq P \).

Everything you get with Solver7

More questions in Sets