• Practice
  • About 13 min
  • 5 practice questions

Set notation and types: the common traps

Convert quickly between set-builder and roster form, count the elements of a described set without slips, and avoid the traps around N, Z, R, the empty set and singletons.

If something looks wrong, please tell us.

Questions on set notation look easy, and that is exactly why marks are lost on them. The usual errors are small: taking x from R when the question said N, forgetting that a set never repeats an element, or treating {0} or {∅} as the empty set. This lesson is about reading a set description precisely and turning it into a list quickly, with the traps named one by one so that you can watch for them.

Read the rule in three parts

A set-builder description {x : condition} has three parts to read: where x comes from (N, Z, Q, R or a named set), the condition itself, and any restriction on size. Solve the condition first as if x were any real number, then keep only the values allowed by the first part. This order avoids the most common mistake, which is keeping a negative or fractional root in a set of natural numbers.

  • N starts at 1 in this course, so 0 ∉ N. If the question needs 0, it will use whole numbers or Z.
  • Strict signs (< and >) exclude the end value; ≤ and ≥ include it.
  • Roots of an equation enter the set only if they belong to the stated number system.
  • |x| < k with x ∈ Z gives the integers from −(k − 1) to k − 1, which is 2k − 1 of them.

Worked example 1: an inequality over Z

List A = {x : x ∈ Z, −2 ≤ 2x + 1 < 7}. Solve each side. From −2 ≤ 2x + 1 we get 2x ≥ −3, so x ≥ −1.5. From 2x + 1 < 7 we get 2x < 6, so x < 3. The integers with −1.5 ≤ x < 3 are −1, 0, 1 and 2. So A = {−1, 0, 1, 2} and n(A) = 4. A frequent slip is to include 3; the strict sign rules it out, and checking 2(3) + 1 = 7, which is not less than 7, confirms it.

Worked example 2: roots that do not qualify

Find B = {x : x ∈ N, x² + x − 6 = 0}. Factorise: x² + x − 6 = (x + 3)(x − 2), so the roots are x = 2 and x = −3. Only 2 is a natural number, so B = {2}, a singleton. If the set had been over Z, it would be {−3, 2}. The equation is the same; the answer changes with the number system.

Worked example 3: from a list to a rule

Write C = {1/2, 2/3, 3/4, 4/5, 5/6} in set-builder form. Look at numerator and denominator separately: the numerator runs 1 to 5 and the denominator is always one more. So C = {x : x = n/(n + 1), n ∈ N, 1 ≤ n ≤ 5}. Always test your rule on the first and last element: n = 1 gives 1/2 and n = 5 gives 5/6, and the restriction n ≤ 5 stops the list at the right place.

Empty set, singleton and the brackets trap

Compare three sets that look alike. ∅ has no element, so n(∅) = 0. {0} has one element, the number zero, so it is a singleton. {∅} also has one element, namely the empty set, so it too is a singleton and is not empty. Whenever an option offers {∅} or {0} as 'the empty set', it is a trap. Likewise, {x : x ∈ R, x² + 1 = 0} is empty because no real number has a negative square, and {x : x ∈ N, 3 < x < 4} is empty because no natural number lies strictly between 3 and 4.

Equal versus equivalent

Equal sets have exactly the same elements; equivalent sets only have the same number of elements. Equal implies equivalent, never the other way round. In questions with words, list the distinct letters before comparing: the letters of SCHOOL and of CHOOSE are {S, C, H, O, L} and {C, H, O, S, E}, which are equivalent (5 each) but not equal, because L and E differ.

Solve the condition first, then keep only values from the stated number system. ∅ has 0 elements; {0} and {∅} each have 1.

— Rule to remember

Key takeaways

Read where x comes from before you list anything. Watch strict and non-strict inequalities at both ends, and check the boundary value by substitution. Test any set-builder rule on its first and last element. Count distinct elements only. {0} and {∅} are singletons, never the empty set.

Check your understanding

  1. 1. How many elements does {x : x ∈ Z, |x| < 4} have?

    1. 8
    2. 7
    3. 4
    4. 3
    Show answer

    Answer: B. |x| < 4 gives the integers −3, −2, −1, 0, 1, 2, 3, which is 2 × 4 − 1 = 7 elements.

  2. 2. How many elements does {x : x ∈ N, x is a divisor of 36} have?

    1. 8
    2. 9
    3. 10
    4. 6
    Show answer

    Answer: B. The divisors of 36 are 1, 2, 3, 4, 6, 9, 12, 18 and 36: nine of them.

  3. 3. What is {x : x ∈ N, x² + x − 6 = 0} in roster form?

    1. {2, −3}
    2. {−2, 3}
    3. ∅
    4. {2}
    Show answer

    Answer: D. x² + x − 6 = (x + 3)(x − 2), so x = 2 or x = −3. Only 2 is natural, so the set is {2}.

  4. 4. Which of these sets is a singleton?

    1. {∅}
    2. ∅
    3. {x : x ∈ R, x² = 1}
    4. {x : x ∈ N, x < 1}
    Show answer

    Answer: A. {∅} has exactly one element, the empty set. ∅ and {x ∈ N : x < 1} have no elements, and x² = 1 gives {−1, 1}.

  5. 5. Which set-builder form describes {3, 6, 9, 12, 15}?

    1. {x : x = 3n, n ∈ N, n < 5}
    2. {x : x = 3n, n ∈ N, n ≤ 5}
    3. {x : x = 3n, n ∈ Z, n ≤ 5}
    4. {x : x = n + 3, n ∈ N, n ≤ 5}
    Show answer

    Answer: B. n = 1 to 5 gives 3, 6, 9, 12, 15. With n < 5 the 15 is lost; with n ∈ Z the set also contains 0 and negative multiples; n + 3 gives {4, 5, 6, 7, 8}.

Sign in to keep track of the lessons you finish.

Next lesson → Subsets and power sets: counting fast

Privacy · Terms · Refunds · Delivery