Cauchy condensation test
# Cauchy condensation test

Part of a series of articles about :

Calculus :

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

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 :

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 :

Miscellaneous

Precalculus

History

Glossary

List of topics

Integration Bee

Mathematical analysis

Nonstandard analysis :

vte :

In mathematics, the Cauchy condensation test, named after Augustin-Louis Cauchy, is a standard convergence test for infinite series. For a non-increasing sequence $f(n)$ of non-negative real numbers, the series $∑_{n=1}^∞f(n){\textstyle$ \sum \limits _{n=1}^{\infty }f(n)} converges if and only if the "condensed" series $∑_{n=0}^∞2^nf(2^n){\textstyle$ \sum \limits _{n=0}^{\infty }2^{n}f(2^{n})} converges. Moreover, if they converge, the sum of the condensed series is no more than twice as large as the sum of the original.

## Estimate

The Cauchy condensation test follows from the stronger estimate,

$\sum _{n=1}^{\infty }f(n)\leq \sum _{n=0}^{\infty }2^{n}f(2^{n})\leq \ 2\sum _{n=1}^{\infty }f(n),$

which should be understood as an inequality of extended real numbers. The essential thrust of a proof follows, patterned after Oresme's proof of the divergence of the harmonic series.

To see the first inequality, the terms of the original series are rebracketed into runs whose lengths are powers of two, and then each run is bounded above by replacing each term by the largest term in that run. That term is always the first one, since by assumption the terms are non-increasing.

${\begin{array}{rcccccccl}\displaystyle \sum \limits _{n=1}^{\infty }f(n)&=&f(1)&+&f(2)+f(3)&+&f(4)+f(5)+f(6)+f(7)&+&\cdots \\&=&f(1)&+&{\Bigf(2)+f(3){\Big )}&+&{\Bigf(4)+f(5)+f(6)+f(7){\Big )}&+&\cdots \\&\leq &f(1)&+&{\Bigf(2)+f(2){\Big )}&+&{\Bigf(4)+f(4)+f(4)+f(4){\Big )}&+&\cdots \\&=&f(1)&+&2f(2)&+&4f(4)&+&\cdots =\sum \limits _{n=0}^{\infty }2^{n}f(2^{n})\end{array}}$

To see the second inequality, these two series are again rebracketed into runs of power of two length, but "offset" as shown below, so that the run of $2∑_{n=1}^∞f(n){\textstyle$ 2\sum _{n=1}^{\infty }f(n)} which begins with $f(2^n){\textstyle$ f(2^{n})} lines up with the end of the run of $∑_{n=0}^∞2^nf(2^n){\textstyle$ \sum _{n=0}^{\infty }2^{n}f(2^{n})} which ends with $f(2^n){\textstyle$ f(2^{n})}, so that the former stays always "ahead" of the latter.

${\begin{aligned}\sum _{n=0}^{\infty }2^{n}f(2^{n})&=f(1)+{\Bigf(2)+f(2){\Big )}+{\Bigf(4)+f(4)+f(4)+f(4){\Big )}+\cdots \\&={\Bigf(1)+f(2){\Big )}+{\Bigf(2)+f(4)+f(4)+f(4){\Big )}+\cdots \\&\leq {\Bigf(1)+f(1){\Big )}+{\Bigf(2)+f(2)+f(3)+f(3){\Big )}+\cdots =2\sum _{n=1}^{\infty }f(n)\end{aligned}}$

## Integral comparison

The "condensation" transformation $f(n)→2^nf(2^n){\textstyle$ f(n)\rightarrow 2^{n}f(2^{n})} recalls the integral variable substitution $x→e^x{\textstyle$ x\rightarrow e^{x}} yielding $f(x)dx→e^xf(e^x)dx{\textstyle$ f(x)\, \mathrm {d} x\rightarrow e^{x}f(e^{x})\, \mathrm {d} x}.

Pursuing this idea, the integral test for convergence gives us, in the case of monotone $f$, that $∑_{n=1}^∞f(n){\textstyle$ \sum \limits _{n=1}^{\infty }f(n)} converges if and only if $\displaystyle \int _{1}^{\infty }f(x)\,\mathrm {d} x$ converges. The substitution $x→2^x{\textstyle$ x\rightarrow 2^{x}} yields the integral $\displaystyle \log 2\ \int _{2}^{\infty }\!2^{x}f(2^{x})\,\mathrm {d} x$. We then notice that $\displaystyle \log 2\ \int _{2}^{\infty }\!2^{x}f(2^{x})\,\mathrm {d} x<\log 2\ \int _{0}^{\infty }\!2^{x}f(2^{x})\,\mathrm {d} x$, where the right hand side comes from applying the integral test to the condensed series $∑_{n=0}^∞2^nf(2^n){\textstyle$ \sum \limits _{n=0}^{\infty }2^{n}f(2^{n})}. Therefore, $∑_{n=1}^∞f(n){\textstyle$ \sum \limits _{n=1}^{\infty }f(n)} converges if and only if $∑_{n=0}^∞2^nf(2^n){\textstyle$ \sum \limits _{n=0}^{\infty }2^{n}f(2^{n})} converges.

## Examples

The test can be useful for series where n appears as in a denominator in f. For the most basic example of this sort, the harmonic series $∑_{n=1}^∞1/n{\textstyle$ \sum _{n=1}^{\infty }1/n} is transformed into the series ∑1{\textstyle \sum 1}, which clearly diverges.

As a more complex example, take

$f(n):=n^{-a}(\log n)^{-b}(\log \log n)^{-c}.$

Here the series definitely converges for a > 1, and diverges for a < 1. When a = 1, the condensation transformation gives the series

$\sum n^{-b}(\log n)^{-c}.$

The logarithms "shift to the left". So when a = 1, we have convergence for b > 1, divergence for b < 1. When b = 1 the value of c enters.

This result readily generalizes: the condensation test, applied repeatedly, can be used to show that for $k=1,2,3,\ldots$, the generalized Bertrand series

$\sum _{n\geq N}{\frac {1}{n\cdot \log n\cdot \log \log n\cdots \log ^{\circ (k-1)}n\cdot (\log ^{\circ k}n)^{\alpha }}}\quad \quad (N=\lfloor \exp ^{\circ k}(0)\rfloor +1)$

converges for $\alpha >1$ and diverges for $0<\alpha \leq 1$. Here $f^{\circ m}$ denotes the mth iterate of a function $f$, so that

$f^{\circ m}(x):={\begin{cases}f(f^{\circ (m-1)}(x)),&m=1,2,3,\ldots ;\\x,&m=0.\end{cases}}$

The lower limit of the sum, $N$, was chosen so that all terms of the series are positive. Notably, these series provide examples of infinite sums that converge or diverge arbitrarily slowly. For instance, in the case of $k=2$ and $\alpha =1$, the partial sum exceeds 10 only after $10^{10^{100}}$(a googolplex) terms; yet the series diverges nevertheless.

## Schlömilch's generalization

A generalization of the condensation test was given by Oskar Schlömilch. Let u(n) be a strictly increasing sequence of positive integers such that the ratio of successive differences is bounded: there is a positive real number N, for which

${\Delta u(n) \over \Delta u(n{-}1)}\ =\ {u(n{+}1)-u(n) \over u(n)-u(n{-}1)}\ <\ N\ {\text{ for all }}n.$

Then, provided that $f(n)$ meets the same preconditions as in Cauchy's convergence test, the convergence of the series $∑_{n=1}^∞f(n){\textstyle$ \sum _{n=1}^{\infty }f(n)} is equivalent to the convergence of

$\sum _{n=0}^{\infty }{\Delta u(n)}\,f(u(n))\ =\ \sum _{n=0}^{\infty }{\Bigu(n{+}1)-u(n){\Big )}f(u(n)).$

Taking $u(n)=2^n{\textstyle$ u(n)=2^{n}} so that $Δu(n)=u(n+1)−u(n)=2^n{\textstyle$ \Delta u(n)=u(n{+}1)-u(n)=2^{n}}, the Cauchy condensation test emerges as a special case.

