Theory
Three photos of the same thing
How would you tell a friend which students topped the exam?
You might describe them: "everyone who scored above 90". Or name them: "Priya, Arjun, Fatima". Or give a rule a computer could run: "every x where marks(x) > 90".
Same group, three descriptions. Sets work exactly this way, and exams ask you to translate between all three.
Theory
Words, list, formula
Think of the three forms as three photos of one set from different angles: a sentence for humans, a list for checking quickly, a formula for handling millions of elements without listing them. Nothing about the set changes; only the camera angle does.
Theory
Form 1: statement (descriptive)
In statement form you describe the set in plain words, precisely enough that membership is a clear yes or no.
Example: S = the set of all even natural numbers less than 10.
The test of a good statement form: anyone reading it builds the same set. "The set of all interesting numbers" fails that test; it is not well-defined.
Theory
Form 2: roster (tabular)
In roster form you list every element inside curly brackets:
A = {2, 4, 6, 8}
Two standing rules carry over from the definition of a set:
- no element is repeated
- order does not matter, so {8, 2, 6, 4} is the same set
For big but patterned sets, dots are allowed: {1, 2, 3, ..., 100}.
Theory
Form 3: set-builder (rule)
In set-builder form you give a variable and the property its values must satisfy:
A = {x : x is an even natural number less than 10}
Read the colon as "such that": "A is the set of all x such that x is an even natural number less than 10." A vertical bar means the same: {x | ...}. This form shines when listing is impossible, like {x : x is an even number}.
Quiz
Which of these is the set-builder form of {1, 4, 9, 16, 25}?
- {x : x is a natural number less than 26}
- {x : x = n² for a natural number n ≤ 5}
- {x : x is an odd number less than 26}
- {1, 4, 9, 16, 25 : x is natural}
Show the answer
{x : x = n² for a natural number n ≤ 5}
The listed elements are the first five perfect squares, which is exactly what option B says. Option A includes every natural number up to 25, far too many. Option D mixes roster and set-builder syntax, a form that does not exist; exams penalise that hybrid.
Think first
Convert to roster form in your head first:
B = {x : x is a letter of the word GOOGLE}
Show the answer
B = {G, O, L, E}: four elements.
Two traps in one question: duplicates (G and O appear twice in the word but once in the set) and the temptation to keep the word's letter order, which does not matter. If you wrote 6 letters, revisit the roster rules.
Quiz
D = {2, 3, 5, 7, 11, 13}. Which statement form describes D correctly?
- The set of odd numbers up to 13
- The set of prime numbers less than 14
- The set of numbers that divide 13
- The set of natural numbers from 2 to 13
Show the answer
The set of prime numbers less than 14
Every element is prime and every prime below 14 is present, a perfect match. "Odd numbers" fails because 2 is even and 9 is missing. Converting roster to words means finding the property that fits ALL elements and ONLY those elements.
Watch out
The conversion traps
Three mark-losers: repeating elements when converting words to roster (GOOGLE gives 4 letters, not 6); writing a set-builder rule that is too wide (covers extra elements) or too narrow (misses some); and mixing forms in one bracket. Always re-check: does my rule generate exactly the listed elements?
Theory
Where you will meet this again
Set-builder form is the ancestor of every database query and list comprehension: SQL's SELECT x FROM users WHERE age > 18 is {x : x is a user such that age of x > 18} in disguise. Roster and rule thinking returns in Venn diagrams, relations and functions next.
Summary
Key takeaways
- One set, three representations: statement (words), roster (list in curly brackets), set-builder (variable plus rule).
- Roster form never repeats elements and ignores order.
- Set-builder form reads the colon or bar as 'such that' and handles infinite sets that cannot be listed.
- Converting means finding a rule that fits all the elements and only the elements.
- Memory hook: words, list, formula, three photos of one set.