Example 1
Question: Let P be the set of letters in the word "MATHEMATICS" and Q be the set of letters in the word "TEAMISH". Determine whether P = Q. Justify your answer.
Solution: First, list the distinct letters of each word. The word "MATHEMATICS" has the letters M, A, T, H, E, M, A, T, I, C, S. Removing duplicates: \[P = \{M, A, T, H, E, I, C, S\}\] The word "TEAMISH" has the letters T, E, A, M, I, S, H. Removing duplicates: \[Q = \{T, E, A, M, I, S, H\}\] Now compare the two sets element by element. Elements of P: M, A, T, H, E, I, C, S (8 elements). Elements of Q: T, E, A, M, I, S, H (7 elements). The element C belongs to P but C does not belong to Q, so P and Q do not have the same elements. Therefore \(P \ne Q\).
Answer: P ≠ Q, because C ∈ P but C ∉ Q.
Example 2
Question: Let A be the set of distinct letters in the word "SILENT" and B be the set of distinct letters in the word "LISTEN". Are A and B equal? Justify your answer.
Solution: List the distinct letters of each word. The word "SILENT" has the letters S, I, L, E, N, T. All letters are already distinct, so: \[A = \{S, I, L, E, N, T\}\] The word "LISTEN" has the letters L, I, S, T, E, N. All letters are already distinct, so: \[B = \{L, I, S, T, E, N\}\] Now check whether every element of A is in B and every element of B is in A. Elements of A: S, I, L, E, N, T. Each of these appears in B. Elements of B: L, I, S, T, E, N. Each of these appears in A. Since every element of A belongs to B, we have \(A \subseteq B\). Since every element of B belongs to A, we have \(B \subseteq A\). Therefore: \[A = B = \{S, I, L, E, N, T\}\]
Answer: A = B = {S, I, L, E, N, T}, since both words contain exactly the same set of distinct letters.