List all the elements of the following sets :
\(D=\{x : x\) is a letter in the word \(\text{“LOYAL”}\}\)
CBSE Class 11 Maths · Sets
CBSE Class 11 Maths · Sets
Imagine collecting letter tiles from the word LOYAL. You pick up L, then O, then Y, then A, then another L. But your collection box only keeps one copy of each tile. So you toss out the extra L. A set works exactly like that collection box — no duplicates allowed! The word LOYAL has five letters, but only four are unique. Those four special letters become your set.
Answer: \( D = \{ L, O, Y, A \} \)
A set is a well-defined collection of distinct objects. When a set is described using a rule or property, it is in set-builder form. To write it in roster (or tabular) form, we simply list all the elements that satisfy the rule, separated by commas, inside curly braces. Two very important properties of sets are: (1) elements are never repeated, so even if a letter appears many times in the word, we write it only once, and (2) the order of listing the elements does not matter. Here the rule is that \( x \) is a letter appearing in the word LOYAL, so we must find every distinct letter used to spell that word.
Roster form: \( D = \{ \text{list of all distinct elements satisfying the rule} \} \)
\( D = \{ L, O, Y, A \} \)
A common mistake is writing \( D = \{ L, O, Y, A, L \} \) by repeating the letter L. Elements in a set must be distinct, so each letter is written only once.
\( D = \{ L, O, Y, A \} \)
One common mistake: Writing the letter L twice (once for each time it appears in LOYAL) instead of listing it only once — always remember that a set never repeats an element, no matter how many times it occurs in the source word.
Answer: \( D = \{ L, O, Y, A \} \)
Question: List all the elements of the set \[ E = \{ x : x \text{ is a letter in the word } \text{"MATHEMATICS"} \} \]
Solution: We write down every letter that appears in the word MATHEMATICS and keep only the distinct (unique) letters. The word MATHEMATICS contains the letters: M, A, T, H, E, M, A, T, I, C, S Now we remove repetitions: M appears twice — keep one M. A appears twice — keep one A. T appears twice — keep one T. H, E, I, C, S each appear once. Hence the distinct letters are: M, A, T, H, E, I, C, S Therefore, in roster form: \[ E = \{ M, A, T, H, E, I, C, S \} \]
Answer: \( E = \{ M, A, T, H, E, I, C, S \} \)
Question: List all the elements of the set \[ F = \{ x : x \text{ is a letter in the word } \text{"ENGINEERING"} \} \]
Solution: We write down every letter that appears in the word ENGINEERING and keep only the distinct (unique) letters. The word ENGINEERING contains the letters: E, N, G, I, N, E, E, R, I, N, G Now we remove repetitions: E appears three times — keep one E. N appears three times — keep one N. G appears twice — keep one G. I appears twice — keep one I. R appears once. Hence the distinct letters are: E, N, G, I, R Therefore, in roster form: \[ F = \{ E, N, G, I, R \} \]
Answer: \( F = \{ E, N, G, I, R \} \)
Question: List all the elements of the following set: \( E = \{ x : x \text{ is a letter in the word } \text{"MATHEMATICS"} \} \)
Answer: \( E = \{ M, A, T, H, E, I, C, S \} \)