How can I prove that #QQ# is incomplete by using the fact that #RR# is archimedean ?
For this proof I have to show that:
Let #S = {x in QQ | x^2 <= 2}# , then #EE# an upper bound in #QQ# .
supremum#(S) !in QQ#
For this proof I have to show that:
Let
supremum
1 Answer
See explanation...
Explanation:
We do not need to look at
Let
First note that there is no rational number
So we can write:
#S = { x in QQ | x^2 < 2 }#
Note that if
So
Suppose
Let:
#b = (4a)/(a^2+2)#
Then:
#b - a = (4a)/(a^2+2) - a = (4a-(a^3-2a))/(a^2+2) = (a(2-a^2))/(a^2+2) > 0#
and:
#2-b^2 = 2- ((4a)/(a^2+2))^2#
#color(white)(2-b^2) = 2 - (16a^2)/(a^4+4a^2+4)#
#color(white)(2-b^2) = (2a^4+8a^2+8 - 16a^2)/(a^4+4a^2+4)#
#color(white)(2-b^2) = (2(a^4-4a^2+4))/(a^4+4a^2+4)#
#color(white)(2-b^2) = (2(a^2-2)^2)/(a^4+4a^2+4) > 0#
So we have:
#a < b# and#b^2 < 2#
So
So
That is