This preview shows pages 1–2. Sign up to view the full content.
7.2 Numerical Series and Sequences
99
NOTE: series are not multiplicative like sequences are:
X
a
n
b
n
6
=
X
a
n
X
b
n
,
because
1 +
a
1
b
2
+
a
2
b
2
+
...a
n
b
n
6
= (1 +
a
1
+
···
+
a
n
)(1 +
b
2
+
···
+
b
n
)
.
(More cross terms on right.)
Theorem 7.2.7
.
If
0
≤
a
n
,
∀
n
, then
∑
a
n
converges iﬀ the
partial sums are bounded.
Proof.
(
⇒
) lim
s
n
exists =
⇒ {
s
n
}
bounded.
(
⇐
)
s
n
=
s
n

1
+
a
n
≥
s
n

1
, so monotone. Then
{
s
n
}
bounded implies
{
s
n
}
convergent
by completeness.
Deﬁnition 7.2.8.
∑
a
n
is
absolutely convergent
iﬀ
∑

a
n

converges.
∑
a
n
is
conditionally convergent
iﬀ
∑

a
n

diverges but
∑
a
n
converges.
Example 7.2.3.
1. For a positiveterm series, convergence
≡
absolute convergence.
2.
∑
(

1)
n
2
n
and
∑
(

1)
n
n
!
are absolutely convergent, since
∑
1
2
n
and
∑
1
n
!
are conver
gent.
3.
∑
(

This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 11/26/2011 for the course MAT 4944 taught by Professor Wong during the Fall '11 term at FSU.
 Fall '11
 Wong

Click to edit the document details