Lably
Skip to content

Cauchy sequence

Sequence of points that get progressively closer to each other

  • 10 min read
  • 4 chapters

Related on Lably

Through Mathematics, Sequence and Element of a set

It is not sufficient for each term to become arbitrarily close to the preceding term. For instance, in the sequence of square roots of natural numbers: an=n, the consecutive terms become arbitrarily close to each other – their differences an+1−an=n+1−n=1n+1+n<12n tend to zero as the index n grows. However, with growing values of n, the terms an become arbitrarily large. So, for any index n and distance d, there exists an index m big enough such that am−an>d. As a result, no matter how far one goes, the remaining terms of the sequence never get close to each other; hence the sequence is not Cauchy.

The utility of Cauchy sequences lies in the fact that in a complete metric space (one where all such sequences are known to converge to a limit), the criterion for convergence depends only on the terms of the sequence itself, as opposed to the definition of convergence, which uses the limit value as well as the terms. This is often exploited in algorithms, both theoretical and applied, where an iterative process can be shown relatively easily to produce a Cauchy sequence, consisting of the iterates, thus fulfilling a logical condition, such as termination.

Generalizations of Cauchy sequences in more abstract uniform spaces exist in the form of Cauchy filters and Cauchy nets.

In real numbers

A sequence x1,x2,x3,… of real numbers is called a Cauchy sequence if for every positive real number ε, there is a positive integer N such that for all natural numbers m,n>N, |xm−xn|<ε, where the vertical bars denote the absolute value. In a similar way one can define Cauchy sequences of rational or complex numbers. Cauchy formulated such a condition by requiring xm−xn to be infinitesimal for every pair of infinite m, n.

For any real number r, the sequence of truncated decimal expansions of r forms a Cauchy sequence. For example, when r=π, this sequence is (3, 3.1, 3.14, 3.141, ...). The mth and nth terms differ by at most 101−m when m < n, and as m grows this becomes smaller than any fixed positive number ε.

Modulus of Cauchy convergence

If (x1,x2,x3,...) is a sequence in the set X, then a modulus of Cauchy convergence for the sequence is a function α from the set of natural numbers to itself, such that for all natural numbers k and natural numbers m,n>α(k), |xm−xn|<1/k.

Any sequence with a modulus of Cauchy convergence is a Cauchy sequence. The existence of a modulus for a Cauchy sequence follows from the well-ordering property of the natural numbers (let α(k) be the smallest possible N in the definition of Cauchy sequence, taking ε to be 1/k). The existence of a modulus also follows from the principle of countable choice. Regular Cauchy sequences are sequences with a given modulus of Cauchy convergence (usually α(k)=k or α(k)=2k). Any Cauchy sequence with a modulus of Cauchy convergence is equivalent to a regular Cauchy sequence; this can be proven without using any form of the axiom of choice.

Moduli of Cauchy convergence are used by constructive mathematicians who do not wish to use any form of choice. Using a modulus of Cauchy convergence can simplify both definitions and theorems in constructive analysis. Regular Cauchy sequences were used by Bishop (2012) and by Bridges (1997) in constructive mathematics textbooks.

Sign in to keep reading

3 more chapters are free with a Lably account.

More in Calculus and analysis