Professional Documents
Culture Documents
You are welcome to work in your groups, or with anyone else for these problems. How-
ever, I will expect you to be able to complete any of these problems unaided.
3.6: 2, 6, 9
Solutions
3.6.2.a Consider xn = yn = n. (xn ) and (yn ) are each properly divergent. xn /yn = 1
converges to 1
3.6.2.b Consider xn = n2 and yn = n. (xn ) and (yn ) are each properly divergent.
xn /yn = n is properly divergent.
3.6.9.
Suppose that xn and yn are sequences of positive numbers such that xn /yn → ∞
(a) If yn → ∞ then xn → ∞.
(b) If xn is bounded then yn → 0.
1
2
(a) Since yn → ∞, there is some N such that if n > N then yn > 1. But then xn > xn /yn .
Theorem 3.6.4 now implies that xn → ∞.
(b) Since (xn ) is bounded, there exists some B > 0 with xn < B for all n, so that
xn /yn < B/yn so that B/yn → ∞.
Consider any > 0, Let α = B/. Since B/yn → ∞ there is some N such that if n > N
then B/yn > B/ so that yn < . Thus, for all > 0 there is an N such that if n > N then
|yn | = yn < . yn → 0.
Show that a sequence (xn ) has no lower bound if an only if there is a subsequence (xnk )
such that (xnk ) goes to −∞.
If xn has a lower bound then so does its every subsequence. Thus, if xn has a lower
bound then no subsequence diverges to −∞.
Conversely, suppose that (xn ) has no lower bound. We will build a subsequence (xnk )
diverging to −∞. We describe (nk ) recursively.
Since −1 is not a lower bound there is some n1 ∈ N with xn1 < −1.
We now define nk+1 in terms of nk . Since (xn ) has not lower bound, so does the nk -tail
of xn . Thus, there is an nk+1 > nk for which xnk+1 < −(k + 1).
Notice that this recursion builds a sequence (nk ) of integers with n1 < n2 < n3 < . . .
(so that xnk is a subsequence of xn ) and xnk < −k for all k. Since −k → −∞ as k → ∞,
xnk → −∞.