Lesson plan
transfinite induction
Transfinite induction is an extension of mathematical induction to ordinal numbers. Its correctness is a theorem of ZF, and relies on the fact that the ordinal numbers are well-ordered, and thus a statement that is not universally true for all ordinals must have a minimal counterexample. In fact, this principle is also true for arbitrary well-ordered sets, but since any well-ordered set can be indexed by ordinals in an order-preserving way, it suffices to establish the principle for ordinals.
Article summary
Transfinite induction is an extension of mathematical induction to ordinal numbers. Its correctness is a theorem of ZF, and relies on the fact that the ordinal numbers are well-ordered, and thus a statement that is not universally true for all ordinals must have a minimal counterexample. In fact, this principle is also true for arbitrary well-ordered sets, but since any well-ordered set can be indexed by ordinals in an order-preserving way, it suffices to establish the principle for ordinals.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.