Uniform Convergence of Series of Functions

Recall that a sequence of functions $(f_{n}(x))_{n=1}^{\infty }$ with common domain $X$ is said to be pointwise convergent if for all $x\in X$ and for all $\varepsilon >0$ there exists an $N\in \mathbb {N}$ such that if $n\geq N$ then:

${\begin{aligned}\quad \left|f_{n}(x)-f(x)\right|<\varepsilon \end{aligned}}$

Also recall that a sequence of functions $(f_{n}(x))_{n=1}^{\infty }$ with common domain $X$ is said to be uniformly convergent if for all $\varepsilon >0$ there exists an $N\in \mathbb {N}$ such that if $n\geq N$ then for all $x\in X$ we have that:

${\begin{aligned}\quad \left|f_{n}(x)-f(x)\right|<\varepsilon \end{aligned}}$

We will now extend the concept of pointwise convergence and uniform convergence to series of functions.

Definition: Let $(f_{n}(x))_{n=1}^{\infty }$ be a sequence of functions with common domain $X$. The corresponding series $\displaystyle {\sum _{n=1}^{\infty }f_{n}(x)}$ is said to be Pointwise Convergent to the sum function $f(x)$ if the corresponding sequence of partial sums $(s_{n}(x))_{n=1}^{\infty }$ (where $\displaystyle {s_{n}(x)=\sum _{k=1}^{n}f_{n}(x)=f_{1}(x)+f_{2}(x)+...+f_{n}(x)}$) is pointwise convergent to $f(x)$.

For example, consider the following sequence of functions defined on the interval $(-1,1)$:

${\begin{aligned}\quad (f_{n}(x))_{n=1}^{\infty }=(x^{n-1})_{n=1}^{\infty }=(1,x,x^{2},x^{3},...)\end{aligned}}$

We now that this series converges pointwise for all $x\in (0,1)$ since the result series $\sum _{n=1}^{\infty }x^{n-1}$ is simply a geometric series to the sum function $\displaystyle {f(x)={\frac {1}{1-x}}}$.

Definition: Let $(f_{n}(x))_{n=1}^{\infty }$ be a sequence of functions with common domain $X$. The corresponding series $\displaystyle {\sum _{n=1}^{\infty }f_{n}(x)}$ is said to be Uniformly Convergent to the sum function $f(x)$ if the corresponding sequence of partial sums is uniformly convergent to $f(x)$.

The geometric series given above actually converges uniformly on $(-1,1)$, though, showing this with the current definition of uniform convergence of series of functions is laborious. We will soon develop methods to determine whether a series of functions converges uniformly or not without having to brute-force apply the definition for uniform convergence for the sequence of partial sums.

Cauchy's Uniform Convergence Criterion for Series of Functions

If we have a sequence of functions $(f_{n}(x))_{n=1}^{\infty }$ with common domain $X$ then the corresponding series of functions $\displaystyle {\sum _{n=1}^{\infty }f_{n}(x)}$ is said to be uniformly convergent if the corresponding sequence of partial sums $(s_{n}(x))_{n=1}^{\infty }$ is a uniformly convergent sequence of functions.

We will now look at a nice theorem known as Cauchy's uniform convergence criterion for series of functions.

Theorem 1: Let $(f_{n}(x))_{n=1}^{\infty }$ be a sequence of real-valued functions with common domain $X$. Then $\displaystyle {\sum _{n=1}^{\infty }f_{n}(x)}$ is uniformly convergent on $X$ if and only if for all $\epsilon >0$ there exists an $N\in \mathbb {N}$ such that if $n\geq N$ and for all $x\in X$ we have that $\displaystyle {\left|\sum _{k=n+1}^{n+p}f_{k}(x)\right|<\epsilon }$ for all $p\in \mathbb {N}$.

• Proof: $\Rightarrow$ Suppose that $\displaystyle {\sum _{n=1}^{\infty }f_{n}(x)}$ is uniformly convergent to some limit function $f(x)$ on $X$. Let $(s_{n}(x))_{n=1}^{\infty }$ denote the sequence of partial sums for this series. Then we must have that $\displaystyle {\lim _{n\to \infty }s_{n}(x)=f(x)}$ uniformly on $X$. So, for $\epsilon _{1}={\frac {\epsilon }{2}}$ there exists an $N\in \mathbb {N}$ such that if $n\geq N$ and for all $x\in X$ we have that:

\begin{align} \quad \mid s_n(x) - f(x) \mid < \epsilon \end{align}

• For any $p\in \mathbb {N}$ let $m=n+p$. Then $m\geq N$ and so:

\begin{align} \quad \quad \left| \sum_{k=1}^{m} f_k(x) - \sum_{k=1}^{n} f_k(x) \right| = \left| \sum_{k=1}^{n+p} f_k(x) - \sum_{k=1}^{n} f_k(x) \right| = \left| \sum_{k=n+1}^{n+p} f_k(x) \right| = \mid s_m(x) - s_n(x) \mid \leq \mid s_m(x) - f(x) \mid + \mid f(x) - s_n(x) \mid < \epsilon_1 + \epsilon_1 = \frac{\epsilon}{2} + \frac{\epsilon}{2} = \epsilon \end{align}

• $\Leftarrow$ Suppose that for all $\epsilon >0$ there exists an $N\in \mathbb {N}$ such that if $n\geq N$ and for all $x\in X$ we have that:

\begin{align} \quad \left| \sum_{k=n+1}^{n+p} f_k(x) \right| < \epsilon \end{align}

• Let $m,n\geq N$. Assume without loss of generality that $m>n$ and that $m=n+p$ for some $p\in \mathbb {N}$. Then from above we see that for all $x\in X$:

\begin{align} \quad \mid s_m(x) - s_n(x) \mid = \left| \sum_{k=1}^{n+p} f_k(x) - \sum_{k=1}^{n} f_k(x) \right| = \left| \sum_{k=n+1}^{n+p} f_k(x) \right| < \epsilon \end{align}

• So $(s_{n}(x))_{n=1}^{\infty }$ converges uniformly by the Cauchy uniform convergence criterion for sequences of functions. So $\displaystyle {\sum _{n=1}^{\infty }f_{n}(x)}$ converges uniformly on $X$. $\blacksquare$

Licensing

Content obtained and/or adapted from:

• Pointwise Convergent and Uniformly Convergent Series of Functions, mathonline.wikidot.com under a CC BY-SA license