Академический Документы
Профессиональный Документы
Культура Документы
Bounded Subsets
Denition 12.
S.
1.6
1. M UB(S)
1.7
1.8
Monotonic Sequences
Denition 20.
1. A sequence (xn ) is called monotonically increasing sequence if xn+1
xn for all n 1.
2. A sequence (xn ) is called monotonically decreasing sequence if xn+1 xn for all
n 1.
3. A sequence (xn ) is called monotonic sequence if it is either monotonically increasing
or monotonically decreasing sequence.
4. A sequence (xn ) is called strictly monotonic sequence if the inequality in the denition above is strict.
Examples 21. Examples of monotonically increasing sequence:
xn = 1
xn = n
n
Examples of monotonically decreasing sequence:
xn = n1
Corollary 22. A sequence (xn ) is monotonically decreasing if and only if (xn ) is monotonically increasing.
Remark: The sequence
(1)n
n
is not monotonic.
1.9
Thus |xn x| < for all n > k. Now is arbitrary, therefore (xn ) x.
Result 15.
1. A monotonically decreasing sequence is convergent if and only if it is
bounded below.
2. A bounded monotonic sequence is convergent.
1
= 0.
Examples 23.
1. lim
n
n
2. xn+1 = xn +
1
.
n+1
Exercise:
1. If x1 = 1 and xn+1 = 13 (xn + 1) for all n N, then show that (xn ) is convergent
sequence and nd it limit.
2. Let x1 = 1 and xn+1 = 2xn for all n N then show that (xn ) is convergent
sequence and nd its limit.
1.10
Subsequences
1
, is a subsequence of
Examples 25.
1. Let X = (xn ) = n1 , then 12 , 14 , 16 , 18 , , 2k
X.
2. Also the sequence X = n!1 is a subsequence of X.
Non Example 1. The sequence 12 , 0, 14 , 0, 16 , 0, 81 , 0, is not a subsequence of X = n1 .
Proof. Let > 0 be given. Then there exists N N such that |xn x| < for all n > N .
Note that for any k 1, nk k. Prove it! Therefore for k > N , we have nk k > N
and hence |xnk x| < . So xnk converges to x.
Corollary 26 (Divergence Criterion). A sequence X = (xn ) diverges if either of the
following holds:
1. X is unbounded.
2. X has two convergent subsequences whose limits are distinct.
Examples 27. Below are some examples of divergent sequences. Justify the reason of
divergence for each of them.
2. 1 + 12 + n1
3. x1 = 1, x2 = 1, xn =
1. (1)n
xn1 + xn2
Result 17 (Monotone Subsequence Theorem). Every sequence has a monotonic subsequence.
Proof. Easy exercise!
Result 18 (Bolzano-Weierstrass Theorem). A bounded sequence has a convergent subsequence.
Proof. Let X = (xn ) be a bounded sequence. Then by Monotone Subsequence Theorem,
X has a monotonic subsequence, say X = (xnk ). But since X is bounded, X is also
bounded. Therefore by Monotone Convergence Theorem, X is convergent.
1.11
Cauchy Sequences
Denition 28 (Cauchy Sequences). A sequence (xn ) is said to be Cauchy if for every >
0 there exists a natural number N such that for all m, n > N , xn , xm satisfy |xn xm | < .
Examples 29.
1
is Cauchy.
n
Proof. Let (xn ) be a Cauchy sequence. Choose = 1. Then there exists N N such
that |xn xN | < for all n > N . Therefore by Triangle inequality |xn | |xN | + 1 for all
n > N.
Let M = max{|x1 |, |x2 |, , |xN 1 |, |xN | + 1}. Then |xn | M for all n N and hence
(xn ) is bounded.
10
Exercise:
Using Cauchy Convergence Theorem show that the following sequences are convergent.
Also nd their limits.
1. xn = 1 +
1
1!
1
1!
2. x1 = 1 and xn+1 =
1
2!
+ +
1
2+xn
1
n!
for all n 2.
11