Cauchy sequence

Last updated

Cauchy sequence illustration.svg
(a) The plot of a Cauchy sequence shown in blue, as versus If the space containing the sequence is complete, then the sequence has a limit.
Cauchy sequence illustration2.svg
(b) A sequence that is not Cauchy. The elements of the sequence do not get arbitrarily close to each other as the sequence progresses.

In mathematics, a Cauchy sequence is a sequence whose elements become arbitrarily close to each other as the sequence progresses. [1] More precisely, given any small positive distance, all excluding a finite number of elements of the sequence are less than that given distance from each other. Cauchy sequences are named after Augustin-Louis Cauchy; they may occasionally be known as fundamental sequences. [2]

Contents

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:

the consecutive terms become arbitrarily close to each other – their differences

tend to zero as the index n grows. However, with growing values of n, the terms become arbitrarily large. So, for any index n and distance d, there exists an index m big enough such that 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

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

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 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 this sequence is (3, 3.1, 3.14, 3.141, ...). The mth and nth terms differ by at most when m < n, and as m grows this becomes smaller than any fixed positive number

Modulus of Cauchy convergence

If is a sequence in the set 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 and natural numbers

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 be the smallest possible in the definition of Cauchy sequence, taking to be ). 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 or ). 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.

In a metric space

Since the definition of a Cauchy sequence only involves metric concepts, it is straightforward to generalize it to any metric space X. To do so, the absolute value is replaced by the distance (where d denotes a metric) between and

Formally, given a metric space a sequence

is Cauchy, if for every positive real number there is a positive integer such that for all positive integers the distance

Roughly speaking, the terms of the sequence are getting closer and closer together in a way that suggests that the sequence ought to have a limit in X. Nonetheless, such a limit does not always exist within X: the property of a space that every Cauchy sequence converges in the space is called completeness, and is detailed below.

Completeness

A metric space (X, d) in which every Cauchy sequence converges to an element of X is called complete.

Examples

The real numbers are complete under the metric induced by the usual absolute value, and one of the standard constructions of the real numbers involves Cauchy sequences of rational numbers. In this construction, each equivalence class of Cauchy sequences of rational numbers with a certain tail behavior—that is, each class of sequences that get arbitrarily close to one another— is a real number.

A rather different type of example is afforded by a metric space X which has the discrete metric (where any two distinct points are at distance 1 from each other). Any Cauchy sequence of elements of X must be constant beyond some fixed point, and converges to the eventually repeating term.

Non-example: rational numbers

The rational numbers are not complete (for the usual distance):
There are sequences of rationals that converge (in ) to irrational numbers; these are Cauchy sequences having no limit in In fact, if a real number x is irrational, then the sequence (xn), whose n-th term is the truncation to n decimal places of the decimal expansion of x, gives a Cauchy sequence of rational numbers with irrational limit x. Irrational numbers certainly exist in for example:

Non-example: open interval

The open interval in the set of real numbers with an ordinary distance in is not a complete space: there is a sequence in it, which is Cauchy (for arbitrarily small distance bound all terms of fit in the interval), however does not converge in — its 'limit', number 0, does not belong to the space

Other properties

These last two properties, together with the Bolzano–Weierstrass theorem, yield one standard proof of the completeness of the real numbers, closely related to both the Bolzano–Weierstrass theorem and the Heine–Borel theorem. Every Cauchy sequence of real numbers is bounded, hence by Bolzano–Weierstrass has a convergent subsequence, hence is itself convergent. This proof of the completeness of the real numbers implicitly makes use of the least upper bound axiom. The alternative approach, mentioned above, of constructing the real numbers as the completion of the rational numbers, makes the completeness of the real numbers tautological.

One of the standard illustrations of the advantage of being able to work with Cauchy sequences and make use of completeness is provided by consideration of the summation of an infinite series of real numbers (or, more generally, of elements of any complete normed linear space, or Banach space). Such a series is considered to be convergent if and only if the sequence of partial sums is convergent, where It is a routine matter to determine whether the sequence of partial sums is Cauchy or not, since for positive integers

If is a uniformly continuous map between the metric spaces M and N and (xn) is a Cauchy sequence in M, then is a Cauchy sequence in N. If and are two Cauchy sequences in the rational, real or complex numbers, then the sum and the product are also Cauchy sequences.

Generalizations

In topological vector spaces

There is also a concept of Cauchy sequence for a topological vector space : Pick a local base for about 0; then () is a Cauchy sequence if for each member there is some number such that whenever is an element of If the topology of is compatible with a translation-invariant metric the two definitions agree.

In topological groups

Since the topological vector space definition of Cauchy sequence requires only that there be a continuous "subtraction" operation, it can just as well be stated in the context of a topological group: A sequence in a topological group is a Cauchy sequence if for every open neighbourhood of the identity in there exists some number such that whenever it follows that As above, it is sufficient to check this for the neighbourhoods in any local base of the identity in

As in the construction of the completion of a metric space, one can furthermore define the binary relation on Cauchy sequences in that and are equivalent if for every open neighbourhood of the identity in there exists some number such that whenever it follows that This relation is an equivalence relation: It is reflexive since the sequences are Cauchy sequences. It is symmetric since which by continuity of the inverse is another open neighbourhood of the identity. It is transitive since where and are open neighbourhoods of the identity such that ; such pairs exist by the continuity of the group operation.

In groups

There is also a concept of Cauchy sequence in a group : Let be a decreasing sequence of normal subgroups of of finite index. Then a sequence in is said to be Cauchy (with respect to ) if and only if for any there is such that for all

Technically, this is the same thing as a topological group Cauchy sequence for a particular choice of topology on namely that for which is a local base.

The set of such Cauchy sequences forms a group (for the componentwise product), and the set of null sequences (sequences such that ) is a normal subgroup of The factor group is called the completion of with respect to

One can then show that this completion is isomorphic to the inverse limit of the sequence

An example of this construction familiar in number theory and algebraic geometry is the construction of the -adic completion of the integers with respect to a prime In this case, is the integers under addition, and is the additive subgroup consisting of integer multiples of

If is a cofinal sequence (that is, any normal subgroup of finite index contains some ), then this completion is canonical in the sense that it is isomorphic to the inverse limit of where varies over all normal subgroups of finite index. For further details, see Ch. I.10 in Lang's "Algebra".

In a hyperreal continuum

A real sequence has a natural hyperreal extension, defined for hypernatural values H of the index n in addition to the usual natural n. The sequence is Cauchy if and only if for every infinite H and K, the values and are infinitely close, or adequal, that is,

where "st" is the standard part function.

Cauchy completion of categories

Krause (2020) introduced a notion of Cauchy completion of a category. Applied to (the category whose objects are rational numbers, and there is a morphism from x to y if and only if ), this Cauchy completion yields (again interpreted as a category using its natural ordering).

See also

Related Research Articles

In mathematics, a continuous function is a function such that a small variation of the argument induces a small variation of the value of the function. This implies there are no abrupt changes in value, known as discontinuities. More precisely, a function is continuous if arbitrarily small changes in its value can be assured by restricting to sufficiently small changes of its argument. A discontinuous function is a function that is not continuous. Until the 19th century, mathematicians largely relied on intuitive notions of continuity and considered only continuous functions. The epsilon–delta definition of a limit was introduced to formalize the definition of continuity.

In mathematical analysis, a metric space M is called complete if every Cauchy sequence of points in M has a limit that is also in M.

<span class="mw-page-title-main">Metric space</span> Mathematical space with a notion of distance

In mathematics, a metric space is a set together with a notion of distance between its elements, usually called points. The distance is measured by a function called a metric or distance function. Metric spaces are the most general setting for studying many of the concepts of mathematical analysis and geometry.

In mathematics, the branch of real analysis studies the behavior of real numbers, sequences and series of real numbers, and real functions. Some particular properties of real-valued sequences and functions that real analysis studies include convergence, limits, continuity, smoothness, differentiability and integrability.

<span class="mw-page-title-main">Sequence</span> Finite or infinite ordered list of elements

In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members. The number of elements is called the length of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an arbitrary index set.

<span class="mw-page-title-main">Uniform continuity</span> Uniform restraint of the change in functions

In mathematics, a real function of real numbers is said to be uniformly continuous if there is a positive real number such that function values over any function domain interval of the size are as close to each other as we want. In other words, for a uniformly continuous real function of real numbers, if we want function value differences to be less than any positive real number , then there is a positive real number such that at any and in any function interval of the size .

<span class="mw-page-title-main">Dirac delta function</span> Generalized function whose value is zero everywhere except at zero

In mathematical analysis, the Dirac delta function, also known as the unit impulse, is a generalized function on the real numbers, whose value is zero everywhere except at zero, and whose integral over the entire real line is equal to one. Since there is no function having this property, to model the delta "function" rigorously involves the use of limits or, as is common in mathematics, measure theory and the theory of distributions.

<span class="mw-page-title-main">Limit inferior and limit superior</span> Bounds of a sequence

In mathematics, the limit inferior and limit superior of a sequence can be thought of as limiting bounds on the sequence. They can be thought of in a similar fashion for a function. For a set, they are the infimum and supremum of the set's limit points, respectively. In general, when there are multiple objects around which a sequence, function, or set accumulates, the inferior and superior limits extract the smallest and largest of them; the type of object and the measure of size is context-dependent, but the notion of extreme limits is invariant. Limit inferior is also called infimum limit, limit infimum, liminf, inferior limit, lower limit, or inner limit; limit superior is also known as supremum limit, limit supremum, limsup, superior limit, upper limit, or outer limit.

<span class="mw-page-title-main">Uniform convergence</span> Mode of convergence of a function sequence

In the mathematical field of analysis, uniform convergence is a mode of convergence of functions stronger than pointwise convergence, in the sense that the convergence is uniform over the domain. A sequence of functions converges uniformly to a limiting function on a set as the function domain if, given any arbitrarily small positive number , a number can be found such that each of the functions differs from by no more than at every pointin. Described in an informal way, if converges to uniformly, then how quickly the functions approach is "uniform" throughout in the following sense: in order to guarantee that differs from by less than a chosen distance , we only need to make sure that is larger than or equal to a certain , which we can find without knowing the value of in advance. In other words, there exists a number that could depend on but is independent of , such that choosing will ensure that for all . In contrast, pointwise convergence of to merely guarantees that for any given in advance, we can find such that, for that particular, falls within of whenever .

In probability theory, there exist several different notions of convergence of sequences of random variables. The different notions of convergence capture different properties about the sequence, with some notions of convergence being stronger than others. For example, convergence in distribution tells us about the limit distribution of a sequence of random variables. This is a weaker notion than convergence in probability, which tells us about the value a random variable will take, rather than just the distribution.

In mathematics, an infinite series of numbers is said to converge absolutely if the sum of the absolute values of the summands is finite. More precisely, a real or complex series is said to converge absolutely if for some real number Similarly, an improper integral of a function, is said to converge absolutely if the integral of the absolute value of the integrand is finite—that is, if

In mathematics, the limit of a function is a fundamental concept in calculus and analysis concerning the behavior of that function near a particular input which may or may not be in the domain of the function.

<span class="mw-page-title-main">Limit of a sequence</span> Value to which tends an infinite sequence

In mathematics, the limit of a sequence is the value that the terms of a sequence "tend to", and is often denoted using the symbol. If such a limit exists, the sequence is called convergent. A sequence that does not converge is said to be divergent. The limit of a sequence is said to be the fundamental notion on which the whole of mathematical analysis ultimately rests.

The Arzelà–Ascoli theorem is a fundamental result of mathematical analysis giving necessary and sufficient conditions to decide whether every sequence of a given family of real-valued continuous functions defined on a closed and bounded interval has a uniformly convergent subsequence. The main condition is the equicontinuity of the family of functions. The theorem is the basis of many proofs in mathematics, including that of the Peano existence theorem in the theory of ordinary differential equations, Montel's theorem in complex analysis, and the Peter–Weyl theorem in harmonic analysis and various results concerning compactness of integral operators.

In mathematics, the Riesz–Fischer theorem in real analysis is any of a number of closely related results concerning the properties of the space L2 of square integrable functions. The theorem was proven independently in 1907 by Frigyes Riesz and Ernst Sigismund Fischer.

The Cauchy convergence test is a method used to test infinite series for convergence. It relies on bounding sums of terms in the series. This convergence criterion is named after Augustin-Louis Cauchy who published it in his textbook Cours d'Analyse 1821.

In mathematics, a sequence of functions from a set S to a metric space M is said to be uniformly Cauchy if:

<span class="mw-page-title-main">Real number</span> Number representing a continuous quantity

In mathematics, a real number is a number that can be used to measure a continuous one-dimensional quantity such as a distance, duration or temperature. Here, continuous means that pairs of values can have arbitrarily small differences. Every real number can be almost uniquely represented by an infinite decimal expansion.

In mathematics, a limit is the value that a function approaches as the input approaches some value. Limits are essential to calculus and mathematical analysis, and are used to define continuity, derivatives, and integrals.

<span class="mw-page-title-main">Graphon</span>

In graph theory and statistics, a graphon is a symmetric measurable function , that is important in the study of dense graphs. Graphons arise both as a natural notion for the limit of a sequence of dense graphs, and as the fundamental defining objects of exchangeable random graph models. Graphons are tied to dense graphs by the following pair of observations: the random graph models defined by graphons give rise to dense graphs almost surely, and, by the regularity lemma, graphons capture the structure of arbitrary large dense graphs.

References

  1. Lang 1992.
  2. Ebbinghaus, Heinz-Dieter (1991). Numbers. New York: Springer. p. 40.

Further reading