Exercise 10.7

Let J be a well-ordered set. A subset J0 of J is said to be inductive if for every α J,

(Sα J0) α J0.

Theorem (The principle of transfinite induction). If J is a well-ordered set and J0 is an inductive subset of J, then J0 = J.

Answers

Proof. Suppose that J0 is an inductive subset of the well-ordered set J. Also, suppose that J0J. Since J0 J, it follows that there must be an x J such that xJ0. Thus the set J J0 is nonempty. Since clearly, this is also a subset of J, it must have a smallest element α since J is well-ordered. Consider any y Sα so that y < α. Then it cannot be that y J J0 since otherwise α would not be the smallest element of J J0. Since clearly y J (since Sα J) it has to be that y J0. Since y was arbitrary this shows that Sα J0. It then follows that α J0 since J0 is inductive. However, this contradicts the fact that α J J0 so that our initial supposition that J0J must be incorrect. Hence J0 = J as desired. □

User profile picture
2019-12-01 00:00
Comments