Exercise 1.4.7

Finish the proof of Theorem 1.4.5 by showing that the assumption α 2 > 2 leads to a contradiction of the fact that α = sup T

Answers

Recall T = { t R t 2 < 2 } and α = sup T . suppose α 2 > 2 , we will show there exists an n N such that ( α 1 n ) 2 > 2 contradicting the assumption that α is the least upper bound.

We expand ( α 1 n ) 2 to find n such that ( α 2 1 n ) > 2

2 < ( α 1 n ) 2 = α 2 2 α n + 1 n 2 < α 2 + 1 2 α n

Then

2 < α 2 + 1 2 α n n ( 2 α 2 ) < 1 2 α

Since 2 α 2 < 0 dividing reverses the inequality gives us

n > 1 2 α 2 α 2

This contradicts α 2 > 2 since we have shown n can be picked such that ( α 2 1 n ) > 2 meaning α is not the least upper bound.

User profile picture
2022-01-27 00:00
Comments