Analysis - Cauchy caracterisation of completeness

  • Thread starter Thread starter quasar987
  • Start date Start date
  • Tags Tags
    Analysis Cauchy
quasar987
Science Advisor
Homework Helper
Gold Member
Messages
4,796
Reaction score
32

Homework Statement


In my book (Classical Analysis by Marsdsen & Hoffman), they use the monotone bounded sequence property as the completeness axiom. That is to say, they call complete an ordered field in which every bounded monotone sequence converges and they argue that there is a unique (up to order preserving field isomorphism) complete ordered field that we call the reals.

Then they clearly show that the completeness axiom is logically equivalent to the least upper bound property (if a subset of the reals is bounded above, then the supremum exists [i.e. is real]). They then start talking about Cauchy sequences and "hint" that the statement "Every Cauchy sequence converges" is also logically equivalent to the completeness axiom. That's what I want to verify.

The Attempt at a Solution



The "==>" part is already taken care of in the text because we used the completeness axiom to prove a lemma to the thm that every Cauchy sequence converges.

But I'm struggling a bit with the "<==" side in showing that every bounded monotone sequence is Cauchy.

I'll keep thinking about it an update this thread if I find something. Meanwhile, a hint would be post welcome :smile:
 
Physics news on Phys.org
quasar987 said:
They then start talking about Cauchy sequences and "hint" that the statement "Every Cauchy sequence converges" is also logically equivalent to the completeness axiom. That's what I want to verify.
It's not. However, "Cauchy complete + Archmedian property" is equivalent to the completeness axiom.
 
Ok, thanks! :-p

Edit: I found the proof.
 
Last edited:
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