guide:790bb571a8

[math] \newcommand{\ex}[1]{\item } \newcommand{\sx}{\item} \newcommand{\x}{\sx} \newcommand{\sxlab}[1]{} \newcommand{\xlab}{\sxlab} \newcommand{\prov}[1] {\quad #1} \newcommand{\provx}[1] {\quad \mbox{#1}} \newcommand{\intext}[1]{\quad \mbox{#1} \quad} \newcommand{\R}{\mathrm{\bf R}} \newcommand{\Q}{\mathrm{\bf Q}} \newcommand{\Z}{\mathrm{\bf Z}} \newcommand{\C}{\mathrm{\bf C}} \newcommand{\dt}{\textbf} \newcommand{\goesto}{\rightarrow} \newcommand{\ddxof}[1]{\frac{d #1}{d x}} \newcommand{\ddx}{\frac{d}{dx}} \newcommand{\ddt}{\frac{d}{dt}} \newcommand{\dydx}{\ddxof y} \newcommand{\nxder}[3]{\frac{d^{#1}{#2}}{d{#3}^{#1}}} \newcommand{\deriv}[2]{\frac{d^{#1}{#2}}{dx^{#1}}} \newcommand{\dist}{\mathrm{distance}} \newcommand{\arccot}{\mathrm{arccot\:}} \newcommand{\arccsc}{\mathrm{arccsc\:}} \newcommand{\arcsec}{\mathrm{arcsec\:}} \newcommand{\arctanh}{\mathrm{arctanh\:}} \newcommand{\arcsinh}{\mathrm{arcsinh\:}} \newcommand{\arccosh}{\mathrm{arccosh\:}} \newcommand{\sech}{\mathrm{sech\:}} \newcommand{\csch}{\mathrm{csch\:}} \newcommand{\conj}[1]{\overline{#1}} \newcommand{\mathds}{\mathbb} [/math]

Infinite Series: Definition and Properties.

We are now ready to define infinite series. Consider an infinite sequence of real numbers [math]a_m, a_{m+1}, a_{m+2},... .[/math] From this sequence [math]\{a_i\}[/math] we construct another sequence [math]\{s_n\}[/math] with the same domain, called the sequence of partial sums and defined by

[[math]] \begin{eqnarray*} s_m &=& a_m, \\ s_{m+1} &=& a_m + a_{m+1}, \\ s_{m+2} &=& a_m + a_{m+1} + a_{m+2}, \\ \vdots \end{eqnarray*} [[/math]]

That is, for every integer [math]n \geq m[/math], the number [math]s_n[/math] is given by

[[math]] \begin{equation} s_n = \sum_{i=m}^n a_i = a_m + \cdots + a_n . \label{eq9.2.1} \end{equation} [[/math]]

If the sequence [math]\{s_n\}[/math] of partial sums converges, we define its limit to be the value of the infinite series determined by the original sequence [math]\{a_i\}[/math], and we write

[[math]] \begin{equation} \sum_{i=m}^\infty a_i = \lim_{n \rightarrow \infty} s_n. \label{eq9.2.2} \end{equation} [[/math]]

Example

Show that

[[math]] \sum_{i=0}^\infty \frac{1}{2^i} = 1 + \frac{1}{2} + \frac{1}{4} + \frac{1}{8} + \cdots = 2. [[/math]]

For this series the sequence of partial sums is given by

[[math]] \begin{eqnarray*} s_0 &=& 1, \\ s_1 &=& 1 + \frac{1}{2}, \\ s_2 &=& 1 + \frac{1}{2} + \frac{1}{4},\\ \vdots \end{eqnarray*} [[/math]]

and, more generally, by

[[math]] s_n = 1 + \frac{1}{2} + \cdots + \frac{1}{2^n} . [[/math]]

Note that [math]s_0 = 2 - 1[/math], [math]s_1 = 2 - \frac{1}{2}[/math], and [math]s_2 = 2 - \frac{1}{4}[/math]. It is not hard to show that [math]s_n = 2 - \frac{1}{2^n}[/math] for every positive integer [math]n[/math]. Hence

[[math]] \lim_{n \rightarrow \infty} s_n = \lim_{n \rightarrow \infty} (2 - \frac{1}{2^n}) = 2, [[/math]]

and it then follows from the above definition that [math]\sum_{n=0}^\infty \frac{1}{2^i} = 2[/math].

If, for a given sequence of real numbers [math]a_m, a_{m+1}, . . .[/math], it happens that the corresponding sequence of partial sums does not converge, then the value of the infinite series is not defined. In this case we shall follow the customary terminology and say that the infinite series [math]\sum_{i=m}^\infty a_i[/math] diverges. On the other hand, if the sequence of partial sums does converge, we shall say that the infinite series [math]\sum_{i=m}^\infty a_i[/math] converges. Summarizing the above definitions (1) and (2) in a single formula, we obtain the equation

[[math]] \begin{equation} \sum_{i=m}^\infty a_i = \lim_{n \rightarrow \infty} \sum_{i=m}^n a_i, \label{eq9.2.3} \end{equation} [[/math]]

in which the series on the left converges if and only if the limit on the right exists. Our first theorem states that if an infinite series [math]\sum_{i=m}^\infty a_i[/math] converges, then the sequence [math]\{ a_i \}[/math] must converge to zero:

Theorem

If [math]\sum_{i=m}^\infty a_i[/math] converges, then [math]\lim_{n \rightarrow \infty} a_n = 0.[/math]

Show Proof

Let [math]s = \{ s_n \}[/math] be the sequence of partial sums. Since the infinite series converges, there exists a real number [math]L[/math] such that

[[math]] \sum_{i=m}^\infty a_i = \lim_{n \rightarrow \infty} s_n = L. [[/math]]

Let [math]s'[/math] be the sequence defined by [math]s'_n = s_{n-1}[/math], for every integer [math]n \geq m + 1[/math]. The range of the function [math]s'[/math] is the same as that of [math]s[/math], and the order is the same. That is, enumeration of the terms of both sequences gives the same list of numbers: [math]s_m, s_{m+1}, ....[/math] We conclude that

[[math]] \lim_{n \rightarrow \infty} s'_n = \lim_{n \rightarrow \infty} s_n. [[/math]]

We next observe that, for every integer [math]n \geq m + 1[/math],

[[math]] a_n = s_n - s_{n-1} = s_n - s'_n. [[/math]]

Since the limit of the sum or difference of two convergent sequences is the sum or difference of their limits [see Theorem (1.1), page 475], we have

[[math]] \lim_{n \rightarrow \infty} a_n = \lim_{n \rightarrow \infty} s_n - \lim_{n \rightarrow \infty} s'_n = L - L = 0, [[/math]]

and the proof is complete.

■

As a result of Theorem (2.1) we see at once that both infinite series

[[math]] \begin{eqnarray*} \sum_{i=0}^\infty (-1)^i 2 &=& 2 - 2 + 2 - 2 + \cdots , \\ \sum_{i=1}^\infty (2 + \frac{1}{i^2}) &=& 3 + 2\frac{1}{4} + 2\frac{1}{9} + 2\frac{1}{16} + \cdots \end{eqnarray*} [[/math]]

are divergent. For the first, [math]\lim_{n \rightarrow \infty} a_n = \lim_{n \rightarrow \infty} (-1)^n 2[/math], which does not exist, and for the second, [math]\lim_{n \rightarrow \infty} a_n = \lim_{n \rightarrow \infty} (2 + \frac{1}{n^2}) = 2.[/math] [Warning: The converse of Theorem (2.1) is false. That is, it is not true that if [math]\lim_{n \rightarrow \infty} a_n = 0[/math], then [math]\sum_{i=m}^\infty a_i[/math] converges. A well-known counterexample is the series discussed in the following example.]

Example

Show that the infinite series

[[math]] \sum_{k=1}^\infty \frac{1}{k} = 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \cdots [[/math]]

diverges. This series is called the harmonic series and is particularly interesting because it diverges in spite of the fact that [math]\lim_{n \rightarrow \infty} \frac{1}{n} = 0[/math]. To prove divergence, [math]s_n[/math] we first observe that [math]s_n[/math], the [math]n[/math]th partial sum of the series, is given by

[[math]] s_n = 1 + \frac{1}{2} + \cdots + \frac{1}{n}. [[/math]]

File:Guide c5467 scanfig9 3.png

Next, consider Figure 3, which shows the graph of the function [math]\frac{1}{x}[/math] between [math]x = 1[/math] and [math]x = n + 1[/math]. With respect to the partition [math]\sigma = \{ 1, 2, . . ., n+1 \}[/math], the upper sum [math]U_\sigma[/math] is equal to the sum of the areas of the shaded rectangles and is given by

[[math]] U_\sigma = 1 + \frac{1}{2} + \cdots + \frac{1}{n} . [[/math]]

Thus [math]U_\sigma = s_n[/math]. Since every upper sum is greater than or equal to the corresponding definite integral, we obtain

[[math]] s_n = U_\sigma \geq \int_1^{n+1} \frac{1}{x} dx = \ln (n + 1). [[/math]]

We know that [math]\ln(n + 1)[/math] increases without bound as [math]n[/math] increases, hence the same is true of [math]s_n[/math]. Thus

[[math]] \lim_{n \rightarrow \infty} s_n = \infty, [[/math]]

which completes the proof that the harmonic series diverges.

The next theorem states that infinite series have what is commonly called the property of linearity. The result is a useful one because it shows that convergent infinite series may be added in the natural way and also multiplied by real numbers. Note that we have come across the property of linearity before. It is one of the basic features of finite series and also of definite integrals.

Theorem

If [math]\sum_{i=m}^ \infty a_i[/math] and [math]\sum_{i=m}^ \infty b_i[/math] are convergent infinite series and if [math]c[/math] is a real number, then the series [math]\sum_{i=m}^ \infty (a_i + b_i)[/math] and [math]\sum_{i=m}^ \infty ca_i[/math] are also convergent, and

\item[i]] [math]\sum_{i=m}^\infty (a_i + b_i) = \sum_{i=m}^\infty a_i + \sum_{i=m}^\infty b_i .[/math] \item[(ii)] [math]\sum_{i=m}^\infty ca_i = c \sum_{i=m}^\infty a_i.[/math]

Show Proof

The proofs of (i) and (ii) are direct corollaries of the corresponding parts of Theorem (1.1), page 475. Let [math]\{ s_n \}[/math] and [math]\{ t_n \}[/math], be the two convergent sequences of partial sums corresponding to [math]\sum_{i=m}^\infty a_i[/math] and [math]\sum_{i=m}^\infty b_i[/math], respectively. That is,

[[math]] s_n = \sum_{i=m}^n a_i, \;\;\; t_n = \sum_{i=m}^n b_i, [[/math]]

[[math]] \begin{equation} \sum_{i=m}^\infty s_n = \lim_{n \rightarrow \infty} s_n, \;\;\; \sum_{i=m}^\infty b_i = \lim_{n \rightarrow \infty} t_n. \label{eq9.2.4} \end{equation} [[/math]]

By part (i) of Theorem (1.1), we have

[[math]] \begin{equation} \lim_{n \rightarrow \infty} (s_n + t_n) = \lim_{n \rightarrow \infty} s_n + \lim_{n \rightarrow \infty} t_n, \label{eq9.2.5} \end{equation} [[/math]]

which shows, first of all, that [math]\{ s_n + t_n \}[/math] is a convergent sequence. The linearity property of finite sums implies that

[[math]] s_n + t_n = \sum_{i=m}^n a_i + \sum_{i=m}^n b_i = \sum_{i=m}^n (a_i + b_i), [[/math]]

from which we conclude that [math]\{ s_n + t_n \}[/math] is the sequence of partial sums corresponding to the series [math]\sum_{i=m}^\infty (a_i + b_i)[/math]. Hence

[[math]] \begin{equation} \sum_{i=m}^\infty (a_i + b_i) = \lim_{n \rightarrow \infty} (s_n + t_n). \label{eq9.2.6} \end{equation} [[/math]]

Substituting from equations (6) and (4) into equation (5), we obtain

[[math]] \sum_{i=m}^\infty (a_i + b_i) = \sum_{i=m}^\infty a_i + \sum_{i=m}^\infty b_i, [[/math]]

and this completes the proof of part (i). Part (ii) is proved in the same way, and we omit the details.

■

As an application of Theorem (2.2) we may conclude that if a series $\sum_{i=m}^\infty a_i$ diverges and if $c \neq 0$, then $\sum_{i=m}^\infty ca_i$ also diverges. For if the latter series converges, we know from part (ii) of (2.1) that

[[math]] \frac{1}{c} \sum_{i=m}^\infty ca_i = \sum_{i=m}^\infty \frac{1}{c} ca_i = \sum_{i=m}^\infty a_i. [[/math]]

and that the series on the right converges, contrary to assumption. For example, since the harmonic series [math]\sum_{i=1}^\infty \frac{1}{i}[/math] diverges, it follows at once that the series

[[math]] \sum_{i=1}^\infty \frac{1}{5i} = \frac{1}{5} + \frac{1}{10} + \frac{1}{15} + \cdots [[/math]]

also diverges. It is an important corollary of the next theorem that the convergence or divergence of an infinite series is unaffected by the addition or deletion of any finite number of terms at the beginning.

Theorem

If [math]m \lt 1[/math], then the series [math]\sum_{i=m}^\infty a_i[/math] converges if and only if [math]\sum_{i=l}^\infty a_i[/math] a converges. lf either converges, then

[[math]] \sum_{i=m}^\infty a_i = \sum_{i=m}^{l-1} a_i + \sum_{i=l}^\infty a_i [[/math]]

Show Proof

Let [math]\{ s_n \}[/math] and [math]\{ t_n \}[/math] be the sequences of partial sums for [math]\sum_{i=m}^\infty a_i[/math] and [math]\sum_{i=l}^\infty a_i[/math], respectively. Then

[[math]] \begin{eqnarray*} s_n &=& \sum_{i=m}^n a_i, \;\;\;\mbox{for every integer}\; n \geq m,\\ t_n &=& \sum_{i=l}^n a_i, \;\;\;\mbox{for every integer}\; n \geq l. \end{eqnarray*} [[/math]]

If [math]n[/math] is any integer greater than or equal to [math]l[/math], then obviously

[[math]] \sum_{i=m}^n a_i = \sum_{i=m}^{l-1} a_i + \sum_{i=l}^n a_i. [[/math]]

Hence

[[math]] s_n = \sum_{i=m}^{l-1} a_i + t_n, \;\;\;\mbox{for every integer}\; n \geq l. [[/math]]

The number [math]\sum_{i=m}^{l-1} a_i[/math] does not depend on [math]n[/math], and is fixed throughout the proof. Thus, for [math]n \geq l[/math], the sequences [math]\{ s_n \}[/math] and [math]\{ t_n \}[/math] differ by a constant. It follows that one converges if and only if the other does and that

[[math]] \lim_{n \rightarrow \infty} s_n = \sum_{i=m}^{l-1} a_i + \lim_{n \rightarrow \infty} t_n, [[/math]]

(see Problem 7, page 481). This completes the proof, since by definition,

[[math]] \lim_{n \rightarrow \infty} s_n = \sum_{i=m}^\infty a_i \;\;\;\mbox{and}\;\;\; \lim_{n \rightarrow \infty} t_n = \sum_{i=l}^\infty a_i . [[/math]]

■

As an illustration, consider an infinite series [math]\sum_{i=0}^\infty a_i[/math] whose first thousand terms we know nothing about, but which has the property that [math]a_n = \frac{1}{2^n}[/math] for every integer [math]n \gt 1000[/math]. We have shown in Example 1 that the series [math]\sum_{i=0}^\infty \frac{1}{2^i}[/math] converges, and it follows by Theorem (2.3) that [math]\sum_{i=1001}^\infty \frac{1}{2^i}[/math] also converges. Since the latter series is precisely the series [math]\sum_{i=1001}^\infty a_i[/math], a second application of (2.3) establishes the convergence of the original series [math]\sum_{i=1}^\infty a_i[/math]. An infinite geometric series is one of the form

[[math]] \sum_{i=0}^\infty ar^i = a + ar + ar^2 + \cdots , [[/math]]

in which [math]a[/math] and [math]r[/math] are arbitrary real numbers. For example, by taking [math]a = 1[/math] and [math]r = \frac{1}{2}[/math] we obtain the convergent series [math]\sum_{i=0}^\infty \frac{1}{2^i}[/math]. In studying the question of the convergence or divergence of geometric series, it is sufficient to take [math]a = 1[/math] and consider the simpler series

[[math]] \begin{equation} \sum_{i=0}^\infty = 1 + r + r^2 + \cdots . \label{eq9.2.7} \end{equation} [[/math]]

For if this series converges, then so does [math]\sum_{i=0}^\infty ar^i[/math], and

[[math]] \sum_{i=0}^\infty ar^i = a \sum_{i=0}^\infty r^i . [[/math]]

On the other hand, if (7) diverges and [math]a \neq 0[/math], then [math]\sum_{i=0}^\infty ar^i[/math] also diverges. The principal result about the convergence of geometric series is the followIng:

Theorem

The geometric series (7) converges if and only if [math] -1 \lt r \lt 1[/math]. If it converges, then

[[math]] \sum_{i=0}^\infty r^i = \frac{1}{1 - r} . [[/math]]

Show Proof

If [math]r = 1[/math], the series (7) is the divergent series [math]1 + 1 + 1 + \cdots [/math]. Hence, in what follows, we shall assume that [math]r \neq 1[/math]. The sequence [math]\{ s \}[/math] of partial sums is defined by

[[math]] s_n = \sum_{i=0}^n r^i = 1 + r+ \cdots + r^n, [[/math]]

for every integer [math]n \geq 0[/math]. Observe that

[[math]] \begin{eqnarray*} 1 + rs_n &=& 1 + r(1 + r + \cdots + r^n) \\ &=& 1 + r + r^2 + \cdots + r^{n+1} = s_{n+1}. \end{eqnarray*} [[/math]]

On the other hand, we have the equation

[[math]] s_n + r^{n + 1} = s_{n +1}. [[/math]]

It follows that [math]1 + rs_n = s_n + r^{n+1}[/math] whence [math]1 - r^{n+1} = s_n(1 - r)[/math], and so

[[math]] s = \frac{1 - r^{n + 1}}{1 - r} [[/math]]

The proof is completed by considering two cases. First of all, suppose that [math]-1 \lt r \lt 1[/math]. Then [math]\lim_{n \rightarrow \infty} r^{n+1} = \lim_{n \rightarrow \infty} r^n = 0[/math] (see Problem 5, page 481), and therefore

[[math]] \sum_{x=0}^\infty r^i = \lim_{n \rightarrow \infty} s_n = \frac{1 - 0}{1 - r } = \frac{1}{1 - r} . [[/math]]

Second, suppose that [math]r \leq - 1[/math] or [math]r \gt 1[/math]. For neither of these possibilities does [math]\lim_{n \rightarrow \infty} r^{n+1}[/math] exist (again, see Problem 5, page 481). It follows that [math]\lim_{n \rightarrow \infty} s_n[/math] also does not exist, and hence the series [math]\sum_{i=0}^\infty r^i[/math] diverges. This completes the proof.

■

\end{exercise}

General references

Doyle, Peter G. (2008). "Crowell and Slesnick's Calculus with Analytic Geometry" (PDF). Retrieved Oct 29, 2024.