1. hw 7
(1) Assuming that the Bolzano-Weierstrass Theorem is true for R1, prove that the Bolzano-Weierstrass Theorem is true for Rp for any p ∈ N by mathematical In- duction. (Hint: Let (an) be a bounded sequence in Rp+1. Write an= (xn, yn) for all n ≥ 1 where (xn) is a sequence in Rp and (yn) is a sequence in R. Show that (xn) is bounded in Rp and (yn) is bounded in R.)
Proof. We have proved the case when p = 1. Let us assume that the Bolzano- Weierstrass Theorem holds for p = k. Let (an) be a bounded sequence in Rk+1. Then there exists M > 0 so that kank
Rk+1 ≤ M for any n ≥ 1. For each n ≥ 1, let us write an= (xn, yn) where xn∈ Rk and yn∈ R for n ≥ 1. For any n ≥ 1,
|yn|, kxnk
Rk ≤ kank
Rk+1 = q
kxnk2
Rk+ |yn|2 ≤ M.
This shows that (xn) is a bounded sequence in Rkand (yn) is a bounded sequence in R. By Bolzano-Weierstrass Theorem for Rk, (xn) has a subsequence (xnj) which is convergent to some point x in Rk. Since (yn) is bounded in R, (ynj) is also bounded in R. By Bolzano-Weierstrass Theorem for R, (ynj) has a further subsequence (ynjl) which converges to some y in R. Since (xnj) converges to x in Rk, its subsequence (xnjl) also converges to x. Now, the subsequence (anjl) of (an) is convergent to (x, y). We prove that the Bolzano-Weierstrass Theorem is true for p = k + 1. By Mathematical induction, Bolzano-Weierstrass Theorem holds for all p ∈ N. (2) Let (M, d) be a complete metric space and N be a subset of M. Let (N, dN) be the metric subspace of (M, d) associated with N. Prove that (N, dN) is complete if and only if N is a closed subset of M.
Proof. Let us assume that N is a closed subset of M. We want to show that (N, dN) is complete. Let (an) be a Cauchy sequence in (N, dN). Then for any > 0, there exists N∈ N so that dN(an, am) < whenever n, m ≥ N. Since (N, dN) is a metric subspace of (M, d), dN(x, x0) = d(x, x0) for any x, x0 ∈ N. For any n, m ≥ N,
d(an, am) = dN(an, am) < .
This shows that (an) is a Cauchy sequence in (M, d). Since (M, d) is complete, (an) is convergent to some point a in (M, d). For the > 0 given, there exists N ∈ N so that d(an, a) < for any n ≥ N. Since an ∈ N for any n ≥ 1, this shows that a is an adherent point of N. Since N is closed, a ∈ N. Since an, a ∈ N, dN(an, a) = d(an, a) < whenever n ≥ N. This shows that (an) is convergent to a in (N, dN). Therefore (N, dN) is complete.
Let us assume that (N, dN) is complete. We want to show that N is a closed subset of (M, d). In other words, let us prove that N contains all of its adherent points. Let a be an adherent point of N. Then there exists a sequence (an) in N so that (an) is convergent to a in (M, d), i.e. for any > 0, there exists N0 ∈ N so that d(an, a) < /2 whenever n ≥ N. Therefore d(an, am) < whenever n, m ≥ N0 in other words, (an) is a Cauchy sequence in (M, d). Since an ∈ N for any n ≥ 1, dN(an, am) = d(an, am) < whenever n, m ≥ N0. This implies that (an) is a Cauchy sequence in (N, dN). By completeness of (N, dN), (an) is convergent to some b ∈ N.
For the given above, we can find N00 such that dN(an, b) < /2 whenever n ≥ N00.
1
2
Let N = max{N0, N00}. For any n ≥ N,
d(a, b) ≤ d(an, a) + d(an, b) = d(an, a) + dN(an, b) < 2 +
2 = .
This shows that d(a, b) < for any > 0. Hence d(a, b) = 0. Since d is a metric on M, a = b. We find that a = b ∈ N. Hence N is closed.
(3) In Calculus, we have learned the following important properties for convergent se-
quences:
Theorem 1.1. Let (an) and (bn) be sequence of real numbers and k be a real number. Suppose that
n→∞lim an= a, lim
n→∞bn= b.
Then (a) lim
n→∞(an+ bn) = a + b;
(b) lim
n→∞(kan) = ka;
(c) lim
n→∞anbn= ab (d) lim
n→∞
an
bn
= a
b if b ≥ 0.
In class, we also proved
Theorem 1.2. Let (an) be a sequence in Rp with an = (a1n, · · · , apn) for n ≥ 1.
Then (an) is convergent in Rp if and only if (a1n), · · · , (apn) are convergent in R. In this case,
n→∞lim an=
n→∞lim a1n, · · · , lim
n→∞apn .
Let (xn) and (yn) be sequences in Rp such that limn→∞xn= x andlimn→∞yn= y. Use Theorem 1.1 and Theorem 1.2 to prove the following statements:
(a) lim
n→∞(xn+ yn) = x + y.
(b) lim
n→∞kxn= kx.
(c) lim
n→∞anxn= ax.
(d) lim
n→∞
xn
bn = x
b if b ≥ 0.
(e) lim
n→∞hxn, yni = hx, yi.
Proof. Routine Check.