Roster Notation — Roster Form of a Set With Examples

TL;DR

Roster notation writes a set by listing all its elements inside curly braces separated by commas, like 1,2,3{1, 2, 3}1,2,3. This article covers the rules for writing roster form, finite and infinite sets, the contrast with set-builder notation, worked examples, and exactly where roster form stops being practical.

What Is Roster Notation?

Roster notation — also called roster form or tabular form — is a way of writing a set by listing every element inside a pair of curly braces {\ } with elements separated by commas. The set of the first five counting numbers in roster form is:

A=1,2,3,4,5A = {1, 2, 3, 4, 5}A=1,2,3,4,5

The braces are the set. Whatever sits between them, listed out, is the complete membership. If you can see every element, you've read the entire set — there is no hidden condition to apply.

It is one of the two standard ways to write a set. The other, set-builder notation, describes the elements by a shared property instead of listing them. Roster form answers "which elements?" by showing them; set-builder answers it by stating a rule.

The Rules for Writing Roster Form

Roster notation has a small, strict grammar. Four rules cover almost every case.

Enclose in curly braces. Always {\ }, never parentheses or square brackets — those mean other things in math.
Separate with commas. Every two adjacent elements get a comma between them.
No repeats. A set lists each element once. 1,2,2,3{1, 2, 2, 3}1,2,2,3 is wrong; it's just 1,2,3{1, 2, 3}1,2,3. An element is either in the set or not — there is no "in twice."
Order does not matter. 1,2,3{1, 2, 3}1,2,3 and 3,1,2{3, 1, 2}3,1,2 are the same set. Roster form has no required sort order, though writing in increasing order is a courtesy to the reader.

The empty set — a set with no elements at all — is written {\ } or with the special symbol ∅\varnothing∅. Note that ∅{\varnothing}∅ is not empty: it's a set containing one element, the empty set.

How Do You Write an Infinite Set in Roster Form?

This is the question that decides when roster notation works and when it breaks. You can't list infinitely many elements, but if the pattern is unmistakable, roster form uses an ellipsis — three dots — to say "continue the obvious pattern."

The set of all natural numbers:

N=1,2,3,4,…\mathbb{N} = {1, 2, 3, 4, \dots}N=1,2,3,4,…

The dots mean the pattern continues forever. For a large finite set, the ellipsis sits between a start and a stated end, so the reader knows where it stops:

B=1,3,5,7,…,99B = {1, 3, 5, 7, \dots, 99}B=1,3,5,7,…,99

That reads "odd numbers from 1 to 99." The ellipsis only works when the pattern is clear from the elements shown — at least the first two or three. Write 2,…,100{2, \dots, 100}2,…,100 and the reader can't tell if you mean every number, the even numbers, or the powers of 2. Show enough to fix the pattern: 2,4,6,…,100{2, 4, 6, \dots, 100}2,4,6,…,100.

Roster Notation vs Set-Builder Notation

The two notations describe the same sets in opposite ways. Roster form shows the elements; set-builder form states the rule they satisfy.

Feature	Roster notation	Set-builder notation
Method	Lists every element	States a defining property
Example	2,4,6,8{2, 4, 6, 8}2,4,6,8	x:x is even,0<x<10{x : x \text{ is even}, 0 < x < 10}x:x is even,0<x<10
Best for	Small, finite sets	Large or infinite sets
Reads as	"the set containing 2, 4, 6, 8"	"the set of all xxx such that…"
Empty set	{\ }	x:x≠x{x : x \neq x}x:x=x

The colon (or vertical bar) in set-builder form reads "such that." So x:x∈N,x<5{x : x \in \mathbb{N}, x < 5}x:x∈N,x<5 reads "all natural numbers xxx such that xxx is less than 5" — which in roster form is simply 1,2,3,4{1, 2, 3, 4}1,2,3,4. The same set; two languages. Converting between them is a core skill: list the elements that satisfy the rule, wrap them in braces, and you've gone from set-builder to roster.

Examples of Roster Notation

The examples move from a plain finite list to conversions and infinite patterns. Each is a set you could be asked to write on an exam.

Example 1

Write the set of all vowels in the English alphabet in roster form.

List each vowel once, inside braces:

V=a,e,i,o,uV = {a, e, i, o, u}V=a,e,i,o,u

Five elements, no repeats, order is free. This is roster form at its simplest — a small, finite set shown in full.

Example 2

Write the set of letters in the word "BALLOON" in roster form.

Wrong attempt. A first instinct is to copy the word letter for letter: B,A,L,L,O,O,N{B, A, L, L, O, O, N}B,A,L,L,O,O,N. That lists L twice and O twice. The check: a set lists each element once, so the repeated letters violate the no-repeats rule. The seven-letter word does not make a seven-element set.

Correct. Keep one of each distinct letter:

B,A,L,O,N{B, A, L, O, N}B,A,L,O,N

Final answer: B,A,L,O,N{B, A, L, O, N}B,A,L,O,N — five elements. The duplicates collapse, because membership is yes-or-no, not a count.

Example 3

Write C=x:x is a prime number,x<20C = {x : x \text{ is a prime number}, x < 20}C=x:x is a prime number,x<20 in roster form.

List every prime below 20:

C=2,3,5,7,11,13,17,19C = {2, 3, 5, 7, 11, 13, 17, 19}C=2,3,5,7,11,13,17,19

This is a set-builder-to-roster conversion: apply the rule "prime and less than 20," collect the elements, wrap in braces.

Example 4

Write the set of natural numbers divisible by 5 in roster form.

This set is infinite, so use the ellipsis after enough terms to fix the pattern:

D=5,10,15,20,…D = {5, 10, 15, 20, \dots}D=5,10,15,20,…

Three terms make the "multiples of 5" pattern unmistakable, and the dots carry it to infinity.

Example 5

Write the set of odd numbers from 1 to 999 in roster form.

Far too many to list, but finite — so the ellipsis sits between a clear start and a stated end:

E=1,3,5,7,…,999E = {1, 3, 5, 7, \dots, 999}E=1,3,5,7,…,999

Final answer: 1,3,5,7,…,999{1, 3, 5, 7, \dots, 999}1,3,5,7,…,999. The reader sees the "odd" pattern from the first four terms and the stopping point from the 999.

Example 6

Convert F=x:x2=9F = {x : x^2 = 9}F=x:x2=9 to roster form.

Solve the condition x2=9x^2 = 9x2=9. Both 333 and −3-3−3 satisfy it, since 32=93^2 = 932=9 and (−3)2=9(-3)^2 = 9(−3)2=9:

F=−3,3F = {-3, 3}F=−3, 3

Final answer: −3,3{-3, 3}−3,3 — two elements. The set-builder rule hid the second solution; writing roster form forces you to find every element the rule allows, which is exactly why conversion is a good check.

Where Roster Notation Earns Its Keep

Listing elements directly is not just a beginner's shortcut — it stays useful well past the first sets lesson, because some things are easier shown than described.

Defining a domain or range. When a function only takes a handful of inputs, 0,1,2,3{0, 1, 2, 3}0,1,2,3 is clearer than any rule.
Programming. A Python set literal — {1, 2, 3} — is roster notation, braces and all. The language enforces the same no-repeats rule automatically.
Probability sample spaces. The outcomes of one die roll are 1,2,3,4,5,6{1, 2, 3, 4, 5, 6}1,2,3,4,5,6 — a small set best written out, not described.
Listing solutions. The solution set of an equation, like −3,3{-3, 3}−3,3 above, is reported in roster form because the reader wants the actual answers.

The destination this points to is set theory and its operations — once a set is written down, you can take its union, intersection, or complement, and those operations are the entry point to probability, logic, and the formal foundations of mathematics.

Tripping Points to Avoid

The errors below all come from forgetting that a set is a membership, not a list-with-order-and-counts.

Mistake 1: Repeating elements

Where it slips in: Writing the set of letters in a word, or copying values from a list that has duplicates.

Don't do this: List a repeated element more than once — 1,2,2,3{1, 2, 2, 3}1,2,2,3.

The correct way: Each element appears exactly once: 1,2,3{1, 2, 3}1,2,3. In a set, an element is in or out — there is no counting.

Mistake 2: Using the wrong brackets

Where it slips in: Reaching for parentheses or square brackets out of habit.

Don't do this: Write a set as (1,2,3)(1, 2, 3)(1,2,3) or [1,2,3][1, 2, 3][1,2,3] — those denote an ordered pair/tuple and an interval or list, not a set.

The correct way: Sets use curly braces only: 1,2,3{1, 2, 3}1,2,3. The braces are part of the meaning.

Mistake 3: An ambiguous ellipsis

Where it slips in: Infinite or large sets, where the rusher writes the dots after only one element.

Don't do this: Write 2,…{2, \dots}2,… and expect the pattern to be clear — it could be all integers, evens, or powers of 2.

The correct way: Show at least the first two or three terms so the pattern is fixed: 2,4,6,…{2, 4, 6, \dots}2,4,6,…. The silent understander who "knows what they mean" still has to make the reader know too.

Key Takeaways

Roster notation writes a set by listing every element inside curly braces, separated by commas — 1,2,3{1, 2, 3}1,2,3.
The rules: curly braces, commas, no repeats, order is free.
Infinite or large sets use an ellipsis after enough terms to fix the pattern.
Roster form shows the elements; set-builder form states the rule — roster is best for small finite sets.
The main limit of roster notation is large or pattern-subtle sets, where set-builder notation wins.

Try These Three Before Moving On

Write the set of letters in the word "MISSISSIPPI" in roster form.
Convert x:x is a multiple of 3,0<x≤15{x : x \text{ is a multiple of 3}, 0 < x \le 15}x:x is a multiple of 3,0<x≤15 to roster form.
Write the set of all even natural numbers in roster form.

If Problem 1 gave you more than four letters, return to Mistake 1 — the repeats collapse.