Collections as Objects
A set is a well-defined collection of distinct objects, its elements. Sets are the fundamental objects of modern mathematics — nearly everything else is defined in terms of them. We write for membership and for non-membership. A set is determined entirely by its elements: order and repetition are irrelevant, so is the same set as and as .
Sets can be specified two ways. Roster notation lists the elements: . Set-builder notation states a defining property: , read "the set of integers such that...". Set-builder is essential for infinite or complex sets that cannot be listed.
Standard number sets have reserved symbols: (naturals), (integers), (rationals), (reals). Key relationships:
- (subset) — every element of is in .
- The empty set has no elements; it is a subset of every set.
- The cardinality is the number of elements.
- The power set is the set of all subsets of ; a set with elements has subsets.
Notice the layering: elements belong to sets, sets can be elements of other sets (the power set), and this careful distinction between (membership) and (subset) is where precision matters most.
Common pitfall: confusing membership () with the subset relation (). "" is true ( is an element), but "" is nonsense — is not a set. Meanwhile "" is true (the set is a subset) but "" is false. An element is in a set; a subset is contained in a set.
A 3-element set with its 8 subsets drawn as a small lattice, the empty set at the bottom and the full set at the top in accent — the power set of size 2^3.