• Foundation
  • About 12 min
  • 5 practice questions

What a set is and how to write one

Understand what makes a collection a set, write sets in roster and set-builder form, use the membership symbols and name the common types of sets.

If something looks wrong, please tell us.

Almost every topic in higher mathematics is written in the language of sets. Functions, relations, probability and coordinate geometry all begin with a collection of objects and ask questions about it. If the language is clear in your head, later chapters read like plain sentences; if it is shaky, every symbol slows you down. This lesson starts from zero: what a set is, how to write one down and the names given to different kinds of sets.

A set is a well-defined collection

A set is a collection of objects in which we can always decide, without any doubt, whether a given object belongs to it or not. The objects are called the elements or members of the set. The collection of vowels of the English alphabet is a set, because for any letter you can say yes or no. The collection of the five best cricketers of India is not a set, because 'best' depends on opinion and two people may give different lists. The test is always the same: is membership decided by a clear rule, or by taste?

Sets are usually named with capital letters such as A, B and S, and elements with small letters. If a is an element of A we write a ∈ A, read 'a belongs to A'. If b is not an element of A we write b ∉ A. Some standard sets have fixed letters: N for natural numbers {1, 2, 3, ...}, Z for integers, Q for rational numbers and R for real numbers.

Two ways to write a set

In roster form (also called tabular form) you list every element inside curly brackets, separated by commas: the set of vowels is {a, e, i, o, u}. Two conventions matter here. First, the order of listing does not matter, so {1, 2, 3} and {3, 1, 2} are the same set. Second, an element is not repeated: the set of letters of the word SCHOOL is {S, C, H, O, L}, with the O written once.

In set-builder form you describe the common property of the elements instead of listing them. The set of vowels becomes {x : x is a vowel of the English alphabet}, read 'the set of all x such that x is a vowel'. Set-builder form is essential when a set is large or infinite, for example {x : x ∈ R, x > 2}, which no list could ever finish.

Types of sets

The basic types of sets
TypeMeaningExample
Empty set ∅ or { }Has no element at all{x : x ∈ N, x < 1}
Singleton setHas exactly one element{0}
Finite setIts elements can be counted to an end{x : x is a day of the week}
Infinite setIts elements never endN, or the set of even natural numbers
Equal setsExactly the same elements{1, 2, 3} and {3, 2, 1}
Equivalent setsSame number of elements{a, b, c} and {1, 2, 3}

The number of elements of a finite set A is written n(A). Note carefully that {0} is not the empty set: it contains one element, the number zero, so n({0}) = 1 while n(∅) = 0.

Worked example 1: from set-builder to roster

Write A = {x : x ∈ N, x² < 30} in roster form. Try natural numbers one by one: 1² = 1, 2² = 4, 3² = 9, 4² = 16 and 5² = 25 are all less than 30, but 6² = 36 is not, and larger numbers give larger squares. So A = {1, 2, 3, 4, 5} and n(A) = 5. Checking the first number that fails is what tells you the list is complete.

Worked example 2: is the set empty?

Decide whether B = {x : x ∈ N, 2x + 3 = 2} is empty. Solving 2x + 3 = 2 gives 2x = −1, so x = −1/2. This is not a natural number, so no element satisfies the rule and B = ∅. If the condition had said x ∈ R instead, the set would be the singleton {−1/2}. The same equation can give different sets depending on where x is allowed to come from.

Worked example 3: equal sets

Are the set of letters of FOLLOW and the set of letters of WOLF equal? The first is {F, O, L, W}, because repeated letters are written once. The second is {W, O, L, F}. Both contain exactly F, O, L and W, and order does not matter, so the two sets are equal. Equal sets are always equivalent, but equivalent sets need not be equal: {a, b} and {1, 2} have the same size and different elements.

A set is decided by its elements only: order and repetition do not change it. {0} has one element; ∅ has none.

— Rule to remember

Key takeaways

A set needs a clear membership rule. Roster form lists elements without repeats and in any order; set-builder form states the rule. Always check where the variable comes from (N, Z or R) before listing. Empty, singleton, finite and infinite describe a single set; equal and equivalent compare two sets.

Check your understanding

  1. 1. Which is the roster form of {x : x ∈ N, 3 < x ≤ 7}?

    1. {3, 4, 5, 6, 7}
    2. {4, 5, 6, 7}
    3. {4, 5, 6}
    4. {3, 4, 5, 6}
    Show answer

    Answer: B. x must be a natural number greater than 3 and at most 7. So 3 is excluded and 7 is included: {4, 5, 6, 7}.

  2. 2. Which of these sets is the empty set?

    1. {x : x ∈ N, x + 5 = 3}
    2. {0}
    3. {x : x ∈ N, x < 2}
    4. {x : x is an even prime number}
    Show answer

    Answer: A. x + 5 = 3 gives x = −2, which is not natural, so the set is empty. {0} has one element, {x ∈ N : x < 2} = {1} and the even primes form {2}.

  3. 3. How many elements does the set of letters of the word ALLAHABAD have?

    1. 9
    2. 5
    3. 4
    4. 6
    Show answer

    Answer: B. The distinct letters are A, L, H, B and D. Repeated letters are written once, so the set has 5 elements.

  4. 4. Which pair of sets is equal?

    1. {1, 2} and {1, 2, 3}
    2. {0} and ∅
    3. {1, 2, 3} and {3, 1, 2, 2}
    4. {a, b} and {1, 2}
    Show answer

    Answer: C. {3, 1, 2, 2} is the same as {1, 2, 3} because order and repetition do not matter. {0} has one element and ∅ none; {a, b} and {1, 2} are only equivalent.

  5. 5. Which of these sets is infinite?

    1. {x : x ∈ N, x < 1000}
    2. {x : x ∈ N, x is even}
    3. The set of letters of the English alphabet
    4. {x : x is a prime factor of 60}
    Show answer

    Answer: B. The even natural numbers 2, 4, 6, ... never end. The others are finite: 999 numbers, 26 letters and {2, 3, 5}.

Privacy · Terms · Refunds · Delivery