In each of the following, determine whether the statement is true or false. If it is true, prove it. If it is false, give an example. If \(x\in A\) and \(A \not\subset B ,\) then \(x \in B\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine a bag of marbles called \( A \) and another bag called \( B \). Saying \( A \not\subset B \) just means at least one marble from bag \( A \) is missing from bag \( B \). But some marbles from bag \( A \) can still be in bag \( B \)! So if you pick a specific marble \( x \) from bag \( A \), you cannot be sure whether \( x \) is in bag \( B \) or not. The statement that \( x \) must be outside \( B \) is simply not always true.
Answer: The statement is FALSE. Counterexample: take \( A = \{1, 2\} \), \( B = \{1, 3\} \), and \( x = 2 \). Then \( x \in A \) and \( A \not\subset B \), but \( x \notin B \).
The notation \( A \not\subset B \) means that \( A \) is NOT a subset of \( B \). By definition, \( A \subset B \) holds when every element of \( A \) is also in \( B \). So \( A \not\subset B \) simply means there exists at least one element of \( A \) that is not in \( B \). Importantly, this says nothing definite about a particular element \( x \in A \); some elements of \( A \) may still lie in \( B \), and some may not. To disprove a general statement like this, we only need ONE counterexample where the given conditions hold but the conclusion fails.
\( A \subset B \iff \text{every element of } A \text{ is in } B \), so \( A \not\subset B \) means there exists some \( a \in A \) with \( a \notin B \).
The statement is FALSE. Counterexample: take \( A = \{1, 2\} \), \( B = \{1, 3\} \), and \( x = 2 \). Then \( x \in A \) and \( A \not\subset B \), but \( x \notin B \).
A common error is treating \( A \not\subset B \) as if it means every element of \( A \) lies outside \( B \). In reality it only guarantees that at least one element of \( A \) is not in \( B \), so a specific \( x \in A \) may or may not belong to \( B \).
The statement is FALSE. Counterexample: take \( A = \{1, 2\} \), \( B = \{1, 3\} \), and \( x = 2 \). Then \( x \in A \) and \( A \not\subset B \), but \( x \notin B \).
One common mistake: students read \( A \not\subset B \) as meaning no element of \( A \) belongs to \( B \), and then incorrectly conclude that any \( x \in A \) must lie outside \( B \). In reality, \( A \not\subset B \) only guarantees that at least one element of \( A \) is missing from \( B \); other elements of \( A \) may or may not be in \( B \).
Answer: The statement is FALSE. Counterexample: take \( A = \{1, 2\} \), \( B = \{1, 3\} \), and \( x = 2 \). Then \( x \in A \) and \( A \not\subset B \), but \( x \notin B \).
Question: Determine whether the following statement is true or false. If true, prove it. If false, give a counterexample. If \( x \in A \) and \( A \not\subset B \), then \( x \notin B \).
Solution: We check whether the statement is true or false. The statement claims: whenever \( x \in A \) and \( A \not\subset B \), it must follow that \( x \notin B \). Recall the definition: \( A \not\subset B \) means there exists at least one element in \( A \) that does not belong to \( B \). It does NOT mean every element of \( A \) is outside \( B \). So it is entirely possible that some elements of \( A \) are in \( B \) and some are not. Counterexample: Let \( A = \{2, 4, 7\} \) and \( B = \{2, 4, 6, 8\} \). Check: Is \( A \subset B \)? We need every element of \( A \) to be in \( B \). But \( 7 \in A \) and \( 7 \notin B \), so \( A \not\subset B \). Now take \( x = 2 \). We have \( x = 2 \in A \) and \( A \not\subset B \), but \( 2 \in B \). This directly contradicts the statement, because even though \( A \not\subset B \), the specific element \( x = 2 \) does belong to \( B \). Therefore, the statement is FALSE.
Answer: False. Counterexample: \( A = \{2, 4, 7\} \), \( B = \{2, 4, 6, 8\} \), \( x = 2 \). Here \( x \in A \), \( A \not\subset B \) (since \( 7 \notin B \)), yet \( x = 2 \in B \).
Question: Determine whether the following statement is true or false. If true, prove it. If false, give a counterexample. If \( A \not\subset B \) and \( x \in A \), then \( x \in A \setminus B \).
Solution: We examine whether the statement is true or false. Recall: \( A \setminus B \) (A minus B) is the set of all elements that are in \( A \) but NOT in \( B \). The statement claims that if \( A \not\subset B \) and \( x \in A \), then necessarily \( x \in A \setminus B \), meaning \( x \notin B \). The condition \( A \not\subset B \) guarantees only that at least one element of \( A \) falls outside \( B \). It says nothing about which specific element \( x \) we pick from \( A \). Counterexample: Let \( A = \{1, 3, 5, 9\} \) and \( B = \{1, 3, 10, 12\} \). Check \( A \not\subset B \): Is \( 5 \in B \)? No. So \( A \not\subset B \). ✓ Now take \( x = 3 \). We have \( x = 3 \in A \), and \( A \not\subset B \), but \( 3 \in B \). Therefore \( x = 3 \notin A \setminus B \), which contradicts the statement. Alternatively, \( A \setminus B = \{5, 9\} \), which does not contain \( x = 3 \). Thus the statement is FALSE.
Answer: False. Counterexample: \( A = \{1, 3, 5, 9\} \), \( B = \{1, 3, 10, 12\} \), \( x = 3 \). Here \( A \not\subset B \) (since \( 5 \notin B \)) and \( x = 3 \in A \), but \( 3 \in B \), so \( x \notin A \setminus B \).
Question: Determine whether the following statement is true or false. If it is true, prove it. If it is false, give a counterexample. If \( x \in A \) and \( A \subseteq B \), then \( x \in B \).
Answer: The statement is TRUE. Proof: Let \( x \in A \) and \( A \subseteq B \). By the definition of a subset, every element of \( A \) is an element of \( B \). Since \( x \in A \), it follows that \( x \in B \).