Show that the set of letters needed to spell \(\text{“CATARACT”}\) and the set of letters needed to spell \(\text{“TRACT”}\) are equal.
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine you have a bag of letter tiles from the word CATARACT. Even though some letters repeat, you keep only one tile of each kind. Your bag ends up with just four unique tiles: C, A, T, and R. Now do the same for TRACT — you get T, R, A, and C. Both bags hold the exact same four letters! In maths, a set ignores repeats and order, so these two sets are perfectly equal.
Answer: The set of letters of CATARACT is \( \{C, A, T, R\} \) and the set of letters of TRACT is \( \{T, R, A, C\} \). Both contain exactly the same elements, so the two sets are equal.
A set is a well-defined collection of distinct objects. In a set, repetition of elements does not matter and order does not matter. So when we list the letters of a word, we write each letter only once. Two sets \( A \) and \( B \) are said to be equal, written \( A = B \), if they contain exactly the same elements — that is, every element of \( A \) is in \( B \) and every element of \( B \) is in \( A \). To prove equality of two sets, we simply list the distinct elements of each and check that both lists are identical.
Two sets are equal if and only if they have exactly the same elements: \( A = B \iff (A \subseteq B \text{ and } B \subseteq A) \).
The set of letters of CATARACT is \( \{C, A, T, R\} \) and the set of letters of TRACT is \( \{T, R, A, C\} \). Both contain exactly the same elements, so the two sets are equal.
A common mistake is to count repeated letters (for example writing A three times for CATARACT) and conclude the sets differ in size. In a set, repeated elements are counted only once, so both words give the same 4-element set.
The set of letters of CATARACT is \( \{C, A, T, R\} \) and the set of letters of TRACT is \( \{T, R, A, C\} \). Both contain exactly the same elements, so the two sets are equal.
One common mistake: Students sometimes think that because CATARACT has 8 letters and TRACT has 5 letters the two sets must be different — they forget that a set ignores repetitions, so the number of letters in the word is irrelevant; only the number of distinct letters matters.
Answer: The set of letters of CATARACT is \( \{C, A, T, R\} \) and the set of letters of TRACT is \( \{T, R, A, C\} \). Both contain exactly the same elements, so the two sets are equal.
Question: Show that the set of letters needed to spell "ASSASSINATION" and the set of letters needed to spell "STATION" are equal.
Solution: We list the distinct letters used in each word. For the word ASSASSINATION, the letters used are: A, S, S, A, S, S, I, N, A, T, I, O, N. Removing repeated letters, the set is \[A = \{A, S, I, N, T, O\}\] For the word STATION, the letters used are: S, T, A, T, I, O, N. Removing repeated letters, the set is \[B = \{S, T, A, I, O, N\}\] Now we compare the two sets. Set \(A\) contains the elements \(A, S, I, N, T, O\) and set \(B\) contains the elements \(S, T, A, I, O, N\). Both sets contain exactly the same six distinct elements. Checking \(A \subseteq B\): Every element of \(A\) — namely \(A, S, I, N, T, O\) — is present in \(B\). So \(A \subseteq B\). Checking \(B \subseteq A\): Every element of \(B\) — namely \(S, T, A, I, O, N\) — is present in \(A\). So \(B \subseteq A\). Since \(A \subseteq B\) and \(B \subseteq A\), we conclude \[A = B\] Hence, the set of letters needed to spell "ASSASSINATION" equals the set of letters needed to spell "STATION".
Answer: Both sets equal \(\{A, S, I, N, T, O\}\), so the two sets are equal.
Question: Show that the set of letters needed to spell "MATHEMATICS" and the set of letters needed to spell "TEAMISH" are NOT equal, but determine the relationship between them.
Solution: We list the distinct letters used in each word. For the word MATHEMATICS, the letters used are: M, A, T, H, E, M, A, T, I, C, S. Removing repeated letters, the set is \[P = \{M, A, T, H, E, I, C, S\}\] For the word TEAMISH, the letters used are: T, E, A, M, I, S, H. Removing repeated letters, the set is \[Q = \{T, E, A, M, I, S, H\}\] Now we compare the two sets. Set \(P\) has 8 elements: \(M, A, T, H, E, I, C, S\). Set \(Q\) has 7 elements: \(T, E, A, M, I, S, H\). Checking \(Q \subseteq P\): Every element of \(Q\) — namely \(T, E, A, M, I, S, H\) — appears in \(P\). So \(Q \subseteq P\). Checking whether \(P \subseteq Q\): The element \(C\) belongs to \(P\) but \(C \notin Q\). Therefore \(P \not\subseteq Q\). Since \(Q \subseteq P\) but \(P \not\subseteq Q\), the two sets are NOT equal: \[P \ne Q\] Instead, \(Q\) is a proper subset of \(P\), written \(Q \subset P\). The element that is in \(P\) but not in \(Q\) is \(C\), so \[P \setminus Q = \{C\}\]
Answer: \(P = \{M, A, T, H, E, I, C, S\}\) and \(Q = \{T, E, A, M, I, S, H\}\). Since \(C \in P\) but \(C \notin Q\), the sets are not equal; instead \(Q \subset P\) (\(Q\) is a proper subset of \(P\)).
Question: Show that the set of letters needed to spell "ASSASSINATION" and the set of letters needed to spell "STATION" are equal.
Answer: The set of letters of ASSASSINATION is \( \{A, S, I, N, T, O\} \) and the set of letters of STATION is \( \{S, T, A, I, O, N\} \). Both sets contain exactly the same six distinct elements, so the two sets are equal.