Professional Documents
Culture Documents
Lecture Real 2
Lecture Real 2
n
has no limit.
Proof:
n N | (−1) n − a | 1 .
That is 2 2 , a contradiction.
Definition:
V (x ) = u :| x − u | .
Theorem:
Remark:
From the above theorem, the convergence of the sequence x n means : For each neighborhood
V ( x ) of x , all but a finite number of terms of x n belong to V ( x ) . The finite number of terms
that may not belong to V ( x ) are the tems x 1 , x 2 , x 3 , , x N −1 .
Definition:
1- x n is said to be bounded above if and only if there is an M such that x n M for all
n .
2- x n is said to be bounded below if and only if there is an m such that x n m for all
n .
3- x n is said to be bounded if and only if it is bounded both above and below.
26
Definition:
A sequence x n of real numbers is said to be bounded if there exist a real number M 0 such
that
| x n | M for all n .
Remark:
The sequence x n is bounded if and only if the set x n : n of its values is a bounded subset
of .
Theorem:
Proof:
Suppose that lim x n = x and let = 1 . Then there exists N such that
n →
n N | x n − x | 1 .
| x n |=| x n − x + x || x n − x | + | x | 1+ | x | .
If we set
Remark:
The converse of the above theorem is not true, for example the sequence ( −1)
n
n
is bounded but
Theoerm:
n N | x n | M .
Theorem:
1- x n + y n → x + y as n → .
27
2- x n − y n → x − y as n → .
3- cx n → cx as n → .
4- x n y n → x y as n → .
xn x
5- → as n → , y 0 .
yn y
Proof:
| (x n + y n ) − (x + y ) |=| (x n − x ) + ( y n − y ) || x n − x | + | y n − y | .
n N 1 | x n − x | / 2 ,
n N 2 | y n − y | / 2 .
| (x n + y n ) − (x + y ) |=| ( x n − x ) + ( y n − y ) || x n − x | + | y n − y | / 2 + / 2 = .
Thus n N | (x n + y n ) − (x + y ) | . That is x n + y n → x + y as n → .
| (x n − y n ) − (x − y ) |=| (x n − x ) + ( y − y n ) || x n − x | + | y − y n | .
n N 1 | x n − x | / 2 ,
n N 2 | y n − y | / 2 .
| (x n − y n ) − (x − y ) |=| ( x n − x ) + ( y − y n ) || x n − x | + | y − y n | / 2 + / 2 = .
Thus n N | (x n − y n ) − (x − y ) | . That is x n − y n → x − y as n → .
28
Now suppose that c 0 . Since
| cx n − cx |=| c (x n − x ) |=| c || x n − x | .
n N | x n − x | / | c | .
Thus n N | cx n − cx | . That is cx n → cx as n → .
| x n y n − xy || x n || y n − y | + | y || x n − x | M 1 | y n − y | + | y || x n − x | . (2)
| x n y n − xy | M | y n − y | + M | x n − x | . (3)
n N 1 | x n − x | / 2M ,
n N 2 | y n − y | / 2M .
| x n y n − xy | M | y n − y | + M | x n − x | M ( / 2M ) + M ( / 2M ) = .
Thus n N | (x n y n ) − (x y ) | . That is x n y n → x y as n → .
xn x
(5) Now we prove that → as n → , y 0 .
yn y
xn x yx n − xy n yx n − xy + xy − xy n y (x n − x ) + x ( y − y n ) | y || x n − x | + | x || y − y n |
− = =
yn y yy n yy n yy n | y || y n |
Since y n → y as n → and y 0 , then there exists M 1 0 and N such that
29
n N | y n | M 1 .
Thus
x n x | y || x n − x | + | x || y − y n | | y || x n − x | + | x || y − y n | 1 |x |
− = |xn −x |+ |xn −x |.
yn y | y || y n | | y |M1 M1 | y |M1
|x | 1
Suppose that M = max , , then
| y | M 1 M 1
xn x
− M | x n − x | +M | x n − x | .
yn y
n N 1 | x n − x | / 2M ,
n N 2 | y n − y | / 2M .
Theorem:
Proof:
n N | x n − x | .
Theorem:
30
Proof:
Theorem:
If x n → x as n → , then x n → x as n → .
Proof:
n N | x n − x | .
n N || x n | − | x || .
Theorem:
Proof:
Since x n → x as n → and x n 0 for all n , then x 0 . Now we consider the two cases:
Case (i): If x = 0 , let 0 be given. Since x n → 0 , then there exists N such that
n N 0 xn = xn −02.
xn − x =
( xn − x )( xn + x )= xn −x
.
xn + x xn + x
1 1
Since x n + x x 0 , it follows that and
xn + x x
31
1
xn − x xn −x .
x
Since x n → x as n → , then x n → x as n → .
Suppose x n , y n and z n are convergent of real numbers such that x n y n z n for all
n and that lim x n = lim z n = . Then lim y n = .
n → n → n →
Proof:
Since lim x n = lim z n = then for all 0 there exists N 1 such that
n → n →
n N 1 | x n − | − x n + ,
n N 2 | z n − | − z n + .
32