Sequence and its Convergence

Content taken from the Book “Thomas Calculus” By “George B Thomas”

Topic 10.1 of 13th edition of the book
 Sequence of numbers
A Sequence is a list of numbers: a1, a2, a3, … , an, … in a given order.

Representation : listing terms or specify nth term

1, 2, 4, 8, . . . an = 2 n

DEFINITION (Infinite Sequence) An infinite sequence (or sequence) of

numbers is a function whose domain is the set of integers greater than
or equal to some integer n0.
Representation of Sequence Graphically
 Convergence and Divergence of sequence (graphically)

As n increases,
+ve terms approach 1
-ve terms approach -1

Note: The convergence or divergence of a sequence has nothing to do with how

the sequence begins. It depends only on how the tail of the sequence behaves.
 Convergence and Divergence of sequence
DEFINITION A sequence {an} converges to the number L if to the every
positive number ϵ there corresponds an integer N such that for all n,
n > N implies | an – L | < ϵ.

If no such L exists, we say that {an} diverges.

If {an} converges to L, we write limn → ∞ an = L, or simply an → L, and call L

the limit of the sequence.

an → L if y = L is the horizontal asymptote of the sequence of points (n, an).

In figure, all points an‘s after aN lie within ϵ of L (since | an – L | < ϵ whenever n > N).
 Convergence and Divergence of sequence
Example : Using the Definition, Show that

Solution:
Theorem
Suppose that ƒ(x) is a function defined for all x ≥ n0 and that {an}
is a sequence of real numbers such that an = ƒ(n) for n ≥ n0. Then

Proof Suppose that lim f  x  L

x

Then for each positive number ɛ there is a number M such that

for all x,

Let N be an integer greater than M and greater than or equal to n0.

Then

Note:
EXAMPLE 7 Show that

Solution The function (ln x)/x is defined for all x ≥ 1 and agrees with the given
sequence at positive integers.
A single application of l’Hôpital’s Rule shows that
 Recursive Definition of Sequences
Sequences are often defined recursively by giving
1. The value(s) of the initial term(s) and
2. A rule, called recursive formula, for calculating any later term
from the terms that precede it.
Example The statements a1 = 1 and an = an-1 + 1 define the
sequence 1, 2, 3, . . . , n, . . . of positive integers.
Example The statements a1 = 1 and an = n . an-1 define the
sequence 1, 2, 6, 24. . . , n!, . . . of factorials of the positive integers.
Example The statements a1 = 1, a2 = 1 and an+1 = an + an-1 define
the sequence 1, 1, 2, 3, 5, . . . . of Fibonacci numbers.

Recursion formulas frequently arise in computer programs and

numerical routines for solving differential equations.
 Subsequences
Subsequence: A subsequence is a sequence that can be derived
from another sequence by deleting some or no elements without
changing the order of the remaining elements.
Example: Consider the sequence of positive integers 1, 2, 3, 4, . . . .
a) The subsequence of even integers: 2, 4, 6, . . . , 2n, . . .
b) The subsequence of odd integers: 1, 3, 5, . . . , 2n+1, . . .
c) The subsequence of primes: 2, 3, 5, 7, 11, . . .
Result. If a sequence {an} converges to L, then all its subsequences
converge to L.
So we can figure out the limit L of a sequence {an} by examining the
limit of a particular subsequence of {an}.
Result. If any subsequence of a sequence {an} diverges, then {an}
diverges.
Also, if two subsequences of sequence {an} have different limit, then
{an} diverges.
 Bounded sequences
DEFINITIONS A sequence {an} is bounded from above if there exists a
number M such that an ≤ M for all n.
The number M is called an upper bound of {an}.
If M is an upper bound of {an} but no number less than M is an upper
bound for {an}, then M is called the least upper bound for {an}.

DEFINITIONS A sequence {an} is bounded from below if there exists a

number m such that an ≥ m for all n.
The number m is called an lower bound of {an}.
If m is a lower bound of {an} but no number greater than m is an lower
bound for {an}, then m is called the greatest lower bound for {an}.

Note : Every Convergent sequence is bounded.

Converse is not true, that is, bounded sequence may not converge
Example: an = (–1)n
 Monotonic Sequences
DEFINITION (Non-decreasing sequence) A sequence an with the property that an ≤
an+1 for all n is called a non-decreasing sequence .
Example

DEFINITION (Non-increasing sequence) A sequence an with the property that an ≥

an+1 for all n is called a non-increasing sequence .
Example Non-increasing sequences
3 4 5 6 n 1
a) The sequence 2, , , , ,....., ,...
2 3 4 5 n
1 1 1 1
b) The sequence 1, , , ,....., n ,...
2 4 8 2

The sequence {an} is monotonic if it is either non-decreasing or non-increasing.

a) The sequence 1, –1, 1, –1, 1, –1,… is not monotonic.

THEOREM (The Monotonic Sequence Theorem)
If a sequence {an} is both bounded and monotonic, then the
sequence converges.
Proof: Suppose {an} is non-decreasing, L is its least upper bound,
and we plot the points (1, a1), (2, a2), …, (n, an), … in the xy-plane.
If M is an upper bound of the sequence, all these points will lie on or
below the line y = M
The line y = L is the lowest such line. None of the points (n, an) lies
above y = L, but some do lie above any lower line y = L – ɛ, if ɛ is a
positive number.
The sequence converges to L because
a. an ≤ L for all values of n, and
b. given any ɛ > 0, there exists at least
one integer N for which aN > L – ɛ.
The fact that {an} is non-decreasing tells us further that
an ≥ aN > L – ɛ for all n ≥ N
Thus, all the numbers an beyond the Nth number lie within ɛ of L.
This is precisely the condition for L to be the limit of the sequence
{an}.

The proof for non-increasing sequences bounded from below is

similar.

Note: Theorem does not say that convergent

sequences are monotonic.

Ex: Sequence {(-1)n+1/n} converges and is

bounded, but it is not monotonic
What the theorem does say is that a non-
decreasing sequence converges when it is
bounded from above, but it diverges to infinity
otherwise.
Test your understanding
Determine if the sequence {an} is Convergent.
Also check whether the sequence is Monotonic, Bounded.
1
1. an 
n
3n  1
2. an 
n 1
n!
3. an  n
n
3n
4. an  3
n

5. an   3  5
n

n 1/ n
 Next Lecture
Infinite Series and its Convergence