Convergence and Cauchy Sequences in Rational Numbers

vertigo74
Messages
5
Reaction score
0

Homework Statement



Prove that if {a_{n}} is a sequence of rational numbers such that {a_{n+1}} > {a_{n}} for all n \in \textbf{N} and there exists an M\in \textbf{Q} such that {a_{n}} \leq M for all n \in \textbf{N}, then {a_{n}} is a Cauchy sequence of rational numbers.

Homework Equations


Do not use the least upper bound property.

A sequence is Cauchy in the rational numbers if \exists an N \in\textbf{N}, such that |{a_{n}} - {a_{m}} | < \epsilon for all n, m \geq N.

If a sequence converges, it is Cauchy.

The Attempt at a Solution



I understand why this is true, but I am having trouble formulating the math to do a proof behind it. I can see that if the sequence never gets bigger than M, and that it is strictly increasing, the sequence must start converging and be Cauchy, but I'm kind of confused at how to start doing the epsilon stuff.

Thanks!

Edit: I'm not sure why those are showing up as superscripts. They are supposed to be subscripts.
 
Last edited:
Physics news on Phys.org
someone please heeeeeeelp
 
try a proof by contradiction.
suppose a_n is no cauchy sequence.For a fixed \epsilon &gt; 0show there is a subsequence b_n of a_n such that
b_{n+1} &gt; b_n + \epsilon
 
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