Well-Ordered Sets

Set Theory · Axiom Academy

Foundation for understanding ordinal numbers through the concept of well-ordering 1. Definition of Well-Ordering A set S with a total order ≤ is well-ordered if every non-empty subset has a least element. The ordering must be total : any two elements are comparable Every non-empty subset (not just S itself) must have a least element Understanding well-ordered sets through classic examples: (ℕ, ≤) - The natural numbers with standard ordering Any finite set with any total ordering 0, 1, 2, ..., n - Any initial segment of ℕ The natural numbers are the prototypical well-ordered set. Every non-empty subset of ℕ has a smallest element, which is the basis for mathematical induction. These ordered sets are not well-ordered because they contain non-empty subsets without least elements: (ℤ, ≤) - The integers: ℤ itself has no least element (ℚ, ≤) - The rationals: (0, 1) has no least element (ℝ, ≤) - The reals: (0, 1) has no least element (ℕ, ≥) - Natural numbers with reverse order: ℕ has no least element Notice that having a least element for the whole set is not enough—we need it for every non-empty subset. An important concept for well-ordered sets is the initial segment . Initial segments are the building blocks of well-ordered sets. They represent "everything that comes before" a given element. Two well-ordered sets are essentially "the same" if there's an order-preserving bijection between them. Order isomorphisms preserve the structure of well-ordered sets

This is the written version of the interactive lesson above. See the full Set Theory course.