You are on page 1of 98

MATH 38

Mathematical Analysis III


I. F. Evidente
IMSP (UPLB)

Previously

Sequences
Graph of Sequences
Convergence of a Sequence
Theorems for finding limits of sequences

Outline

Convergence of Alternating Sequences

Monotone and Bounded Sequences

Proving the convergence of sequences by definition

Outline

Convergence of Alternating Sequences

Monotone and Bounded Sequences

Proving the convergence of sequences by definition

Alternating Sequences
If the signs of a sequence alternate from positive to negative, or vice-verse,
we say that the sequence is an alternating sequence.

Alternating Sequences
If the signs of a sequence alternate from positive to negative, or vice-verse,
we say that the sequence is an alternating sequence.

Example

(1)n
1 1 1 1
= , , , , ...
2n
2 4 8 16
n+1
{(1)
} = {1, 1, 1, 1, 1, ...}

Theorem
If lim |an | = 0, then lim an = 0.
n

Theorem
If lim |an | = 0, then lim an = 0.
n

Note
Totoo lang ito kapag zero ang limit.

Example

Use the theorem to show that the sequence

(1)n
2n

is convergent.

Example

Use the theorem to show that the sequence

(1)n
2n

is convergent.

Remark
Let {an } be an alternating sequence. If lim |an | 6= lim |an |, then lim an
n
n
n
does not exist. (That is, {an } is divergent.)

Example
Use the remark to show that the sequence (1)n+1 is divergent.

Example
Use the remark to show that the sequence (1)n+1 is divergent.

Outline

Convergence of Alternating Sequences

Monotone and Bounded Sequences

Proving the convergence of sequences by definition

Definition
A sequence {an }
n=1 is said to be

Definition
A sequence {an }
n=1 is said to be
1

increasing if

Definition
A sequence {an }
n=1 is said to be
1

increasing if an an+1 for all n

Definition
A sequence {an }
n=1 is said to be
1

increasing if an an+1 for all n

decreasing if

Definition
A sequence {an }
n=1 is said to be
1
2

N
decreasing if an an+1 for all n N
increasing if an an+1 for all n

Definition
A sequence {an }
n=1 is said to be
1
2
3

N
decreasing if an an+1 for all n N
increasing if an an+1 for all n

monotonic if

Definition
A sequence {an }
n=1 is said to be
1
2
3

N
decreasing if an an+1 for all n N
increasing if an an+1 for all n

monotonic if {an }
n=1 is either increasing or decreasing.

Definition
A sequence {an }
n=1 is said to be
1
2
3

N
decreasing if an an+1 for all n N
increasing if an an+1 for all n

monotonic if {an }
n=1 is either increasing or decreasing.

Example
1

1
1 1 1
= 1, , , , ... is a decreasing sequence
n
2 3 4

Definition
A sequence {an }
n=1 is said to be
1
2
3

N
decreasing if an an+1 for all n N
increasing if an an+1 for all n

monotonic if {an }
n=1 is either increasing or decreasing.

Example
1

1
1 1 1
= 1, , , , ... is a decreasing sequence
n
2 3 4
{3n 8} = {5, 2, 1, 4, ..} is an increasing sequence.

Remark
Two methods to show that a sequence {an } is monotonic:
1 Let f (n) = a . Consider f (n) as a function of
. Find f 0 (n).
n
increasing: f 0 (n) 0 for all n [k, )
decreasing: f 0 (n) 0 for all n [k, )

Remark
Two methods to show that a sequence {an } is monotonic:
1 Let f (n) = a . Consider f (n) as a function of
. Find f 0 (n).
n
increasing: f 0 (n) 0 for all n [k, )
decreasing: f 0 (n) 0 for all n [k, )
2

If the terms of {an } are all positive:


a n+1
1 for all n I
an
a n+1
decreasing:
1 for all n I
an

increasing:

Example
Determine whether or not the following sequences are monotonic:

5n + 1
2n

Example
Determine whether or not the following sequences are monotonic:

5n + 1
2n

decreasing

Example
Determine whether or not the following sequences are monotonic:

5n + 1
2n

n!
10

decreasing

Example
Determine whether or not the following sequences are monotonic:

5n + 1
decreasing
2n

n!
increasing
10

Example
Determine whether or not the following sequences are monotonic:

5n + 1
decreasing
2n

n!
increasing
10

1
(2n)!

Example
Determine whether or not the following sequences are monotonic:

5n + 1
decreasing
2n

n!
increasing
10

1
decreasing
(2n)!

Example
Determine whether or not the following sequences are monotonic:

5n + 1
decreasing
2n

n!
increasing
10

1
decreasing
(2n)!

(1)n
2n

Example
Determine whether or not the following sequences are monotonic:

5n + 1
decreasing
2n

n!
increasing
10

1
decreasing
(2n)!

(1)n
not monotonic
2n

Example
Determine whether or not the following sequences are monotonic:

5n + 1
decreasing
2n

n!
increasing
10

1
decreasing
(2n)!

(1)n
not monotonic
2n
n
o

cos
n n=2

Example
Determine whether or not the following sequences are monotonic:

5n + 1
decreasing
2n

n!
increasing
10

1
decreasing
(2n)!

(1)n
not monotonic
2n
n
o

increasing
cos
n n=2

Definition
If {an }
n=1 is a sequence, then

Definition
If {an }
n=1 is a sequence, then
1

l is a lower bound of the sequence if

Definition
If {an }
n=1 is a sequence, then
1

l is a lower bound of the sequence if l a n for all n

N.

Definition
If {an }
n=1 is a sequence, then
1

l is a lower bound of the sequence if l a n for all n

u is an upper bound of the sequence if

N.

Definition
If {an }
n=1 is a sequence, then

N.

l is a lower bound of the sequence if l a n for all n

u is an upper bound of the sequence if u a n for all n

N.

Definition
If {an }
n=1 is a sequence, then

N.

l is a lower bound of the sequence if l a n for all n

u is an upper bound of the sequence if u a n for all n

The sequence is bounded if

N.

Definition
If {an }
n=1 is a sequence, then

N.

l is a lower bound of the sequence if l a n for all n

u is an upper bound of the sequence if u a n for all n

The sequence is bounded if it has both an upper bound and lower


bound.

N.

Example
Which among the sequences in the previous example are bounded?

5n + 1
2n

(decreasing)

Example
Which among the sequences in the previous example are bounded?

5n + 1
2n

(decreasing) bounded

Example
Which among the sequences in the previous example are bounded?

5n + 1
(decreasing) bounded
2n

n!
(increasing)
10

Example
Which among the sequences in the previous example are bounded?

5n + 1
(decreasing) bounded
2n

n!
(increasing) not bounded
10

Example
Which among the sequences in the previous example are bounded?

5n + 1
(decreasing) bounded
2n

n!
(increasing) not bounded
10

1
(decreasing)
(2n)!

Example
Which among the sequences in the previous example are bounded?

5n + 1
(decreasing) bounded
2n

n!
(increasing) not bounded
10

1
(decreasing) bounded
(2n)!

Example
Which among the sequences in the previous example are bounded?

5n + 1
(decreasing) bounded
2n

n!
(increasing) not bounded
10

1
(decreasing) bounded
(2n)!
n
o
cos
(increasing)
n n=2

Example
Which among the sequences in the previous example are bounded?

5n + 1
(decreasing) bounded
2n

n!
(increasing) not bounded
10

1
(decreasing) bounded
(2n)!
n
o
cos
(increasing) bounded
n n=2

Is the sequence

(1)n
2n

bounded? (not monotonic)

Is the sequence

(1)n
2n

bounded? (not monotonic)

Is the sequence

BOUNDED!

(1)n
2n

bounded? (not monotonic)

Theorem (Monotone Convergence Theorem)


A bounded monotonic sequence is convergent.

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
2n

(decreasing, bounded)

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
2n

(decreasing, bounded) convergent

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
(decreasing, bounded) convergent
2n

n!
(increasing, not bounded)
10

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
(decreasing, bounded) convergent
2n

n!
(increasing, not bounded) no conclusion
10

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
(decreasing, bounded) convergent
2n

n!
(increasing, not bounded) no conclusion
10

1
(decreasing, bounded)
(2n)!

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
(decreasing, bounded) convergent
2n

n!
(increasing, not bounded) no conclusion
10

1
(decreasing, bounded) convergent
(2n)!

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
(decreasing, bounded) convergent
2n

n!
(increasing, not bounded) no conclusion
10

1
(decreasing, bounded) convergent
(2n)!

(1)n
(not monotonic, bounded)
2n

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
(decreasing, bounded) convergent
2n

n!
(increasing, not bounded) no conclusion
10

1
(decreasing, bounded) convergent
(2n)!

(1)n
(not monotonic, bounded) no conclusion
2n

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
(decreasing, bounded) convergent
2n

n!
(increasing, not bounded) no conclusion
10

1
(decreasing, bounded) convergent
(2n)!

(1)n
(not monotonic, bounded) no conclusion
2n
n
o
cos
(increasing, bounded)
n n=2

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
(decreasing, bounded) convergent
2n

n!
(increasing, not bounded) no conclusion
10

1
(decreasing, bounded) convergent
(2n)!

(1)n
(not monotonic, bounded) no conclusion
2n
n
o
cos
(increasing, bounded) convergent
n n=2

Example
Which among the sequences in the previous examples are convergent by
the theorem?

5n + 1
(decreasing, bounded) convergent
2n

n!
(increasing, not bounded) no conclusion
10

1
(decreasing, bounded) convergent
(2n)!

(1)n
(not monotonic, bounded) no conclusion
2n
n
o
cos
(increasing, bounded) convergent
n n=2

Completeness Axiom
Let S be a nonempty set S of real numbers. If S has an upperbound, then
S has a smallest upper bound (called the least upper bound). If S has a
lower bound, then S has largest lower bound (called the greatest lower
bound).

Remark
Let {an } be a bounded monotonic sequence.

Remark
Let {an } be a bounded monotonic sequence.
1

increasing: glb =

Remark
Let {an } be a bounded monotonic sequence.
1

increasing: glb = first term,

Remark
Let {an } be a bounded monotonic sequence.
1

increasing: glb = first term, lub = limit of the sequence

Remark
Let {an } be a bounded monotonic sequence.
1

increasing: glb = first term, lub = limit of the sequence

decreasing: lub =

Remark
Let {an } be a bounded monotonic sequence.
1

increasing: glb = first term, lub = limit of the sequence

decreasing: lub = first term,

Remark
Let {an } be a bounded monotonic sequence.
1

increasing: glb = first term, lub = limit of the sequence

decreasing: lub = first term, glb = limit of the sequence

Remark
Let {an } be a bounded monotonic sequence.
1

increasing: glb = first term, lub = limit of the sequence

decreasing: lub = first term, glb = limit of the sequence

Example
Determine the glb and lub of the convergent sequences in the previous
example.

5n + 1
2n

(decreasing)

Remark
Let {an } be a bounded monotonic sequence.
1

increasing: glb = first term, lub = limit of the sequence

decreasing: lub = first term, glb = limit of the sequence

Example
Determine the glb and lub of the convergent sequences in the previous
example.

5n + 1
(decreasing)
2n

1
(decreasing)
(2n)!

Remark
Let {an } be a bounded monotonic sequence.
1

increasing: glb = first term, lub = limit of the sequence

decreasing: lub = first term, glb = limit of the sequence

Example
Determine the glb and lub of the convergent sequences in the previous
example.

5n + 1
(decreasing)
2n

1
(decreasing)
(2n)!
n
o
cos
(increasing)
n n=2

Remark
Let {an } be a bounded monotonic sequence.
1

increasing: glb = first term, lub = limit of the sequence

decreasing: lub = first term, glb = limit of the sequence

Example
Determine the glb and lub of the convergent sequences in the previous
example.

5n + 1
(decreasing)
2n

1
(decreasing)
(2n)!
n
o
cos
(increasing)
n n=2

Outline

Convergence of Alternating Sequences

Monotone and Bounded Sequences

Proving the convergence of sequences by definition

Please note some changes...

Definition (Convergence of a Sequence)


A sequence {an } is said to converge to the limit L if

Please note some changes...

Definition (Convergence of a Sequence)


A sequence {an } is said to converge to the limit L if given any > 0,

Please note some changes...

Definition (Convergence of a Sequence)


A sequence {an } is said to converge to the limit L if given any > 0, there
exists a number N such that:

Please note some changes...

Definition (Convergence of a Sequence)


A sequence {an } is said to converge to the limit L if given any > 0, there
exists a number N such that:
If n is an integer and n > N , then |an L| < .

L +

L
L

L +

L
L

N
0

L +

L +

N
0

L +

L +

N
0

L +
L
L

L +
L
L

N
0

Remark
To show that {an } converges to L by definition:

Remark
To show that {an } converges to L by definition:
1

Find a suitable N in terms of

Remark
To show that {an } converges to L by definition:
1
2

Find a suitable N in terms of


Show that the given N satisfies the condition: If n > N , then
|a n L| < .

Tip:
1

Simplify |an L|

Tip:
1
2

Simplify |an L|
In the inequality |an L| < , solve for n in terms of . The the
expression in terms of is your candidate for N .

Example
Prove the following using the definition of convergence of a sequence:
1
2

converges to 0.

n2n1
5n

converges to 25 .

Announcements

Do not forget to bring your SW blue book to the next class!

You might also like