SET 01 · Basics & Representation

Definition

A set is a well-defined collection of distinct objects.

Object

Anything: something you can touch (pens, cars) or an idea (facts learned in a course, numbers). Examples: a set of odd numbers divisible by 2 (that’s the empty set — still a set!), the vowels of English.

Well-defined

A collection is well-defined if for any object we can decide, without opinion, whether it belongs.

CollectionSet?Why
Vowels of the English alphabet✅clear membership
Odd numbers divisible by 2✅well-defined (it’s empty)
Beautiful songs / beautiful flowers❌“beautiful” is opinion
Great people / best football players❌subjective
Most dangerous animals / most talented boys❌subjective

Test

If two reasonable people could disagree about membership, it’s not a set.

Distinct objects

Repeating elements doesn’t change a set: Order doesn’t matter either: .

Membership

  • Sets: uppercase (A, B), elements: lowercase (a, b).
  • — “a belongs to A”
  • — “b does not belong to A”

Three ways to represent a set

FormExampleWhen useful
List (roster)small, finite sets
Predicate (set-builder)rules / infinite sets
Missing element (ellipsis), obvious patterns
  • Predicate form: — iff is true. ✓, .
  • Any listed set can be written as a predicate:

Link to logic

Set-builder notation is a predicate in disguise. This is why every set law later comes straight from a logic law.


Next → SET 02 Subsets and Equality