In the mathematical field of analysis, uniform convergence is a mode of convergence of functions stronger than pointwise convergence. A sequence of functions converges uniformly to a limiting function on a set if, given any arbitrarily small positive number , a number can be found such that each of the functions differ from by no more than at every point in . Described in an informal way, if converges to uniformly, then the rate at which approaches is "uniform" throughout its domain in the following sense: in order to determine how large needs to be to guarantee that falls within a certain distance of , we do not need to know the value of in question -- there is a single value of independent of , such that choosing to be larger than will suffice.
The difference between uniform convergence and pointwise convergence was not fully appreciated early in the history of calculus, leading to instances of faulty reasoning. The concept, which was first formalized by Karl Weierstrass, is important because several properties of the functions , such as continuity, Riemann integrability, and, with additional hypotheses, differentiability, are transferred to the limit if the convergence is uniform, but not necessarily if the convergence is not uniform.
In 1821 Augustin-Louis Cauchy published a proof that a convergent sum of continuous functions is always continuous, to which Niels Henrik Abel in 1826 found purported counterexamples in the context of Fourier series, arguing that Cauchy's proof had to be incorrect. Completely standard notions of convergence did not exist at the time, and Cauchy handled convergence using infinitesimal methods. When put into the modern language, what Cauchy proved is that a uniformly convergent sequence of continuous functions has a continuous limit. The failure of a merely pointwise-convergent limit of continuous functions to converge to a continuous function illustrates the importance of distinguishing between different types of convergence when handling sequences of functions.
The term uniform convergence was probably first used by Christoph Gudermann, in an 1838 paper on elliptic functions, where he employed the phrase "convergence in a uniform way" when the "mode of convergence" of a series is independent of the variables and While he thought it a "remarkable fact" when a series converged in this way, he did not give a formal definition, nor use the property in any of his proofs.
Later Gudermann's pupil Karl Weierstrass, who attended his course on elliptic functions in 1839-1840, coined the term gleichmäßig konvergent (German: uniformly convergent) which he used in his 1841 paper Zur Theorie der Potenzreihen, published in 1894. Independently, similar concepts were articulated by Philipp Ludwig von Seidel and George Gabriel Stokes. G. H. Hardy compares the three definitions in his paper "Sir George Stokes and the concept of uniform convergence" and remarks: "Weierstrass's discovery was the earliest, and he alone fully realized its far-reaching importance as one of the fundamental ideas of analysis."
Under the influence of Weierstrass and Bernhard Riemann this concept and related questions were intensely studied at the end of the 19th century by Hermann Hankel, Paul du Bois-Reymond, Ulisse Dini, Cesare Arzelà and others.
Suppose is a set and is a sequence of real-valued functions on it. We say the sequence is uniformly convergent on with limit if for every there exists a natural number such that for all and
The notation for uniform convergence of to is not quite standardized and different authors have used a variety of symbols, including (in roughly decreasing order of popularity):
Frequently, no special symbol is used, and authors simply write
to indicate that convergence is uniform. (In contrast, the expression on without an adverb is taken to mean pointwise convergence on : for all , as .)
Since is a complete metric space, the Cauchy criterion can be used to give an equivalent alternative formulation for uniform convergence: converges uniformly on (in the previous sense) if and only if for every , there exists a natural number such that
In yet another equivalent formulation, if we define
then converges to uniformly if and only if as . Thus, we can characterize uniform convergence of on as (simple) convergence of in the function space with respect to the uniform metric (also called the supremum metric), defined by
The sequence is said to be locally uniformly convergent with limit if is a metric space and for every , there exists an such that converges uniformly on It is clear that uniform convergence implies local uniform convergence, which implies pointwise convergence.
Intuitively, a sequence of functions converges uniformly to if, given an arbitrarily small , we can find an so that the functions with all fall within a "tube" of width centered around (i.e., between and ) for the entire domain of the function.
Note that interchanging the order of quantifiers in the definition of uniform convergence by moving "for all " in front of "there exists a natural number " results in a definition of pointwise convergence of the sequence. To make this difference explicit, in the case of uniform convergence, can only depend on , and the choice of has to work for all , for a specific value of that is given. In contrast, in the case of pointwise convergence, may depend on both and , and the choice of only has to work for the specific values of and that are given. Thus uniform convergence implies pointwise convergence, however the converse is not true, as the example in the section below illustrates.
One may straightforwardly extend the concept to functions E -> M, where (M, d) is a metric space, by replacing with .
The most general setting is the uniform convergence of nets of functions E -> X, where X is a uniform space. We say that the net converges uniformly with limit f : E -> X if and only if for every entourage V in X, there exists an , such that for every x in E and every , is in V. In this situation, uniform limit of continuous functions remains continuous.
Uniform convergence admits a simplified definition in a hyperreal setting. Thus, a sequence converges to f uniformly if for all x in the domain of and all infinite n, is infinitely close to (see microcontinuity for a similar definition of uniform continuity).
The sequence of functions
is a classic example of a sequence of functions that converges to a function pointwise but not uniformly. To show this, we first observe that the pointwise limit of as is the function , given by
Pointwise convergence: Convergence is trivial for and , since and , for all . For and given , we can ensure that whenever by choosing (here the upper square brackets indicate rounding up, see ceiling function). Hence, pointwise for all . Note that the choice of depends on the value of and . Moreover, for a fixed choice of , (which cannot be defined to be smaller) grows without bound as approaches 1. These observations preclude the possibility of uniform convergence.
Non-uniformity of convergence: The convergence is not uniform, because we can find an so that no matter how large we choose there will be values of and such that To see this, first observe that regardless of how large becomes, there is always an such that Thus, if we choose we can never find an such that for all and . Explicitly, whatever candidate we choose for , consider the value of at . Since
the candidate fails because we have found an example of an that "escaped" our attempt to "confine" each to within of for all . In fact, it is easy to see that
contrary to the requirement that if .
In this example one can easily see that pointwise convergence does not preserve differentiability or continuity. While each function of the sequence is smooth, that is to say that for all n, , the limit is not even continuous.
Theorem (Weierstrass M-test). Let be a sequence of functions and let be a sequence of positive real numbers such that for all and If converges, then converges uniformly on .
The complex exponential function can be expressed as the series:
Any bounded subset is a subset of some disc of radius centered on the origin in the complex plane. The Weierstrass M-test requires us to find an upper bound on the terms of the series, with independent of the position in the disc:
To do this, we notice
If is convergent, then the M-test asserts that the original series is uniformly convergent.
The ratio test can be used here:
which means the series over is convergent. Thus the original series converges uniformly for all and since , the series is also uniformly convergent on
If and are topological spaces, then it makes sense to talk about the continuity of the functions . If we further assume that is a metric space, then (uniform) convergence of the to is also well defined. The following result states that continuity is preserved by uniform convergence:
This theorem is proved by the "ε/3 trick", and is the archetypal example of this trick: to prove a given inequality (ε), one uses the definitions of continuity and uniform convergence to produce 3 inequalities (ε/3), and then combines them via the triangle inequality to produce the desired inequality.
This theorem is an important one in the history of real and Fourier analysis, since many 18th century mathematicians had the intuitive understanding that a sequence of continuous functions always converges to a continuous function. The image above shows a counterexample, and many discontinuous functions could, in fact, be written as a Fourier series of continuous functions. The erroneous claim that the pointwise limit of a sequence of continuous functions is continuous (originally stated in terms of convergent series of continuous functions) is infamously known as "Cauchy's wrong theorem". The uniform limit theorem shows that a stronger form of convergence, uniform convergence, is needed to ensure the preservation of continuity in the limit function.
More precisely, this theorem states that the uniform limit of uniformly continuous functions is uniformly continuous; for a locally compact space, continuity is equivalent to local uniform continuity, and thus the uniform limit of continuous functions is continuous.
If is an interval and all the functions are differentiable and converge to a limit , it is often desirable to determine the derivative function by taking the limit of the sequence . This is however in general not possible: even if the convergence is uniform, the limit function need not be differentiable (not even if the sequence consists of everywhere-analytic functions, see Weierstrass function), and even if it is differentiable, the derivative of the limit function need not be equal to the limit of the derivatives. Consider for instance with uniform limit . Clearly, is also identically zero. However, the derivatives of the sequence of functions are given by and the sequence does not converge to or even to any function at all. In order to ensure a connection between the limit of a sequence of differentiable functions and the limit of the sequence of derivatives, the uniform convergence of the sequence of derivatives plus the convergence of the sequence of functions at at least one point is required. The precise statement covering this situation is as follows:
Similarly, one often wants to exchange integrals and limit processes. For the Riemann integral, this can be done if uniform convergence is assumed:
In fact, for a uniformly convergent family of bounded functions on an interval, the upper and lower Riemann integrals converge to the upper and lower Riemann integrals of the limit function. This follows because, for n sufficiently large, the graph of is within ε of the graph of f, and so the upper sum and lower sum of are each within of the value of the upper and lower sums of , respectively.
Much stronger theorems in this respect, which require not much more than pointwise convergence, can be obtained if one abandons the Riemann integral and uses the Lebesgue integral instead.
If a sequence of analytic functions converges uniformly in a region S of the complex plane, then the limit is analytic in S. This example demonstrates that complex functions are more well-behaved than real functions, since the uniform limit of analytic functions on a real interval need not even be differentiable (see Weierstrass function).
We say that converges:
i) pointwise on E if and only if the sequence of partial sums converges for every .
ii) uniformly on E if and only if sn converges uniformly as .
iii) absolutely on E if and only if converges for every .
With this definition comes the following result:
Let x0be contained in the set E and each fn be continuous at x0. If converges uniformly on E then f is continuous at x0in E. Suppose that and each fn is integrable on E. If converges uniformly on E then f is integrable on E and the series of integrals of fn is equal to integral of the series of fn.
If the domain of the functions is a measure space E then the related notion of almost uniform convergence can be defined. We say a sequence of functions converges almost uniformly on E if for every there exists a measurable set with measure less than such that the sequence of functions converges uniformly on . In other words, almost uniform convergence means there are sets of arbitrarily small measure for which the sequence of functions converges uniformly on their complement.
Note that almost uniform convergence of a sequence does not mean that the sequence converges uniformly almost everywhere as might be inferred from the name. However, Egorov's theorem does guarantee that on a finite measure space, a sequence of functions that converges almost everywhere also converges almost uniformly on the same set.