A total ordering R on a set S is a well ordering if every subset of S has a smallest element. Well orderings are important because one can use a generalization of mathematical induction known as transfinite induction. The canonical example is the ordinal numbers.
This concept has the prerequisites:
- Know what it means for a relation to be a well ordering
- Know the transfinite induction principle and why it is justified
- Be able to define functions using transfinite recursion
Core resources (read/watch one of the following)
→ Notes on Set Theory (2013)
Lecture notes for a course on axiomatic set theory.
→ Elements of Set Theory
An introductory textbook on axiomatic set theory.
Location: Chapter 7, "Orderings and ordinals," subsection "Well orderings," pages 172-178
-No Additional Notes-
- create concept: shift + click on graph
- change concept title: shift + click on existing concept
- link together concepts: shift + click drag from one concept to another
- remove concept from graph: click on concept then press delete/backspace
- add associated content to concept: click the small circle that appears on the node when hovering over it
- other actions: use the icons in the upper right corner to optimize the graph placement, preview the graph, or download a json representation