Beruflich Dokumente
Kultur Dokumente
1
n
0
< . To do this,
we usually start with what we want, i.e.
1
n
0
1
n
0
< =
1
n
<
=
1
n
<
=n >
1
, then n _ N =
1
n
0
< .
Example 303 Show that the sequence whose general term is x
n
=
1
n
2
converges
to 0.
Given > 0, we need to nd N such that n _ N =
1
n
2
0
< . To do this,
we usually start with what we want, i.e.
1
n
2
0
1
n
2
0
< =
1
n
2
<
=
1
n
2
<
=n
2
>
1
=n >
1
_
or n <
1
_
,
then n _ N =
1
n
0
< .
Example 304 Same example as above, using a slightly dierent approach.
When we had
1
n
2
< . We could have noticed that if n > 1 we have
1
n
2
<
1
n
.
So, if we make
1
n
< then what we need,
1
n
2
< will also happen. We can
make
1
n
< simply by taking n >
1
1
n
2
0
works.
112 CHAPTER 4. SEQUENCES AND LIMIT OF SEQUENCES
Remark 305 It seems that if we do the same problem dierent ways, we nd a
dierent solution. We really dont. When we nd N, the only thing we guarantee
is that if n _ N, then [x
n
L[ < . It might also be true if n is slightly less
than N. In other words, we are not nding the smallest N that will work. If we
use approximations like in example 304 , we may not get the best estimate for
N.
Remark 306 The idea is the following. Forget mathematics for a second (just
a second). Imagine you are driving on a dirt road and you come to a bridge.
You are not sure if the bridge can withstand the weight of your car. If ahead of
you is a vehicle you know to be heavier than yours which just cleared the bridge,
then you know your vehicle can clear the bridge as well.
Remark 307 The above example illustrates a general technique to nd N given
. In general, the general term of the sequence is too complicated for us to be
able to solve for n: If we call x
n
the general term of the sequence, we do the
following: Start with [x
n
L[ and simplify it as much as possible. We get an
expression involving n, call it E
1
(n). If we still cannot solve for n in E
1
(n) < ,
we try to nd an upper bounds of [x
n
L[, call it E
2
(n) for which we can solve
E
2
(n) < . The result will follow. Since [x
n
L[ = E
1
(n) < E
2
(n), if we can
have E
2
(n) < , we will also have [x
n
L[ < . Obviously, E
2
(n) has to be
small enough so we can make it as small as we want. We illustrate this with
the next example.
Example 308 Show that the sequence x
n
whose general term is x
n
=
2n 1
3n + 2
converges to
2
3
.
Again, as before, we look at what we need, and see if we can derive the condition
n must satisfy.
2n 1
3n + 2
2
3
< ==
6n 3 6n 7
3 (3n + 2)
==
10
3 (3n + 2)
<
Though here we could solve for n, we can also use an upper bound instead. We
notice that
10
3 (3n + 2)
=
10
9n + 6
<
10
9n
Thus, if we make
10
9n
< , it will follow that
2n 1
3n + 2
2
3
2n 1
3n + 2
2
3
< this
proves that lim
2n 1
3n + 2
=
2
3
.
4.2. LIMIT OF A SEQUENCE: DEFINITIONS 113
Example 309 Prove that lim
__
n + 1
_
n
_
= 0.
Again, as before, we look at what we need, and see if we can derive the condition
n must satisfy.
__
n + 1
_
n
_
0
< ==
__
n + 1
_
n
_ __
n + 1 +
_
n
_
_
n + 1 +
_
n
<
We work on the left side of the inequality and nd an upper bound.
__
n + 1
_
n
_ __
n + 1 +
_
n
_
_
n + 1 +
_
n
=
1
_
n + 1 +
_
n
<
1
2
_
n
So, if we make
1
2
_
n
< , we will have what we need, that is
_
n + 1
_
n
< .
The former happens when
_
n >
1
2
or n >
1
4
2
(since n > 0). Now, we see
that given > 0, if n >
1
4
2
then
__
n + 1
_
n
_
0
_
1
2
n
if n = 2k
1
n
2
+ 1
if n = 2k + 1
for any integer k. Prove that x
n
0.
7. Let x
n
=
n
2
+ 3n + 1
2n
2
+ n + 4
. Prove that x
n
1
2
.
8. Explain and justify the following observations made in the notes:
114 CHAPTER 4. SEQUENCES AND LIMIT OF SEQUENCES
(a) If a sequence is in a set, then it is eventually in the set.
(b) If a sequence is eventually in a set, then it is frequently in the set.
(c) (x
n
) is eventually in S if and only if it is not frequently in R S.
(d) (x
n
) is frequently in S if and only if it is not eventually in R S.
9. Prove theorem 288.
10. Prove theorem 293.
11. Prove theorem 294.
12. Prove theorem 295.