Sequences and limits
- 3,5,7,9,11,...
- 1,2,6,24,120, ...
- 1,-1,1,-1,1,...
The elements of a sequence are called the terms.
The 'n-th term' or 'general term' of the first example is (2n + 1).
The sequence is completely determined by this general term. Therefore we write the first sequence as {2n + 1}.
The second sequence is {1.2.3.4...n} or {n!}.
The third is
{(-1)n+1 }
We write a general theoretical sequence as t
1,t
2,t
3,... or {t
n}.
We define the distance between two real numbers a and b as |b - a|.
Take a fixed real number b. For each strictly positive real number e, we say that the set of numbers { x | with b - e < x < b + e } is a base environment of b with radius e. We write this environment as ]b - e , b + e[. In most applications e is a very small strictly positive real number.
From this we see that
- If a sequence converges to b, then a base environment of b, contains all the terms of {tn}, starting from a suitable term.
- If each base environment of b contains all the terms of {tn}, starting from a suitable term, then the sequence converges to b.
tr criterion-of-cauchy cauchy-criterion Theorem:
The sequence {tn} converges
<=>
With each strictly positive real number e,
corresponds a suitable positive integer N
such that n > N => |tn+p - tn|< e for each p=1,2,3,...
Proof:
First part: suppose the sequence {tn} converges to a number b.
A base environment of b, contains all the terms of {tn}, starting from a suitable term.
From this it follows that
With each strictly positive real number e,
corresponds a suitable positive integer N
such that n > N => |tn+p - tn|< e for each p=1,2,3,...
Second part: suppose that
With each strictly positive real number e,
corresponds a suitable positive integer N
such that n > N => |tn+p - tn|< e for each p=1,2,3,...
Choose a fixed value of n. We divide all real numbers in two sets.
A real number belongs to the set A if it is exceeded by an infinitely number of elements of the sequence.
A real number belongs to the set B if it is exceeded by a finite number of elements of the sequence.
Both sets define a
Dedekind-cut b.
From |tn+p - tn|< e, we see that the number tn -e is exceeded by an infinitely number of elements of the sequence and belongs to set A.
From |tn+p - tn|< e, we see that the number tn +e is exceeded by a finite number of elements of the sequence and belongs to set B.
Therefore |tn - b| =< e.
Now, tn+p - b = tn+p - tn + tn - b
=> |tn+p - b| =< |tn+p - tn| + |tn - b| < 2e for p=1,2,3,...
=> | tm - b | < 2e for all m > n
=> The sequence {tn} converges
Each sequence that converges to 0 is a zero-sequence . If for each n: t
n>0 and lim t
n=0, then we can write lim (t
n) = +0.
If for each n: t
n<0 and lim t
n=0, then we can write lim (t
n) = -0.
- Example : Take the sequence {n.n} . The general term tn can grow bigger than any real number r.
With each real number r, corresponds a suitable positive integer N such that
n > N => tn > r
We say that tn has an infinite limit and we write lim tn = infinity.
- General definition : Take the sequence {tn}. We say that
lim tn = +infty
<=>
With each real number r,
corresponds a suitable positive integer N
such that n > N => tn > r .
lim tn = -infty
<=>
With each real number r,
corresponds a suitable positive integer N
such that n > N => tn < r .
We say that the sequence diverges to infinity.
Not every sequence has a limit. Example: 1,-1,1,-1,1,-1,...
Take a sequence {t
n}.
A real number M is an upper bound for {tn}
if and only if
for each n : M >= tn
A real number m is an lower bound for {tn}
if and only if
for each n : m =< tn
A sequence {tn} is bounded
if and only if
{tn} has an upper and a lower bound
Say lim t
n = b, and choose a strictly positive number e. Then, only a finite number of term of the sequence are not in ]b - e,b + e[. Then it is always possible to choose an upper and a lower bound.
Remark: If a sequence is bounded, it has not always a finite limit.
If for all n t
n+1 > t
n then we say that the sequence is rising.
If for all n t
n+1 < t
n then we say that the sequence is descending.
If for all n t
n+1 =< t
n then we say that the sequence is not rising.
If for all n t
n+1 >= t
n then we say that the sequence is not descending.
If a sequence is not rising or not descending, we say that it is a monotone sequence .
{t
n} is a not empty upper bounded set; So, it has a smallest upper bound s. Then, there is a term t
N in ]s - e , s + e[ for each strictly positive value of e. And since the sequence is not descending, all the following terms are in ]s - e , s + e[. Hence, lim t
n = s.
The proof is analogous with the previous one.
Choose a real number r. Since r is not an upper bound, there is a term t
N > r and all following terms are > r . So, for each r, there is a N such that n > N => t
n > r . Hence t
n diverges.
The proof is analogous with the previous one.
Without a proof we accept the following properties.
(Here n is a fixed integer.)
-
If lim tn = b and lim tn' = b
and if for all n > N : tn =< t"_n =< tn'
Then lim t"_n = b
-
If lim tn = b
and if for all n > N : tn = tn'
Then lim tn' = b
-
If lim tn = +infty
and if for all n > N : tn =< tn'
Then lim tn' = +infty
-
If lim tn = -infty
and if for all n > N : tn >= tn'
Then lim tn' = -infty
-
If lim tn = b > 0
Then tn > 0 for all n starting from a suitable n=N
-
If lim tn = b < 0
Then tn < 0 for all n starting from a suitable n=N
-
If lim tn = b
Then lim |tn| = |b|
-
If lim tn = b is a real number
Then,
lim r.tn = r.lim tn
lim 1/tn = 1/lim tn (if b not 0)
lim tnn = ( lim tn )n
lim tn1/p = ( lim tn )1/n (if both sides exist)
-
If lim tn and lim tn' are real numbers,
Then, lim (tn + tn') = lim tn + lim tn'
lim (tn - tn') = lim tn - lim tn'
lim tn.tn' = lim tn . lim tn'
tn lim tn
lim ----- = ------------ (if both sides exist)
tn' lim tn'
We define the following rules for calculation rules with infinity.
We write infty for (+infty or -infty)
-(+infty)=-infty -(-infty)=+infty
+(-infty)=-infty +(+infty)=+infty
|+infty|= +infty |-infty|= +infty
(+infty)n = +infty (-infty)2n= +infty (-infty)2n+1= -infty
nth-root(+infty)=+infty (2n+1)th-root(-infty)=-infty
for each r = strictly positive real number
r(+infty)=+infty r(-infty)=-infty
-r(+infty)=-infty -r(-infty)=+infty
for each real number r
r/+infty = 0 r/-infty = 0
+infty + r = +infty -infty + r = -infty
r - infty = -infty r + infty = +infty
+infty +(+infty)= +infty
-infty +(-infty)= -infty
+infty -(-infty)= +infty
-infty -(+infty)= -infty
(+infty)(+infty)= +infty
(-infty)(+infty)= -infty
(+infty)(-infty)= -infty
(-infty)(-infty)= +infty
lim tn = +infty => lim (-tn) = -infty
lim tn = -infty => lim (-tn) = +infty
lim tn = +infty => lim |tn| = +infty
lim tn = -infty => lim |tn| = +infty
if lim tn = +infty or lim tn = -infty, then
lim tnp = (lim tn)p
lim (nth-root(tn)) = nth-root(lim tn)
(if both sides exist)
lim (c.tn) = c.(lim tn) (with c real number)
lim (c/tn) = 0 (with c real number)
lim tn = +0 => lim (1/tn)=+infty
lim tn = -0 => lim (1/tn)=-infty
if lim tn = infty and lim tn'= b (real and not zero) then
lim(tn+tn')=lim tn +lim tn'
lim(tn-tn')=lim tn -lim tn'
lim(tn'-tn)=lim tn' -lim tn
lim(tn'.tn)=lim tn' .lim tn
lim(tn/tn')=lim tn / lim tn'
lim(tn'/tn)= 0
lim tn = +infty and lim tn' = +infty
=> lim(tn+tn')=lim tn + lim tn'
lim tn = -infty and lim tn' = -infty
=> lim(tn+tn')=lim tn + lim tn'
lim tn = +infty and lim tn' = -infty
=> lim(tn-tn')=lim tn - lim tn'
lim tn = -infty and lim tn' = +infty
=> lim(tn-tn')=lim tn - lim tn'
lim tn = infty and lim tn' = infty
=> lim(tn.tn')=lim tn . lim tn'
Take a constant real number v, and define a sequence
tn = t1 + (n-1).v
With each choice of t
1 corresponds exactly one sequence .
All this sequences are called arithmetic sequences.
v is called the common difference of the arithmetic sequence.
If v = 0 the sequence is constant.
If v > 0 the sequence is rising and has no upper bound. lim t
n = +infty.
If v < 0 the sequence is descending and has no lower bound. lim t
n = -infty.
Say S = t
1 + t
2 + ... + t
n , then
S = t1 + t1 + v + t1 + 2.v + ... + tn
Now write the same sequence in reverse order
S = tn + tn - v + tn - 2.v + ... + t1
Addition gives
2.S = (t1 + tn).n
So,
(t1 + tn).n
S = ----------------
2
Take a t
1 and a constant real number q, and define a sequence
tn = t(n-1).q
With each choice of t
1 corresponds exactly one sequence .
All this sequences are called geometric sequences.
q is called the common ratio of the geometric sequence.
for all n > 1 :
If q = 1 + x > 1 , then qn > 1 + n.x (1)
Prove:
- From this theorem it follows that
If q > 1 then qn is rising and has no upper bound.
lim qn = +infty
- If 0 < |q| < 1 then
1 1 n
(---) > 1 and lim (---) = +infty
|q| |q|
Hence,
n 1 1
lim |q | = lim -------- = --------- = 0
1 n +infty
(---)
|q|
tn = t1.qn-1 = t1.qn /q = (constant number) .qn
If q > 1 then lim tn = + infty or -infty
If q = 1 then the sequence is constant lim tn = t1
If 0 < q <1 then lim tn = 0
If -1< q <0 then lim tn = 0
If q = -1 then lim tn don't exist
If q < -1 then lim tn don't exist
S = t1 + t2 + ... + tn , then
=> S.q = t1.q + t2.q + ... + tn.q
=> S.q = t2 + ... + tn + tn.q
=> S.q - S = tn.q - t1
=> S(q-1) = tn.q - t1
tn.q - t1 t1.qn - t1
=> S = ---------------- = ----------------
(q - 1) (q - 1)
t1.(qn - 1)
=> S = ----------------
(q - 1)
Take 0 < |q| < 1
t1.qn - t1 t1
S = lim ---------------- = -----------
(q - 1) (1 - q)