Series

Motivation for a Series

What is $1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\dots$? One may think of this geometrically: We start with a square of edge length $1$. Its area is given by $1^2=1$. Now, we proceed cutting it in equal-sized pieces by alterningly using horizontal and vertical cuts. The first cut yields a rectangle of area $\frac{1}{2}\cdot 1=\frac{1}{2}$, then we get a square of size $\frac{1}{2}\cdot \frac{1}{2}=\frac{1}{4}$, in the next step a rectangle of area $\frac{1}{4}\cdot \frac{1}{2}=\frac{1}{8}$ and so on. We may now arrange those rectangles in a specific way:

Visualization of geometric series

Combining all areas, we obtain a $2\times 1$-rectangle with total area $2\cdot 1=2$. Hence, we expect the value of the infinite sum $1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\dots$ to be $2$. When considering the partial sums of that infinite sum, we get a similar result:

$\begin{array}{c}\begin{array}{ccc}{S}_1& =1& =1\\ S_2& =1+\frac{1}{2}& =\mathrm{1,5}\\ S_3& =1+\frac{1}{2}+\frac{1}{4}& =\mathrm{1,75}\\ S_4& =1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}& =\mathrm{1,875}\\ S_5& =1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\frac{1}{16}& =\mathrm{1,9375}\\ & ⋮\end{array}\end{array}$

The partial sums seemingly tend towards $2$ . This supports our assumption that for the infinite sum, $1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\dots =2$ is a sensible definition.

So we just assigned a specific value to a particular infinite sum. Now, we would like to extend this intuitive concept to an exact definition for infinite sums. This opens up a set of questions:

• How can we determine the value of an arbitrary infinite sum?
• Are there maybe infinite sums which cannot be assigned a value?
• And if yes, how do we see whether an infinite series can be assigned a value or not?

In this chapter, we will use the concept of a series to formally define what the value of an infinite sum is. Series will be defined using partial sums, which are finite and hence may be easily evaluated. In the following chapters, we will see that there actually are infinite sums, which cannot be assigned a value. And we will obtain some criteria for finding out whether an infinite sum may be evaluated or not.

Finite sums

Finite sums and summation convention (YouTube video (in German) by the YouTube channel: MJ Maths)

Summation convention for finite sums

A finite sum (as you may suspect from its name) is nothing else but a sum with finitely many summands. There is an efficient way of denoting such a sum, which we have already seen in Sum and product (missing). Instead of writing

$a_1+a_2+a_3+a_4+\dots +a_n$

we used the notation

$\sum _{k=1}^n{a}_k$

Here, $k$ is the summation index, which assumes all integer values starting from $1$ up to its finite value of $n$. For each assumed $k$, the expression $a_k$ will return a summand - and all of these summands are finally added up. This principle is made clear in the following animation:

Animation zur endlichen Summe

Example (Example for a finite sum)

Let us consider the finite sum

$\sum _{k=3}^7{k}^3$

Here, $k$ assumes all integer values starting from $3$ through $7$. The funcion assigning to each index its respective summand is given by $a_k=k^3$, so we map $k\mapsto k^3$. That means, for $k=3$ the summand is $3^3$, for $k=4$ it is $4^3$ and so on, until we have $7^3$ for $k=7$. The final sum we obtain is now:

$\sum _{k=3}^7{k}^3=3^3+4^3+5^3+6^3+7^3$

Partial sums

Partial sums - definition and example (YouTube video (in German) by the YouTube channel: MJ Maths)

As we now know how to define finite sums, we may proceed with the formal definition of an infinite sum. We start with the form, which seems intuitively most plausible:

$a_1+a_2+a_3+a_4+a_5+\dots$

And consider the sequence of partial sums:

$\begin{array}{cc}{S}_1& =a_1\\ S_2& =a_1+a_2\\ S_3& =a_1+a_2+a_3\\ S_4& =a_1+a_2+a_3+a_4\\ S_5& =a_1+a_2+a_3+a_4+a_5\\ & ⋮\\ S_n& =a_1+a_2+a_3+a_4+a_5+\dots a_n\\ & ⋮\end{array}$

This sequence will be used to define infinite sums. $S_n$ is the sum over the first $n$ summands - and hence a finite sum:

$S_n=a_1+a_2+a_3+a_4+a_5+\dots +a_n=\sum _{k=1}^n{a}_k$

These partial sums are parts of the finite sum. Formally, we may define:

Definition (Partialsumme)

Let $(a_m{)}_{m\in \mathbb{N}}$ be a sequnce in $ℝ$. Then, the following sum is called $n$-th Partial sum:

$S_n=a_1+a_2+a_3+a_4+a_5+\dots +a_n=\sum _{k=1}^n{a}_k$

Series

The value of an infinite sum should be the limit of its partial sums:

$\begin{array}{cc}{a}_1+a_2+a_3+a_4+\dots & =\underset{n\to \mathrm{\infty }}{lim}(a_1+a_2+a_3+a_4+\dots +a_n)\\ & =\underset{n\to \mathrm{\infty }}{lim}\sum _{k=1}^n{a}_k\\ & =\underset{n\to \mathrm{\infty }}{lim}{S}_n\end{array}$

We may first construct the sequence of all possible partial sums and then consider their limit. This sequence of partial sums is defined to be a series. We denote it by $\sum _{k=1}^{\mathrm{\infty }}{a}_k$. This notation is very similar to that of the $n$-th partial sum $\sum _{k=1}^n{a}_k$. But instead of writing down the final index $n$ at which the summation has to be stopped, we use the infinity symbol $\mathrm{\infty }$, emphasizing that our summation does not end. The formal definition now reads:

Definition (Reihe)

For a real-valued sequence $(a_k{)}_{k\in \mathbb{N}}$, the series $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ is defined as the sequence of partial sums ${\left(\sum _{k=1}^n{a}_k\right)}_{n\in \mathbb{N}}$:

$\begin{array}{cc}\sum _{k=1}^{\mathrm{\infty }}{a}_k& ={\left(\sum _{k=1}^n{a}_k\right)}_{n\in \mathbb{N}}\\ & =(\sum _{k=1}^1{a}_k,\sum _{k=1}^2{a}_k,\sum _{k=1}^3{a}_k,\sum _{k=1}^4{a}_k,\dots )\\ & =(a_1,a_1+a_2,a_1+a_2+a_3,a_1+a_2+a_3+a_4,\dots )\end{array}$

Next, we identify the outcome of the infinite summation with the limit of the partial sum sequence. This sequence of partial sums is just an ordinary sequence. It either has a limit value, or it diverges. If the partial sum sequence diverges, then the infinite sum / series is also said to diverge. In case, it actually converges towards a certain limit, then the limit value is also assigned to the infinite sum. Technically, an infinite sum is nothing else but the limit of its partial sum sequence. This limit is denoted by $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ as well:

Definition (Limit of a series)

The limit $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ of a series is the limit of the corresponding partial sum sequence:

$\sum _{k=1}^{\mathrm{\infty }}{a}_k=\underset{n\to \mathrm{\infty }}{lim}\sum _{k=1}^n{a}_k$

Hint

In the article „Cauchy-Kriterium für Reihen“ we will see that only the value of almost all summands is relevant for the convergence behavior (convergent / divergent). That means, if we change the value of finitely many summands in the series, the convergence behavior stays the same. However, the limit of a converging series may of course change if we replace some of its summands.

Is a series a number or a sequence?

As we already noticed, the expression $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ is used to denote either the sequence of partial sums (= series) or its limit (= value of the series) . This contradicts the basic principle that notations in mathematics should always be unique! The expression $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ cannot describe two different objects (a sequence and a number) at once. Instead, we have to choose the correct meaning from the context. This problem is also treated in the book „Analysis 1“ by Otto Forster:

„The Symbol $\sum _{n=0}^{\mathrm{\infty }}{a}_n$ may mean two things:

1. The sequence ${\left(\sum _{n=0}^m{a}_n\right)}_{m\in \mathbb{N}}$ of partial sums.
2. In case of convergence the limit $\underset{m\to \mathrm{\infty }}{lim}\sum _{n=0}^m{a}_n$.“

– Otto Forster in „Analysis 1“, translated from German

If we, for instance, say "the series $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ converges" or talk about "the series $\sum _{k=1}^{\mathrm{\infty }}{a}_k$" in general, then the expression is meant to describe a sequence (first meaning). In case that $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ is treated like a number in calculations, then the expression is meant to denote the limit (second meaning). So we need to pay attention what is meant when using the expression $\sum _{k=1}^{\mathrm{\infty }}{a}_k$: a sequence of partial sums or its limit.

Conclusion

We just formally defined the idea of an infinite sum:

1. We defined the sum of the first $n$ summands as $n$-th partial sum.
2. We called the sequence of these partial sums a "series". The limit of this sequence was defined to be the value of our infinite sum.

Example: geometrical series with $\frac{1}{2}$

$\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\dots =1$

Let us consider again the infinite sum $1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\dots$ given in the beginning. According to our definition, this sum is equivalent to the series $\sum _{k=0}^{\mathrm{\infty }}\frac{1}{2^k}$. First, let us compute its partial sums:

$\begin{array}{c}\begin{array}{cccc}{S}_1& =\sum _{k=0}^0\frac{1}{2^k}& =1& =1\\ S_2& =\sum _{k=0}^1\frac{1}{2^k}& =1+\frac{1}{2}& =\mathrm{1,5}\\ S_3& =\sum _{k=0}^2\frac{1}{2^k}& =1+\frac{1}{2}+\frac{1}{4}& =\mathrm{1,75}\\ S_4& =\sum _{k=0}^3\frac{1}{2^k}& =1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}& =\mathrm{1,875}\\ S_5& =\sum _{k=0}^4\frac{1}{2^k}& =1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\frac{1}{16}& =\mathrm{1,9375}\\ & ⋮\end{array}\end{array}$

The infinite sum $1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\dots$ is equivalent to the sequence of those partial sums:

$\begin{array}{cc}\sum _{k=0}^{\mathrm{\infty }}\frac{1}{2^k}& ={\left(\sum _{k=0}^{n-1}\frac{1}{2^k}\right)}_{n\in \mathbb{N}}\\ & =(\sum _{k=0}^0\frac{1}{2^k},\sum _{k=0}^1\frac{1}{2^k},\sum _{k=0}^2\frac{1}{2^k},\sum _{k=0}^3\frac{1}{2^k},\dots )\\ & =(1,1+\frac{1}{2},1+\frac{1}{2}+\frac{1}{4},1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8},\dots )\\ & =(1;\mathrm{1,5};\mathrm{1,75};\mathrm{1,875};\dots )\end{array}$

We may directly give the result for any $n$-th partial sum, using the geometrical summation formula $\sum _{k=0}^n{q}^k=\frac{1-q^{n+1}}{1-q}$ for $q\ne 1$. Plugging in $q=\frac{1}{2}$, this yields:

$\begin{array}{cc}{S}_n& =1+\frac{1}{2}+\frac{1}{4}+\frac{1}{8}+\dots +\frac{1}{2^{n-1}}\\ & =\sum _{k=0}^{n-1}\frac{1}{2^k}\\ & =\frac{1-{\left(\frac{1}{2}\right)}^{(n-1)+1}}{1-\frac{1}{2}}\\ & =2\cdot (1-\frac{1}{2^n})\\ & =2-\frac{1}{2^{n-1}}\end{array}$

Hence, our series corresponds to the following sequence:

$\sum _{k=0}^{\mathrm{\infty }}\frac{1}{2^k}={(2-\frac{1}{2^{n-1}})}_{n\in \mathbb{N}}$

The sequence ${(2-\frac{1}{2^{n-1}})}_{n\in \mathbb{N}}$ converges, as $\underset{n\to \mathrm{\infty }}{lim}\frac{1}{2^{n-1}}=0$ (geometrical sequence with $q=\frac{1}{2}$). Therefore, the value of our series equals 2:

$\begin{array}{cc}\sum _{k=0}^{\mathrm{\infty }}\frac{1}{2^k}& =\underset{n\to \mathrm{\infty }}{lim}\sum _{k=0}^{n-1}\frac{1}{2^k}\\ & =\underset{n\to \mathrm{\infty }}{lim}(2-\frac{1}{2^{n-1}})\\ & =2\end{array}$

Exercise

Exercise (geometrical series with $-\frac{1}{2}$)

Show convergence of the series $\sum _{k=0}^{\mathrm{\infty }}\frac{(-1{)}^k}{2^k}$ and determine its limit.

Solution (geometrical series with $-\frac{1}{2}$)

Using the geometrical summation formula, one may give an expression for the $n$-th partial sum:

$\begin{array}{cc}{S}_n& =1-\frac{1}{2}+\frac{1}{4}-\frac{1}{8}+\dots +\frac{(-1{)}^{n-1}}{2^{n-1}}\\ & =\sum _{k=0}^{n-1}{(-\frac{1}{2})}^k\\ & =\frac{1-{(-\frac{1}{2})}^{(n-1)+1}}{1-(-\frac{1}{2})}\\ & =\frac{1-{(-\frac{1}{2})}^{(n-1)+1}}{\frac{3}{2}}\\ & =\frac{2}{3}\cdot (1-(-\frac{1}{2}{)}^n)\\ & =\frac{2}{3}-\frac{2}{3}{(-\frac{1}{2})}^n\end{array}$

Therefore:

$\sum _{k=0}^{\mathrm{\infty }}\frac{(-1{)}^k}{2^k}={(\frac{2}{3}-\frac{2}{3}{(-\frac{1}{2})}^n)}_{n\in \mathbb{N}}$

Using $\underset{n\to \mathrm{\infty }}{lim}{(-\frac{1}{2})}^n=0$ (geometrical sequence with $q=-\frac{1}{2}$) and the calculation rules for limit values, convergence of the series may be shown:

$\begin{array}{cc}\sum _{k=0}^{\mathrm{\infty }}\frac{(-1{)}^k}{2^k}& =\underset{n\to \mathrm{\infty }}{lim}\sum _{k=0}^{n-1}{(-\frac{1}{2})}^k\\ & =\underset{n\to \mathrm{\infty }}{lim}[\frac{2}{3}-\frac{2}{3}{(-\frac{1}{2})}^n]\\ & =\frac{2}{3}-\frac{2}{3}\cdot 0\\ & =\frac{2}{3}\end{array}$

Sequence of remainders

As we have seen, a series $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ is the same thing as the sequence of its partial sums ${\left(\sum _{k=1}^n{a}_k\right)}_{n\in \mathbb{N}}$ . Let us assume that $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ converges. That means, the limit $\underset{n\to \mathrm{\infty }}{lim}\sum _{k=1}^n{a}_k$ exists and equals the value $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ of the series. Hence, $\underset{n\to \mathrm{\infty }}{lim}(\sum _{k=1}^{\mathrm{\infty }}{a}_k-\sum _{k=1}^n{a}_k)=0$.

Let us consider the difference between the above limit and the partial sums. The difference between the value of the series (the limit) and the $n$-th partial sum is called $n$-th remainder $R_n$. We may also thik of it as the "error" of the $n$-th partial sum approximating the value of the series.

The formal definition of the $n$-th remainder reads:

Definition ($n$-tes Restglied einer Reihe)

Let $\sum _{k=1}^{\mathrm{\infty }}{a}_k$ be a series. Then the $n$-th remainder is given by the following series:

$R_n=\sum _{k=n+1}^{\mathrm{\infty }}{a}_k=a_{n+1}+a_{n+2}+a_{n+3}+\dots$

The remainders will therefore take the following form:

$\begin{array}{c}\begin{array}{cccccccccccc}{S}_1& =& a_1& R_1& =& a_2& +& a_3& +& a_4& +& \dots \\ S_2& =& a_1+a_2& R_2& =& & & a_3& +& a_4& +& \dots \\ S_3& =& a_1+a_2+a_3& R_3& =& & & & & a_4& +& \dots \\ & ⋮& & & ⋮& \\ S_n& =& a_1+a_2+\dots +a_n& R_n& =& a_{n+1}& +& a_{n+2}& +& a_{n+3}& +& \dots \\ & ⋮& & & ⋮& \end{array}\end{array}$

Now, consider the sequence of remainders $(R_n{)}_{n\in \mathbb{N}}$. How do we expect this sequence to behave? We already mentioned above that for convrgent series, the remainders should tend to zero, so $\underset{n\to \mathrm{\infty }}{lim}{R}_n=\underset{n\to \mathrm{\infty }}{lim}(\sum _{k=1}^{\mathrm{\infty }}{a}_k-\sum _{k=1}^n{a}_k)=0$ makes sense. And we will prove that claim in the following theorem:

Theorem (sequence of remainders)

Let $\sum _{k=1}^{\mathrm{\infty }}{a}_k={\left(\sum _{k=1}^n{a}_k\right)}_{n\in \mathbb{N}}=(S_n{)}_{n\in \mathbb{N}}$ be a convergent series. Then, the sequence of remainders $(R_n{)}_{n\in \mathbb{N}}={\left(\sum _{k=n+1}^{\mathrm{\infty }}{a}_k\right)}_{n\in \mathbb{N}}$ will converge towards $0$.

Proof (sequence of remainders)

Since the series converges, the limit $\underset{n\to \mathrm{\infty }}{lim}{S}_n=\underset{n\to \mathrm{\infty }}{lim}\sum _{k=1}^n{a}_k=\sum _{k=1}^{\mathrm{\infty }}{a}_k=S<\mathrm{\infty }$ exists. Now

$\begin{array}{cc}{R}_n& =\sum _{k=n+1}^{\mathrm{\infty }}{a}_k\\ & =\sum _{k=1}^{\mathrm{\infty }}{a}_k-\sum _{k=1}^n{a}_k\\ & =S-S_n\end{array}$

Using the calculation rules for limits, we obtain

$\begin{array}{cc}\underset{n\to \mathrm{\infty }}{lim}{R}_n& =\underset{n\to \mathrm{\infty }}{lim}(S-S_n)\\ & =S-\underset{n\to \mathrm{\infty }}{lim}{S}_n\\ & =S-S\\ & =0\end{array}$

Therefore, $(R_n{)}_{n\in \mathbb{N}}$ is a null sequence.

Hint

Usually, it is not possible to write down an explicit formula for the sequence of remainders $(R_n{)}_{n\in \mathbb{N}}$. However, in many cases one may give estimates or bounds for them. For instance, when considering alternating series $\sum _{k=1}^{\mathrm{\infty }}(-1{)}^{k+1}{b}_k$ in general, the Leibniz-Kriteriums will yield us an "error estimate", i.e. an upper bound to the remainder. Taylor series allow for such error estimates as well.