next up previous contents index
Next: The Comparison Test Up: Infinite Series Previous: Arithmetic and Geometric Series   Contents   Index

Convergent Series

Definition 6.3   Let {an} be a sequence, and let

Sn = a1 + a2 + ... + an,    the nth partial sum.    

If $\displaystyle \lim_{{n\to\infty}}^{}$Sn exists, we say that $\displaystyle \sum$an is a convergent series, and write $\displaystyle \lim_{{n\to\infty}}^{}$Sn = $\displaystyle \sum$an.

Thus a series is convergent if and only if it's sequence of partial sums is convergent. The limit of the sequence of partial sums is the sum of the series. A series which is not convergent, is a divergent series.

Example 6.4   The series $\displaystyle \sum$rn is convergent with sum 1/(1 - r), provided that | r| < 1. For other values of r, the series is divergent; in particular, the series $\displaystyle \sum$(- 1)n is divergent.

Solution. We noted above that when | r| < 1, Sn$ \to$a/(1 - r) as n$ \to$$ \infty$; note particular cases;

$\displaystyle \sum_{{n=1}}^{\infty}$$\displaystyle {\frac{{1}}{{2^n}}}$ = 1    or equivalently,    $\displaystyle {\frac{{1}}{{2}}}$ + $\displaystyle {\frac{{1}}{{4}}}$ + $\displaystyle {\frac{{1}}{{8}}}$ + ... = 1.


Example 6.5   The sum $\displaystyle \sum$$\displaystyle {\frac{{1}}{{n(n+1)}}}$ is convergent with sum 1.

Solution. We can compute the partial sums explicitly:

Sn = $\displaystyle \sum_{{k=1}}^{n}$$\displaystyle {\frac{{1}}{{k(k+1)}}}$ = $\displaystyle \sum_{{k=1}}^{n}$$\displaystyle \left(\vphantom{\frac{1}{k} -
\frac{1}{k+1}}\right.$$\displaystyle {\frac{{1}}{{k}}}$ - $\displaystyle {\frac{{1}}{{k+1}}}$$\displaystyle \left.\vphantom{\frac{1}{k} -
\frac{1}{k+1}}\right)$ = 1 - $\displaystyle {\frac{{1}}{{n+1}}}$$\displaystyle \to$1    as    n$\displaystyle \to$$\displaystyle \infty$.


Example 6.6   The sum $\displaystyle \sum$$\displaystyle {\frac{{1}}{{n}}}$ is divergent.

Solution. We estimate the partial sums:

Sn = $\displaystyle {\frac{{1}}{{1}}}$ + $\displaystyle {\frac{{1}}{{2}}}$ + $\displaystyle \left(\vphantom{\frac{1}{3}+ \frac{1}{4}}\right.$$\displaystyle {\frac{{1}}{{3}}}$ + $\displaystyle {\frac{{1}}{{4}}}$$\displaystyle \left.\vphantom{\frac{1}{3}+ \frac{1}{4}}\right)$ + $\displaystyle \left(\vphantom{\frac{1}{5}+ \cdots + \frac{1}{8}}\right.$$\displaystyle {\frac{{1}}{{5}}}$ + ... + $\displaystyle {\frac{{1}}{{8}}}$$\displaystyle \left.\vphantom{\frac{1}{5}+ \cdots + \frac{1}{8}}\right)$ + $\displaystyle \left(\vphantom{\frac{1}{9} +\cdots+ \frac{1}{15}}\right.$$\displaystyle {\frac{{1}}{{9}}}$ + ... + $\displaystyle {\frac{{1}}{{15}}}$$\displaystyle \left.\vphantom{\frac{1}{9} +\cdots+ \frac{1}{15}}\right)$ + ... + $\displaystyle {\frac{{1}}{{n}}}$  
  > 1 + $\displaystyle {\frac{{1}}{{2}}}$ + $\displaystyle {\frac{{2}}{{4}}}$ + $\displaystyle {\frac{{4}}{{8}}}$ > 2$\displaystyle {\frac{{1}}{{2}}}$    if n$ \ge$15      
  > 1 + $\displaystyle {\frac{{1}}{{2}}}$ + $\displaystyle {\frac{{2}}{{4}}}$ + $\displaystyle {\frac{{4}}{{8}}}$ + $\displaystyle {\frac{{8}}{{16}}}$ > 3    if n$ \ge$31      
  $\displaystyle \to$ $\displaystyle \infty$    as    n$\displaystyle \to$$\displaystyle \infty$.  


Example 6.7   The sum $\displaystyle \sum$$\displaystyle {\frac{{1}}{{n^2}}}$ is convergent. [Actually the sum is $ \pi^{2}_{}$/6, but this is much harder.]

Figure 6.1: Comparing the area under the curve y = 1/x2 with the area of the rectangles below the curve
\psfrag{y=1/x^2}{$y = 1/{x^2}$}\psfrag{1/n^2}{$1/{n^2}$}\includegraphics[width=2.9in]{xfig/area-under.eps}

Solution. We estimate the partial sums. Since 1/n2 > 0, clearly {Sn} is an increasing sequence. We show it is bounded above, whence by the Monotone Convergence Theorem (3.9), it is convergent. From the diagram,

$\displaystyle {\frac{{1}}{{2^2}}}$ + $\displaystyle {\frac{{1}}{{3^2}}}$ + ... + $\displaystyle {\frac{{1}}{{n^2}}}$ < $\displaystyle \int_{1}^{n}$$\displaystyle {\frac{{d\,x}}{{x^2}}}$,    and so      
Sn < 1 + $\displaystyle \left[\vphantom{-\frac{1}{x}}\right.$ - $\displaystyle {\frac{{1}}{{x}}}$$\displaystyle \left.\vphantom{-\frac{1}{x}}\right]_{1}^{n}$$\displaystyle \le$2 - $\displaystyle {\frac{{1}}{{n}}}$.  

Thus Sn < 2 for all n, the sequence of partial sums is bounded above, and the series is convergent.


Proposition 6.8   Let $ \sum$an be convergent. Then an$ \to$ 0 as n$ \to$$ \infty$.

Proof. Write l = $ \lim_{{n\to \infty}}^{}$Sn, and recall from our work on limits of sequences that Sn-1$ \to$l as n$ \to$$ \infty$. Then

an = (a1 + a2 +...an) - (a1 + a2 +...an-1) = Sn - Sn-1$\displaystyle \to$l - l    as    n$\displaystyle \to$$\displaystyle \infty$.

$ \qedsymbol$

Remark 6.9   This gives a necessarycondition for the convergence of a series; it is not sufficient. For example we have seen that $ \sum$1/n is divergent, even though 1/n$ \to$ 0 as n$ \to$$ \infty$.

Example 6.10   The sum $\displaystyle \sum$$\displaystyle {\frac{{1}}{{n}}}$ is divergent (Graphical method).

Solution. We estimate the partial sums. Since 1/n > 0, clearly {Sn} is an increasing sequence. We show it is not bounded above, whence by the note after 3.9, the sequence of partial sums $ \to$$ \infty$ as n$ \to$$ \infty$.

Figure 6.2: Comparing the area under the curve y = 1/x with the area of the rectangles above the curve
\includegraphics[width=2.9in]{xfig/one-over-x.eps}

From the diagram,

1 + $\displaystyle {\frac{{1}}{{2}}}$ + ... + $\displaystyle {\frac{{1}}{{n}}}$ > $\displaystyle \int_{1}^{n}$$\displaystyle {\frac{{d\,x}}{{x}}}$ > $\displaystyle {\frac{{1}}{{2}}}$ + ... + $\displaystyle {\frac{{1}}{{n}}}$.

Writing Sn = 1 + $\displaystyle {\frac{{1}}{{2}}}$ + ... + $\displaystyle {\frac{{1}}{{n}}}$, we have Sn > log n > Sn - 1, or equivalently 1 + log n > Sn > log n for all n. Thus Sn$ \to$$ \infty$ and the series is divergent. [There is a much better estimate; the difference Sn - log n$ \to$$ \gamma$ as n$ \to$$ \infty$, where $ \gamma$ is Euler's constant.]


Proposition 6.11   Let $ \sum$an and $ \sum$bn be convergent. Then $ \sum$(an + bn) and $ \sum$c.an are convergent.

Proof. This can be checked easily directly from the definition; it is in effect the same proof that the sum of two convergent sequences is convergent etc. $ \qedsymbol$


next up previous contents index
Next: The Comparison Test Up: Infinite Series Previous: Arithmetic and Geometric Series   Contents   Index
Ian Craw 2002-01-07