2.8 Sequence of functions
Let \(A\) and \(B\) be subsets of \(\mathbb {R}\), and for each natural number \(n\) let \(f_n: A\longrightarrow B\) be a function with domain \(A\) and codomain \(B\). If \(f\) is a function from \(A_0\subseteq A\) into \(B\), the sequence \(\{f_n\}\) is said to converge on \(A_0\) to \(f\) if the sequence of values \(\{f_n(x)\}\) converges to \(f(x)\) for every \(x\in A_0\). We also say that \(f_n\) converges to \(f\) pointwise on \(A_0\).
Definition 2.8.1. A sequence of functions \(\{f_n\}\) on a set \(A\) converges pointwise to a function \(f\) on \(A_0\subseteq A\) if for every \(\varepsilon > 0\) and each \(x\in A_0\) there is a number \(N = N(x,\varepsilon )\) such that \(|f_n(x) - f(x)| < \varepsilon \) whenever \(n>N\).
We then write \(\lim _{n\rightarrow \infty } f_n(x) = f(x)\), \(x\in A_0\), and say that \(\{f_n\}\) is convergent on \(A_0\).
Example 2.8.2. Let \(f_n : \mathbb {R}\longrightarrow \mathbb {R}\) be defined by \(f_n(x) = \frac {x}{n}\). For each \(x\), \(\frac {x}{n}\longrightarrow 0\), so the sequence converges on \(\mathbb {R}\) to the function \(f(x) = 0\).
Uniform convergence
In the definition of pointwise convergence, \(N\) usually depends on both \(\varepsilon \) and \(x\). When \(N\) can be chosen independently of \(x\), the convergence is said to be uniform.
Definition 2.8.3. A sequence of functions \(f_n: A\longrightarrow B\) converges uniformly to a function \(f\) on \(A_0\subseteq A\) if for every \(\varepsilon > 0\) there is an \(N\), depending only on \(\varepsilon \) and not on \(x\), such that \(|f_n(x) - f(x)| < \varepsilon \) for all \(n> N\) and all \(x\in A_0\).
Clearly a uniformly convergent sequence is also pointwise convergent. The converse is not true.
Example 2.8.4. The sequence \(f_n(x) = \frac {x}{n}\) converges pointwise on \(\mathbb {R}\) to \(f = 0\), but not uniformly. For \(|f_n(x) - f(x)| < \frac {1}{10}\) we need \(n>10\) at \(x=1\), \(n>20\) at \(x=2\), and in general \(n>10|x|\). No single \(N\) works for every \(x\in \mathbb {R}\). On a bounded set \(|x|\leq R\), however, \(|f_n(x)|\leq \frac {R}{n}\), and the convergence is uniform.
Definition 2.8.5. A function \(f: A\longrightarrow \mathbb {R}\), \(A\subseteq \mathbb {R}\), is said to be bounded if there exists a number \(M\) with \(0 < M < \infty \) such that \(\sup _{x\in A}|f(x)|\leq M\).
Theorem 2.8.6. Let \(\{f_n\}\) be a sequence of functions \(f_n: A\longrightarrow \mathbb {R}\) such that each \(f_n - f\) is bounded. Then \(\{f_n\}\) converges uniformly on \(A\) to \(f\) if and only if \[\lim _{n\rightarrow \infty } \, \sup _{x\in A}|f_n(x) - f(x)| = 0 .\]
Proof. Write \(d_n = \sup _{x\in A}|f_n(x) - f(x)|\). Suppose \(f_n\longrightarrow f\) uniformly on \(A\), and let \(\varepsilon >0\). There is an \(N\) such that \(|f_n(x) - f(x)| < \frac {\varepsilon }{2}\) for all \(n> N\) and all \(x\in A\). Taking the supremum over \(x\), \(d_n\leq \frac {\varepsilon }{2}<\varepsilon \) for \(n> N\). Hence \(d_n\longrightarrow 0\).
Conversely, suppose \(d_n\longrightarrow 0\), and let \(\varepsilon >0\). There is an \(N\) with \(d_n<\varepsilon \) for \(n>N\). Then for every \(x\in A\) and \(n>N\), \[|f_n(x) - f(x)| \leq d_n < \varepsilon ,\] and \(N\) does not depend on \(x\). Hence \(f_n\longrightarrow f\) uniformly on \(A\). □
Example 2.8.7. Let \(f_n(x) = n^2 x (1 - x)^n\) for \(0\leq x\leq 1\). Determine whether the sequence converges uniformly on \([0,1]\).
For each fixed \(x\in [0,1]\), \(f_n(x)\longrightarrow 0\) (at \(x = 0\) and \(x = 1\) every term is \(0\), and for \(0<x<1\) the factor \((1-x)^n\) decays geometrically). So \(f_n\) converges pointwise to the zero function \(f\). To test for uniform convergence we compute \(\sup _{0\leq x\leq 1}|f_n(x) - f(x)|\), which is a maximum because \(f_n\) is continuous on \([0,1]\). Setting the derivative \(n^2(1-x)^{n-1}\bigl (1-(n+1)x\bigr )\) equal to zero gives \(x = \frac {1}{n + 1}\), so \[\sup _{0\leq x\leq 1}|f_n(x) - f(x)| = \frac {n^2}{n + 1}\left (1 - \frac {1}{n + 1}\right )^n = \frac {n^2}{n + 1}\left (\frac {n}{n+1}\right )^n .\] As \(n\longrightarrow \infty \), \(\left (\frac {n}{n+1}\right )^n = \left (1+\frac {1}{n}\right )^{-n}\longrightarrow e^{-1}\), while \(\frac {n^2}{n+1}\longrightarrow \infty \). Hence the supremum tends to \(\infty \), and \(f_n\) does not converge uniformly on \([0,1]\).
Example 2.8.8. Let \(f_n(x) = \frac {x^n}{2 + 3 x^n}\) for \(0\leq x\leq 1\). Show that \(f_n\) converges pointwise and determine whether the sequence converges uniformly on \([0,1]\).
Solution. For \(0\leq x<1\), \(x^n\longrightarrow 0\) and so \(f_n(x)\longrightarrow 0\), while \(f_n(1) = \frac {1}{5}\) for every \(n\). Hence \(f_n \longrightarrow f\) pointwise, where \[ f(x) = \begin {cases} 0, & 0\leq x < 1,\\ \frac {1}{5}, & x = 1. \end {cases} \] To test for uniform convergence, note that \[|f_n(x) - f(x)| = \begin {cases} \frac {x^n}{2 + 3x^n}, & 0\leq x < 1,\\ 0, & x = 1. \end {cases}\] For fixed \(n\), \(\frac {x^n}{2 + 3x^n}\) increases with \(x\) on \([0,1)\) and tends to \(\frac {1}{5}\) as \(x\longrightarrow 1\). Hence \[ \sup _{x\in [0,1]}|f_n(x) - f(x)| = \frac {1}{5} \quad \text {for every } n . \] This does not tend to \(0\), so \(f_n\) does not converge uniformly on \([0,1]\). (This also follows from the next theorem, since each \(f_n\) is continuous but \(f\) is not.)
Theorem 2.8.9. Let \(E\subseteq \mathbb {R}\) and let \(f_1, f_2, \dots \) be continuous functions on \(E\). If \(f_n \longrightarrow f\) uniformly on \(E\), then \(f\) is continuous on \(E\). In particular, if \(x_0\in E\) is a limit point of \(E\), then \[\lim _{n \rightarrow \infty }\, \lim _{x\rightarrow x_0} f_n(x) = \lim _{x\rightarrow x_0} \,\lim _{n\rightarrow \infty } f_n(x) = f(x_0).\]
Proof. Let \(x_0\in E\) and \(\varepsilon >0\). For every \(x\in E\) and every \(n\), \[|f(x) - f(x_0)|\leq |f(x) - f_n(x)| + |f_n(x) - f_n(x_0)| + |f_n(x_0) - f(x_0)| .\] By uniform convergence there is an \(N\) such that \(|f_n(x) - f(x)| < \frac {\varepsilon }{3}\) for all \(n> N\) and all \(x\in E\); in particular \(|f_n(x_0) - f(x_0)| < \frac {\varepsilon }{3}\). Fix one \(n>N\). Since \(f_n\) is continuous at \(x_0\), there is a \(\delta > 0\) such that \(|f_n(x) - f_n(x_0)|< \frac {\varepsilon }{3}\) whenever \(x\in E\) and \(|x - x_0| < \delta \). For such \(x\) all three terms are less than \(\frac {\varepsilon }{3}\), so \(|f(x) - f(x_0)| < \varepsilon \). Hence \(f\) is continuous at \(x_0\).
For the limits: \(\lim _{x\rightarrow x_0} f_n(x) = f_n(x_0)\longrightarrow f(x_0)\) as \(n\longrightarrow \infty \), and \(\lim _{x\rightarrow x_0} f(x) = f(x_0)\) by the continuity of \(f\). □
Definition 2.8.10. A sequence of functions \(f_1, f_2, \dots \) is said to have the uniform Cauchy property on \(E\) if for every \(\varepsilon > 0\) there is a positive integer \(N\), depending only on \(\varepsilon \), such that \(|f_n (x) - f_m(x)| < \varepsilon \) for all \(n, m > N\) and all \(x\in E\).
Theorem 2.8.11. Suppose that the real valued functions \(f_1, f_2, \dots \) have the uniform Cauchy property on \(E\). Then the sequence \(\{f_n\}\) converges uniformly on \(E\).
Proof. For each \(x\in E\), \(\{f_n(x)\}\) is a Cauchy sequence of real numbers and hence converges; call its limit \(f(x)\). Let \(\varepsilon >0\) and choose \(N\) such that \(|f_n(x) - f_m(x)| < \frac {\varepsilon }{2}\) for all \(n, m> N\) and all \(x\in E\). Fix \(n>N\) and \(x\in E\), and let \(m\longrightarrow \infty \): this gives \(|f_n(x) - f(x)| \leq \frac {\varepsilon }{2} < \varepsilon \). Since \(N\) does not depend on \(x\), \(f_n \longrightarrow f\) uniformly on \(E\). □
Theorem 2.8.12 (Dini’s Theorem). Let \(f_1, f_2, \dots \) be continuous real valued functions on a compact set \(E\), and assume that they form a monotone sequence: either \(f_{n+ 1}(x) \leq f_n(x)\) for all \(x\in E\) and all \(n\), or \(f_{n+1}(x) \geq f_n(x)\) for all \(x\in E\) and all \(n\). If \(f_n \longrightarrow f\) pointwise on \(E\) and \(f\) is continuous on \(E\), then \(f_n\longrightarrow f\) uniformly on \(E\).
Proof. We may assume that the \(f_n\) decrease (otherwise consider \(-f_n\)). Put \(g_n = f_n - f\). Then \(\{g_n\}\) is a decreasing sequence of non-negative continuous functions converging pointwise to zero.
Let \(\varepsilon > 0\), and let \(V_n = \{x\in E: g_n(x) < \varepsilon \}\). By continuity of \(g_n\), \(V_n\) is open in \(E\), say \(V_n = E\cap O_n\) with \(O_n\) open. If \(x\in E\) then \(g_n(x) < \varepsilon \) for large \(n\), so the sets \(O_n\) cover \(E\). Since \(E\) is compact, \(E\subseteq O_1\cup \dots \cup O_N\) for some \(N\), that is, \(E = V_1\cup \dots \cup V_N\). Since the \(g_n\) decrease, \(V_n \subseteq V_{n + 1}\) for all \(n\), so \(E = V_N\). Thus \(g_N(x) < \varepsilon \) for every \(x\in E\), and for \(n\geq N\), \[0\leq g_n(x) \leq g_N(x) <\varepsilon \qquad \text {for all } x\in E .\] Hence \(g_n \longrightarrow 0\) uniformly on \(E\), that is, \(f_n\longrightarrow f\) uniformly on \(E\). □
By definition, uniform convergence of a series of functions \(\sum ^{\infty }_{n = 1} f_n\) means uniform convergence of the sequence of partial sums \(S_n = \sum ^{n}_{k = 1} f_k\).
Theorem 2.8.13 (Weierstrass M-Test). Let \(f_1, f_2, \dots \) be real valued functions on a set \(E\). If \(|f_n (x)| \leq M_n\) for all \(x\in E\) and all \(n\), where \(\sum ^{\infty }_{n = 1} M_n < \infty \), then the series \(\sum ^{\infty }_{n=1} f_n\) converges uniformly on \(E\). Consequently, if each \(f_n\) is continuous on \(E\), then \(\sum ^{\infty }_{n = 1} f_n\) is continuous on \(E\).
Proof. Let \(S_n\) be the \(n^{\text {th}}\) partial sum of the series. For \(m< n\) and every \(x\in E\), \[|S_n(x) - S_m(x)| = \left |\sum ^n_{k = m + 1} f_k(x)\right | \leq \sum ^n_{k = m + 1} |f_k(x)| \leq \sum ^{\infty }_{k=m + 1} M_k ,\] and the right side does not depend on \(x\) and tends to \(0\) as \(m\longrightarrow \infty \), since \(\sum M_n < \infty \). Thus \(\{S_n\}\) has the uniform Cauchy property, and therefore converges uniformly on \(E\). If each \(f_n\) is continuous, so is each \(S_n\), and the uniform limit is continuous by the theorem above. □
Example 2.8.14. Let \(f_n(x) = \frac {\sin nx}{n^2}\), \(x\in \mathbb {R}\). Then \(|f_n(x)|\leq M_n = \frac {1}{n^2}\) for all \(x\), and \(\sum ^{\infty }_{n = 1} \frac {1}{n^2}\) converges. By the M-test, \(\sum ^{\infty }_{n=1} \frac {\sin nx}{n^2}\) converges uniformly on \(\mathbb {R}\), and its sum is a continuous function.
Solution. The pointwise limit is \(f = 0\). For \(x>0\) the inequality of arithmetic and geometric means gives \(1 + nx^2\geq 2\sqrt {n}\,x\), so \(|f_n(x)|\leq \frac {1}{2\sqrt {n}}\), with equality at \(x = \frac {1}{\sqrt {n}}\); by symmetry the same bound holds for \(x<0\). Hence \(\sup _{x\in \mathbb {R}}|f_n(x) - 0| = \frac {1}{2\sqrt {n}}\longrightarrow 0\), and the convergence is uniform. For \(\varepsilon = 0.01\) any \(n>2500\) works.
Example 2.8.16. Let \(f_n(x) = \frac {nx}{1+n^2x^2}\). Show that \(f_n\longrightarrow 0\) pointwise on \([0,1]\) but not uniformly, and that the convergence is uniform on \([a,1]\) for each \(a>0\).
Solution. At \(x = 0\) every term is \(0\); for \(x>0\), \(f_n(x)\leq \frac {nx}{n^2x^2} = \frac {1}{nx}\longrightarrow 0\). But \(f_n\left (\frac {1}{n}\right ) = \frac {1}{2}\) for every \(n\), so \(\sup _{[0,1]}|f_n|\geq \frac {1}{2}\) and the convergence is not uniform on \([0,1]\). The “bump” of height \(\frac {1}{2}\) moves towards \(0\) as \(n\) grows.
On \([a,1]\) we have \(|f_n(x)|\leq \frac {1}{nx}\leq \frac {1}{na}\longrightarrow 0\), uniformly in \(x\).
Example 2.8.17. Use the M-test to show that \(\displaystyle \sum _{n=1}^\infty \frac {x^n}{n^2}\) converges uniformly on \([-1,1]\) and that \(\displaystyle \sum _{n=1}^\infty \frac {1}{n^2+x^2}\) converges uniformly on \(\mathbb {R}\). Are the sums continuous?
Solution. On \([-1,1]\), \(\left |\frac {x^n}{n^2}\right |\leq \frac {1}{n^2}\), and on \(\mathbb {R}\), \(\frac {1}{n^2+x^2}\leq \frac {1}{n^2}\). Since \(\sum \frac {1}{n^2}\) converges, both series converge uniformly by the M-test. Their terms are continuous, so both sums are continuous functions. Moreover the tail after \(N\) terms is at most \(\sum _{n>N}\frac {1}{n^2}<\frac {1}{N}\), so \(N = 100\) terms give either sum to within \(0.01\) at every point.
Example 2.8.18. Explain how Dini’s Theorem applies to \(f_n(x) = x^n\) on \(\left [0,\frac {1}{2}\right ]\), and why it does not apply on \([0,1)\).
Solution. On the compact set \(\left [0,\frac {1}{2}\right ]\) the functions \(x^n\) are continuous, decrease with \(n\), and converge pointwise to the continuous function \(0\). Dini’s Theorem gives uniform convergence (as also follows from \(\sup x^n = 2^{-n}\)). On \([0,1)\) the limit is still \(0\) and the sequence still decreases, but the convergence is not uniform, since \(\sup _{[0,1)}x^n = 1\). Dini’s Theorem does not apply because \([0,1)\) is not compact.
Questions on this section
Stuck on something here? Ask below and it stays attached to this topic.