Name the members one by one, or post a single entry rule — two ways to pin a set down.
There are exactly two honest ways to write a set down. When the members are few, you simply list them inside braces — the roster notation, {2, 4, 6, 8}. When there are far too many to list, you post an entry rule instead — the set-builder notation, { x | x is even }, where the bar reads “such that.” Most sets can be written either way, and real fluency means switching between them at will: unfold a rule into a list, or fold a list back into a rule. Along the way we meet the strangest set of all — the empty set ∅, the bubble that nobody enters.
When a set has few members — or follows an obvious pattern — just list them inside curly braces, separated by commas. This is roster (or listing) notation:
A = { 2, 4, 6, 8, 10 } V = { a, e, i, o, u }
You read the first one as “A is the set whose members are 2, 4, 6, 8, and 10.” For a clear, unmistakable run you may use an ellipsis “…” to say “and so on in the same pattern”: {1, 2, 3, …, 100} is the whole numbers from 1 to 100, and {2, 4, 6, …} is all the positive even numbers, running forever. Order and repeats never matter (Lesson 19.1), so {2, 4, 6}, {6, 2, 4} and {2, 2, 4, 6} are the very same set.
The “…” is only honest when the pattern is unmistakable. {2, 4, 8, …} is ambiguous — is the next number 16 (doubling) or 14 (skip-counting)? When in doubt, give enough terms to fix the rule, or switch to set-builder notation.
Some sets are simply too big to list: every even number, every real number between 0 and 1. For these we post an entry condition — a rule that decides exactly who gets in:
{ x | x is even }
Read it aloud: “the set of all x such that x is even.” There are three parts. A variable (here x) stands for a typical member; the bar | means “such that” (some books use a colon, { x : … }); and the condition is the test the variable must pass. You may also name the variable’s home set — where the candidates come from — by writing it just after the variable:
{ x ∈ ℤ | −3 ≤ x ≤ 5 }
Set-builder notation describes a set by a property, not by a roll-call. It can name an infinite set in a single line — which is exactly why we need it.
Fluency is being able to translate either way at will.
Builder → roster. Walk the candidates, keep the ones that pass, and write them down. Take { x ∈ ℤ | x² < 10 }. Test integers: 0²=0, (±1)²=1, (±2)²=4, (±3)²=9 — all under 10 — but (±4)²=16, which is too big. So the set is
{ x ∈ ℤ | x² < 10 } = { −3, −2, −1, 0, 1, 2, 3 }.
Roster → builder. Spot the shared rule behind the list. The numbers 1, 4, 9, 16, 25 are the squares of 1 through 5, so
{ 1, 4, 9, 16, 25 } = { n² | n ∈ ℤ, 1 ≤ n ≤ 5 }.
Some sets are practical only in builder form — all the even numbers, all the reals between 0 and 1 — and that is precisely why the notation earns its keep.
Don’t forget the negatives. In { x ∈ ℤ | x² < 10 } the variable is an integer, so −3, −2, −1 qualify just as much as 3, 2, 1. Watch the boundary too: 3² = 9 < 10 is in, but 4² = 16 is out — the answer stops at ±3.
What if no object satisfies the condition? Then the bubble is empty, and the set has no members at all. This is the empty set, written ∅ (or { }). For example,
{ x ∈ ℝ | x² = −1 } = ∅ and { x | x > 3 and x < 3 } = ∅,
because no real number squares to a negative, and no number can be both above and below 3 at once. The empty set is perfectly respectable — it just happens to be the set you get whenever a rule turns everyone away.
∅ ≠ {0}: the empty set has no elements (|∅| = 0), while {0} has exactly one — the number 0 (|{0}| = 1). And ∅ ≠ {∅} either: {∅} is a box that contains the empty box, so it has one element. An empty bag and a bag holding an empty bag are not the same bag.
Whichever notation you use, membership is checked the same way. Write a ∈ A to say a is an element of A, and a ∉ A to say it is not. Against the rule { x | x is even }:
6 ∈ { x | x is even } 7 ∉ { x | x is even }
6 passes the test (it is even), so it is in; 7 fails, so it is out. And for the empty set, every object is out: 0 ∉ ∅, 7 ∉ ∅, π ∉ ∅ — nothing whatsoever lives in ∅.
Membership is the one question a set must always answer: for any object you name, is it in or out? Roster and set-builder are just two ways of writing the answer key.
| Idea | Notation | Reads / means |
|---|---|---|
| Roster | { 2, 4, 6, 8 } | list the members in braces (order & repeats don’t count) |
| Set-builder | { x | x is even } | “all x such that x is even” |
| With a home set | { x ∈ ℤ | −3 ≤ x ≤ 5 } | candidates come from ℤ; keep those passing the rule |
| Empty set | ∅ = { } | no member at all; ∅ ≠ {0} |
| Membership | a ∈ A · a ∉ A | “a is / is not an element of A” |
Roster when the list is short; set-builder when the rule is shorter than the list. Translate freely, and remember that an honest rule can leave the bubble empty.
Write { 3, 6, 9, 12, 15 } in set-builder notation.
Each member is a multiple of 3, namely 3·1 through 3·5, so { 3, 6, 9, 12, 15 } = { 3n | n ∈ ℤ, 1 ≤ n ≤ 5 }. (Equivalently { x ∈ ℤ | x is a multiple of 3, 1 ≤ x ≤ 15 }.)
List the members of { x ∈ ℤ | −2 ≤ x < 3 } in roster form.
The integers from −2 up to but not including 3: { −2, −1, 0, 1, 2 }. The right end is strict (<), so 3 is left out.
What is { x ∈ ℝ | x² = −4 }?
No real number squares to a negative, so nothing passes the rule: the set is the empty set ∅.
Is 0 ∈ ∅? Explain.
No. ∅ has no elements at all, so 0 ∉ ∅ — and in fact x ∉ ∅ for every object x.
Explain why ∅ ≠ {0}.
∅ has no elements, so |∅| = 0. But {0} has exactly one element — the number 0 — so |{0}| = 1. Different number of members ⇒ different sets.
Read aloud, and say what the bar means: { x | x > 0 }.
“The set of all x such that x is greater than 0.” The bar | reads “such that” — not “divides” and not “absolute value.”
Six questions to lock it in. Tap the answer you think is right.
This lesson gives students two interchangeable languages for the same object. Roster notation lists the members; set-builder notation posts a membership rule, { x | … }. The single most important habit is reading the symbols aloud: the bar | is “such that,” ∈ is “is an element of,” and ∅ is “the empty set.” The symbols carry most of the difficulty, so insist students say them.
Three misconceptions to watch. First, students often misread the bar | as “divides” or “absolute value” — it means “such that.” Second, the empty set is not zero and not {0}: ∅ has no elements, while {0} has one. Third, when unfolding a rule like { x ∈ ℤ | x² < 10 }, students drop the negatives or include 4 — emphasize testing both signs and checking the boundary (3² = 9 in, 4² = 16 out).
Common Core. This is the high-school convention for set notation (roster and set-builder), supporting A-REI and F-IF — describing solution sets and, soon, the domain of a function as a set. The empty set and set-builder form are the exact tools used when a system has no solution or a function excludes certain inputs.