In mathematics, the ratio test is a test (or "criterion") for the convergence of a series
infty | |
\sum | |
n=1 |
an,
where each term is a real or complex number and is nonzero when is large. The test was first published by Jean le Rond d'Alembert and is sometimes known as d'Alembert's ratio test or as the Cauchy ratio test.
The usual form of the test makes use of the limitThe ratio test states that:
It is possible to make the ratio test applicable to certain cases where the limit L fails to exist, if limit superior and limit inferior are used. The test criteria can also be refined so that the test is sometimes conclusive even when L = 1. More specifically, let
R=\lim\sup\left|
an+1 | |
an |
\right|
r=\liminf\left|
an+1 | |
an |
\right|
Then the ratio test states that:
\left| | an+1 |
an |
\right|>1
|an|
If the limit L in exists, we must have L = R = r. So the original ratio test is a weaker version of the refined one.
Consider the series
| ||||
\sum | ||||
n=1 |
Applying the ratio test, one computes the limit
L=\limn\toinfty\left|
an+1 | |
an |
\right|=\limn\toinfty\left|
| ||||
|
\right|=
1 | |
e |
<1.
Since this limit is less than 1, the series converges.
Consider the series
| ||||
\sum | ||||
n=1 |
.
Putting this into the ratio test:
L=\limn\toinfty\left|
an+1 | |
an |
\right|=\limn\toinfty\left|
| ||||
|
\right| =e>1.
Thus the series diverges.
Consider the three series
infty | |
\sum | |
n=1 |
1,
infty | |
\sum | |
n=1 |
1 | |
n2 |
,
infty | |
\sum | |
n=1 |
(-1)n+1 | |
n |
.
The first series (1 + 1 + 1 + 1 + ⋯) diverges, the second (the one central to the Basel problem) converges absolutely and the third (the alternating harmonic series) converges conditionally. However, the term-by-term magnitude ratios
\left| | an+1 |
an |
\right|
1,
n2 | |
(n+1)2 |
n | |
n+1 |
\limn\toinfty\left|
an+1 | |
an |
\right|
Below is a proof of the validity of the original ratio test.
Suppose that
L=\limn\toinfty\left|
an+1 | |
an |
\right|<1
L<r<1
|an+1|<r|an|
|an+i|<
i|a | |
r | |
n |
|
infty | |
\sum | |
i=N+1 |
|ai|=
infty | |
\sum | |
i=1 |
\left|aN+i\right|<
infty | |
\sum | |
i=1 |
ri|aN|=|aN|
infty | |
\sum | |
i=1 |
ri=|aN|
r | |
1-r |
<infty.
That is, the series converges absolutely.
On the other hand, if L > 1, then
|an+1|>|an|
As seen in the previous example, the ratio test may be inconclusive when the limit of the ratio is 1. Extensions to the ratio test, however, sometimes allows one to deal with this case.[1] [2] [3] [4] [5] [6] [7] [8]
In all the tests below one assumes that Σan is a sum with positive an. These tests also may be applied to any series with a finite number of negative terms. Any such series may be written as:
infty | |
\sum | |
n=1 |
an=
N | |
\sum | |
n=1 |
an+\sum
infty | |
n=N+1 |
an
where aN is the highest-indexed negative term. The first expression on the right is a partial sum which will be finite, and so the convergence of the entire series will be determined by the convergence properties of the second expression on the right, which may be re-indexed to form a series of all positive terms beginning at n=1.
Each test defines a test parameter (ρn) which specifies the behavior of that parameter needed to establish convergence or divergence. For each test, a weaker form of the test exists which will instead place restrictions upon limn->∞ρn.
All of the tests have regions in which they fail to describe the convergence properties of Σan. In fact, no convergence test can fully describe the convergence properties of the series.[1] [7] This is because if Σan is convergent, a second convergent series Σbn can be found which converges more slowly: i.e., it has the property that limn->∞ (bn/an) = ∞. Furthermore, if Σan is divergent, a second divergent series Σbn can be found which diverges more slowly: i.e., it has the property that limn->∞ (bn/an) = 0. Convergence tests essentially use the comparison test on some particular family of an, and fail for sequences which converge or diverge more slowly.
Augustus De Morgan proposed a hierarchy of ratio-type tests[1] [6]
The ratio test parameters (
\rhon
Dnan/an+1-Dn+1
an+1/an
Dn-Dn+1an+1/an
The first test in the De Morgan hierarchy is the ratio test as described above.
This extension is due to Joseph Ludwig Raabe. Define:
\rhon\equivn\left(
an | |
an+1 |
-1\right)
(and some extra terms, see Ali, Blackburn, Feld, Duris (none), Duris2)
\rhon\gec
\rhon\le1
For the limit version, the series will:
\rho=\limn\toinfty\rhon>1
\limn\toinfty\rhon<1
When the above limit does not exist, it may be possible to use limits superior and inferior.[1] The series will:
\liminfn\rhon>1
\limsupn\rhon<1
Defining
\rhon\equivn\left(
an | |
an+1 |
-1\right)
\limsup\rhon<1
\suman
\liminf\rhon>1
The proof proceeds essentially by comparison with
\sum1/nR
\limsup\rhon<1
\limsup\rhon<0
an+1\gean
n
0\le\limsup\rhon<1
R<1
\rhon\leR
n\geN
an/an+1\le\left(1+
Rn\right)\le | |
e |
R/n
an+1\ge
-R/n | |
a | |
ne |
an+1\ge
-R(1/N+...+1/n) | |
a | |
Ne |
\ge
-Rlog(n) | |
ca | |
Ne |
R | |
=ca | |
N/n |
n\geN
R<1
\suman
The proof of the other half is entirely analogous, with most of the inequalities simply reversed. We need a preliminary inequality to usein place of the simple
1+t<et
R
N
log\left(1+ |
| ||||||
log\left(\left(1+ |
| |||||||||
\left(1+ |
| |||
R |
Suppose now that
\liminf\rhon>1
R>1
an+1\le
-R | |
ca | |
Nn |
n\geN
R>1
\suman
This extension is due to Joseph Bertrand and Augustus De Morgan.
Defining:
\rhon\equivnlnn\left(
an | |
an+1 |
-1\right)-lnn
Bertrand's test[1] [7] asserts that the series will:
\rhon\gec
\rhon\le1
For the limit version, the series will:
\rho=\limn\toinfty\rhon>1
\limn\toinfty\rhon<1
When the above limit does not exist, it may be possible to use limits superior and inferior.[1] [6] The series will:
\liminf\rhon>1
\limsup\rhon<1
This extension probably appeared at the first time by Margaret Martin in 1941.[9] A short proof based on Kummer's test and without technical assumptions (such as existence of the limits, for example) was provided by Vyacheslav Abramov in 2019.[10]
Let
K\geq1
ln(K)(x)
K
ln(1)(x)=ln(x)
2\leqk\leqK
ln(k)(x)=ln(k-1)(ln(x))
Suppose that the ratio
an/an+1
n
an | =1+ | |
an+1 |
1 | + | |
n |
1 | |
n |
K-1 | |
\sum | |
i=1 |
1 | + | ||||||||
|
\rhon | |||||||||
|
, K\geq1.
K=1
The value
\rhon
\rhon=
Kln | ||
n\prod | (n)\left( | |
(k) |
an | |
an+1 |
jln | |
-1\right)-\sum | |
(K-k+1) |
(n).
Extended Bertrand's test asserts that the series
c>1
\rhon\geqc
n>N
\rhon\leq1
n>N
For the limit version, the series
\rho=\limn\toinfty\rhon>1
\rho=infty
\limn\toinfty\rhon<1
\rho=1
When the above limit does not exist, it may be possible to use limits superior and inferior. The series
\liminf\rhon>1
\limsup\rhon<1
For applications of Extended Bertrand's test see birth–death process.
This extension is due to Carl Friedrich Gauss.
Assuming an > 0 and r > 1, if a bounded sequence Cn can be found such that for all n:[2] [4] [6] [7]
an | =1+ | |
an+1 |
\rho | + | |
n |
Cn | |
nr |
then the series will:
\rho>1
\rho\le1
This extension is due to Ernst Kummer.
Let ζn be an auxiliary sequence of positive constants. Define
\rhon\equiv\left(\zetan
an | |
an+1 |
-\zetan+1\right)
Kummer's test states that the series will:[2] [3] [7] [8]
c>0
\rhon\gec
\rhon>0
\rhon\le0
infty | |
\sum | |
n=1 |
1/\zetan
For the limit version, the series will:[4] [6]
\limn\toinfty\rhon>0
\limn\toinfty\rhon<0
infty | |
\sum | |
n=1 |
1/\zetan
When the above limit does not exist, it may be possible to use limits superior and inferior.[1] The series will
\liminfn\rhon>0
\limsupn\rhon<0
\sum1/\zetan
All of the tests in De Morgan's hierarchy except Gauss's test can easily be seen as special cases of Kummer's test:[1]
\rhoKummer=\left(
an | |
an+1 |
-1\right)=1/\rhoRatio-1
\rhoKummer=\left(n
an | |
an+1 |
-(n+1)\right)=\rhoRaabe-1
\rhoKummer=nln(n)\left(
an | |
an+1 |
\right)-(n+1)ln(n+1)
Using
ln(n+1)=ln(n)+ln(1+1/n)
ln(1+1/n) → 1/n
\rhoKummer
\rhoKummer=nln(n)\left(
an | |
an+1 |
-1\right)-ln(n)-1=\rhoBertrand-1
ln(k)(n+1)=ln(k)(n)+
1 | +O\left( | ||||||||
|
1 | |
n2 |
\right),
\rhoKummer=
Kln | ||
n\prod | (n) | |
(k) |
an | |
an+1 |
K\left(ln | ||
-(n+1)\left[\prod | (n)+ | |
(k) |
1 | |||||||||
|
Kln | ||
\right)\right]+o(1) =n\prod | (n)\left( | |
(k) |
an | |
an+1 |
jln | |
-1\right)-\sum | |
(K-k+1) |
(n)-1+o(1).
Hence,
\rhoKummer=\rhoExtendedBertrand-1.
Note that for these four tests, the higher they are in the De Morgan hierarchy, the more slowly the
1/\zetan
If
\rhon>0
0<\delta<\rhon
N
n>N,
\delta\leq\zetan
an | |
an+1 |
-\zetan+1.
an+1>0
n>N,
0\leq\deltaan+1\leq\zetanan-\zetan+1an+1.
\zetan+1an+1\leq\zetanan
n\geqN
N
\zetanan>0
\limn\toinfty\zetanan=L
infty | |
\sum | |
n=1 |
\left(\zetanan-\zetan+1an+1\right)
n>N,
\deltaan+1\leq\zetanan-\zetan+1an+1
infty | |
\sum | |
n=1 |
\deltaan+1
On the other hand, if
\rho<0
\zetanan
n>N
\epsilon>0
\zetanan>\epsilon
n>N
\sumnan=\sumn
an\zetan | |
\zetan |
\sumn
\epsilon | |
\zetan |
A new version of Kummer's test was established by Tong.[3] See also [5] [8] [11] for further discussions and new proofs. The provided modification of Kummer's theorem characterizesall positive series, and the convergence or divergence can be formulated in the form of two necessary and sufficient conditions, one for convergence and another for divergence.
infty | |
\sum | |
n=1 |
an
\zetan
n=1,2,...
\zeta | ||||
|
-\zetan+1\geqc>0.
infty | |
\sum | |
n=1 |
an
\zetan
n=1,2,...
\zeta | ||||
|
-\zetan+1\leq0,
infty | |
\sum | |
n=1 |
1 | |
\zetan |
=infty.
The first of these statements can be simplified as follows: [12]
infty | |
\sum | |
n=1 |
an
\zetan
n=1,2,...
\zeta | ||||
|
-\zetan+1=1.
The second statement can be simplified similarly:
infty | |
\sum | |
n=1 |
an
\zetan
n=1,2,...
\zeta | ||||
|
-\zetan+1=0,
infty | |
\sum | |
n=1 |
1 | |
\zetan |
=infty.
However, it becomes useless, since the condition
infty | |
\sum | |
n=1 |
1 | |
\zetan |
=infty
infty | |
\sum | |
n=1 |
an=infty.
Another ratio test that can be set in the framework of Kummer's theorem was presented by Orrin Frink[13] 1948.
Suppose
an
C\setminus\{0\}
\limsupn → infty(
|an+1| | |
|an| |
| ||||
) |
\sumnan
N\inN
( | |an+1| |
|an| |
| ||||
) |
n\geqN
\sumn|an|
This result reduces to a comparison of
\sumn|an|
\sumnn-p
A more refined ratio test is the second ratio test:[4] [6] For
an>0
L0\equiv\limn →
| |||
L1\equiv\limn →
| |||
L\equivmax(L0,L1) |
By the second ratio test, the series will:
L< | 1 |
2 |
L> | 1 |
2 |
L= | 1 |
2 |
If the above limits do not exist, it may be possible to use the limits superior and inferior. Define:
L0\equiv\limsupn →
| L1\equiv\limsupn →
| |||||||
\ell0\equiv\liminfn →
| \ell1\equiv\liminfn →
| |||||||
L\equivmax(L0,L1) | \ell\equivmin(\ell0,\ell1) |
Then the series will:
L< | 1 |
2 |
\ell> | 1 |
2 |
\ell\le
1 | |
2 |
\leL
This test is a direct extension of the second ratio test.[4] [6] For
0\leqk\leqm-1,
an
Lk\equiv\limn →
| |||
L\equivmax(L0,L1,\ldots,Lm-1) |
m
L< | 1 |
m |
L> | 1 |
m |
L= | 1 |
m |
If the above limits do not exist, it may be possible to use the limits superior and inferior. For
0\leqk\leqm-1
Lk\equiv\limsupn →
| |||
\ellk\equiv\liminfn →
| |||
L\equivmax(L0,L1,\ldots,Lm-1) | \ell\equivmin(\ell0,\ell1,\ldots,\ellm-1) |
Then the series will:
L< | 1 |
m |
\ell> | 1 |
m |
\ell\leq
1 | |
m |
\leqL
This test is an extension of the
m
Assume that the sequence
an
Let
\varphi:Z+\toZ+
\limn\toinfty
n | |
\varphi(n) |
\alpha=\limn\toinfty
n | |
\varphi(n) |
0<\alpha<1
Assume also that
\limn\toinfty
a\varphi(n) | |
an |
=L.
Then the series will:
L<\alpha
L>\alpha
L=\alpha
§8.14.