Lecture2 Sequences 2
Lecture2 Sequences 2
Limits of sequences
Benoit F. Sehba1
1 University of Ghana, Ghana
Outline
1 Sequences
Definition of a sequence
4 Subsequences
5 Cauchy sequences
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Definition of a sequence
Definition
Definition of a sequence
Example of sequences
1 1 1
{an }n∈N = { }n∈N = {1, , , ...}.
n 2 3
Another convenient way of describing a sequence is to specify
a1 (or a0 ) and a rule for obtaining an+1 for n ≤ 1. Examples are:
(1) a1 = 1, an+1 = 3an for all n ≥ 1
(2) Let a1 and a2 be any positive real numbers and let
an+1 = 21 (an + an+1 ), n ≥ 2 such definitions are called recursive
definitions.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Definition of a sequence
Definition of a sequence
Monotonic sequences
Definition of a sequence
Definition of a sequence
Proof.
Let ϵ > 0 choose n0 = ⌊ 3ϵ ⌋ + 1. Then
n0 ∈ N, let n ∈ N : n > n0 . Then
3 3 3 3
|2 − − 2| = | − | = < < ϵ.
n n n n0
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Exploration
Proof.
Let ϵ > 0. Choose n0 = ⌊ 1ϵ ⌋ + 1. Then n0 ∈ N and n0 > 1ϵ .
Let
n ∈ N, n > n0 , then |an − 1| = |1 + 21n − 1| = 21n < n1 < ϵ.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Uniqueness of limit
Theorem
If a sequence a : N → V has two limits l and l ′ then l = l ′ .
Proof.
Suppose {an }n∈N converges to l and l ′ with l ̸= l ′ . Then
′|
|l − l ′ | > 0. Let ϵ = |l−l ′
3 . Note ϵ > 0, since l ̸= l . Since
an → l, ∃N1 ∈ N such that
ϵ
∀n ∈ N, n > N1 |an − l| < .
2
Also, as an → l ′ , ∃N2 ∈ N such that
ϵ
∀n ∈ N, n > N2 |an − l ′ | < .
2
Choose N0 = max N1 , N2 , then
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Uniqueness of limit
Proof.
|l − l ′ | = |l − an + an − l ′ | ≤ |l − an | + |an − l ′ | < ϵ.
Taking for example ϵ = 12 |l − l ′ |, we obtain
1
|l − l ′ | < |l − l ′ |
2
or equivalently,
|l − l ′ | < 0.
This contradicts the fact that |l − l ′ | > 0. Hence l = l ′ .
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Proof.
On the board.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Theorem
Let {an } be an increasing sequence, if
limn→∞ an = l, then an ≤ l, ∀n ∈ N. If {an } is decreasing
and limn→∞ an = l then an ≥ l, ∀n ∈ N
Proof.
Suppose that {an } be an increasing and limn→∞ an = l. Let us
show that for any k ∈ N, an ≤ l + k1 .
Let k > 0, then as limn→∞ an = l, we can find an integer nk > 0
such that for any n ≥ nk , an < l + k1 . Hence
1
a1 ≤ a2 ≤ . . . ≤ ank ≤ ank +1 ≤ . . . < l + .
k
Squeeze Principle
Theorem
(Squeeze Principle) Let a : N → V be a sequence. If there
exists a real valued sequence ϕ : N → R such that
(i) ||an − l|| ≤ ϕn , ∀n ∈ N and
(ii) limn→∞ ϕn = 0,
then limn→∞ an = l.
Proof.
This follows from that
Squeeze Principle
Theorem
Let an , bn , sn : N → V be sequences. Assume that
an ≤ sn ≤ bn , ∀n ∈ N. If limn→∞ an = limn→∞ bn = l, then
limn→∞ sn = l.
Proof.
That an ≤ sn ≤ bn is equivalent to an − l ≤ sn − l ≤ bn − l.
Taking the limit gives the answer.
4
Let an : N → R be defined by an = n! , prove that limn→∞ an = 0
Proof.
4 4
|an − 0| = | n! | = n! ≤ n4 , ∀n ∈ N, limn→∞ n4 = 0
Thus choose
ϕn = n4 , then, |an − 0| ≤ ϕn and limn→∞ ϕn =
0.So by the squeeze principle an → 0
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Theorem
For all a ∈ R, |a| < 1 =⇒ limn→∞ an = 0
Proof.
Let a ∈ R with |a| < 1. Then |a| = b1 , for some b > 1. Thus
b = 1 + d, for some d ∈ R, d > 0. Now,
bn = (1 + d)n = 1 + nd + (n C2 )d 2 + ... ≥ nd
Thus |a|n = b1n ≤ nd
1
= nc where c = d1 > 0. Now choose
c
ϕn = n , c > 0 then |an − 0| = |a2 | ≤ ϕn for all n ∈ N and
limn→∞ ϕn = 0 So by the squeeze principle limn→∞ an = 0
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Theorem
(limit of an ordered pair) Let an : N → V , bn : N → W be two
sequences and suppose limn→∞ an = L ∈ V and
limn→∞ bn = m ∈ N, then limn→∞ (an , bn ) = (l, m) ∈
V × W ; i.e limn→∞ (an , bn ) = (limn→∞ an , limn→∞ bn )
Proof.
We see (an , bn ) as an element of the linear space V × W
endowed with the norm
Proof.
Algebra of Limits
Theorem
If each of the real-valued sequences an : N → R and
bn : N → R have limits, then
(i) limn→∞ (an + bn ) = limn→∞ (an ) + limn→∞ bn .
(ii) limn→∞ (an − bn ) = limn→∞ an − limn→∞ bn .
(iii) limn→∞ (an bn ) = (limn→∞ an )(limn→∞ bn ).
limn→∞ (an )
(iv) limn→∞ ( abnn ) = limn→∞ bn , provided limn→∞ bn ̸= 0.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Algebra of Limits
Proof.
Put limn→∞ (an ) = ℓ and limn→∞ (bn ) = ℓ′ .
(iii) We have
Algebra of Limits
Proof.
Put limn→∞ (an ) = ℓ and limn→∞ (bn ) = ℓ′ .
(iii)
Algebra of Limits
Proof.
Consequently, as b1n (bn − ℓ′ ) is a product of a bounded
sequence and a sequence whose limit is zero, we have that
1
lim (bn − ℓ′ ) = 0,
n→∞ bn
i.e
ℓ′
lim 1− = 0.
n→∞ bn
Thus
1 1
lim = ′.
n→∞ bn ℓ
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Preserving inequalities
Theorem
(Preserving inequalities) If an ≤ bn for all
n ∈ N, limn→∞ an = a and limn→∞ bn = b then a≤b
Proof.
Put limn→∞ (an ) = ℓ and limn→∞ (bn ) = ℓ′ . We proceed by
contradiction. Suppose that ℓ > ℓ′ . Choose ϵ > 0 such that
′
ϵ < ℓ−ℓ 2 . Then as (an )n converges to ℓ, there exists an integer
N1 > 0 such that for all integer n ≥ N − 1, |an − ℓ| < ϵ.
As (bn )n converges to ℓ′ , there exists an integer N2 > 0 such
that for integer n ≥ N − 2, |bn − ℓ′ | < ϵ.
It follows that for any integer n ≥ max{N1 , N2 },
Theorem
Every convergent sequence is bounded.
Proof.
Assume that an → l. Let ϵ > 0, then ∃n0 ∈ N such that
|an − l| < ϵ for all n ≥ n0 , i.e l − ϵ < an < l + ϵ for all n ≥ n0 .
Put K = min{a1 , ..., an0 −1 , l − ϵ} and
M = max{a1 , a2 , ..., an0 −1 , l + ϵ}. Then
K ≤ an ≤ M for all n ∈ N. Hence {an } is bounded.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Existence Theorems
Theorem
(Monotonic Convergence Theorem) Every bounded
monotonically increasing sequence converges.
Proof.
Let {an } be a bounded monotonically increasing sequence. Let
S be the set S := {an : n ∈ N}. Then S is an non-empty set,
which is bounded. By the completeness property of real
number (The Least Upper Bound Property), there is a number
l = supS. Let ϵ > 0, ∃n0 ∈ N : an > l − ϵ (by definition of Sup)
Thus an ≥ an0 > l − ϵ, ∀n ≥ n0 ......(1)
since an is increasing and l is the supremum of S , we have that
an ≤ l ≤ l + ϵ for all n ∈ N.........(2).
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Existence Theorems
Existence Theorems
Theorem
Every bounded monotonically decreasing sequence converges.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Existence Theorems
MCT
Existence Theorems
Theorem
Let {Fn } be a sequence of closed intervals such that
(i)Fn+1 ⊂ Fn for all n and T∞
(ii)limn→∞ (length of Fn ) = 0, then n=1 Fn consist of
exactly one point
Proof.
Let Fn = [an , bn ] for each n ∈ N. Since for every n, Fn+1 ⊂ Fn ,
therefore
an ≤ an+1 ≤ bn+1 ≤ bn
Note that{an } is a monotonically increasing sequence and
bounded above by b,
The sequence {bn } is a monotonically decreasing sequence
and bounded below by a, thus both {an } and {bn }converges.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Existence Theorems
Theorem
Let {Fn } be a sequence of closed intervals such that
(i)Fn+1 ⊂ Fn for all n and T∞
(ii)limn→∞ (length of Fn ) = 0, then n=1 Fn consist of
exactly one point
Proof.
Let Fn = [an , bn ] for each n ∈ N. Since for every n, Fn+1 ⊂ Fn ,
therefore
an ≤ an+1 ≤ bn+1 ≤ bn
Note that{an } is a monotonically increasing sequence and
bounded above by b,
The sequence {bn } is a monotonically decreasing sequence
and bounded below by a, thus both {an } and {bn }converges.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Existence Theorems
Theorem
Let {Fn } be a sequence of closed intervals such that
(i)Fn+1 ⊂ Fn for all n and T∞
(ii)limn→∞ (length of Fn ) = 0, then n=1 Fn consist of
exactly one point
Proof.
Let Fn = [an , bn ] for each n ∈ N. Since for every n, Fn+1 ⊂ Fn ,
therefore
an ≤ an+1 ≤ bn+1 ≤ bn
Note that{an } is a monotonically increasing sequence and
bounded above by b.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Existence Theorems
Proof continuation
Proof.
The sequence {bn } is a monotonically decreasing sequence
and bounded below by a, thus both {an } and {bn } converges.
Since
lim (bn − an ) = lim (length of Fn ) = 0
n→∞ n→∞
Existence Theorems
Proof continuation
Proof.
Thus, an ≤ ℓ ≤ bn for all n ∈ N. Therefore ℓ ∈ Fn , ∀n ∈ N.
Suppose ℓ′ ∈ Fn , ℓ ̸= ℓ′ , then bn − an → 0 implies that for
some n ∈ N.
|bn − an | < |ℓ − ℓ′ |, ̸= 0
(since ℓ ̸= ℓ′ ). This is a contradiction.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Definition:Subsequence
Subsequences:Example
Subsequences: Exampl
Subsequences
Theorem
Suppose limn→∞ s(n) = l. Let soj be any subsequence of s,
then limn→∞ (s ◦ j)(n) = l.
Bolzano-Weierstress Theorem
Theorem
(Bolzano-Weierstress) Every bounded sequence has a
convergent subsequence.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Bolzano-Weierstress Theorem in R
Theorem
Let I be a closed and bounded interval in R. Let (xn )n be a
sequence in I. Then there exists a subsequence (xnk )k of (xn )n
that converges to a point of I.
Proof.
This will be proved will the help of Cauchy sequences and
completeness of closed and bounded intervals.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Definition:Cauchy sequence
|an − am | < ϵ
1 1 m−n
| − |=| |
n m mn
1 1 1 1
Then | − | ≤ max{ , } < ϵ
n m n m
1
Choose n0 >
ϵ
Proof.
Let ϵ > 0. Choose n0 = 1ϵ + 1. Let
m, n ∈ N : m = n0 + 2 and n = n0 + 1 then n, m >
n0 and | n1 − m1
| ≤ max{ n1 , m
1
} < ϵ.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Cauchy Convergence
Theorem
(Cauchy Convergence Criterion) Every convergent sequence is
a Cauchy sequence.
∥an − am ∥ = ∥an − ℓ + ℓ − am ∥
≤ ∥an − ℓ∥ + ∥am − ℓ∥
ϵ ϵ
< + =ϵ
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Cauchy Convergence
Theorem
Let (xn ) be a Cauchy sequence. If (xn ) contains a convergent
subsequence, then (xn ) is also convergent.
Proof.
Assume that (xn )n is Cauchy and that xkn → x as n → ∞. Let
us prove that xn → x as n → ∞. Let ϵ > 0. As (xn ) is Cauchy,
there exist N1 ∈ N such that
ϵ
∥xn − xkn ∥ < for all n ≥ N1 .
2
ϵ
Also as xkn → x, there exists N2 ∈ N such that ∥xkn − x∥ < 2 for
all n ≥ N2 .
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Proof continuation
Proof.
Taking N = max(N1 , N2 ), we obtain that
ϵ ϵ
∀ n ≥ N, ∥xn − x∥ ≤ ∥xn − xkn ∥ + ∥xkn − x∥ < + = ϵ.
2 2
Thus xn → x as n → ∞.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Completeness of R
Theorem
R endowed with its natural norn is complete.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Completeness of R
Proof.
Let (xn ) be a Cauchy sequence in R. Then (xn ) is bounded,
that is ∃M > 0 such that |xn | ≤ M ∀n.
Let An := {xk : k ≥ n} and let yn := inf An = inf k ≥n xk . We have
that An+1 ⊂ An . Hence (yn ) is increasing and bounded (in fact,
yn ≤ M ∀n). Thus (yn ) converges.
Let x = limn→∞ yn . Let us prove that limn→∞ xn = x. Let ϵ > 0
ϵ
Let N ∈ N, so that |xn − xm | < for all n, m ≥ N. In particular,
2
ϵ
|xN − xm | < ∀m ≥ N.
2
ϵ ϵ
xN − < xm < xN + ∀m ≥ N.
2 2
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Completeness of R
Proof.
Hence,
ϵ ϵ
xN −
< yn < xN + ∀n ≥ N.
2 2
Passing to the limit, we obtain
ϵ ϵ
xN − < lim yn < xN + ,
2 n→∞ 2
that is
ϵ ϵ ϵ
xN − < x < xN + or equivalently |xN − x| < .
2 2 2
ϵ ϵ
Hence, for all n ≥ N, |xn − x| ≤ |xn − xN | + |xN − x| = + = ϵ.
2 2
That is (xn )n converges to x.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Bolzano-Weierstrass Theorem in R
Theorem (Bolzano-Weierstrass)
Let I be a closed and bounded interval in R. Let {xn } be a
sequence in I, then there exists a subsequence {xnk } of {xn }
which converges to a point in I.
Proof.
Let us assume without loss of generality that I = [0, 1].
Consider [0, 12 ] and [ 12 , 1]. Then one of these subintervals must
contain infinitely many xn . Call this subinterval I1 .
Bisect I1 in its right and left closed halves. Again one of these
subintervals contain xn for infinitely many n. Denote this
subinterval I2 . Proceeding this way, we find a sequence of
closed intervals {In } such that |In+1 | = 12 |In | and each contains
xn for infinitely many n.
Sequences Convergent and divergent sequences Monotonic sequences and limits Subsequences Cauchy sequences
Proof continuation
Proof.
Let x1 ∈ N so that xn1 ∈ I1 . Then choose n2 > n1 such that
xn2 ∈ I2 . Then n3 > n2 such that xn3 ∈ I3 and so on. One
obtains a sequence (xnk ) such that xnk ∈ Ik . If i, j ≥ k , then
xni , xnj ∈ Ik and so |xni − xnj | ≤ 21k .
Hence (xnk ) is a Cauchy sequence and since [0, 1] is complete,
(xnk ) converges to some x ∈ [0, 1].
The proof is complete.