How do you prove the validity of the ratio test?

[pivoxa15]

It dosen't seem intuitive that if the ratio of the last two consecutive terms is less than 1 then it is convergent and viceversa if divergent when adding an infinite number of terms.

 

[quasar987]

I won't prove it but I'll try to convince you that it's intuitive.

Say we have a series of general term c_n and the ratio test is conclusive. Say,

\lim_{n\rightarrow \infty} \left|\frac{c_{n+1}}{c_n}\right|=a<1

This means that by taking n large enough, we can make |c_{n+1}| as close as we want to a*|c_n|. So, for say n>N, we can approximate |c_{N+1}| by a*|c_N|, |c_{N+2}| by a*|c_{N+1}|=a²*|c_N|, etc, such that the series looks like

\sum_{n=1}^{\infty}|c_n|=\sum_{n=1}^{N}|c_n|+|c_N|\sum_{n=1}^{\infty}a^n

I.e. like some finite sum + a geometrical series. So the series converges absolutely.

 

[Data]

quasar's post resembles how you could construct a proof.

Assume WLOG that c_n is positive for every n. Suppose

\lim_{n \rightarrow \infty} \frac{c_{n+1}}{c_n} = a <1.

Let \delta \in (a, 1). Then there's some N s.t.

|c_{n+1}/c_n - a| < \delta - a

for all n>N. Then for all n>N, certainly,

c_{n+1} < \delta c_n.

See if you can finish!

 

[mathwonk]

there are only 2 convergent processes we understand easily, the geometric series, and a convergent integral.all tests for absolute covergence consist of comparing the size of the terms to one of these.

the ratio test amounts to saying the terms are eventually bunded by those of a coinvergent geometric series.

there is no clearer explanatio of this than in courant vol 1.

 

[Gib Z]

Perhaps it seems unintuitive because You think that it compares the "last" 2 terms.

I seem to think of it as since as n gets large the terms are getting smaller, ie the ratio is less than 1, than the terms must be approaching zero. Since the terms are approaching zero, it seems intuitive that it converges.

 

[pivoxa15]

Perhaps it seems unintuitive because You think that it compares the "last" 2 terms.

I seem to think of it as since as n gets large the terms are getting smaller, ie the ratio is less than 1, than the terms must be approaching zero. Since the terms are approaching zero, it seems intuitive that it converges.

The ratio test is more than just nth term as n gets large becoming 0. However its not just the n+1 term is smaller than the nth term either. Since 1/n certainly fit both descriptions. The unintuitive thing about the ratio test is that it demands the evaluation of a limit in that test.

 

[pivoxa15]

I won't prove it but I'll try to convince you that it's intuitive.

Say we have a series of general term c_n and the ratio test is conclusive. Say,

\lim_{n\rightarrow \infty} \left|\frac{c_{n+1}}{c_n}\right|=a<1

This means that by taking n large enough, we can make |c_{n+1}| as close as we want to a*|c_n|. So, for say n>N, we can approximate |c_{N+1}| by a*|c_N|, |c_{N+2}| by a*|c_{N+1}|=a²*|c_N|, etc, such that the series looks like

\sum_{n=1}^{\infty}|c_n|=\sum_{n=1}^{N}|c_n|+|c_N|\sum_{n=1}^{\infty}a^n

I.e. like some finite sum + a geometrical series. So the series converges absolutely.

That is nice. You are saying if the ratio test applies than this series is convergent. What about the other way? Can we apply the same argument in reverse so the proof you gave works both ways?

 

[Moo Of Doom]

The other way is quite similar. Suppose a > 1. Then you can do the same thing to bound your series from below by a geometric series with common ration a > 1, which diverges.

 

[pivoxa15]

I was thinking about proving that if the series is convergent than the ration test applies, namely a<1.

Just before doing that I think that the series in post 2 is wrong and should look like this instead:
\sum_{n=1}^{\infty}|c_n|&lt;\sum_{n=1}^{N}|c_n|+|c_N| \sum_{n=N+1}^{\infty}a^n

If a series converges than make it smaller then a finite series + a geometric series. Now apply the argument in reverse and get the ratio test with a<1. So it does work the other way when a<1.

It can be clearly seen that when a=1 than we can't use a geometric series so this method doesn't work.

 

[quasar987]

I was thinking about proving that if the series is convergent than the ration test applies, namely a<1.

Just before doing that I think that the series in post 2 is wrong and should look like this instead:
\sum_{n=1}^{\infty}|c_n|&lt;\sum_{n=1}^{N}|c_n|+|c_N| \sum_{n=N+1}^{\infty}a^n

This is not cenessarily true. See below, it is b that goes in there instead of a.

In any case, post #2 was not meant to be taken too seriously. I was only trying to make you understand intuitively what it meant and what it implies for the ratio of c_{n+1} to c_n to get smaller than 1 as n gets bigger.

However, it only takes a few more technicality to make that idea rigorous. Inspired by Data's post, will try to do that now.

Ok, say that as before,

\lim_{n\rightarrow \infty} \left|\frac{c_{n+1}}{c_n}\right|=a&lt;1

This means that, in particular, for \epsilon \in (0,a), there exists an N s.t. for all n\geq N,

\left|\frac{c_{n+1}}{c_n}-a\right|&lt;\epsilon \Leftrightarrow |c_{n+1}-ac_n|&lt;\epsilon|c_n| \Rightarrow |c_{n+1}|-a|c_n|&lt;\epsilon |c_n| \Leftrightarrow |c_{n+1}|&lt;(\epsilon+a)|c_n|\equiv b|c_n|

Because I have chosen epsilon in (0,a), b is less than 1. So to recapitulate, what the above is saying is that for all n\geq N, |c_{n+1}|&lt;b|c_n|. In particular, |c_{N+1}|&lt;b|c_N| \Rightarrow |c_{N+2}|&lt;b|c_{N+1}|&lt;b^2|c_N|\Rightarrow |c_{N+3}|&lt;..., so we can write

\sum_{n=1}^{\infty}|c_n|=\sum_{n=1}^{N}|c_n|+\sum_{n=N+1}^{\infty}|c_n|&lt;\sum_{n=1}^{N}|c_n|+|c_N|\sum_{n=1}^{\infty}b^n&lt;\infty

The second sum starts at 1 and not at N+1 because as I said in the above paragraph, |c_{N+1}| is bounded by b|c_N|, not b^{N+1}|c_N|. Anyway, I feel pretty intelligent right now. So this is what it's like to be StatusX, huh. I like it.

 

[mathwonk]

if you read my post you see there are two tests, comparing with geometric series and comparing with convergent integrals. if the ratio test always worked, there would be no need for the integral test.

a standard example is the sum of the terms 1/n^2.

here the ratio tends to 1, so the ratio test fails, but the integral of 1/x^2 converges, so the series does too.

 

[Data]

quasar, I think you have a little bit of a problem, but it's an easy fix. Having \epsilon \in (0,a) does not quite ensure that \epsilon + a &lt; 1. See how to fix it?

The "diverges when a>1" part is, as Moo indicated, by an almost identical argument.

 

[quasar987]

Oops, make that \epsilon\in(0,1-a).

 

[Data]

indeed