Homepage › Solution manuals › James Munkres › Topology › Exercise 10.7
Exercise 10.7
Let be a well-ordered set. A subset of is said to be inductive if for every ,
Theorem (The principle of transfinite induction). If is a well-ordered set and is an inductive subset of , then .
Answers
Proof. Suppose that is an inductive subset of the well-ordered set . Also, suppose that . Since , it follows that there must be an such that . Thus the set is nonempty. Since clearly, this is also a subset of , it must have a smallest element since is well-ordered. Consider any so that . Then it cannot be that since otherwise would not be the smallest element of . Since clearly (since ) it has to be that . Since was arbitrary this shows that . It then follows that since is inductive. However, this contradicts the fact that so that our initial supposition that must be incorrect. Hence as desired. □