Set Formula

Set is a well-defined collection of distinct, unordered objects called elements, described either by listing or by a membership rule.

The Formula

A={x:P(x)} (set-builder notation: the set of all x satisfying property P)

Ask yourself: If I rearrange the items or drop a repeat, is it still the exact same object?

Quick example

{1,2,3}, {a,b,c}, {even numbers}, {students in a class}.

Notation

A, B, C denote sets; {…} denotes listing elements; {x:P(x)} denotes set-builder form

What this formula means

A well-defined collection of distinct, unordered objects called elements, described either by listing or by a membership rule.

A set works like a party guest list: each name is either on it or not. Writing a name twice doesn't invite that guest twice, and putting the list in alphabetical order changes nothing. Unlike a printed list, though, a set has no first or last entry at all.

Formal view

A={x:P(x)} defines the set of all x satisfying predicate P; ∀x (x∈A⇔P(x))

Worked examples

Example 1

easy
Let A={2,4,6,8,10}. Determine whether 6∈A and whether 5∈A.
Show solution

Answer

6∈A and 5∉A

First step

1.
Recall that a set is a well-defined collection of distinct objects called elements. The set A={2,4,6,8,10} is given in roster (list) notation.

Full solution

  1. 2.
    Check membership of 6: scan the roster — 2, 4, 6, 8, 10. The element 6 appears, so 6∈A.
  2. 3.
    Check membership of 5: scan the roster — 2, 4, 6, 8, 10. The element 5 does not appear, so 5∉A.
The symbol ∈ means 'is an element of.' To test membership, check whether the element appears in the set's roster.

Example 2

medium
Write the set B={x∈Z:−2≤x<3} in roster notation.

Example 3

medium
Convert {x∈Z:1≤x≤6 and x is odd} to roster form.

Common mistakes

  • Counting a repeated entry twice, like calling {a,a,b} a 3-element set — distinct objects collapse, so it has 2 elements.
  • Thinking {1,2,3} and {3,2,1} are different sets — order never matters in a set.
  • Calling a vague group like 'big numbers' a set — a set must be well-defined so membership has a clear yes or no.

Why this formula matters

Once you can name a collection by its members alone, you can compare groups, combine them and count them without confusion: the players on two teams, the outcomes of a dice roll, the solutions of an equation. Without the idea, a list like 2, 2, 3 gets counted as three different things, and two lists written in a different order look like two different answers when they are the same one.

Frequently asked questions

What is the Set formula?

A well-defined collection of distinct, unordered objects called elements, described either by listing or by a membership rule.

How do you use the Set formula?

Use a set when only membership matters: the problem asks which items appear, the distinct values, or the collection of all solutions, and it uses braces {…} or the words 'the set of'. If the order matters (a code, a ranking, a sequence of moves), use an ordered list. If the number of copies matters (coins in a pocket, the letter tiles needed to spell a word), use a multiset or count with repeats.

What do the symbols mean in the Set formula?

A, B, C denote sets; {…} denotes listing elements; {x:P(x)} denotes set-builder form

Why is the Set formula important in Math?

Once you can name a collection by its members alone, you can compare groups, combine them and count them without confusion: the players on two teams, the outcomes of a dice roll, the solutions of an equation. Without the idea, a list like 2, 2, 3 gets counted as three different things, and two lists written in a different order look like two different answers when they are the same one.

What do students get wrong about Set?

The procedure for set is the easy part; the trap is counting a repeated entry twice, like calling {a,a,b} a 3-element set. Asking "If I rearrange the items or drop a repeat, is it still the exact same object?" first is what keeps a correct-looking calculation from being attached to the wrong concept.