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 \(A \not\subset B\) and \(B\not\subset C ,\) then \(A \not\subset C\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine three friend groups at school. Group A is not fully inside Group B, and Group B is not fully inside Group C. Does that mean Group A stays outside Group C? Not necessarily! Group A could still fit inside Group C even if the middle group B does not connect them perfectly. We can pick real sets to show this: \( A = \\{1, 2\\} \), \( B = \\{2, 3\\} \), \( C = \\{1, 2, 4\\} \). Here A misses from B, B misses from C, yet every member of A is still found inside C.
Answer: The statement is FALSE. Counterexample: \( A = \{1, 2\} \), \( B = \{2, 3\} \), \( C = \{1, 2, 4\} \). Here \( A \not\subset B \) (since \( 1 \notin B \)) and \( B \not\subset C \) (since \( 3 \notin C \)), yet \( A \subset C \), so \( A \not\subset C \) is false.
We say \( A \subset B \) if every element of \( A \) is also an element of \( B \). The notation \( A \not\subset B \) means A is NOT a subset of B, i.e. there exists at least one element of A that does not belong to B. The statement claims: if \( A \not\subset B \) and \( B \not\subset C \), then \( A \not\subset C \). Subset relations do not simply chain like this. The conditions only tell us something about A vs B and about B vs C, but say nothing that forces a relation between A and C. So the smart way to test such a statement is to try building a counterexample where both hypotheses hold but the conclusion fails, that is, where \( A \subset C \) is actually true.
\( A \subset B \) means: for every \( x \), if \( x \in A \) then \( x \in B \). \( A \not\subset B \) means: there exists some \( x \in A \) with \( x \notin B \).
The statement is FALSE. Counterexample: \( A = \{1, 2\} \), \( B = \{2, 3\} \), \( C = \{1, 2, 4\} \). Here \( A \not\subset B \) (since \( 1 \notin B \)) and \( B \not\subset C \) (since \( 3 \notin C \)), yet \( A \subset C \), so \( A \not\subset C \) is false.
Assuming subset relations 'chain' like inequalities and concluding the statement is true. Non-subset conditions on A, B and on B, C give no direct link between A and C, so you must test with a concrete counterexample rather than assume the pattern carries over.
The statement is FALSE. Counterexample: \( A = \{1, 2\} \), \( B = \{2, 3\} \), \( C = \{1, 2, 4\} \). Here \( A \not\subset B \) (since \( 1 \notin B \)) and \( B \not\subset C \) (since \( 3 \notin C \)), yet \( A \subset C \), so \( A \not\subset C \) is false.
One common mistake: students assume subset relations 'chain' in the same way equality does. Unlike \( A = B \) and \( B = C \) implying \( A = C \), the conditions \( A \not\subset B \) and \( B \not\subset C \) give no information about whether \( A \) and \( C \) are related by the subset relation.
Answer: The statement is FALSE. Counterexample: \( A = \{1, 2\} \), \( B = \{2, 3\} \), \( C = \{1, 2, 4\} \). Here \( A \not\subset B \) (since \( 1 \notin B \)) and \( B \not\subset C \) (since \( 3 \notin C \)), yet \( A \subset C \), so \( A \not\subset C \) is false.
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 \( B \not\subset C \), then \( A \not\subset C \).
Solution: We claim the statement is FALSE. To disprove it, we need sets A, B, and C such that \( A \not\subset B \), \( B \not\subset C \), but \( A \subset C \). Let us define: \[A = \{2, 4\}, \quad B = \{1, 3, 5\}, \quad C = \{1, 2, 3, 4, 5\}\] Step 1: Check whether \( A \subset B \). The element \( 2 \in A \) but \( 2 \notin B \), so \( A \not\subset B \). ✓ Step 2: Check whether \( B \subset C \). Every element of B, namely 1, 3, 5, belongs to C. So \( B \subset C \), which means \( B \not\subset C \) is FALSE here. Let us adjust. Redefine: \[A = \{6, 8\}, \quad B = \{1, 2, 3\}, \quad C = \{4, 6, 8, 9\}\] Step 1: Check \( A \not\subset B \). The element \( 6 \in A \) but \( 6 \notin B \), so \( A \not\subset B \). ✓ Step 2: Check \( B \not\subset C \). The element \( 1 \in B \) but \( 1 \notin C \), so \( B \not\subset C \). ✓ Step 3: Check \( A \subset C \). We have \( A = \{6, 8\} \). Since \( 6 \in C \) and \( 8 \in C \), every element of A belongs to C. Therefore \( A \subset C \). ✓ This counterexample shows that even though \( A \not\subset B \) and \( B \not\subset C \), we can still have \( A \subset C \). Hence the statement is FALSE.
Answer: False. Counterexample: \( A = \{6, 8\} \), \( B = \{1, 2, 3\} \), \( C = \{4, 6, 8, 9\} \). Here \( A \not\subset B \), \( B \not\subset C \), but \( A \subset C \).
Question: Determine whether the following statement is true or false. If true, prove it. If false, give a counterexample. For sets P, Q, R: if \( P \not\subset Q \) and \( Q \not\subset R \), then \( P \not\subset R \).
Solution: We claim the statement is FALSE. We construct a counterexample: sets P, Q, R such that \( P \not\subset Q \) and \( Q \not\subset R \), yet \( P \subset R \). Let: \[P = \{a, b\}, \quad Q = \{c, d, e\}, \quad R = \{a, b, f, g\}\] Here the elements are distinct letters. Step 1: Check \( P \not\subset Q \). The element \( a \in P \) but \( a \notin Q \) (since \( Q = \{c, d, e\} \)), so \( P \not\subset Q \). ✓ Step 2: Check \( Q \not\subset R \). The element \( c \in Q \) but \( c \notin R \) (since \( R = \{a, b, f, g\} \)), so \( Q \not\subset R \). ✓ Step 3: Check whether \( P \subset R \). We have \( P = \{a, b\} \). Since \( a \in R \) and \( b \in R \), every element of P is in R. Therefore \( P \subset R \). ✓ Since we have found sets P, Q, R for which both \( P \not\subset Q \) and \( Q \not\subset R \) hold, yet \( P \subset R \) also holds, the given statement is FALSE. The non-subset relation is NOT transitive.
Answer: False. Counterexample: \( P = \{a, b\} \), \( Q = \{c, d, e\} \), \( R = \{a, b, f, g\} \). Here \( P \not\subset Q \), \( Q \not\subset R \), but \( P \subset R \).
Question: Determine whether the following statement is true or false. If it is true, prove it. If it is false, give a counterexample. Statement: If \( A \not\subset B \) and \( B \not\subset C \), then \( A \not\subset C \). Consider the sets \( A = \{3, 5\} \), \( B = \{5, 7, 9\} \), and \( C = \{3, 5, 8\} \) to help investigate.
Answer: The statement is TRUE. With \( A = \{3, 5\} \), \( B = \{5, 7, 9\} \), \( C = \{3, 5, 8\} \): we have \( A \not\subset B \) (since \( 3 \notin B \)) and \( B \not\subset C \) (since \( 7 \notin C \)), yet \( A \subset C \) (since both \( 3, 5 \in C \)). This is a counterexample, so the statement is actually FALSE.