Example 1
Question: Consider the sets \( P = \{2, 4\} \), \( Q = \{2, 4, 6, 8\} \), \( R = \{1, 2, 3, 4, 5\} \), and \( \emptyset \) (the empty set). Insert the correct symbol \( \subset \) or \( \not\subset \) between each of the following pairs: (i) \( P \ldots Q \), (ii) \( P \ldots R \), (iii) \( Q \ldots R \), (iv) \( \emptyset \ldots P \).
Solution: We check whether every element of the first set belongs to the second set. (i) Checking \( P \subset Q \): The elements of \( P \) are 2 and 4. We verify: \( 2 \in Q \) and \( 4 \in Q \). Since every element of \( P \) is in \( Q \), we conclude \( P \subset Q \). (ii) Checking \( P \subset R \): The elements of \( P \) are 2 and 4. We verify: \( 2 \in R \) and \( 4 \in R \). Since every element of \( P \) is in \( R \), we conclude \( P \subset R \). (iii) Checking \( Q \subset R \): The elements of \( Q \) are 2, 4, 6, 8. We check each: \( 2 \in R \), \( 4 \in R \), but \( 6 \notin R \) (since \( R = \{1, 2, 3, 4, 5\} \)). Because the element 6 belongs to \( Q \) but not to \( R \), we conclude \( Q \not\subset R \). (iv) By definition, the empty set is a subset of every set. Therefore \( \emptyset \subset P \).
Answer: (i) \( P \subset Q \), (ii) \( P \subset R \), (iii) \( Q \not\subset R \), (iv) \( \emptyset \subset P \)
Example 2
Question: Consider the sets \( A = \{a, e, i, o, u\} \), \( B = \{a, b, c, d, e\} \), \( C = \{a, e\} \), and \( D = \{b, d, f\} \). Insert the correct symbol \( \subset \) or \( \not\subset \) between each of the following pairs: (i) \( C \ldots A \), (ii) \( C \ldots B \), (iii) \( D \ldots A \), (iv) \( D \ldots B \).
Solution: We check whether every element of the first set belongs to the second set. (i) Checking \( C \subset A \): The elements of \( C \) are a and e. We verify: \( a \in A \) and \( e \in A \) (since \( A = \{a, e, i, o, u\} \)). Since every element of \( C \) is in \( A \), we conclude \( C \subset A \). (ii) Checking \( C \subset B \): The elements of \( C \) are a and e. We verify: \( a \in B \) and \( e \in B \) (since \( B = \{a, b, c, d, e\} \)). Since every element of \( C \) is in \( B \), we conclude \( C \subset B \). (iii) Checking \( D \subset A \): The elements of \( D \) are b, d, and f. We check: \( b \notin A \) (since \( A \) contains only vowels a, e, i, o, u). Because b belongs to \( D \) but not to \( A \), we conclude \( D \not\subset A \). (iv) Checking \( D \subset B \): The elements of \( D \) are b, d, and f. We check: \( b \in B \), \( d \in B \), but \( f \notin B \) (since \( B = \{a, b, c, d, e\} \)). Because f belongs to \( D \) but not to \( B \), we conclude \( D \not\subset B \).
Answer: (i) \( C \subset A \), (ii) \( C \subset B \), (iii) \( D \not\subset A \), (iv) \( D \not\subset B \)