Exercise 3.13

Prove the following: If an ordered set A has the least upper bound property, then it has the greatest lower bound property.

Answers

Proof. Suppose that A0 is any nonempty subset of A that is bounded below so that b is a lower bound of A0. Let B0 be the set of lower bounds of A0 so that B0 is nonempty since b B0. Since A0 is nonempty there is an a A0. Now, for any x B0 we have that x is a lower bound of A0 so that x a, which shows that a is an upper bound of B0. Hence B0 is a nonempty subset of A that is bounded above, and so has a least upper bound c since A has the least upper bound property. We claim that c is also the greatest lower bound of A0.

Consider any x A0 and any y B0. Then y is a lower bound of A0 so that y x since x A0. Since y B0 was arbitrary, this shows that x is an upper bound of B0. Thus we have c x since c is the least upper bound of B0. Since x A0 was arbitrary, this shows that c is a lower bound of A0. If y is any other lower bound then y B0 so that y c since c is an upper bound of B0. Since y was an arbitrary lower bound, this shows that in fact c is the greatest lower bound of A0. Hence A also has the greatest lower bound property since the nonempty subset A0 was arbitrary. □

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