Homework6 Solution Ian
Homework6 Solution Ian
IAN FRANCIS
1. 3.3
√
3) Let x1 ≥ 2 and xn+1 := 1 + xn − 1, n ∈ N. Show that (xn ) is decreasing and bounded below
by 2. Find the limit.
Solution
√ We are given√ x1 ≥ 2. Now assume xn ≥ 2 for some n ∈ N. Then xn+1 =
1 + xn − 1 ≥ 1 + 2 − 1 = 2. Hence, √ by induction, (xn ) is √ bounded below by 2. Now
we have xn ≥ xn+1 ⇔ xn ≥ 1 + xn − 1 ⇔ xn − 1 ≥ xn − 1, which is true since
xn − 1 ≥ 1 ⇔ xn ≥ 2, ∀n ∈ N, which we proved above. Hence, (xn ) is decreasing and
bounded below, so√ by the Monotone√Convergence Theorem, lim(xn ) = x ∈ R exists and
satisfies x = 1 + x − 1 ⇔ x − 1 = x − 1 ⇔ x ∈ {1, 2} ⇒ x = 2, since (xn ) is bounded
below by 2. ♦
√
4) Let x1 := 1 and xn+1 := 2 + xn , n ∈ N. Show (xn ) converges and find the limit. √
Solution
√ Note that x1 < 2. Now assume xn < 2 for some n ∈ N. Then xn+1 √ = 2 + xn <
2 + 2 = 4, so xn < 2 for all n ∈ N by induction. Now, xn+1 > xn ⇔ 2 + xn > xn ⇔
2 + xn > x2n ⇔ 2 > x2n − xn = xn (xn − 1), which is true since xn − 1 < 1, ∀n ∈ N. There-
fore, (xn ) is increasing and bounded above by 2. The √
Monotone Convergence Theorem then
implies that lim(xn ) = x ∈ R exists and satisfies x = 2 + x ⇒ x2 = 2 + x ⇒ x2 − x − 2 =
(x + 1)(x − 2) = 0 ⇒ x = 2, since xn ≥ 1 > −1, ∀n ∈ N. ♦
√ √
5) Let y1 := p, where p > 0 and yn+1 := p + yn , n ∈ N. Show that (yn ) converges and find the
limit.
√ √
Solution First, note that y1 < 1 + 2 p and assume that yn < 1 + 2 p for some n ∈ N. Then
√ p √ p√ √ √ √
yn+1 = p + yn < p + 1 + 2 p = ( p + 1)2 = p + 1 < 1 + 2 p, so yn < 1 + 2 p
p √ √ √ √
for all n ∈ N by induction. Now y2 > y1 ⇔ p + p > p ⇔ p + p > p ⇔ p > 0, a
triviality. Now assume yn+1 > yn , ∀n ≤ k, for some k ∈ N. Then yk+1 2 − yk2 = (p + yk ) −
(p + yk−1 ) = yk − yk−1 > 0 ⇒ (yk+1 + yk )(yk+1 − yk ) > 0 ⇒ y√ k+1 > yk , since we know
√
(yk+1 + yk ) > 0 by y1 > 0 and inductively yn > 0 ⇒ yn+1 = p + yn > p > 0, triv-
ially. By strong induction, yn+1 > yn , ∀n ∈ N, so (yn ) is increasing and bounded above ⇒
lim(xn ) = x ∈ R exists by the Monotone√ Convergence Theorem. Passing to the limit yields
√
x = x + p ⇔ x2 − x − p = 0 ⇒ x = 1+ 21+4p . ♦
√
6) Let a > 0 and let z1 > 0. Define zn+1 := a + zn for n ∈ N. Show that (zn ) converges and find
the limit. √ √
Solution First note that zn > 0, ∀n ∈ N (z1 > 0, zn > 0 ⇒ zn+1 = a + zn > a + 0 > 0).
Now (zn+1 + zn )(zn+1 − zn ) = zn+12 − zn2 = a + zn − (a + zn−1 ) = zn − zn−1 . Since
zn+1 + zn > 0 ⇒ zn − zn−1 , zn+1 − zn are either both nonpositive or nonnegative, ∀n ∈ N. So
(zn ) is monotonic. √
√ 2
n −zn (zn −r1 )(zn −r2 )
Now, zn+1 − zn = a + zn − zn = √a+z a+z +z
= − √
a+z +z
, where r1 = 1+ 1+4a
2 > 0, r2 =
n n n n
9) Let A be an infinite subset of R that is bounded above and let u := sup(A). Show there exists
an increasing sequence (xn ) with xn ∈ A, ∀n ∈ N such that u = lim(xn ).
Solution We use strong induction. We have ∀ε > 0, ∃ a ∈ A such that u − ε < a < u.In partic-
ular, ∃x1 ∈ A such that u − 21 < x1 ≤ u. Now assume x1 , ..., xn have all been chosen such that
1
x1 ≤ x2 ≤ ... ≤ xn , where xi ∈ A, ∀i such that 1 ≤ i ≤ n. Now let m = max{xn , u − 2n+1 }. If
m = u, set xn+1 = m = u. Otherwise, if m < u, ∃ p ∈ A such that m < p ≤ u. In that case,
1
choose xn+1 = p. So we have xn ≤ xn+1 and u − 2n+1 < xn+1 ≤ u. This process defines such
an increasing (xn ) that satisfies xn → u. ♦
11) Let xn := nk=1 k12 , for each n ∈ N. Prove that (xn ) is increasing and bounded, and hence
P
converges.
1
Solution We have xn+1 − xn = (n+1) 2 > 0, so the sequence is increasing. Now xn =
Pn 1 Pn n
1
1+ k=2 kk ≤ 1+ k=2 k(k−1) = 1+ k=2 k−1 − k = 1+1− 2 + 2 +−....+ n−1 − n = 2− n1 < 2,
1 1 1 1 1 1
P
so the sequence is bounded above by 2. By the Monotone Convergence Theorem, (xn ) con-
verges. ♦
2. 3.4
1
2) If 0 < c < 1, then lim(c ) = 1.
n
1 1 1
Solution We have that if 0 < c < 1, then c n < 1 and c n < c n+1 for all n ∈ N, so
1
xn := c n is bounded and strictly increasing, so the Monotone Convergence Theorem says
1 1
that x := lim(xn ) exists and we also have that x = lim(x2n ) ⇔ lim(c n ) = lim(c 2n ) =
1 1
lim(c n ) 2 ⇔ x = x2 ⇔ x ∈ {0, 1}. Since x1 > 0, and xn+1 > xn , ∀n ∈ N, it follows that
x 6= 0 ⇒ x = 1. ♦
5) Let X = (xn ), Y = (yn ) be given sequences, and let the shuffled sequences Z = (zn ) be defined
by z1 := x1 , z2 = y1 , ..., z2n−1 = xn , z2n = y2n , .... Show that Z is convergent ⇔ both X, Y are
convergent and lim(X) = lim(Y ).
Solution (⇒) Z convergent ⇒ X, Y are convergent and have the same limit, since they are
subsequences of Z.
(⇐) Suppose xn → z, yn → z, z ∈ R. Then if ε > 0, ∃ K, L ∈ N such that |xn − z| < ε,
447 HOMEWORK SET 6 3
|yn − z| < ε for n ≥ K, and n ≥ L, respectively. Let M = max{2K − 1, 2L} and let n ≥ M .
If n is odd, n = 2k − 1 for some k ≥ K such that zn = xk , thus |zn − z| < ε. Now if n is even,
then n = 2k for some k ≥ L such that |zn − z| < ε. Thus, lim(zn ) = z ♦
1
6) Let xn := n n for n ∈ N. Show xn → 1.
1
1 1 1 xn+1 (n+1) n+1
Solution a) Note that n = n+1 + n(n+1) . So we have xn+1 < xn ⇔ xn <1⇔ 1 =
nn
1
(n+1) n+1
1 1 < 1 ⇔ ( n+1 n 1 n 1 n
n ) = (1 + n ) < n. Now since ((1 + n ) ) is a monotonic, increasing
n n+1 n n2 +n
sequence that converges to e, it clearly is < 3. Thus xn > xn+1 , ∀n ≥ 3. It’s clear that
xn ≥ 1, ∀n ∈ N. Thus, the Monotone Convergence Theorem says that xn converges.
1
b) Since x2n must also converge to the same limit, we have lim(x2n ) = lim((2n) 2n ) =
1 1 1 1 1 1 1 1
lim((2) 2n (n) 2n ) = lim(1 · n n ) 2 . So lim(n n ) = lim(n n ) 2 ⇒ lim(n n ) ∈ {0, 1}. However
xn ≥ 1, ∀n ∈ N, so xn → 1. ♦