Proving the Cauchy Criterion for Sum of Sequences

  • Thread starter Thread starter 1800bigk
  • Start date Start date
  • Tags Tags
    Cauchy Sequence
1800bigk
Messages
42
Reaction score
0
How would one prove that the sum of 2 cauchy sequences is cauchy? I said let e>0 and take 2 arbitrary cauchy sequences then
|Sn - St|<e/2 whenever n,t>N1 and |St - Sm|<e/2 whenever t,m >N2.

So

|Sn - Sm|=|Sn - St + St - Sm|<= |Sn - St|+|St - Sm|< e/2 + e/2 <= e

So n,m>max{N1, N2} imples |Sn - Sm|<e thus cauchy

Am I close or way off?
 
Physics news on Phys.org
bump ttt bump
 
The method looks perfect to me.

However, a slight issue with your subscripts. When I did this problem I only needed two subscripts. Observe:

Take two arbitrary Cauchy sequences \{x_n\} and \{y_n\}. Then for any \epsilon &gt; 0 there exists N_1 \in \mathbb{N} such that for any n,m \geq N_1 we have

<br /> |x_n - x_m| &lt; \frac{\epsilon}{2}<br />

and there also exists an N_2 \in \mathbb{N} such that for any n,m \geq N_2 we have

<br /> |y_n - y_m| &lt; \frac{\epsilon}{2}<br />

Then, as you said, choose N = \max\{N_1,N_2\}. Then for any n,m \geq N we have

|(x_n + y_n) - (x_m - y_m)| = |(x_n - x_m) + (y_n - y_m)| \leq |x_n-x_m| + |y_n - y_m| &lt; \frac{\epsilon}{2} + \frac{\epsilon}{2} = \epsilon

Therefore \{x_n + y_n\} is a Cauchy sequence. \square
 
thank you!
 
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