Proof of convergence by proving a sequence is Cauchy

Click For Summary

Homework Help Overview

The discussion revolves around proving the convergence of a sequence {A_n} of real numbers, given the condition |A_n+1 - A_n| < r^n for all natural numbers n, where 0 < r < 1. The participants are exploring the relationship between Cauchy sequences and convergence.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the application of the triangle inequality to express |A_m - A_n| in terms of the differences |A_k - A_{k-1}|. There is uncertainty about how to solve the inequality nr^n < epsilon for n. Some participants question the validity of certain inequalities presented in the attempts.

Discussion Status

The discussion is ongoing, with participants providing insights and corrections to each other's reasoning. Some guidance has been offered regarding the convergence of nr^n, but there is still confusion about the application of Cauchy sequence definitions and the handling of indices m and n.

Contextual Notes

There is a mention of the need for a specific choice of N such that nr^n < epsilon for n > N, but the exact method to determine N remains unclear. Participants are also considering the implications of the condition 0 < r < 1 on the convergence behavior of the sequence.

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.

[tex]|A_m-A_n|\le |A_m-A_{m-1}|+\dots+|A_{n+1}-A_n|<r^{m-1}+r^{m-2}+\dots+r^{n-1}<(m-n)r^{n-1}[/tex]

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 3 ·
Replies
3
Views
2K
  • · Replies 34 ·
2
Replies
34
Views
4K
  • · Replies 6 ·
Replies
6
Views
3K