Proof of convergence by proving a sequence is Cauchy

Click For Summary
SUMMARY

The discussion focuses on proving that the sequence {A_n} converges by demonstrating that it is a Cauchy sequence. The sequence satisfies the condition |A_n+1 - A_n| < r^n for all natural numbers n, where 0 < r < 1. The Triangle Inequality is applied to show that the sum of differences |A_m - A_n| can be bounded by n*r^n, which converges to zero as n increases. The conclusion is that if n*r^n < epsilon for sufficiently large n, then {A_n} is indeed Cauchy and thus convergent.

PREREQUISITES
  • Understanding of Cauchy sequences in real analysis
  • Familiarity with the Triangle Inequality
  • Knowledge of convergence criteria for sequences
  • Basic experience with limits and epsilon-delta definitions
NEXT STEPS
  • Study the formal definition of Cauchy sequences in detail
  • Learn about convergence tests for sequences and series
  • Explore the implications of the Triangle Inequality in proofs
  • Review examples of sequences that are Cauchy but not convergent in different contexts
USEFUL FOR

Mathematics students, particularly those studying real analysis, and educators looking to deepen their understanding of sequence convergence and Cauchy criteria.

KPutsch
Messages
4
Reaction score
0

Homework Statement



Let 0 < r < 1. Let {A_n} be a sequence of real numbers such that |A_n+1 - A_n| < r^n for all naturals n. Prove {A_n} converges.

Homework Equations



A sequence of real numbers is called Cauchy, if for every positive real number epsilon, there is a positive integer N such that for all natural numbers m, n > N |x_m - x_n| < epsilon.

A sequence is convergent if and only if it is Cauchy.

Triangle Inequality: |x + y| <= |x| + |y|

The Attempt at a Solution



WLOG m>n, then |Am - An| = |Am - Am-1 + Am-1 - Am-2 ... -An|. Then we can use Triangle inequality to see that |Am - Am-1| < r^n, |Am-1 - Am-2| < r^n, ... . Then we can say that |Am - Am-1| + |Am-1 - Am-2| +...+ |An-1 -An|< n*r^n. Since r^n converges to zero, nr^n converges to zero, and nr^n < epsilon. Now to solve for n...

I have no idea how to solve nr^n < epsilon for n. Also, am I doing this right? I only have one poor example to go off of. If I can find n, will that mean I've shown that A_n is Cauchy?

Thank you for any help.
 
Physics news on Phys.org
Depends on the professor, but mine just used:
Let E>0 be given. Choose N so that for n>N, nr^n<E.
Didn't solve for N at all, since we already know that nr^n converges.
 
You do not know n*r^n goes to zero. If you did you would be done.

|Am - Am-1| + |Am-1 - Am-2| +...+ |An-1 -An|< n*r^n

This is not true.

Also, since r is between 0 and 1 you know there is a natural number, say, a, such that 1/a <= r.

You know this because 1/n -> 0.
 
Ah, I proved in an earlier example that if 0 < r < 1, then nr^n converges to zero.

I realize now that the last pair of terms should be |An+1 -An|. The inequality should be true now: |Am - Am-1| + |Am-1 - Am-2| +...+ |An+1 -An|< n*r^n. So, am I done since I've shown that |An+1 - An| < ... < nr^n < epsilon? I really don't understand how this Cauchy sequence business works.
 
Last edited:
No, it's not.

|A_m-A_n|\le |A_m-A_{m-1}|+\dots+|A_{n+1}-A_n|&lt;r^{m-1}+r^{m-2}+\dots+r^{n-1}&lt;(m-n)r^{n-1}

Where the last inequality follows from the fact that r^m<r^n for m>n and noting there are m-n terms summed.

Read some more Cauchy proofs. Pay particular attention to how m and n are handled. Remember that there exists some natural number eta s.t 1/eta <= r and for any pi > eta, 1/pi < 1/eta. Also, n is not a free variable in the sense that it is bounded by m.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
4
Views
2K
Replies
3
Views
3K
  • · Replies 28 ·
Replies
28
Views
3K
  • · Replies 34 ·
2
Replies
34
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
1K