Exercise 10.4

(a)
Let denote the set of negative integers in the usual order. Show that a simple ordered set A fails to be well-ordered if and only if it contains a subset having the same order type as .
(b)
Show that if A is simply ordered and every countable subset of A is well-ordered, then A is well-ordered.

Answers

(a)

Proof. Let A be a set with simple order .

(⇒) Suppose that is not a well-ordering of A. Then there exists a nonempty subset B of A such that B has no smallest element. For any b B define the set Xb = {x Bx b}. Clearly Xb B and Xb for any b B since otherwise b would be the smallest element of B. Now let c be a choice function on the collection of nonempty subsets of B, which of course exists by the axiom of choice. Since B is nonempty there is a b0 B. It then follows from the principle of recursive definition that there is a function f : + B such that

f(1) = b0, f(n) = c(Xf(n1)) for n > 1.

It then is easy to show that f(n + 1) f(n) for all n +, i.e. that the sequence defined by f is decreasing. If we then simply define g : + by g(n) = n for n , it is clear that f g is an order-preserving bijection from to some subset C of B. Clearly also C A since B A. Hence the subset C has the same order type as .

(⇐) Now suppose that A has a subset B with the same order type as . Clearly then B is nonempty and has no smallest element since does not. The existence of this B shows that A fails to be well-ordered. □

(b)

Proof. Suppose that A is a set that is simply ordered by such that every countable subset is well-ordered by . Consider any nonempty subset B A. Suppose for a moment that the restricted does not well-order B. Then it follows from part (a) that B has a subset C with the same order type as . However, clearly C A (since B A) and C is countable (since is countable) and thus it should be well-ordered. As this is impossible since C has the same order type as (which is clearly not well-ordered), it has to be that the restricted does in fact well-order B. Hence B has a -smallest element, which shows that A is well-ordered since B was arbitrary. □

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