Integral test for convergence

Part of a series of articles about
Calculus
${\displaystyle \int _{a}^{b}f'(t)\,dt=f(b)-f(a)}$
Fundamental theorem Limits Continuity Rolle's theorem Mean value theorem Inverse function theorem
Differential Definitions Derivative (generalizations) Differential infinitesimal of a function total Concepts Differentiation notation Second derivative Implicit differentiation Logarithmic differentiation Related rates Taylor's theorem Rules and identities Sum Product Chain Power Quotient L'Hôpital's rule Inverse General Leibniz Faà di Bruno's formula Reynolds
Integral Lists of integrals Integral transform Leibniz integral rule Definitions Antiderivative Integral (improper) Riemann integral Lebesgue integration Contour integration Integral of inverse functions Integration by Parts Discs Cylindrical shells Substitution (trigonometric, tangent half-angle, Euler) Euler's formula Partial fractions (Heaviside's method) Changing order Reduction formulae Differentiating under the integral sign Risch algorithm
Series Geometric (arithmetico-geometric) Harmonic Alternating Power Binomial Taylor Convergence tests Summand limit (term test) Ratio Root Integral Direct comparison Limit comparison Alternating series Cauchy condensation Dirichlet Abel
Vector Gradient Divergence Curl Laplacian Directional derivative Identities Theorems Gradient Green's Stokes' Divergence generalized Stokes Helmholtz decomposition
Multivariable Formalisms Matrix Tensor Exterior Geometric Definitions Partial derivative Multiple integral Line integral Surface integral Volume integral Jacobian Hessian
Advanced Calculus on Euclidean space Generalized functions Limit of distributions
Specialized Fractional Malliavin Stochastic Variations
Miscellanea Precalculus History Glossary List of topics Integration Bee Mathematical analysis Nonstandard analysis
v t e

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

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

${\displaystyle \sum _{n=N}^{\infty }f(n)}$

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

${\displaystyle \int _{N}^{\infty }f(x)\,dx}$

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

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

${\displaystyle \int _{N}^{\infty }f(x)\,dx\leq \sum _{n=N}^{\infty }f(n)\leq f(N)+\int _{N}^{\infty }f(x)\,dx}$

(1)

for the infinite series.

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

Many textbooks require the function ${\displaystyle f}$ to be positive,^[1][2][3] but this condition is not really necessary, since when ${\displaystyle f}$ is negative and decreasing both ${\displaystyle \sum _{n=N}^{\infty }f(n)}$ and ${\displaystyle \int _{N}^{\infty }f(x)\,dx}$ diverge.^{[4][better source needed]}

The proof uses the comparison test, comparing the term ${\displaystyle f(n)}$ with the integral of ${\displaystyle f}$ over the intervals ${\displaystyle [n-1,n)}$ and ${\displaystyle [n,n+1)}$ respectively.

The monotonic function ${\displaystyle f}$ is continuous almost everywhere. To show this, let

${\displaystyle D=\{x\in [N,\infty )\mid f{\text{ is discontinuous at }}x\}}$

For every ${\displaystyle x\in D}$, there exists by the density of ${\displaystyle \mathbb {Q} }$, a ${\displaystyle c(x)\in \mathbb {Q} }$ so that ${\displaystyle c(x)\in \left[\lim _{y\downarrow x}f(y),\lim _{y\uparrow x}f(y)\right]}$.

Note that this set contains an open non-empty interval precisely if ${\displaystyle f}$ is discontinuous at ${\displaystyle x}$. We can uniquely identify ${\displaystyle c(x)}$ as the rational number that has the least index in an enumeration ${\displaystyle \mathbb {N} \to \mathbb {Q} }$ and satisfies the above property. Since ${\displaystyle f}$ is monotone, this defines an injective mapping ${\displaystyle c:D\to \mathbb {Q} ,x\mapsto c(x)}$ and thus ${\displaystyle D}$ is countable. It follows that ${\displaystyle f}$ is continuous almost everywhere. This is sufficient for Riemann integrability.^[5]

Since f is a monotone decreasing function, we know that

${\displaystyle f(x)\leq f(n)\quad {\text{for all }}x\in [n,\infty )}$

and

${\displaystyle f(n)\leq f(x)\quad {\text{for all }}x\in [N,n].}$

Hence, for every integer n ≥ N,

${\displaystyle \int _{n}^{n+1}f(x)\,dx\leq \int _{n}^{n+1}f(n)\,dx=f(n)}$

(2)

and, for every integer n ≥ N + 1,

${\displaystyle f(n)=\int _{n-1}^{n}f(n)\,dx\leq \int _{n-1}^{n}f(x)\,dx.}$

(3)

By summation over all n from N to some larger integer M, we get from (2)

${\displaystyle \int _{N}^{M+1}f(x)\,dx=\sum _{n=N}^{M}\underbrace {\int _{n}^{n+1}f(x)\,dx} _{\leq \,f(n)}\leq \sum _{n=N}^{M}f(n)}$

and from (3)

${\displaystyle {\begin{aligned}\sum _{n=N}^{M}f(n)&=f(N)+\sum _{n=N+1}^{M}f(n)\\&\leq f(N)+\sum _{n=N+1}^{M}\underbrace {\int _{n-1}^{n}f(x)\,dx} _{\geq \,f(n)}\\&=f(N)+\int _{N}^{M}f(x)\,dx.\end{aligned}}}$

Combining these two estimates yields

${\displaystyle \int _{N}^{M+1}f(x)\,dx\leq \sum _{n=N}^{M}f(n)\leq f(N)+\int _{N}^{M}f(x)\,dx.}$

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

The harmonic series

${\displaystyle \sum _{n=1}^{\infty }{\frac {1}{n}}}$

diverges because, using the natural logarithm, its antiderivative, and the fundamental theorem of calculus, we get

${\displaystyle \int _{1}^{M}{\frac {1}{n}}\,dn=\ln n{\Bigr |}_{1}^{M}=\ln M\to \infty \quad {\text{for }}M\to \infty .}$

On the other hand, the series

${\displaystyle \zeta (1+\varepsilon )=\sum _{n=1}^{\infty }{\frac {1}{n^{1+\varepsilon }}}}$

(cf. Riemann zeta function) converges for every ε > 0, because by the power rule

${\displaystyle \int _{1}^{M}{\frac {1}{n^{1+\varepsilon }}}\,dn=\left.-{\frac {1}{\varepsilon n^{\varepsilon }}}\right|_{1}^{M}={\frac {1}{\varepsilon }}\left(1-{\frac {1}{M^{\varepsilon }}}\right)\leq {\frac {1}{\varepsilon }}<\infty \quad {\text{for all }}M\geq 1.}$

From (1) we get the upper estimate

${\displaystyle \zeta (1+\varepsilon )=\sum _{n=1}^{\infty }{\frac {1}{n^{1+\varepsilon }}}\leq {\frac {1+\varepsilon }{\varepsilon }},}$

which can be compared with some of the particular values of Riemann zeta function.

The above examples involving the harmonic series raise the question of whether there are monotone sequences such that f(n) decreases to 0 faster than 1/n but slower than 1/n^1+ε in the sense that

${\displaystyle \lim _{n\to \infty }{\frac {f(n)}{1/n}}=0\quad {\text{and}}\quad \lim _{n\to \infty }{\frac {f(n)}{1/n^{1+\varepsilon }}}=\infty }$

for every ε > 0, and whether the corresponding series of the f(n) still diverges. Once such a sequence is found, a similar question can be asked with f(n) taking the role of 1/n, 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 k, the series

${\displaystyle \sum _{n=N_{k}}^{\infty }{\frac {1}{n\ln(n)\ln _{2}(n)\cdots \ln _{k-1}(n)\ln _{k}(n)}}}$

(4)

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

${\displaystyle \sum _{n=N_{k}}^{\infty }{\frac {1}{n\ln(n)\ln _{2}(n)\cdots \ln _{k-1}(n)(\ln _{k}(n))^{1+\varepsilon }}}}$

(5)

converges for every ε > 0. Here ln_k denotes the k-fold composition of the natural logarithm defined recursively by

${\displaystyle \ln _{k}(x)={\begin{cases}\ln(x)&{\text{for }}k=1,\\\ln(\ln _{k-1}(x))&{\text{for }}k\geq 2.\end{cases}}}$

Furthermore, N_k denotes the smallest natural number such that the k-fold composition is well-defined and ln_k(N_k) ≥ 1, i.e.

${\displaystyle N_{k}\geq \underbrace {e^{e^{\cdot ^{\cdot ^{e}}}}} _{k\ e'{\text{s}}}=e\uparrow \uparrow k}$

using tetration or Knuth's up-arrow notation.

To see the divergence of the series (4) using the integral test, note that by repeated application of the chain rule

${\displaystyle {\frac {d}{dx}}\ln _{k+1}(x)={\frac {d}{dx}}\ln(\ln _{k}(x))={\frac {1}{\ln _{k}(x)}}{\frac {d}{dx}}\ln _{k}(x)=\cdots ={\frac {1}{x\ln(x)\cdots \ln _{k}(x)}},}$

hence

${\displaystyle \int _{N_{k}}^{\infty }{\frac {dx}{x\ln(x)\cdots \ln _{k}(x)}}=\ln _{k+1}(x){\bigr |}_{N_{k}}^{\infty }=\infty .}$

To see the convergence of the series (5), note that by the power rule, the chain rule and the above result

${\displaystyle -{\frac {d}{dx}}{\frac {1}{\varepsilon (\ln _{k}(x))^{\varepsilon }}}={\frac {1}{(\ln _{k}(x))^{1+\varepsilon }}}{\frac {d}{dx}}\ln _{k}(x)=\cdots ={\frac {1}{x\ln(x)\cdots \ln _{k-1}(x)(\ln _{k}(x))^{1+\varepsilon }}},}$

hence

${\displaystyle \int _{N_{k}}^{\infty }{\frac {dx}{x\ln(x)\cdots \ln _{k-1}(x)(\ln _{k}(x))^{1+\varepsilon }}}=-{\frac {1}{\varepsilon (\ln _{k}(x))^{\varepsilon }}}{\biggr |}_{N_{k}}^{\infty }<\infty }$

and (1) gives bounds for the infinite series in (5).

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

• Knopp, Konrad, "Infinite Sequences and Series", Dover Publications, Inc., New York, 1956. (§ 3.3) ISBN 0-486-60153-6
• Whittaker, E. T., and Watson, G. N., A Course in Modern Analysis, fourth edition, Cambridge University Press, 1963. (§ 4.43) ISBN 0-521-58807-3
• Ferreira, Jaime Campos, Ed Calouste Gulbenkian, 1987, ISBN 972-31-0179-3