Chapter 1.7

Sequences and Series of Functions

[26/15%]
Show
LaTeX
Problem 1.7.1

Prove that every uniformly convergent sequence of bounded functions is uniformly bounded.

?
Problem 1.7.2

If {fn}\left\{ f_{n}\right\} and {gn}\left\{ g_{n}\right\} converge uniformly on a set EE, prove that {fn+gn}\left\{ f_{n}+g_{n}\right\} converges uniformly on EE. If, in addition, {fn}\left\{ f_{n}\right\} and {gn}\left\{ g_{n}\right\} are sequences of bounded functions, prove that {fngn}\left\{ f_{n} g_{n}\right\} converges uniformly on EE.

?
Problem 1.7.3

Construct sequences {fn},{gn}\left\{ f_{n}\right\} ,\left\{ g_{n}\right\} which converge uniformly on some set EE, but such that {fngn}\left\{ f_{n} g_{n}\right\} does not converge uniformly on EE (of course, {fngn}\left\{ f_{n} g_{n}\right\} must converge on E).

?
Problem 1.7.4

Consider

f(x)=∑n=1∞11+n2x f(x) = \sum _{n = 1}^{\infty } \frac{1}{1+n^{2} x}

For what values of xx does the series converge absolutely? On what intervals does it converge uniformly? On what intervals does it fail to converge uniformly? Is ff continuous wherever the series converges? Is ff bounded?

?
Problem 1.7.5

Let

fn(x)={0(x<1n+1)sin⁡2πx(1n+1≤x≤1n)0(1n<x) f_{n}(x) = \begin{cases} 0 & \left(x < \frac{1}{n+1}\right) \\ \sin ^{2} \frac{\pi }{x} & \left(\frac{1}{n+1} \leq x \leq \frac{1}{n}\right) \\ 0 & \left(\frac{1}{n} < x\right)\end{cases}

Show that {fn}\left\{ f_{n}\right\} converges to a continuous function, but not uniformly. Use the series Σfn\Sigma f_{n} to show that absolute convergence, even for all xx, does not imply uniform convergence.

?
Problem 1.7.6

Prove that the series

∑n=1∞(−1)nx2+nn2 \sum _{n = 1}^{\infty }(-1)^{n} \frac{x^{2}+n}{n^{2}}

converges uniformly in every bounded interval, but does not converge absolutely for any value of xx.

?
Problem 1.7.7

For n=1,2,3,…,xn = 1,2,3, \ldots , x real, put

fn(x)=x1+nx2 f_{n}(x) = \frac{x}{1+n x^{2}}

Show that {fn}\left\{ f_{n}\right\} converges uniformly to a function ff, and that the equation

f′(x)=lim⁡n→∞fn′(x) f^{\prime }(x) = \lim _{n \rightarrow \infty } f_{n}^{\prime }(x)

is correct if x≠0x \neq 0, but false if x=0x = 0.

?
Problem 1.7.8

If

I(x)={0(x≤0)1(x>0) I(x) = \begin{cases} 0 & (x \leq 0) \\ 1 & (x > 0)\end{cases}

if {xn}\left\{ x_{n}\right\} is a sequence of distinct points of (a,b)(a, b), and if Σ∣cn∣\Sigma \left|c_{n}\right| converges, prove that the series

f(x)=∑n=1∞cnI(x−xn)(a≤x≤b) f(x) = \sum _{n = 1}^{\infty } c_{n} I\left(x-x_{n}\right) \quad (a \leq x \leq b)

converges uniformly, and that ff is continuous for every x≠xnx \neq x_{n}.

?
Problem 1.7.9

Let {fn}\left\{ f_{n}\right\} be a sequence of continuous functions which converges uniformly to a function ff on a set EE. Prove that

lim⁡n→∞fn(xn)=f(x) \lim _{n \rightarrow \infty } f_{n}\left(x_{n}\right) = f(x)

for every sequence of points xn∈Ex_{n} \in E such that xn→xx_{n} \rightarrow x, and x∈Ex \in E. Is the converse of this true?

?
Problem 1.7.10

Letting (x)(x) denote the fractional part of the real number xx (see Exercise 16, Chap.4, for the definition), consider the function

f(x)=∑n=1∞(nx)n2(x real ) f(x) = \sum _{n = 1}^{\infty } \frac{(n x)}{n^{2}} \quad (x \text{ real })

Find all discontinuities of ff, and show that they form a countable dense set. Show that ff is nevertheless Riemann-integrable on every bounded interval.

?
Problem 1.7.11

Suppose {fn},{gn}\left\{ f_{n}\right\} ,\left\{ g_{n}\right\} are defined on EE, and

?
(a)

Σfn\Sigma f_{n} has uniformly bounded partial sums;

(b)

gn→0g_{n} \rightarrow 0 uniformly on EE;

(c)

g1(x)≥g2(x)≥g3(x)≥⋯g_{1}(x) \geq g_{2}(x) \geq g_{3}(x) \geq \cdots for every x∈Ex \in E.

Prove that Σfngn\Sigma f_{n} g_{n} converges uniformly on E. Hint: Compare with Theorem 3.42.

Problem 1.7.12

Suppose gg and fn(n=1,2,3,…)f_{n}(n = 1,2,3, \ldots ) are defined on (0,∞)(0, \infty ), are Riemann-integrable on [ t,Tt, T ] whenever 0<t<T<∞,∣fn∣≤g,fn→f0 < t < T < \infty ,\left|f_{n}\right| \leq g, f_{n} \rightarrow f uniformly on every compact subset of (0,∞)(0, \infty ), and

∫0∞g(x)dx<∞ \int _{0}^{\infty } g(x) d x < \infty

Prove that

lim⁡n→∞∫0∞fn(x)dx=∫0∞f(x)dx \lim _{n \rightarrow \infty } \int _{0}^{\infty } f_{n}(x) d x = \int _{0}^{\infty } f(x) d x

(See Exercises 7 and 8 of Chap. 6 for the relevant definitions). This is a rather weak form of Lebesgue's dominated convergence theorem (Theorem 11.32). Even in the context of the Riemann integral, uniform convergence can be replaced by pointwise convergence if it is assumed that f∈Rf \in \mathscr {R}. (See the articles by F. Cunningham in Math. Mag., vol. 40, 1967, pp. 179-186, and by H. Kestelman in Amer. Math. Monthly, vol. 77, 1970, pp. 182-187).

?
Problem 1.7.13

Assume that {fn}\left\{ f_{n}\right\} is a sequence of monotonically increasing functions on R1\mathbb {R}^{1} with 0≤fn(x)≤10 \leq f_{n}(x) \leq 1 for all xx and all nn.

?
(a)

Prove that there is a function ff and a sequence {nk}\left\{ n_{k}\right\} such that

f(x)=lim⁡k→∞fnk(x) f(x) = \lim _{k \rightarrow \infty } f_{n_{k}}(x)

for every x∈R1x \in \mathbb {R}^{1}. (The existence of such a pointwise convergent subsequence is usually called Helly's selection theorem).

(b)

If, moreover, ff is continuous, prove that fnk→ff_{n k} \rightarrow f uniformly on compact sets.

Hint: (i) Some subsequence {fnd}\left\{ f_{n d}\right\} converges at all rational points rr, say, to f(r)f(r). (ii) Define f(x)f(x), for any x∈R1x \in \mathbb {R}^{1}, to be sup⁡f(r)\sup f(r), the sup being taken over all r≤xr \leq x. (iii) Show that fnt(x)→f(x)f_{n_{t}}(x) \rightarrow f(x) at every xx at which ff is continuous. (This is where monotonicity is strongly used). (iv) A subsequence of {fni}\left\{ f_{n i}\right\} converges at every point of discontinuity of ff since there are at most countably many such points. This proves (a). To prove (b), modify your proof of (iii) appropriately.

Problem 1.7.14

Let ff be a continuous real function on R1\mathbb {R}^{1} with the following properties: 0≤f(t)≤1,f(t+2)=f(t)0 \leq f(t) \leq 1, f(t+2) = f(t) for every tt, and

f(t)={0(0≤t≤13)1(23≤t≤1) f(t) = \begin{cases} 0 & \left(0 \leq t \leq \frac{1}{3}\right) \\ 1 & \left(\frac{2}{3} \leq t \leq 1\right)\end{cases}

Put Φ(t)=(x(t),y(t))\Phi (t) = (x(t), y(t)), where

x(t)=∑n=1∞2−nf(32n−1t),y(t)=∑n=1∞2−nf(32nt) x(t) = \sum _{n = 1}^{\infty } 2^{-n} f\left(3^{2 n-1} t\right), \quad y(t) = \sum _{n = 1}^{\infty } 2^{-n} f\left(3^{2 n} t\right)

Prove that Φ\Phi is continuous and that Φ\Phi maps I=[0,1]I = [0,1] onto the unit square I2⊂R2I^{2} \subset \mathbb {R}^{2}. If fact, show that Φ\Phi maps the Cantor set onto I2I^{2}.

Hint: Each (x0,y0)∈I2\left(x_{0}, y_{0}\right) \in I^{2} has the form

x0=∑n=1∞2−na2n−1,y0=∑n=1∞2−na2n x_{0} = \sum _{n = 1}^{\infty } 2^{-n} a_{2 n-1}, \quad y_{0} = \sum _{n = 1}^{\infty } 2^{-n} a_{2 n}

where each aia_{i} is 0 or 1. If

t0=∑i=1∞3−i−1(2ai) t_{0} = \sum _{i = 1}^{\infty } 3^{-i-1}\left(2 a_{i}\right)

show that f(3kt0)=akf\left(3^{k} t_{0}\right) = a_{k}, and hence that x(t0)=x0,y(t0)=y0x\left(t_{0}\right) = x_{0}, y\left(t_{0}\right) = y_{0}. (This simple example of a so-called "space-filling curve" is due to I. J. Schoenberg, Bull. A.M.S., vol. 44, 1938, pp. 519).

?
Problem 1.7.15

Suppose ff is a real continuous function on R1,fn(t)=f(nt)\mathbb {R}^{1}, f_{n}(t) = f(n t) for n=1,2,3,…n = 1,2,3, \ldots, and {fn}\left\{ f_{n}\right\} is equicontinuous on [0,1][0,1]. What conclusion can you draw about ff?

?
Problem 1.7.16

Suppose {fn}\left\{ f_{n}\right\} is an equicontinuous sequence of functions on a compact set KK, and {fn}\left\{ f_{n}\right\} converges pointwise on KK. Prove that {fn}\left\{ f_{n}\right\} converges uniformly on KK.

?
Problem 1.7.17

Define the notions of uniform convergence and equicontinuity for mappings into any metric space. Show that Theorems 7.9 and 7.12 are valid for mappings into any metric space, that Theorems 7.8 and 7.11 are valid for mappings into any complete metric space, and that Theorems 7.10, 7.16, 7.17, 7.24, and 7.25 hold for vector-valued functions, that is, for mappings into any Rk\mathbb {R}^{k}.

The cited results, as stated in the book for (real or complex) functions.

Theorem 7.8: The sequence of functions {fn}\left\{ f_{n}\right\}, defined on EE, converges uniformly on EE if and only if for every ε>0\varepsilon > 0 there exists an integer NN such that m≥Nm \geq N, n≥Nn \geq N, x∈Ex \in E implies ∣fn(x)−fm(x)∣≤ε\left|f_{n}(x)-f_{m}(x)\right| \leq \varepsilon.

Theorem 7.9: Suppose lim⁡n→∞fn(x)=f(x)\lim_{n \rightarrow \infty } f_{n}(x) = f(x) (x∈E)(x \in E). Put Mn=sup⁡x∈E∣fn(x)−f(x)∣M_{n} = \sup_{x \in E} \left|f_{n}(x)-f(x)\right|. Then fn→ff_{n} \rightarrow f uniformly on EE if and only if Mn→0M_{n} \rightarrow 0 as n→∞n \rightarrow \infty.

Theorem 7.10: Suppose {fn}\left\{ f_{n}\right\} is a sequence of functions defined on EE, and suppose ∣fn(x)∣≤Mn\left|f_{n}(x)\right| \leq M_{n} (x∈E,n=1,2,3,…)(x \in E, n = 1,2,3, \ldots ). Then Σfn\Sigma f_{n} converges uniformly on EE if ΣMn\Sigma M_{n} converges.

Theorem 7.11: Suppose fn→ff_{n} \rightarrow f uniformly on a set EE in a metric space. Let xx be a limit point of EE, and suppose that lim⁡t→xfn(t)=An\lim_{t \rightarrow x} f_{n}(t) = A_{n} (n=1,2,3,…)(n = 1,2,3, \ldots ). Then {An}\left\{ A_{n}\right\} converges, and lim⁡t→xf(t)=lim⁡n→∞An\lim_{t \rightarrow x} f(t) = \lim_{n \rightarrow \infty } A_{n}.

Theorem 7.12: If {fn}\left\{ f_{n}\right\} is a sequence of continuous functions on EE, and if fn→ff_{n} \rightarrow f uniformly on EE, then ff is continuous on EE.

Theorem 7.16: Let α\alpha be monotonically increasing on [a,b][a, b]. Suppose fn∈R(α)f_{n} \in \mathscr {R}(\alpha ) on [a,b][a, b], for n=1,2,3,…n = 1,2,3, \ldots, and suppose fn→ff_{n} \rightarrow f uniformly on [a,b][a, b]. Then f∈R(α)f \in \mathscr {R}(\alpha ) on [a,b][a, b], and ∫abfdα=lim⁡n→∞∫abfndα\int_{a}^{b} f d \alpha = \lim_{n \rightarrow \infty } \int_{a}^{b} f_{n} d \alpha. (The existence of the limit is part of the conclusion.)

Theorem 7.17: Suppose {fn}\left\{ f_{n}\right\} is a sequence of functions, differentiable on [a,b][a, b] and such that {fn(x0)}\left\{ f_{n}\left(x_{0}\right)\right\} converges for some point x0x_{0} on [a,b][a, b]. If {fn′}\left\{ f_{n}^{\prime }\right\} converges uniformly on [a,b][a, b], then {fn}\left\{ f_{n}\right\} converges uniformly on [a,b][a, b], to a function ff, and f′(x)=lim⁡n→∞fn′(x)f^{\prime }(x) = \lim_{n \rightarrow \infty } f_{n}^{\prime }(x) (a≤x≤b)(a \leq x \leq b).

Theorem 7.24: If KK is a compact metric space, if fn∈C(K)f_{n} \in \mathscr {C}(K) for n=1,2,3,…n = 1,2,3, \ldots, and if {fn}\left\{ f_{n}\right\} converges uniformly on KK, then {fn}\left\{ f_{n}\right\} is equicontinuous on KK.

Theorem 7.25: If KK is compact, if fn∈C(K)f_{n} \in \mathscr {C}(K) for n=1,2,3,…n = 1,2,3, \ldots, and if {fn}\left\{ f_{n}\right\} is pointwise bounded and equicontinuous on KK, then (a) {fn}\left\{ f_{n}\right\} is uniformly bounded on KK, (b) {fn}\left\{ f_{n}\right\} contains a uniformly convergent subsequence.

(Here R(α)\mathscr {R}(\alpha ) is the class of functions Riemann--Stieltjes integrable with respect to α\alpha, and C(K)\mathscr {C}(K) is the set of all complex-valued, continuous, bounded functions on KK.)

?
Problem 1.7.18

Let {fin}\left\{ f_{i n}\right\} be a uniformly bounded sequence of functions which are Riemann-integrable on [a,b][a, b], and put

Fn(x)=∫axfn(t)dt(a≤x≤b) F_{n}(x) = \int _{a}^{x} f_{n}(t) d t \quad (a \leq x \leq b)

Prove that there exists a subsequence {Fnk}\left\{ F_{n_{k}}\right\} which converges uniformly on [a, bb ].

?
Problem 1.7.19

Let KK be a compact metric space, let SS be a subset of C(K)\mathscr {C}(K). Prove that SS is compact (with respect to the metric defined in Section 7.14) if and only if SS is uniformly closed, pointwise bounded, and equicontinuous. (If SS is not equicontinuous, then SS contains a sequence which has no equicontinuous subsequence, hence has no subsequence that converges uniformly on KK).

?
Problem 1.7.20

If ff is continuous on [0,1][0,1] and if

∫01f(x)xndx=0(n=0,1,2,…) \int _{0}^{1} f(x) x^{n} d x = 0 \quad (n = 0,1,2, \ldots )

prove that f(x)=0f(x) = 0 on [0,1][0,1]. Hint: The integral of the product of ff with any polynomial is zero. Use the Weierstrass theorem to show that ∫01f2(x)dx=0\int_{0}^{1} f^{2}(x) d x = 0.

?
Problem 1.7.21

Let KK be the unit circle in the complex plane (i.e., the set of all zz with ∣z∣=1\left|z\right| = 1), and let A\mathscr {A} be the algebra of all functions of the form

f(eℓθ)=∑n=0Ncneℓnθ(θ real ) f\left(e^{\ell \theta }\right) = \sum _{n = 0}^{N} c_{n} e^{\ell n \theta } \quad (\theta \text{ real })

Then A\mathscr {A} separates points on KK and A\mathscr {A} vanishes at no point of KK, but nevertheless there are continuous functions on KK which are not in the uniform closure of A\mathscr {A}. Hint: For every f∈Af \in \mathscr {A}

∫02πf(eiθ)eiθdθ=0 \int _{0}^{2 \pi } f\left(e^{i \theta }\right) e^{i \theta } d \theta = 0

and this is also true for every ff in the closure of A\mathscr {A}.

?
Problem 1.7.22

Assume f∈R(α)f \in \mathscr {R}(\alpha ) on [a,b][a, b], and prove that there are polynomials PnP_{n} such that

lim⁡n→∞∫ab∣f−Pn∣2dα=0 \lim _{n \rightarrow \infty } \int _{a}^{b}\left|f-P_{n}\right|^{2} d \alpha = 0

(Compare with Exercise 12, Chap. 6).

?
Problem 1.7.23

Put P0=0P_{0} = 0, and define, for n=0,1,2,…n = 0,1,2, \ldots,

Pn+1(x)=Pn(x)+x2−Pn2(x)2 P_{n+1}(x) = P_{n}(x)+\frac{x^{2}-P_{n}^{2}(x)}{2}

Prove that

lim⁡n→∞Pn(x)=∣x∣ \lim _{n \rightarrow \infty } P_{n}(x) = \left|x\right|

uniformly on [−1,1][-1,1]. (This makes it possible to prove the Stone-Weierstrass theorem without first proving Theorem 7.26).

Hint: Use the identity

∣x∣−Pn+1(x)=[∣x∣−Pn(x)][1−∣x∣+Pn(x)2] \left|x\right|-P_{n+1}(x) = \left[\left|x\right|-P_{n}(x)\right]\left[1-\frac{\left|x\right|+P_{n}(x)}{2}\right]

to prove that 0≤Pn(x)≤Pn+1(x)≤∣x∣0 \leq P_{n}(x) \leq P_{n+1}(x) \leq \left|x\right| if ∣x∣≤1\left|x\right| \leq 1, and that

∣x∣−Pn(x)≤∣x∣(1−∣x∣2)n<2n+1 \left|x\right|-P_{n}(x) \leq \left|x\right|\left(1-\frac{\left|x\right|}{2}\right)^{n} < \frac{2}{n+1}

if ∣x∣≤1\left|x\right| \leq 1.

?
Problem 1.7.24

Let XX be a metric space, with metric dd. Fix a point a∈Xa \in X. Assign to each p∈Xp \in X the function fpf_{p} defined by

fp(x)=d(x,p)−d(x,a)(x∈X) f_{p}(x) = d(x, p)-d(x, a) \quad (x \in X)

Prove that ∣fp(x)∣≤d(a,p)\left|f_{p}(x)\right| \leq d(a, p) for all x∈Xx \in X, and that therefore fp∈C(X)f_{p} \in \mathscr {C}(X). Prove that

∥fp−fq∥=d(p,q) \left\| f_{p}-f_{q}\right\| = d(p, q)

for all p,q∈Xp, q \in X. If Φ(p)=fp\Phi (p) = f_{p} it follows that Φ\Phi is an isometry (a distance-preserving mapping) of XX onto Φ(X)⊂C(X)\Phi (X) \subset \mathscr {C}(X).

Let YY be the closure of Φ(X)\Phi (X) in C(X)\mathscr {C}(X). Show that YY is complete. Conclusion: XX is isometric to a dense subset of a complete metric space YY. (Exercise 24, Chap. 3 contains a different proof of this).

?
Problem 1.7.25

Suppose ϕ\phi is a continuous bounded real function in the strip defined by 0≤x≤1,−∞<y<∞0 \leq x \leq 1,-\infty < y < \infty. Prove that the initial-value problem

y′=ϕ(x,y),y(0)=c y^{\prime } = \phi (x, y), \quad y(0) = c

has a solution. (Note that the hypotheses of this existence theorem are less stringent than those of the corresponding uniqueness theorem; see Exercise 27, Chap. 5).

Hint: Fix nn. For i=0,…,ni = 0, \ldots , n, put xi=i/nx_{i} = i / n. Let fnf_{n} be a continuous function on [0,1][0,1] such that fn(0)=cf_{n}(0) = c,

fn′(t)=ϕ(xl,fn(xl)) if xl<t<xi+1 f_{n}^{\prime }(t) = \phi \left(x_{l}, f_{n}\left(x_{l}\right)\right) \quad \text{ if } x_{l} < t < x_{i+1}

and put

Δn(t)=fn′(t)−ϕ(t,fn(t)) \Delta _{n}(t) = f_{n}^{\prime }(t)-\phi \left(t, f_{n}(t)\right)

except at the points xix_{i}, where Δn(t)=0\Delta_{n}(t) = 0. Then

fn(x)=c+∫0x[ϕ(t,fn(t))+Δn(t)]dt f_{n}(x) = c+\int _{0}^{x}\left[\phi \left(t, f_{n}(t)\right)+\Delta _{n}(t)\right] d t

Choose M<∞M < \infty so that ∣ϕ∣≤M\left|\phi \right| \leq M. Verify the following assertions.

?
(a)

∣fn′∣≤M,∣Δn∣≤2M,Δn∈R\left|f_{n}^{\prime }\right| \leq M,\left|\Delta_{n}\right| \leq 2 M, \Delta_{n} \in \mathscr {R}, and ∣fn∣≤∣c∣+M=M1\left|f_{n}\right| \leq \left|c\right|+M = M_{1}, say, on [0, 1], for all nn.

(b)

{fn}\left\{ f_{n}\right\} is equicontinuous on [0,1][0,1], since ∣fn′∣≤M\left|f_{n}^{\prime }\right| \leq M.

(c)

Some {fnk}\left\{ f_{n_{k}}\right\} converges to some ff, uniformly on [0,1][0,1].

(d)

Since ϕ\phi is uniformly continuous on the rectangle 0≤x≤1,∣y∣≤M10 \leq x \leq 1,\left|y\right| \leq M_{1},

ϕ(t,fnk(t))→ϕ(t,f(t)) \phi \left(t, f_{n_{k}}(t)\right) \rightarrow \phi (t, f(t))

uniformly on [0,1][0,1].

(e)

Δn(t)→0\Delta_{n}(t) \rightarrow 0 uniformly on [0,1][0,1], since

Δn(t)=ϕ(xi,fn(xi))−ϕ(t,fn(t)) \Delta _{n}(t) = \phi \left(x_{i}, f_{n}\left(x_{i}\right)\right)-\phi \left(t, f_{n}(t)\right)

in (xi,xi+1)\left(x_{i}, x_{i+1}\right).

(f)

Hence

f(x)=c+∫0xϕ(t,f(t))dt. f(x) = c+\int _{0}^{x} \phi (t, f(t)) d t.

This ff is a solution of the given problem.

Problem 1.7.26

Prove an analogous existence theorem for the initial-value problem

y′=Φ(x,y),y(0)=c \mathbf{y}^{\prime } = \Phi (x, y), \quad \mathbf{y}(0) = \mathbf{c}

where now c∈Rk,y∈Rkc \in \mathbb {R}^{k}, y \in \mathbb {R}^{k}, and Φ\Phi is a continuous bounded mapping of the part of Rk+1R^{k+1} defined by 0≤x≤1,y∈Rk0 \leq x \leq 1, y \in \mathbb {R}^{k} into Rk\mathbb {R}^{k}. (Compare Exercise 28, Chap. 5). Hint: Use the vector-valued version of Theorem 7.25.

?