Uniform convergence

From HandWiki
Short description: Mode of convergence of a function sequence
A sequence of functions (fₙ) converges uniformly to f when for arbitrary small ε there is an index N such that the graph of fₙ is in the ε-tube around f whenever n ≥ N.

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 [math]\displaystyle{ (f_n) }[/math] converges uniformly to a limiting function [math]\displaystyle{ f }[/math] on a set [math]\displaystyle{ E }[/math] as the function domain if, given any arbitrarily small positive number [math]\displaystyle{ \epsilon }[/math], a number [math]\displaystyle{ N }[/math] can be found such that each of the functions [math]\displaystyle{ f_N, f_{N+1},f_{N+2},\ldots }[/math] differs from [math]\displaystyle{ f }[/math] by no more than [math]\displaystyle{ \epsilon }[/math] at every point [math]\displaystyle{ x }[/math] in [math]\displaystyle{ E }[/math]. Described in an informal way, if [math]\displaystyle{ f_n }[/math] converges to [math]\displaystyle{ f }[/math] uniformly, then how quickly the functions [math]\displaystyle{ f_n }[/math] approach [math]\displaystyle{ f }[/math] is "uniform" throughout [math]\displaystyle{ E }[/math] in the following sense: in order to guarantee that [math]\displaystyle{ f_n(x) }[/math] differs from [math]\displaystyle{ f(x) }[/math] by less than a chosen distance [math]\displaystyle{ \epsilon }[/math], we only need to make sure that [math]\displaystyle{ n }[/math] is larger than or equal to a certain [math]\displaystyle{ N }[/math], which we can find without knowing the value of [math]\displaystyle{ x\in E }[/math] in advance. In other words, there exists a number [math]\displaystyle{ N=N(\epsilon) }[/math] that could depend on [math]\displaystyle{ \epsilon }[/math] but is independent of [math]\displaystyle{ x }[/math], such that choosing [math]\displaystyle{ n\geq N }[/math] will ensure that [math]\displaystyle{ |f_n(x)-f(x)|\lt \epsilon }[/math] for all [math]\displaystyle{ x\in E }[/math]. In contrast, pointwise convergence of [math]\displaystyle{ f_n }[/math] to [math]\displaystyle{ f }[/math] merely guarantees that for any [math]\displaystyle{ x\in E }[/math] given in advance, we can find [math]\displaystyle{ N=N(\epsilon, x) }[/math] (i.e., [math]\displaystyle{ N }[/math] could depend on the values of both [math]\displaystyle{ \epsilon }[/math] and [math]\displaystyle{ x }[/math]) such that, for that particular [math]\displaystyle{ x }[/math], [math]\displaystyle{ f_n(x) }[/math] falls within [math]\displaystyle{ \epsilon }[/math] of [math]\displaystyle{ f(x) }[/math] whenever [math]\displaystyle{ n\geq N }[/math] (and a different [math]\displaystyle{ x }[/math] may require a different, larger [math]\displaystyle{ N }[/math] for [math]\displaystyle{ n\geq N }[/math] to guarantee that [math]\displaystyle{ |f_n(x)-f(x)|\lt \epsilon }[/math]).

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 [math]\displaystyle{ f_n }[/math], such as continuity, Riemann integrability, and, with additional hypotheses, differentiability, are transferred to the limit [math]\displaystyle{ f }[/math] 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.[1]

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 [math]\displaystyle{ \sum_{n=1}^\infty f_n(x,\phi,\psi) }[/math] is independent of the variables [math]\displaystyle{ \phi }[/math] and [math]\displaystyle{ \psi. }[/math] 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.[2]

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[3] 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.


We first define uniform convergence for real-valued functions, although the concept is readily generalized to functions mapping to metric spaces and, more generally, uniform spaces (see below).

Suppose [math]\displaystyle{ E }[/math] is a set and [math]\displaystyle{ (f_n)_{n \in \N} }[/math] is a sequence of real-valued functions on it. We say the sequence [math]\displaystyle{ (f_n)_{n \in \N} }[/math] is uniformly convergent on [math]\displaystyle{ E }[/math] with limit [math]\displaystyle{ f: E \to \R }[/math] if for every [math]\displaystyle{ \epsilon \gt 0, }[/math] there exists a natural number [math]\displaystyle{ N }[/math] such that for all [math]\displaystyle{ n \geq N }[/math] and for all [math]\displaystyle{ x \in E }[/math]

[math]\displaystyle{ |f_n(x)-f(x)|\lt \epsilon. }[/math]

The notation for uniform convergence of [math]\displaystyle{ f_n }[/math] to [math]\displaystyle{ f }[/math] is not quite standardized and different authors have used a variety of symbols, including (in roughly decreasing order of popularity):

[math]\displaystyle{ f_n\rightrightarrows f, \quad \underset{n\to\infty}{\mathrm{unif\ lim}}f_n = f, \quad f_n \overset{\mathrm{unif.}}{\longrightarrow} f, \quad f=\mathrm{u}\!\!-\!\!\!\lim_{n\to\infty} f_n . }[/math]

Frequently, no special symbol is used, and authors simply write

[math]\displaystyle{ f_n\to f \quad \mathrm{uniformly} }[/math]

to indicate that convergence is uniform. (In contrast, the expression [math]\displaystyle{ f_n\to f }[/math] on [math]\displaystyle{ E }[/math] without an adverb is taken to mean pointwise convergence on [math]\displaystyle{ E }[/math]: for all [math]\displaystyle{ x \in E }[/math], [math]\displaystyle{ f_n(x)\to f(x) }[/math] as [math]\displaystyle{ n\to\infty }[/math].)

Since [math]\displaystyle{ \R }[/math] is a complete metric space, the Cauchy criterion can be used to give an equivalent alternative formulation for uniform convergence: [math]\displaystyle{ (f_n)_{n\in\N} }[/math] converges uniformly on [math]\displaystyle{ E }[/math] (in the previous sense) if and only if for every [math]\displaystyle{ \epsilon \gt 0 }[/math], there exists a natural number [math]\displaystyle{ N }[/math] such that

[math]\displaystyle{ x\in E, m,n\geq N \implies |f_m(x)-f_n(x)|\lt \epsilon }[/math].

In yet another equivalent formulation, if we define

[math]\displaystyle{ d_n = \sup_{x\in E} |f_n(x) - f(x) |, }[/math]

then [math]\displaystyle{ f_n }[/math] converges to [math]\displaystyle{ f }[/math] uniformly if and only if [math]\displaystyle{ d_n\to 0 }[/math] as [math]\displaystyle{ n\to\infty }[/math]. Thus, we can characterize uniform convergence of [math]\displaystyle{ (f_n)_{n \in \N} }[/math] on [math]\displaystyle{ E }[/math] as (simple) convergence of [math]\displaystyle{ (f_n)_{n \in \N} }[/math] in the function space [math]\displaystyle{ \R^E }[/math] with respect to the uniform metric (also called the supremum metric), defined by

[math]\displaystyle{ d(f,g)=\sup_{x\in E} |f(x)-g(x)|. }[/math]


[math]\displaystyle{ f_n\rightrightarrows f\iff d(f_n,f) \to 0 }[/math].

The sequence [math]\displaystyle{ (f_n)_{n \in \N} }[/math] is said to be locally uniformly convergent with limit [math]\displaystyle{ f }[/math] if [math]\displaystyle{ E }[/math] is a metric space and for every [math]\displaystyle{ x\in E }[/math], there exists an [math]\displaystyle{ r \gt 0 }[/math] such that [math]\displaystyle{ (f_n) }[/math] converges uniformly on [math]\displaystyle{ B(x,r)\cap E. }[/math] It is clear that uniform convergence implies local uniform convergence, which implies pointwise convergence.


Intuitively, a sequence of functions [math]\displaystyle{ f_n }[/math] converges uniformly to [math]\displaystyle{ f }[/math] if, given an arbitrarily small [math]\displaystyle{ \epsilon\gt 0 }[/math], we can find an [math]\displaystyle{ N\in\N }[/math] so that the functions [math]\displaystyle{ f_n }[/math] with [math]\displaystyle{ n\gt N }[/math] all fall within a "tube" of width [math]\displaystyle{ 2\epsilon }[/math] centered around [math]\displaystyle{ f }[/math] (i.e., between [math]\displaystyle{ f(x)-\epsilon }[/math] and [math]\displaystyle{ f(x)+\epsilon }[/math]) for the entire domain of the function.

Note that interchanging the order of quantifiers in the definition of uniform convergence by moving "for all [math]\displaystyle{ x\in E }[/math]" in front of "there exists a natural number [math]\displaystyle{ N }[/math]" results in a definition of pointwise convergence of the sequence. To make this difference explicit, in the case of uniform convergence, [math]\displaystyle{ N=N(\epsilon) }[/math] can only depend on [math]\displaystyle{ \epsilon }[/math], and the choice of [math]\displaystyle{ N }[/math] has to work for all [math]\displaystyle{ x\in E }[/math], for a specific value of [math]\displaystyle{ \epsilon }[/math] that is given. In contrast, in the case of pointwise convergence, [math]\displaystyle{ N=N(\epsilon,x) }[/math] may depend on both [math]\displaystyle{ \epsilon }[/math] and [math]\displaystyle{ x }[/math], and the choice of [math]\displaystyle{ N }[/math] only has to work for the specific values of [math]\displaystyle{ \epsilon }[/math] and [math]\displaystyle{ x }[/math] 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 EM, where (M, d) is a metric space, by replacing [math]\displaystyle{ |f_n(x)-f(x)| }[/math] with [math]\displaystyle{ d(f_n(x),f(x)) }[/math].

The most general setting is the uniform convergence of nets of functions EX, where X is a uniform space. We say that the net [math]\displaystyle{ (f_\alpha) }[/math] converges uniformly with limit f : EX if and only if for every entourage V in X, there exists an [math]\displaystyle{ \alpha_0 }[/math], such that for every x in E and every [math]\displaystyle{ \alpha\geq \alpha_0 }[/math], [math]\displaystyle{ (f_\alpha(x),f(x)) }[/math] is in V. In this situation, uniform limit of continuous functions remains continuous.

Definition in a hyperreal setting

Uniform convergence admits a simplified definition in a hyperreal setting. Thus, a sequence [math]\displaystyle{ f_n }[/math] converges to f uniformly if for all x in the domain of [math]\displaystyle{ f^* }[/math] and all infinite n, [math]\displaystyle{ f_n^*(x) }[/math] is infinitely close to [math]\displaystyle{ f^*(x) }[/math] (see microcontinuity for a similar definition of uniform continuity).


For [math]\displaystyle{ x \in [0,1) }[/math], a basic example of uniform convergence can be illustrated as follows: the sequence [math]\displaystyle{ (1/2)^{x+n} }[/math] converges uniformly, while [math]\displaystyle{ x^n }[/math] does not. Specifically, assume [math]\displaystyle{ \epsilon=1/4 }[/math]. Each function [math]\displaystyle{ (1/2)^{x+n} }[/math] is less than or equal to [math]\displaystyle{ 1/4 }[/math] when [math]\displaystyle{ n \geq 2 }[/math], regardless of the value of [math]\displaystyle{ x }[/math]. On the other hand, [math]\displaystyle{ x^n }[/math] is only less than or equal to [math]\displaystyle{ 1/4 }[/math] at ever increasing values of [math]\displaystyle{ n }[/math] when values of [math]\displaystyle{ x }[/math] are selected closer and closer to 1 (explained more in depth further below).

Given a topological space X, we can equip the space of bounded real or complex-valued functions over X with the uniform norm topology, with the uniform metric defined by

[math]\displaystyle{ d(f,g)=\|f-g\|_{\infty}=\sup_{x\in X} |f(x)-g(x)|. }[/math]

Then uniform convergence simply means convergence in the uniform norm topology:

[math]\displaystyle{ \lim_{n\to\infty}\|f_n-f\|_{\infty}=0 }[/math].

The sequence of functions [math]\displaystyle{ (f_n) }[/math]

[math]\displaystyle{ \begin{cases} f_n:[0,1]\to [0,1] \\ f_n(x)=x^n \end{cases} }[/math]

is a classic example of a sequence of functions that converges to a function [math]\displaystyle{ f }[/math] pointwise but not uniformly. To show this, we first observe that the pointwise limit of [math]\displaystyle{ (f_n) }[/math] as [math]\displaystyle{ n\to\infty }[/math] is the function [math]\displaystyle{ f }[/math], given by

[math]\displaystyle{ f(x) = \lim_{n\to \infty} f_n(x) = \begin{cases} 0, & x \in [0,1); \\ 1, & x=1. \end{cases} }[/math]

Pointwise convergence: Convergence is trivial for [math]\displaystyle{ x=0 }[/math] and [math]\displaystyle{ x=1 }[/math], since [math]\displaystyle{ f_n(0)=f(0)=0 }[/math] and [math]\displaystyle{ f_n(1)=f(1)=1 }[/math], for all [math]\displaystyle{ n }[/math]. For [math]\displaystyle{ x \in (0,1) }[/math] and given [math]\displaystyle{ \epsilon\gt 0 }[/math], we can ensure that [math]\displaystyle{ |f_n(x)-f(x)|\lt \epsilon }[/math] whenever [math]\displaystyle{ n\geq N }[/math] by choosing [math]\displaystyle{ N = \lceil\log\epsilon/\log x\rceil }[/math], which is the minimum integer exponent of [math]\displaystyle{ x }[/math] that allows it to reach or dip below [math]\displaystyle{ \epsilon }[/math] (here the upper square brackets indicate rounding up, see ceiling function). Hence, [math]\displaystyle{ f_n\to f }[/math] pointwise for all [math]\displaystyle{ x\in[0,1] }[/math]. Note that the choice of [math]\displaystyle{ N }[/math] depends on the value of [math]\displaystyle{ \epsilon }[/math] and [math]\displaystyle{ x }[/math]. Moreover, for a fixed choice of [math]\displaystyle{ \epsilon }[/math], [math]\displaystyle{ N }[/math] (which cannot be defined to be smaller) grows without bound as [math]\displaystyle{ x }[/math] approaches 1. These observations preclude the possibility of uniform convergence.

Non-uniformity of convergence: The convergence is not uniform, because we can find an [math]\displaystyle{ \epsilon\gt 0 }[/math] so that no matter how large we choose [math]\displaystyle{ N, }[/math] there will be values of [math]\displaystyle{ x \in [0,1] }[/math] and [math]\displaystyle{ n \geq N }[/math] such that [math]\displaystyle{ |f_n(x)-f(x)|\geq\epsilon. }[/math] To see this, first observe that regardless of how large [math]\displaystyle{ n }[/math] becomes, there is always an [math]\displaystyle{ x_0 \in [0,1) }[/math] such that [math]\displaystyle{ f_n(x_0)=1/2. }[/math] Thus, if we choose [math]\displaystyle{ \epsilon = 1/4, }[/math] we can never find an [math]\displaystyle{ N }[/math] such that [math]\displaystyle{ |f_n(x)-f(x)|\lt \epsilon }[/math] for all [math]\displaystyle{ x\in[0,1] }[/math] and [math]\displaystyle{ n\geq N }[/math]. Explicitly, whatever candidate we choose for [math]\displaystyle{ N }[/math], consider the value of [math]\displaystyle{ f_N }[/math] at [math]\displaystyle{ x_0 = (1/2)^{1/N} }[/math]. Since

[math]\displaystyle{ \left|f_N(x_0) - f(x_0)\right| = \left| \left[ \left(\frac{1}{2}\right)^{\frac{1}{N}} \right]^N - 0 \right| = \frac{1}{2} \gt \frac{1}{4} = \epsilon, }[/math]

the candidate fails because we have found an example of an [math]\displaystyle{ x\in[0,1] }[/math] that "escaped" our attempt to "confine" each [math]\displaystyle{ f_n\ (n\geq N) }[/math] to within [math]\displaystyle{ \epsilon }[/math] of [math]\displaystyle{ f }[/math] for all [math]\displaystyle{ x\in[0,1] }[/math]. In fact, it is easy to see that

[math]\displaystyle{ \lim_{n\to\infty}\|f_n-f\|_{\infty}=1, }[/math]

contrary to the requirement that [math]\displaystyle{ \|f_n-f\|_{\infty}\to 0 }[/math] if [math]\displaystyle{ f_n \rightrightarrows f }[/math].

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, [math]\displaystyle{ f_n\in C^{\infty}([0,1]) }[/math], the limit [math]\displaystyle{ \lim_{n\to \infty}f_n }[/math] is not even continuous.

Exponential function

The series expansion of the exponential function can be shown to be uniformly convergent on any bounded subset [math]\displaystyle{ S \subset \C }[/math] using the Weierstrass M-test.

Theorem (Weierstrass M-test). Let [math]\displaystyle{ (f_n) }[/math] be a sequence of functions [math]\displaystyle{ f_n:E\to \C }[/math] and let [math]\displaystyle{ M_n }[/math] be a sequence of positive real numbers such that [math]\displaystyle{ |f_n(x)|\le M_n }[/math] for all [math]\displaystyle{ x\in E }[/math] and [math]\displaystyle{ n=1,2, 3, \ldots }[/math] If [math]\displaystyle{ \sum_n M_n }[/math] converges, then [math]\displaystyle{ \sum_n f_n }[/math] converges absolutely and uniformly on [math]\displaystyle{ E }[/math].

The complex exponential function can be expressed as the series:

[math]\displaystyle{ \sum_{n=0}^{\infty}\frac{z^n}{n!}. }[/math]

Any bounded subset is a subset of some disc [math]\displaystyle{ D_R }[/math] of radius [math]\displaystyle{ R, }[/math] centered on the origin in the complex plane. The Weierstrass M-test requires us to find an upper bound [math]\displaystyle{ M_n }[/math] on the terms of the series, with [math]\displaystyle{ M_n }[/math] independent of the position in the disc:

[math]\displaystyle{ \left| \frac{z^n}{n!} \right|\le M_n, \forall z\in D_R. }[/math]

To do this, we notice

[math]\displaystyle{ \left| \frac{z^n}{n!}\right| \le \frac{|z|^n}{n!} \le \frac{R^n}{n!} }[/math]

and take [math]\displaystyle{ M_n=\tfrac{R^n}{n!}. }[/math]

If [math]\displaystyle{ \sum_{n=0}^{\infty}M_n }[/math] is convergent, then the M-test asserts that the original series is uniformly convergent.

The ratio test can be used here:

[math]\displaystyle{ \lim_{n \to \infty}\frac{M_{n+1}}{M_n}=\lim_{n \to \infty}\frac{R^{n+1}}{R^n}\frac{n!}{(n+1)!}=\lim_{n \to \infty}\frac{R}{n+1}=0 }[/math]

which means the series over [math]\displaystyle{ M_n }[/math] is convergent. Thus the original series converges uniformly for all [math]\displaystyle{ z\in D_R, }[/math] and since [math]\displaystyle{ S\subset D_R }[/math], the series is also uniformly convergent on [math]\displaystyle{ S. }[/math]


  • Every uniformly convergent sequence is locally uniformly convergent.
  • Every locally uniformly convergent sequence is compactly convergent.
  • For locally compact spaces local uniform convergence and compact convergence coincide.
  • A sequence of continuous functions on metric spaces, with the image metric space being complete, is uniformly convergent if and only if it is uniformly Cauchy.
  • If [math]\displaystyle{ S }[/math] is a compact interval (or in general a compact topological space), and [math]\displaystyle{ (f_n) }[/math] is a monotone increasing sequence (meaning [math]\displaystyle{ f_n(x) \leq f_{n+1}(x) }[/math] for all n and x) of continuous functions with a pointwise limit [math]\displaystyle{ f }[/math] which is also continuous, then the convergence is necessarily uniform (Dini's theorem). Uniform convergence is also guaranteed if [math]\displaystyle{ S }[/math] is a compact interval and [math]\displaystyle{ (f_n) }[/math] is an equicontinuous sequence that converges pointwise.


To continuity

Main page: Uniform limit theorem
Counterexample to a strengthening of the uniform convergence theorem, in which pointwise convergence, rather than uniform convergence, is assumed. The continuous green functions [math]\displaystyle{ \sin^n(x) }[/math] converge to the non-continuous red function. This can happen only if convergence is not uniform.

If [math]\displaystyle{ E }[/math] and [math]\displaystyle{ M }[/math] are topological spaces, then it makes sense to talk about the continuity of the functions [math]\displaystyle{ f_n,f:E\to M }[/math]. If we further assume that [math]\displaystyle{ M }[/math] is a metric space, then (uniform) convergence of the [math]\displaystyle{ f_n }[/math] to [math]\displaystyle{ f }[/math] is also well defined. The following result states that continuity is preserved by uniform convergence:

Uniform limit theorem — Suppose [math]\displaystyle{ E }[/math] is a topological space, [math]\displaystyle{ M }[/math] is a metric space, and [math]\displaystyle{ (f_n) }[/math] is a sequence of continuous functions [math]\displaystyle{ f_n:E\to M }[/math]. If [math]\displaystyle{ f_n \rightrightarrows f }[/math] on [math]\displaystyle{ E }[/math], then [math]\displaystyle{ f }[/math] is also continuous.

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.

To differentiability

If [math]\displaystyle{ S }[/math] is an interval and all the functions [math]\displaystyle{ f_n }[/math] are differentiable and converge to a limit [math]\displaystyle{ f }[/math], it is often desirable to determine the derivative function [math]\displaystyle{ f' }[/math] by taking the limit of the sequence [math]\displaystyle{ f'_n }[/math]. 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 [math]\displaystyle{ f_n(x) = n^{-1/2}{\sin(nx)} }[/math] with uniform limit [math]\displaystyle{ f_n\rightrightarrows f\equiv 0 }[/math]. Clearly, [math]\displaystyle{ f' }[/math] is also identically zero. However, the derivatives of the sequence of functions are given by [math]\displaystyle{ f'_n(x)=n^{1/2}\cos nx, }[/math] and the sequence [math]\displaystyle{ f'_n }[/math] does not converge to [math]\displaystyle{ f', }[/math] 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:[4]

If [math]\displaystyle{ (f_n) }[/math] is a sequence of differentiable functions on [math]\displaystyle{ [a,b] }[/math] such that [math]\displaystyle{ \lim_{n\to\infty} f_n(x_0) }[/math] exists (and is finite) for some [math]\displaystyle{ x_0\in[a,b] }[/math] and the sequence [math]\displaystyle{ (f'_n) }[/math] converges uniformly on [math]\displaystyle{ [a,b] }[/math], then [math]\displaystyle{ f_n }[/math] converges uniformly to a function [math]\displaystyle{ f }[/math] on [math]\displaystyle{ [a,b] }[/math], and [math]\displaystyle{ f'(x) = \lim_{n\to \infty} f'_n(x) }[/math] for [math]\displaystyle{ x \in [a, b] }[/math].

To integrability

Similarly, one often wants to exchange integrals and limit processes. For the Riemann integral, this can be done if uniform convergence is assumed:

If [math]\displaystyle{ (f_n)_{n=1}^\infty }[/math] is a sequence of Riemann integrable functions defined on a compact interval [math]\displaystyle{ I }[/math] which uniformly converge with limit [math]\displaystyle{ f }[/math], then [math]\displaystyle{ f }[/math] is Riemann integrable and its integral can be computed as the limit of the integrals of the [math]\displaystyle{ f_n }[/math]: [math]\displaystyle{ \int_I f = \lim_{n\to\infty}\int_I f_n. }[/math]

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 [math]\displaystyle{ f_n }[/math] is within ε of the graph of f, and so the upper sum and lower sum of [math]\displaystyle{ f_n }[/math] are each within [math]\displaystyle{ \varepsilon |I| }[/math] of the value of the upper and lower sums of [math]\displaystyle{ f }[/math], 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.

To analyticity

Using Morera's Theorem, one can show that 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).

To series

We say that [math]\displaystyle{ \sum_{n=1}^\infty f_n }[/math] converges:

  1. pointwise on E if and only if the sequence of partial sums [math]\displaystyle{ s_n(x)=\sum_{j=1}^{n} f_j(x) }[/math] converges for every [math]\displaystyle{ x\in E }[/math].
  2. uniformly on E if and only if sn converges uniformly as [math]\displaystyle{ n\to\infty }[/math].
  3. absolutely on E if and only if [math]\displaystyle{ \sum_{n=1}^\infty |f_n| }[/math] converges for every [math]\displaystyle{ x \in E }[/math].

With this definition comes the following result:

Let x0 be contained in the set E and each fn be continuous at x0. If [math]\displaystyle{ f = \sum_{n=1}^\infty f_n }[/math] converges uniformly on E then f is continuous at x0 in E. Suppose that [math]\displaystyle{ E = [a, b] }[/math] and each fn is integrable on E. If [math]\displaystyle{ \sum_{n=1}^\infty f_n }[/math] 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.

Almost uniform convergence

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 [math]\displaystyle{ (f_n) }[/math] converges almost uniformly on E if for every [math]\displaystyle{ \delta \gt 0 }[/math] there exists a measurable set [math]\displaystyle{ E_\delta }[/math] with measure less than [math]\displaystyle{ \delta }[/math] such that the sequence of functions [math]\displaystyle{ (f_n) }[/math] converges uniformly on [math]\displaystyle{ E \setminus E_\delta }[/math]. 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.

Almost uniform convergence implies almost everywhere convergence and convergence in measure.

See also


  1. Sørensen, Henrik Kragh (2005). "Exceptions and counterexamples: Understanding Abel's comment on Cauchy's Theorem". Historia Mathematica 32 (4): 453–480. doi:10.1016/j.hm.2004.11.010. 
  2. Jahnke, Hans Niels (2003). "6.7 The Foundation of Analysis in the 19th Century: Weierstrass". A history of analysis. AMS Bookstore. p. 184. ISBN 978-0-8218-2623-2. https://books.google.com/books?id=CVRZEXFVsZkC&pg=PA184. 
  3. Lakatos, Imre (1976). Proofs and Refutations. Cambridge University Press. pp. 141. ISBN 978-0-521-21078-2. 
  4. Rudin, Walter (1976). Principles of Mathematical Analysis 3rd edition, Theorem 7.17. McGraw-Hill: New York.


  • Konrad Knopp, Theory and Application of Infinite Series; Blackie and Son, London, 1954, reprinted by Dover Publications, ISBN 0-486-66165-2.
  • G. H. Hardy, Sir George Stokes and the concept of uniform convergence; Proceedings of the Cambridge Philosophical Society, 19, pp. 148–156 (1918)
  • Bourbaki; Elements of Mathematics: General Topology. Chapters 5–10 (paperback); ISBN 0-387-19374-X
  • Walter Rudin, Principles of Mathematical Analysis, 3rd ed., McGraw–Hill, 1976.
  • Gerald Folland, Real Analysis: Modern Techniques and Their Applications, Second Edition, John Wiley & Sons, Inc., 1999, ISBN 0-471-31716-0.
  • William Wade, An Introduction to Analysis, 3rd ed., Pearson, 2005

External links