Scribd
Upload
36 views

M2 - Convergence Using Theorems 3

This document defines key concepts related to convergence of sequences such as monotone convergent theorem (MCT), Cauchy sequences, and provides examples. It then presents 15 problems involving determining convergence or properties of specific sequences. The problems apply techniques like induction, taking limits, and comparing to known convergent forms to analyze monotonicity, boundedness and convergence.

Uploaded by

Jason Costanzo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views

M2 - Convergence Using Theorems 3

This document defines key concepts related to convergence of sequences such as monotone convergent theorem (MCT), Cauchy sequences, and provides examples. It then presents 15 problems involving determining convergence or properties of specific sequences. The problems apply techniques like induction, taking limits, and comparing to known convergent forms to analyze monotonicity, boundedness and convergence.

Uploaded by

Jason Costanzo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Convergence using theorems III

Definitions
ˆ MCT: If {an } is bounded and monotone, then it converges.
Recall
ˆ We defined Cauchy sequences as: {an } is Cauchy iff
(∀ϵ > 0)(∃N )(m > n > N =⇒ |am − an | < ϵ.

ˆ Every Cauchy sequence in R must converge in R. Conversely, every convergent sequence is


Cauchy.
One advantage of Cauchy sequences is that there is no mention of the limit a in the definition.
Thus we can prove convergence without ever knowing what the limit is.
ˆ Bounded sequences do not have to converge. Counterexample: an = (−1)n . an is bounded,
but it oscillates between −1 and 1, and so it doesn’t converge.
Problems
√
1. Let the sequence {sn }∞
1 be defined as s1 = 0 and sn+1 = 1 + sn . Show that {sn }∞
1 converges
to a limit s and find s.
ˆ We use the MCT. To do that, we show that {sn } is bounded and monotone. By the
MCT, it must converge.
a) We use induction to show sn < 2.
√ √ √
– For n = 1, s2 = 1 + s1 = 1 + 1 = 2 < 2.
– Assume sn < 2 and show sn+1 < 2. write
√
sn+1 = 1 + sn
√
< 1 + 2 (by induction assumption sn < 2)
√
= 3
< 2
b) We use induction to show that {sn } is increasing
√ √
* s1 = 1 < 1 + 1 = 1 + s1 = s2 . Thus the property is true for n = 1.
* Assume sn > sn−1 and show sn+1 > sn . In fact,
√
sn+1 = 1 + sn
p
> 1 + sn−1 (why?)
= sn
c) we have shown that sn ↗ and bounded. By the MCT it must converge to a limit s.
d) How do we find s? Since sn −→ s, all the terms sn will be near the limit s for large
enough √
n (i.e, for n > N , where
√ N ∈ I). Thus if we take the limit of both sides of
sn+1 = 1 + sn , we get s = 1 + s. Now we solve for s.
s2 = 1+s
=⇒ s2 − s − 1 = 0
√
1± 1+4
=⇒ s = .
2
√
1+ 5
Since sn > 0, we choose the positive root s = 2 . Done!

1
ˆ Caution: The step in d) of taking the limits of both sides can not be done before proving
the limit of the sequence {sn } exists. Here is an an example that will illustrate the idea
Let a1 = 1, and an+1 = an + 1. Assume (without a proof) that an −→ a. Now take the
limit of both sides: limn−→∞ an+1 = limn−→∞ an + 1. It follows that a = a + 1 which
implies 0 = 1. The contradiction we got is due to the fact that this sequence does not
converge. In fact, a1 = 1, a2 = a1 + 1 = 2, a3 = a2 + 1 = 3, · · · , an = 1 + an−1 = n, · · ·.
n o
1
2. Is an = 1+n 2 monotone?
Proof There is a quick way to show monotonicity for the this sequence. Assume n is a
continuous variable x (not discrete like 1, 2, 3, · · ·), and take the derivative using the quotient
rule.  ′
1 −2x
= .
1 + x2 (1 + x2 )2
Since x > 0, and the denominator (1+x2 )2 > 0, the derivative is negative, and so the function
1
1+x2
is decreasing. In particular, an is decreasing.
3. Is an = {2n + (−1)n } monotone?
Sketch Notice here that the values of an are: 1, 5, 5, 9, 9, 13, 13, · · ·. This is still monotonically
increasing, albeit not strictly increasing. In other words, an ≤ an+1 and not an < an+1 . This
can be shown in various ways, one of which is induction on n.
100n
4. If an = n! . Find N ∈ I, the set of positive integers, such that an+1 < an (n > N ).
Proof So when is an+1 < an ? Replace each term with its value and solve the resulting
inequality.
100n+1 100n ×
100 100 · · · 100 ×
100
 100· · ·100

< =⇒ < .
(n + 1)! n! 1 × 2 × 3 × · · · × 
n × (n + 1) 1 × 2 × 3 × · · · × 
n
We end up with
100 1
< = 1.
n+1 1
Thus, for an+1 to be less than an , take n ≥ 100. Then
100 100 100
< = < 1.
n+1 100 + 1 1001
It follows that an+1 < an .
5. For n a positive integer, let
1 · 3 · 5 · · · (2n − 1)
an = .
2 · 4 · 6 · · · 2n
Prove {an } is convergent and limn−→∞ an ≤ 21 .
6. Let
2 · 4 · 6 · · · 2n 1
an = · 2.
1 · 3 · 5 · · · (2n − 1) n
Show a1 > a2 > a3 . Is {an } non-increasing?
7. Let
1 + 2 + ··· + n
an = (n ∈ I).
n2
show that {an } is monotone and bounded, and that limn−→∞ an = 12 . Hint: Use the formula
1 + 2 + · · · + n = n(n+1)
2 . Show that an is bounded above by 1. Guess whether an is increasing
or decreasing. Now prove your guess by setting the inequality you think to be true.

2
√
n
8. Let limn−→∞ bn = b > 0. Show limn−→∞ b1 · b2 · b3 · · · bn = b.
1/2
9. Prove that if {an }∞ ∞
1 converges to 1, then {an }1 converges to 1. Hint: You can a logarithm
1/2
argument to show that ln an approaches 0.

10. Let c1 = 0 and c2 = 1. Show cn+1 = 12 (cn + cn−1 ) converges to c. Find c


√ √
11. Let cn+1 = 2 cn . show {cn } converges to c. Find c. Hint: Use induction to show cn is
bounded and monotone. Then use a common trick to find the limit.

12. Suppose a1 > 0 and an+1 = an + a1n . Prove that {an } diverges to ∞. Hint: Assume
an converges to a nonzero limit a. Use a familiar trick to find an equation that would be
satisfied by the limit.
1
13. Show that the sequence an = 1 + √
3 n is a Cauchy sequence. Hint: Every convergent sequence

is a Cauchy sequence.
√
14. Let a1 = 2 and let an for n ≥ 2 be defined recursively by the formula
√
q
an+1 = 2 + an .

Prove that an is bounded above by 2. Hint: Use induction on n.

15. Let {a2n } be a Cauchy sequence. Does {an } have to be a Cauchy sequence? Hint: Give an
example of a sequence {a2n } that converges (thus Cauchy), but {an } does not converge (thus
not Cauchy).

You might also like