Homework 1

Table of Contents

Exercise 1.1.13

Prove Proposition 1.1.19.

Proposition (1.1.19)

Let XX be any set, and let ddiscd_{\mathrm{disc}} be the discrete metric on XX. Let (x(n))n=m\p{x^{\p{n}}}_{n=m}^\infty be a sequence of points in XX, and let xx be a point in XX. Then (x(n))n=m\p{x^{\p{n}}}_{n=m}^\infty converges to xx with respect to the discrete metric ddiscd_{\mathrm{disc}} if and only if there exists an NmN \geq m such that x(n)=xx^{\p{n}} = x for all nNn \geq N.

Solution.

"    \implies"

Assume (x(n))n=m\p{x^{\p{n}}}_{n=m}^\infty converges to xx. Then applying the definition of convergence with ε=12\varepsilon = \frac{1}{2}, we find NmN \geq m such that

nN    ddisc(x(n),x)<12.n \geq N \implies d_{\mathrm{disc}}\p{x^{\p{n}}, x} < \frac{1}{2}.

But ddisc(x(n),x){0,1}d_{\mathrm{disc}}\p{x^{\p{n}}, x} \in \set{0, 1}, so this means ddisc(x(n),x)=0d_{\mathrm{disc}}\p{x^{\p{n}}, x} = 0. By the definition of a metric space, this means x(n)=xx^{\p{n}} = x for nNn \geq N.

"    \impliedby"

Let NmN \geq m be such that x(n)=xx^{\p{n}} = x for all nNn \geq N. Given any ε>0\varepsilon > 0, if nNn \geq N, then

ddisc(x(n),x)=ddisc(x,x)=0<ε.d_{\mathrm{disc}}\p{x^{\p{n}}, x} = d_{\mathrm{disc}}\p{x, x} = 0 < \varepsilon.

Exercise 1.4.7

Prove Proposition 1.4.12.

Proposition (1.4.12)
  1. Let (X,d)\p{X, d} be a metric space, and let (Y,dY×Y)\p{Y, \left. d \right\rvert_{Y \times Y}} be a subspace of (X,d)\p{X, d}. If (Y,dY×Y)\p{Y, \left. d \right\rvert_{Y \times Y}} is complete, then YY must be closed in XX.

  2. Conversely, suppose that (X,d)\p{X, d} is a complete metric space, and YY is a closed subset of XX. Then the subspace (Y,dY×Y)\p{Y, \left. d \right\rvert_{Y \times Y}} is also complete.

Solution.

This problem is really a test of your ability to use the definitions precisely, i.e., understand which definitions are applied in the metric space (X,d)\p{X, d} versus (Y,dY×Y)\p{Y, \left. d \right\rvert_{Y \times Y}}. Everything I wrote down is needed to have a completely correct proof, so pay close attention to when I use dd versus dY×Y\left. d \right\rvert_{Y \times Y}.

  1. Assume (Y,dY×Y)\p{Y, \left. d \right\rvert_{Y \times Y}} is complete and let (yn)nY\p{y_n}_n \subseteq Y be a sequence which converges to some x0Xx_0 \in X with respect to dd. Then (yn)n\p{y_n}_n is Cauchy in (X,d)\p{X, d}, but because (yn)nY\p{y_n}_n \subseteq Y, we have

    d(yn,x0)=dY×Y(yn,x0),d\p{y_n, x_0} = \left. d \right\rvert_{Y \times Y}\p{y_n, x_0},

    which implies that (yn)n\p{y_n}_n is also Cauchy in (Y,dY×Y)\p{Y, \left. d \right\rvert_{Y \times Y}}. Since YY is complete, this means that (yn)n\p{y_n}_n converges to some y0Yy_0 \in Y with respect to dY×Y\left. d \right\rvert_{Y \times Y}. By uniqueness of limits, we must have x0=y0Yx_0 = y_0 \in Y, so YY is closed in (X,d)\p{X, d}.

  2. Assume that YY is closed in (X,d)\p{X, d} and let (yn)nY\p{y_n}_n \subseteq Y be a Cauchy sequence in (Y,dY×Y)\p{Y, \left. d \right\rvert_{Y \times Y}}. As above,

    d(yn,ym)=dY×Y(yn,ym),d\p{y_n, y_m} = \left. d \right\rvert_{Y \times Y}\p{y_n, y_m},

    which implies that (yn)n\p{y_n}_n is also Cauchy in (X,d)\p{X, d}. Since (X,d)\p{X, d} is complete, there exists x0Xx_0 \in X such that ynx0y_n \to x_0 with respect to dd. But (yn)nY\p{y_n}_n \subseteq Y, so because YY is closed, this means x0Yx_0 \in Y. Finally,

    dY×Y(yn,x0)=d(yn,x0)n0,\left. d \right\rvert_{Y \times Y}\p{y_n, x_0} = d\p{y_n, x_0} \xrightarrow{n\to\infty} 0,

    so ynx0y_n \to x_0 with respect to dY×Y\left. d \right\rvert_{Y \times Y}.

Exercise 1.5.2

Prove Proposition 1.5.5.

Proposition (1.5.5)

Let (X,d)\p{X, d} be a compact metric space. Then (X,d)\p{X, d} is both complete and bounded.

Solution.

(X,d)\p{X, d} is complete:

Let (xn)nX\p{x_n}_n \subseteq X be a Cauchy sequence. Since XX is compact, there exists a subsequence (xnk)k\p{x_{n_k}}_k which converges to some x0Xx_0 \in X. We now need to show that the original sequence also converges to x0x_0. Let ε>0\varepsilon > 0. Then there exists NNN \in \N such that if k,Nk, \ell \geq N, then

d(xk,x)<ε2.d\p{x_k, x_\ell} < \frac{\varepsilon}{2}.

In particular, if N\ell \geq N, then nNn_\ell \geq \ell \geq N, so d(xk,xn)<ε2d\p{x_k, x_{n_\ell}} < \frac{\varepsilon}{2}. Finally, because xnkx0x_{n_k} \to x_0, there exists 0N\ell_0 \geq N such that d(xn0,x0)<ε2d\p{x_{n_{\ell_0}}, x_0} < \frac{\varepsilon}{2}. Putting everything together, we get for kNk \geq N,

d(xk,x0)d(xk,x0)+d(x0,x0)<ε.d\p{x_k, x_0} \leq d\p{x_k, x_{\ell_0}} + d\p{x_{\ell_0}, x_0} < \varepsilon.

(X,d)\p{X, d} is bounded:

Suppose XX is not bounded and let x1Xx_1 \in X. Then XB(x1,1)X \subsetneq B\p{x_1, 1}, so there exists x2XB(x1,1)x_2 \in X \setminus B\p{x_1, 1}. Notice that XB(x1,1)B(x2,1)X \subsetneq B\p{x_1, 1} \cup B\p{x_2, 1}, or else

XB(x1,1)B(x2,1)B(x1,d(x1,x2)+1).X \subseteq B\p{x_1, 1} \cup B\p{x_2, 1} \subseteq B\p{x_1, d\p{x_1, x_2} + 1}.

Now suppose we have chosen x1,,xnx_1, \ldots, x_n such that xkXi=1k1B(xi,1)x_k \in X \setminus \bigcup_{i=1}^{k-1} B\p{x_i, 1} for all 2kn2 \leq k \leq n. Then Xi=1nB(xi,n)X \subsetneq \bigcup_{i=1}^n B\p{x_i, n}, or else

XB(x1,max{d(x1,xi)2in}+1).X \subseteq B\p{x_1, \max\set{d\p{x_1, x_i} \mid 2 \leq i \leq n} + 1}.

(Check this!) Thus, there exists xn+1Xi=1nB(xi,n)x_{n+1} \in X \setminus \bigcup_{i=1}^n B\p{x_i, n}. By induction, we have constructed a sequence (xn)n\p{x_n}_n with the property xnXi=1n1B(xi,1)x_n \in X \setminus \bigcup_{i=1}^{n-1} B\p{x_i, 1} for all nNn \in \N. In particular, if n<mn < m, then

xmB(xn,1)    d(xn,xm)1.x_m \notin B\p{x_n, 1} \iff d\p{x_n, x_m} \geq 1.

Thus, no subsequence can possibly be Cauchy, so no subsequence can possibly be convergent, i.e., XX is not compact.