Maclaurin–Cauchy test

In mathematics, the integral test for convergence is a method used to test infinite series of monotonous terms for convergence. It was developed by Colin Maclaurin and Augustin-Louis Cauchy and is sometimes known as the Maclaurin–Cauchy test.

Statement of the test

Consider an integer and a function defined on the unbounded interval , on which it is monotone decreasing. Then the infinite series

:$\sum_^\infty f(n)$

converges to a real number if and only if the improper integral

:$\int_N^\infty f(x)\,dx$

is finite. In particular, if the integral diverges, then the series diverges as well.

Remark

If the improper integral is finite, then the proof also gives the lower and upper bounds

for the infinite series.

Note that if the function $f(x)$ is increasing, then the function $-f(x)$ is decreasing and the above theorem applies.

Proof

The proof basically uses the comparison test, comparing the term with the integral of over the intervals
and , respectively.

The monotonous function $f$ is continuous almost everywhere. To show this, let $D=\$. For every $x\in D$, there exists by the density of $\mathbb Q$ a $c(x)\in\mathbb Q$ so that c(x)\in\left lim_ f(y), \lim_ f(y)\right/math>. Note that this set contains an open non-empty interval precisely if $f$ is discontinuous at $x$. We can uniquely identify $c(x)$ as the rational number that has the least index in an enumeration $\mathbb N\to\mathbb Q$ and satisfies the above property. Since $f$ is monotone, this defines an injective mapping $c:D\to\mathbb Q, x\mapsto c(x)$ and thus $D$ is countable. It follows that $f$ is continuous almost everywhere. This is sufficient for Riemann integrability.

Since is a monotone decreasing function, we know that

:
f(x)\le f(n)\quad\textx\in ,\infty)

and

:$f(n)\le f(x)\quad\textx\in[N,n$

Hence, for every integer ,

and, for every integer ,

By summation over all from to some larger integer , we get from ()

:$\int_N^f(x)\,dx=\sum_^M\underbrace_\le\sum_^Mf(n)$

and from ()

:$\sum_^Mf(n)=f(N)+\sum_^Mf(n)\le f(N)+\sum_^M\underbrace_=f(N)+\int_N^M f(x)\,dx.$

Combining these two estimates yields

:$\int_N^f(x)\,dx\le\sum_^Mf(n)\le f(N)+\int_N^M f(x)\,dx.$

Letting tend to infinity, the bounds in () and the result follow.

Applications

The harmonic series
:$\sum_^\infty \frac 1 n$
diverges because, using the harmonic series (mathematics)">harmonic series
:$\sum_^\infty \frac 1 n$
diverges because, using the natural logarithm, its antiderivative">natural logarithm">harmonic series (mathematics)">harmonic series
:$\sum_^\infty \frac 1 n$
diverges because, using the natural logarithm, its antiderivative, and the fundamental theorem of calculus, we get
:$\int_1^M \frac 1 n\,dn = \ln n\Bigr, _1^M = \ln M \to\infty \quad\textM\to\infty.$
On the other hand, the series
:$\zeta(1+\varepsilon)=\sum_^\infty \frac1$
(cf. Riemann zeta function)
converges for every , because by the power rule
:$\int_1^M\frac1\,dn = \left. -\frac 1 \_1^M= \frac 1 \varepsilon \left(1-\frac 1 \right) \le \frac 1 \varepsilon < \infty \quad\textM\ge1.$
From () we get the upper estimate
:$\zeta(1+\varepsilon)=\sum_^\infty \frac 1 \le \frac\varepsilon,$
which can be compared with some of the particular values of Riemann zeta function.

Borderline between divergence and convergence

The above examples involving the harmonic series raise the question, whether there are monotone sequences such that decreases to 0 faster than but slower than in the sense that
:$\lim_\frac=0 \quad\text\quad \lim_\frac=\infty$
for every , and whether the corresponding series of the still diverges. Once such a sequence is found, a similar question can be asked with taking the role of , and so on. In this way it is possible to investigate the borderline between divergence and convergence of infinite series.

Using the integral test for convergence, one can show (see below) that, for every natural number , the series

still diverges (cf. proof that the sum of the reciprocals of the primes diverges for ) but

converges for every . Here denotes the -fold composition of the natural logarithm defined recursively by
:$\ln_k(x)= \begin \ln(x)&\textk=1,\\ \ln(\ln_(x))&\textk\ge2. \end$
Furthermore, denotes the smallest natural number such that the -fold composition is well-defined and , i.e.
:$N_k\ge \underbrace_=e \uparrow\uparrow k$
using tetration or Knuth's up-arrow notation.

To see the divergence of the series () using the integral test, note that by repeated application of the chain rule
:$\frac\ln_(x) =\frac\ln(\ln_k(x)) =\frac1\frac\ln_k(x) =\cdots =\frac1,$
hence
:$\int_^\infty\frac =\ln_(x)\bigr, _^\infty=\infty.$
To see the convergence of the series (), note that by the power rule, the chain rule and the above result
:$-\frac\frac1 =\frac1\frac\ln_k(x) =\cdots =\frac,$
hence
:$\int_^\infty\frac =-\frac1\biggr, _^\infty<\infty$
and () gives bounds for the infinite series in ().

See also

* Convergence tests
* Convergence (mathematics)
* Direct comparison test
* Dominated convergence theorem
* Euler-Maclaurin formula
* Limit comparison test
* Monotone convergence theorem

References

* Knopp, Konrad, "Infinite Sequences and Series", Dover Publications, Inc., New York, 1956. (§ 3.3)
* Whittaker, E. T., and Watson, G. N., ''A Course in Modern Analysis'', fourth edition, Cambridge University Press, 1963. (§ 4.43)
* Ferreira, Jaime Campos, Ed Calouste Gulbenkian, 1987,

{{Calculus topics

Augustin-Louis Cauchy
Integral calculus
Convergence tests
Articles containing proofs