How Do You List the Elements of a Set?
At a glance
- 1. Find the definition
Identify the set’s elements, either by an explicit list or by a rule describing which objects belong.
- 2. Check membership
Test possible elements against the rule, paying attention to the specified domain and any bounds.
- 3. Write the set
Put each distinct element inside braces; use an ellipsis only when the pattern is clear.
To list the elements of a set, you need to know how the set is defined. The title alone does not specify a set, so there is no particular list of elements to give. If you have a set expression or a rule for membership, you can expand it using the method below.
What it means to list a set
A set is a collection of distinct objects. When you write its elements explicitly, put them inside braces and separate them with commas. For example, the set of positive integers less than 5 is
The order does not matter: and represent the same set. Repeated elements do not change a set either, so .
A rule may describe a set without listing its elements. This is often called set-builder notation. For example,
means “the integers such that .” The integers satisfying the rule are , so the set can be listed as .
A step-by-step method
- Read the domain. Find out what kinds of objects are allowed. The condition has different answers depending on whether must be an integer, a real number, or another kind of object.
- Apply the membership rule. Determine which allowed objects satisfy every condition in the definition.
- Check for omitted cases. In a finite range, test all candidates. With a divisibility or parity rule, check each candidate against that rule.
- Write distinct elements in braces. For a finite set, include every qualifying element once. For an infinite set, make clear that the pattern continues or retain the defining rule.
Worked examples
Example 1: A finite set defined by a rule. List the elements of
The domain is the integers. The values from through satisfy the inequalities, while does not because the upper bound is strict. Therefore,
Example 2: A set defined by divisibility. List the positive integers less than 20 that are divisible by 4. Check the positive multiples of 4 below 20: . The next multiple, 20, is excluded. The set is
Example 3: An infinite set. The positive even integers can be written
The ellipsis means the displayed pattern continues; it does not indicate that 8 is the last element. To avoid relying on a pattern, write the set-builder form .
Common mistakes
- Leaving out the domain: is not fully specified unless the universe for is understood. Over the integers or reals, its elements are and ; over the natural numbers, whether 0 is included makes no difference here: the only solution is .
- Including a strict endpoint: The condition excludes 5; includes it.
- Listing duplicates: A set contains each element only once, even if the defining process produces the same value multiple times.
- Treating an ellipsis as a complete finite list: Use an ellipsis only when the continuing pattern is clear, and say if the set is infinite.
- Confusing an element with a subset: For instance, has elements 1 and 2. The set has elements 1 and the set .
To determine a particular list, provide the set itself—such as a roster, a set-builder rule, or a description of its domain and membership condition.
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.