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 \subset B\) and \(x \notin B ,\) then \(x \notin A\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine set B is a club, and set A is a smaller group that is completely inside that club. Every member of group A must belong to the club B. Now, suppose someone named x is NOT a member of club B at all. Could x possibly be in group A? No way! Because every person in A must be in B, x cannot secretly be hiding in A. So whenever \( A \subset B \) and \( x \notin B \), we can be sure \( x \notin A \) too.
Answer: The statement is TRUE. Since \( A \subset B \), any element of A lies in B. As \( x \notin B \), x cannot lie in A, hence \( x \notin A \).
This statement is TRUE. Recall the meaning of a subset. We say \( A \subset B \) if every element of \( A \) is also an element of \( B \). In symbols, whenever \( y \in A \), it must be that \( y \in B \). Now we are told two things: \( A \subset B \) (every element of A lies in B) and \( x \notin B \) (the element x is NOT in B). We want to conclude that \( x \notin A \). The idea is to argue by contradiction: if x were in A, then by the subset rule it would have to be in B, but that contradicts the fact that x is not in B. So x cannot be in A.
Definition of subset: \( A \subset B \) means for every \( y \), if \( y \in A \) then \( y \in B \).
The statement is TRUE. Since \( A \subset B \), any element of A lies in B. As \( x \notin B \), x cannot lie in A, hence \( x \notin A \).
A common mistake is to think the statement could be false and try to give a counterexample, or to confuse this with the reverse claim. Remember: if \( x \in A \) forced \( x \in B \), then not being in B rules out being in A. (Note the reverse, if \( x \notin A \) then \( x \notin B \), is NOT valid.)
The statement is TRUE. Since \( A \subset B \), any element of A lies in B. As \( x \notin B \), x cannot lie in A, hence \( x \notin A \).
One common mistake: students try to prove \( x \notin A \) directly by listing elements, forgetting that the subset relationship \( A \subset B \) works in only one direction — it tells us A's elements go into B, not the other way around. The correct move is to use the contrapositive or contradiction: if x were in A it would have to be in B, which is impossible.
Answer: The statement is TRUE. Since \( A \subset B \), any element of A lies in B. As \( x \notin B \), x cannot lie in A, hence \( x \notin A \).
Question: Determine whether the following statement is true or false. If true, prove it. If false, give a counterexample. If \( P \subset Q \) and \( y \notin Q \), then \( y \notin P \).
Solution: The statement is TRUE. Proof: Assume \( P \subset Q \) and \( y \notin Q \). We want to show that \( y \notin P \). Suppose, for contradiction, that \( y \in P \). Since \( P \subset Q \), every element of \( P \) is also an element of \( Q \). Therefore \( y \in P \) would imply \( y \in Q \). But this contradicts our assumption that \( y \notin Q \). Hence our supposition is wrong, and we conclude \( y \notin P \). Example to illustrate: Let \( P = \{2, 4, 6\} \) and \( Q = \{1, 2, 3, 4, 5, 6\} \). Clearly \( P \subset Q \). Now take \( y = 7 \). Since \( 7 \notin Q \), we check whether \( 7 \in P \). Indeed \( 7 \notin P \), which confirms the statement.
Answer: True. If \( P \subset Q \) and \( y \notin Q \), then \( y \notin P \).
Question: Determine whether the following statement is true or false. If true, prove it. If false, give a counterexample. Let \( M \) and \( N \) be sets such that \( M \subseteq N \). If an element \( z \) does not belong to \( N \), then \( z \) does not belong to \( M \).
Solution: The statement is TRUE. Proof: Given: \( M \subseteq N \) and \( z \notin N \). We need to prove: \( z \notin M \). We use the method of contradiction. Assume \( z \in M \). Since \( M \subseteq N \), every element belonging to \( M \) must also belong to \( N \). So \( z \in M \) implies \( z \in N \). This contradicts the given condition \( z \notin N \). Therefore our assumption is false, and it follows that \( z \notin M \). Numerical illustration: Let \( M = \{a, e, i\} \) and \( N = \{a, e, i, o, u\} \). Then \( M \subseteq N \). Choose \( z = b \). Since \( b \notin N \), and indeed \( b \notin M \), the statement holds.
Answer: True. If \( M \subseteq N \) and \( z \notin N \), then \( z \notin M \).
Question: Determine whether the following statement is true or false. If it is true, prove it. If it is false, give a counterexample. If \( P \subseteq Q \) and \( x \in P \), then \( x \in Q \).
Answer: The statement is TRUE. Since \( P \subseteq Q \), every element of P belongs to Q. Given \( x \in P \), it follows directly that \( x \in Q \).