Advanced Calculus Midterm Exam
November 24, 2010 Note: There are 8 questions with total 126 points in this exam.1. Let {xk} be a sequence defined recursively by x1=√
2, and xk+1=p
2 + xk, for k = 1, 2, . . . . (a) (10 points) Show by induction that (i) xk< 2 and (ii) xk< xk+1 for all k.
Solution: (i) When k = 1, x1=√ 2 < 2.
Assume that xk< 2. Then we have xk+1 =p
2 + xk<√
2 + 2 = 2.
Thus, the argument of induction implies that xk< 2 for all k.
(ii) Using (i) twice, we have xk+1=p
2 + xk>√
xk+ xk=√ 2√
xk>√ xk√
xk= xkfor all k.
(b) (10 points) Show that lim
k→∞xkexists and evaluate it.
Solution: The results of (a) implies that {xk} is an increasing sequence and it is bounded from above by 2. The Monotone convergence theorem implies that lim
k→∞xk= x exists, and since x =
k→∞limxk+1= lim
k→∞
p
2 + xk=√
2 + x, we have 0 = x2− x − 2 = (x − 2)(x + 1) =⇒ x = 2.
2. (16 points) Let S ⊂ Rnand x ∈ Rn. Show that x ∈ S if and only if there is a sequence of points {xk} in S that converges to x. [Hint: You may use the fact that the closure of S is the union of S and all its boundary points, i.e. S = S ∪∂S.]
Solution: (⇒) If x ∈ S = S ∪∂S, then either
Case (i) : x ∈ S, then the sequence {xk= x}, for k = 1, 2, . . . , is a sequence in S that converges to x, or
Case (ii) : x ∈∂S, then, there is an xk∈ B(1
k, x) ∩ S, for each k = 1, 2, . . . satisfying that lim
k→∞xk= x.
(⇐) For each x /∈ S, there exists an r > 0 such that B(r, x) ⊂ Sc. This implies there does not exist any sequence of points {xk} in S that converges to x.
Remark: This equivalence says that S ∪∂S = S ∪ S0, where S0 denote the set of accumulation points of S.
3. (a) (10 points) Let B(r, 0) = {x ∈ Rn: kxk < r} be the ball of radius r about the origin. Show that B(r, 0) is open in Rn.
Solution: For each p ∈ B(r, 0), we have B(r − kpk, p) ⊂ B(r, 0) since for each y ∈ B(r − kpk, p) we have kyk ≤ ky − pk + kpk < r − kpk + kpk = r, i.e. y ∈ B(r, 0).
Alternative proof: Since 0 ∈ B(r, 0) ⊂ B(r, 0), 0 is an interior point of B(r, 0).
For each p ∈ B(r, 0) \ {0}, by settingρ = min{kpk, r − kpk} > 0, we have B(ρ, p) ⊂ B(r, 0) and conclude that p is an interior point of B(r, 0). Thus, B(r, 0) is open since each of its points is an interior point.
(b) (16 points) Show that if S1and S2are open, so are S1∪ S2and S1∩ S2.
Solution: For each p ∈ S1∪ S2, since p is an interior point of Si, for i = 1 or 2, there exists a B(r, p), for some r > 0, satisfying either B(r, p) ⊂ Si⊂ S1∪ S2. Thus, p is an interior point of S1∪ S2, and S1∪ S2is open.
For each p ∈ S1∩ S2, there exist r1, r2> 0 such that B(r1, p) ⊂ S1, and B(rr, p) ⊂ S2. By taking r = min{r1, r2} > 0, we have B(r, p) ⊂ S1∩ S2, and conclude that S1∩ S2is open.
Advanced Calculus Midterm Exam (Continued) November 24, 2010
(c) (8 points) Show that for any S ⊂ Rn, Sint is open.
Solution: For each p ∈ Sint, there is an r > 0 such that B(r, p) ⊂ S. By (a), every point in B(r, p) is an interior point of B(r, p) ⊂ S, hence, it is also an interior point of S. Thus, B(r, p) ⊂ Sint, and this implies that Sint is open.
Alternative proof:The definition of an interior point says that x ∈ Sint if there exists a ball B(r, x) ⊂ S. Therefore, if x /∈ Sint, then either every ball centered at x intersects both S and Sc, or there exists a ball B(r, x) ⊂ Sc, i.e. x ∈∂S ∪ (Sc)int. Since∂S =∂Sc,∂S ∪ (Sc)int=∂Sc∪ (Sc)int is closed, Sint is open.
4. (10 points) Let f : S → Rmbe a function satisfying
|f(x) − f(y)| ≤ C|x − y|λ for all x, y ∈ S,
where C > 0 andλ > 0 are constants. Show that f is uniformly continuous on S.
Solution: For each ε > 0, since |f(x) − f(y)| ≤ C|x − y|λ for all x, y ∈ S, we choose δ =¡ε C
¢1/λ
such that if , x, y ∈ S satisfying that |x − y| <δ, then |f(x) − f(y)| ≤ C|x − y|λ < Cδ =ε. Hence, f is uniformly continuous on S.
5. (16 points) Show that f : Rn→ Rk is continuous (in the sense ofε-δ definition) if and only if for each open subset U in Rk the set f−1(U) = {x ∈ Rn: f(x) ∈ U } is open.
Solution: (⇒) Let U be an open subset in Rk and p be a point in f−1(U). Given ε > 0, since B(ε, f(p)) ∩U is open, there exists a ball B(η, f(p)) ⊂ B(ε, f(p)) ∩U, for someη> 0. The continuity of f at p implies that there is a ball B(δ, p), for some δ > 0, such that f(B(δ, p)) ⊂ B(η, f(p)) ⊂ B(ε, f(p)) ∩U ⊂ U. This implies that B(δ, p) ⊂ f−1(U), and f−1(U) is open .
(⇐) For each p ∈ Rn, and eachε> 0, since the set B(ε, f(p)) is open in Rk, f−1(B(ε, f(p))) is an open set containing p. There exists aδ> 0 such that B(δ, p) ⊂ f−1(B(ε, f(p))), i.e. f(B(δ, p)) ⊂ B(ε, f(p)), and f is continuous at p.
6. (10 points) Suppose that f : Rn→ Rm is continuous on U ⊂ Rn and g : Rm→ Rk is continuous on f(U ) ⊂ Rm. Show that the composite function g(f) : Rn→ Rkis continuous on U.
Solution: For each p ∈ U, and anyε> 0, since g is continuous at f(p), there existsδ1> 0, such that if y ∈ f(U ) satisfying that |y − f(p)| <δ1, then |g(y) − g(f(p))| <ε. Also, since f is continuous at p, there exists aδ > 0, such that if x ∈ U satisfying that |x − p| <δ, then |f(x)− f(p)| <δ1which implies that |g(f(x)) − g(f(p))| <ε, i.e. the composite function g(f) is continuous at each p ∈ U.
Page 2
Advanced Calculus Midterm Exam (Continued) November 24, 2010
7. (10 points) Let S be a compact subset of Rnand let f : S → Rmbe continuous at every point of S. Show that the image set
f(S) = {f(x) : x ∈ S}
is also compact.
Solution: Suppose {yk} is a sequence in f(S). This implies that, for each k, there is an xk ∈ S such that yk= f(xk). Since S is compact, by the Bolzano-Weierstrass theorem, {xk} has a convergent subse- quence {xkj} that converges to a point a ∈ S. Since f is continuous at a, lim
j→∞ykj = lim
j→∞f(xkj) = f(a) ∈ f (S). Thus, every sequence in f(S) has a subsequence whose limit lies in f(S). This implies that f(S) is compact.
8. (10 points) Let S be a connected subset in Rn. Show that the closure of S is also connected.
Solution: Suppose that S is disconnected and (U,V ) is a disconnection of S. Suppose that U ∩ S 6= /0 and V ∩ S 6= /0, then it is easy to see that (U ∩ S,V ∩ S) is a disconnection of S. This contradicts to that S is connected. Therefore, either U ∩ S = /0, or V ∩ S = /0. Assume that V ∩ S = /0, since S ∪∂S = S = U ∪ V, this implies that V ⊂∂S, and U = S. But, this implies that U ∩ V = S ∩ V 6= /0 which contradicts to that (U,V ) is a disconnection of S. It is easy to see that U ∩ S = /0 will also lead to a contradiction. Therefore, S is connected.
Note: (1)In general, the converse is not true. e.g. Let S = [0, 1) ∪ (1, 2). Then S = [0, 2] is connected while S is not.
(2)A subset A ⊂ S is said to beopen relative to the set Sif there exists an open set U ⊂ Rnsuch that A = U ∩ S.
The definition of connectedness of S ⇐⇒ is equivalent to that S cannot be a disjoint union of two nonempty open subsets relative to S, i.e. S cannot be expressed as S = A ∪ B, where /0 6= A = U ∩ S, and /0 6= B = V ∩ S, A ∩ B = /0, and U,V are open subsets of Rn.
proof of (⇒) Suppose that S = A ∪ B, where /0 6= A = U ∩ S, and /0 6= B = V ∩ S, A ∩ B = /0, and U,V are open subsets of Rn.
⇒ A = S \ B = S \ (V ∩ S) = S \V = S ∩Vc, and B = S \ A = S \ (U ∩ S) = S \U = S ∩Uc.
⇒ A ∩ B =¡
S ∩Vc¢
∩¡ S ∩V¢
= /0, and A ∩ B =¡
S ∩Vc¢
∩¡ S ∩V¢
= /0.
Hence, S is disconnected.
proof of (⇐) Suppose that S is disconnected, and S = S1∪ S2, where /0 6= Si, i = 1, 2, and S1∩ S2= /0, S1∩ S2= /0.
⇒ S1= S2
c∩ S, and S2= S1
c∩ S are disjoint nonempty open subsets relative to S, and S = S1∪ S2.
Page 3