8.4 Series of Functions 227
8.4.4. THEOREM. Let (f
n
) be a sequence of continuous functions from a subset
S of R
n
into R
m
. If
∞
P
n=1
f
n
(x) converges uniformly, then it is continuous.
8.4.5. DEFINITION. Let S ⊂ R
n
. We say that a series of functions f
k
from S
to R
m
is uniformly Cauchy on S if for every ε > 0, there is an N so that
°
°
°
l
X
i=k+1
f
i
(x)
°
°
°
≤ ε whenever x ∈ S and l > k ≥ N.
The proof that a series of real numbers converges if and only if it is Cauchy can
be modified in a straightforward way to show the following.
8.4.6. THEOREM. A series of functions converges uniformly if and only if it is
uniformly Cauchy.
PROOF. Let f
n
be the nth partial sum. If f
n
converges uniformly to f, then for
each ε > 0, there is N ∈ N so that kf
n
− fk < ε/2 for all n ≥ N. If m, n ≥ N,
kf
m
− f
n
k ≤ kf
m
− fk + kf − f
n
k <
ε
2
+
ε
2
= ε.
Conversely, if (f
n
) is uniformly Cauchy, then (f
n
(x)) is Cauchy for every x, and
thus f(x) = lim
n→∞
f
n
(x) exists as a pointwise limit. Moreover, if ε > 0 and
kf
m
− f
n
k < ε for all m, n ≥ N, then
kf − f
n
k = lim
m→∞
kf
m
− f
n
k ≤ ε.
Thus this convergence is uniform. ¥
There is a useful test for uniform convergence of a series of functions. The
proof is easy, and the test comes up often in practice.
8.4.7. WEIERSTRASS M-TEST.
Suppose that a
n
(x) is a sequence of functions on S ⊂ R
k
into R
m
and (M
n
) is a
sequence of real numbers so that
ka
n
k
∞
= sup
x∈S
ka
n
(x)k ≤ M
n
for all x ∈ S.
If
∞
P
n=1
M
n
converges, then the series
∞
P
n=1
a
n
(x) converges uniformly on S.
PROOF. For each x ∈ S, the sequence (a
n
(x)) is an absolutely convergent se-
quence of real numbers since
∞
X
n=1
ka
n
(x)k <
∞
X
n=1
ka
n
k
∞
≤
∞
X
n=1
M
n
< ∞.