Set Formula

The Formula

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

When to use: Think of a set as a bag that can hold anything — numbers, names, shapes — but with two strict rules: no duplicates allowed and the order in which items sit inside the bag does not matter.

Quick Example

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

Notation

A, B, C denote sets; \{\ldots\} 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.

Think of a set as a bag that can hold anything — numbers, names, shapes — but with two strict rules: no duplicates allowed and the order in which items sit inside the bag does not matter.

Formal View

A = \{x : P(x)\} defines the set of all x satisfying predicate P; \forall x\,(x \in A \Leftrightarrow P(x))

Worked Examples

Example 1

easy
Let A = \{2, 4, 6, 8, 10\}. Determine whether 6 \in A and whether 5 \in A.

Solution

  1. 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.
  2. 2
    Check membership of 6: scan the roster — 2, 4, **6**, 8, 10. The element 6 appears, so 6 \in A.
  3. 3
    Check membership of 5: scan the roster — 2, 4, 6, 8, 10. The element 5 does not appear, so 5 \notin A.

Answer

6 \in A \text{ and } 5 \notin A
The symbol \in 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 \in \mathbb{Z} : -2 \le x < 3\} in roster notation.

Common Mistakes

  • Treating a set like a list where order or repetition matters — \{1, 2, 3\} and \{3, 2, 1\} are the same set
  • Confusing a set with its elements — \{3\} is a set containing 3, not the number 3 itself
  • Writing \{1, 1, 2, 3\} and thinking it has 4 elements — duplicates are ignored, so this equals \{1, 2, 3\}

Why This Formula Matters

Sets are the bedrock of modern mathematics — every number system, function, and proof is built on set language and notation.

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?

Think of a set as a bag that can hold anything — numbers, names, shapes — but with two strict rules: no duplicates allowed and the order in which items sit inside the bag does not matter.

What do the symbols mean in the Set formula?

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

Why is the Set formula important in Math?

Sets are the bedrock of modern mathematics — every number system, function, and proof is built on set language and notation.

What do students get wrong about Set?

\{1, 2, 3\} = \{3, 1, 2\} (order doesn't matter). \{1, 1, 2\} = \{1, 2\} (no duplicates).

← Back to Set See All Examples Practice Problems