Proving the Greatest Lower Bound of a Set Using the Archimedean Property

  • Thread starter Thread starter cragar
  • Start date Start date
  • Tags Tags
    Bound Proof
cragar
Messages
2,546
Reaction score
3

Homework Statement


Use the Archimedean property of \mathbb{R} to prove that
the greatest lower bound of {\frac{1}{n}:n\in\mathbb{N}}=0
the archimedean principle says that for any number y there is a natural number
such that 1/n<y for y>0

The Attempt at a Solution


since all of our numbers in our set are positive. I could pick a real number as close to zero as I wanted but there would still be a natural such that 1/n is smaller than the real I picked, there zero is the greatest lower bound of the set.
 
Physics news on Phys.org
Well, yes, that would be true. What's your question?
 
Im guessing my statement isn't enough to prove it. Or should I assume that there is a real just to the right of zero and claim that this is the greater lower bound, but then there is always another number 1/n that is smaller and since all 1/n are in the set, that zero has to be the greatest lower bound.
 
Last edited:
cragar said:
Im guessing my statement isn't enough to prove it

I don't see why not. If y>0 then y is not a lower bound of {1/n} by the Archimedean property. If y=0, then it is since 1/n>0 for all n. Doesn't that make y=0 the greatest lower bound?
 
ok sweet, thanks for the help.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top