# Math for Non-Geeks/Absolute convergence of a series

In this article, you may learn about the absolute convergence, which is a stronger property than just convergence. Absolute convergence is able to guarantee that a series keeps the same limit under re-arrangement of elements. So an absolute convergent series has a kind of unique limit, independent of the order of summation. The concept also turns out useful for defining integrals ("=continuous sums") with unique values.

## Motivation

Does the value of a sum depend on the order of the order of elements? For finite sums, the answer is no, as you may have already learned in school. For instance,
$1+2+3+4+5+6+7+8+9+10$
is the same as
$2+9+5+3+10+6+7+4+1+8$
This is a consequence of "commutativity of the sum": there is $a+b=b+a$ for all $a,b\in \mathbb {R}$ . Finitely many commutations of neighbouring elements will not change the value of the sum. However, for infinitely many commutations, it is not clear whether the value of the sum remains invariant. So may the value of the sum depend on the order, here? The answer turns out to be yes! A series like
$a_{1}+a_{2}+a_{3}+a_{4}+\ldots$
might have a different value than its re-arranged version
$a_{42}+a_{9}+a_{1000}+a_{543}+\ldots$
It might even happen that a convergent sum gets divergent under re-arrangement and vice versa. Therefore, it might be useful to have a criterion for when the value of a series does not depend on the order of its elements. And indeed, such a criterion exists:
The limit of a series is invariant under re-arrangement of the elements if and only if the series is absolutely convergent.
The idea is there are sequences which include both positive elements which add up to $\infty$ and negative elements, which add up to $-\infty$. The term $\infty -\infty$ is not defined and the limiting behaviours of such a series may depend on how elements are combined. For instance, consider the series
$1-1+1-1+1-1+1-1+\ldots$
The partial sums of this series jump between 1 and 0, so they do not converge, but stay bounded. However, one may re-arrange the elements such that alternatingly two positive and two negative elements follow each other:
$1+1-1+1+1-1+1+1-1+\ldots$
Since $1+1-1=1$, this series is equivalent to $1+1+1+\ldots =\infty$. Equivalently, by taking "more negative than positive elements", we can reach
$1-1-1+1-1-1+1-1-1+\ldots =-\infty$
How to avoid these ambiguities? It may be a good ansatz to require that the sums of absolutes of all positive and of all negative elements are smaller than infinity. Then, we do not run into the problem of having an ill-defined limit $\infty -\infty$. Having bounded sums of the absolute values is actually what characterizes an absolutely convergent series.

## Definition

Definition (absolute convergence)
A series $\sum _{k=1}^{\infty }a_{k}$ converges absolutely if and only if $\sum _{k=1}^{\infty }|a_{k}|$ converges.
So a series is absolutely convergent, if and only if the series of the absolute values of its elements converges. This forbids the case, where all $a_{k}>0$ or all $a_{k}<0$ sum up to $\infty$ or $-\infty$.
Hint
If $a_{k}\geq 0$ for all $k\in \mathbb {N}$, the we have $|a_{k}|=a_{k}$. In that case, absolute convergence and convergence are identical.

## Absolutely convergent series converge

Absolute convergence is the strongest form of convergence. This sentence can be formulated as a mathematical theorem:
Theorem (Absolute convergence implies convergence.)
every absolutely convergent series converges.
Proof (Absolute convergence implies convergence.)
Let $\sum _{k=1}^{\infty }a_{k}$ be an absolutely convergent series. That means, $\sum _{k=1}^{\infty }|a_{k}|$ has to converge. Let us consider the sequence of partial sums $\sum _{k=1}^{n}a_{k}$. We would like to show that this is a Cauchy sequence. So let $\epsilon >0$ be given. The sequence $\left(\sum _{k=1}^{n}|a_{k}|\right)_{n\in \mathbb {N} }$ converges, so it is a Cauchy sequence (as every convergent sequence is Cauchy). Consequencetly, there is an $N\in \mathbb {N}$, such that for all $m{\text{ and }}n>N{\text{ there is }}\left|\sum _{k=1}^{n}|a_{k}|-\sum _{k=1}^{m}|a_{k}|\right|<\epsilon$. We conclude all summands and assume without loss of generality (w.l.o.g.) that $n>m$.
$\sum _{k=m+1}^{n}|a_{k}|=\left|\sum _{k=m+1}^{n}|a_{k}|\right|=\left|\sum _{k=1}^{n}|a_{k}|-\sum _{k=1}^{m}|a_{k}|\right|<\epsilon$
The partial sums of $\sum _{k=1}^{\infty }a_{k}$ can be bounded from above by this expression: For $n>m>N$, there is
${\begin{aligned}\left|\sum _{k=1}^{n}a_{k}-\sum _{k=1}^{m}a_{k}\right|&=\left|\sum _{k=m+1}^{n}a_{k}\right|\\[0.3em]&{\color {OliveGreen}\left\downarrow {\text{triangle inequality}}\right.}\\[0.3em]&\leq \sum _{k=m+1}^{n}|a_{k}|<\epsilon \end{aligned}}$
So $\left(\sum _{k=1}^{n}a_{k}\right)$ is a (real-valued) Cauchy sequence as well. Now, within the real numbers, all Cauchy sequences converge, so $\sum _{k=1}^{\infty }a_{k}$ converges, as well.
Math for Non-Geeks: Template:Alternativer Beweis
Hint
The proof above implies that for absolutely convergent series $\left|\sum _{k=1}^{\infty }a_{k}\right|\leq \sum _{k=1}^{\infty }|a_{k}|$. So the series of absolute values provides an upper bound for the absolute value of the original series:
${\begin{aligned}\left|\sum _{k=1}^{\infty }a_{k}\right|&=\left|\lim _{n\to \infty }\sum _{k=1}^{n}a_{k}\right|\\[0.3em]&{\color {OliveGreen}\left\downarrow \lim _{n\to \infty }|c_{n}|=\left|\lim _{n\to \infty }c_{n}\right|\right.}\\[0.3em]&=\lim _{n\to \infty }\left|\sum _{k=1}^{n}a_{k}\right|\\[0.3em]&{\color {OliveGreen}\left\downarrow (\forall n:c_{n}\leq d_{n})\implies \lim _{n\to \infty }c_{n}\leq \lim _{n\to \infty }d_{n}\right.}\\[0.3em]&\leq \lim _{n\to \infty }\sum _{k=1}^{n}|a_{k}|\\[0.3em]&=\sum _{k=1}^{\infty }|a_{k}|\end{aligned}}$

## Not all convergent series converge absolutely

Every absolutely convergent series converges. However, the converse does not hold true (otherwise one would not need the notion of an absolutely convergent series). An example for a series which converges, but does not converge absolutely is the alternating harmonic series $\sum _{k=1}^{\infty }(-1)^{k}{\frac {1}{k}}$. Using the Alternating series test, one can prove its convergence. However, the series of absolute values $\sum _{k=1}\left|(-1)^{k}{\frac {1}{k}}\right|=\sum _{k=1}^{\infty }{\frac {1}{k}}$ is just the harmonic series, which is known to diverge. We conclude:
Every absolutely convergent series converges, but there are convergent series, which do not converge absolutely.

## Criteria for absolute convergence

Not every convergent series converge absolutely. Are there conditions under which a convergent series is known to converge absolutely? Indeed, there are! In order to find such a condition, we may ask the question how can a not absolutely convergent series possible converge? we can decompose such a series $\sum _{k=1}^{\infty }a_{k}$ into its positive and negative parts:
$a_{k}^{+}={\begin{cases}a_{k}&a_{k}>0\\0&a_{k}\leq 0\end{cases}}$
and
$a_{k}^{-}={\begin{cases}0&a_{k}\geq 0\\a_{k}&a_{k}<0\end{cases}}$
for instance, for$a_{k}=(-1)^{k+1}{\tfrac {1}{k^{2}}}$, there is
$a_{k}^{+}={\begin{cases}{\frac {1}{k^{2}}}&k{\text{ odd}}\\0&k{\text{ even}}\end{cases}}$
and
$a_{k}^{-}={\begin{cases}0&k{\text{ odd}}\\-{\tfrac {1}{k^{2}}}&k{\text{ even}}\end{cases}}$
We may think of $\left(\sum _{k=1}^{n}a_{k}^{+}\right)_{n\in \mathbb {N} }$ as the "budget of positive values" and of $\left(\sum _{k=1}^{n}a_{k}^{-}\right)_{n\in \mathbb {N} }$ as the "budget of negative values" of the series $\sum _{k=1}^{\infty }a_{k}=\sum _{k=1}^{\infty }(a_{k}^{+}+a_{k}^{-})$. Absolute convergence means that the combined budget $\sum _{k=1}^{\infty }(a_{k}^{+}-a_{k}^{-})$ is finite. For absolutely divergent series, the budget must be infinite. Now, a convergent but not absolutely convergent series combines an infinite budget to a finite limit, by cancelling out infinities within the budget like $\infty -\infty$. We can prevent this by requiring that the "budgets" $\left(\sum _{k=1}^{n}a_{k}^{+}\right)_{n\in \mathbb {N} }$ and $\left(\sum _{k=1}^{n}a_{k}^{-}\right)_{n\in \mathbb {N} }$ of the series are finite:
Theorem (criterion for absolute convergence)
The series $\sum _{k=1}^{\infty }a_{k}$ converges absolutely, if and only if the series $\sum _{k=1}^{\infty }a_{k}^{+}$ and $\sum _{k=1}^{\infty }a_{k}^{-}$ converge. In that case, $\sum _{k=1}^{\infty }a_{k}=\sum _{k=1}^{\infty }a_{k}^{+}+\sum _{k=1}^{\infty }a_{k}^{-}$.
Proof (criterion for absolute convergence)
Proof step: If $\sum _{k=1}^{\infty }a_{k}$ converges absolutely, then also $\sum _{k=1}^{\infty }a_{k}^{+}$ and $\sum _{k=1}^{\infty }a_{k}^{-}$ converge absolutely.
Let $\sum _{k=1}^{\infty }a_{k}$ be absolutely convergent, so $\sum _{k=1}^{\infty }|a_{k}|$ converges. There is $|a_{k}^{+}|\leq |a_{k}|$ and $|a_{k}^{-}|\leq |a_{k}|$. By means of the direct comparison test, the "smaller" series $\sum _{k=1}^{\infty }a_{k}^{+}$ and $\sum _{k=1}^{\infty }a_{k}^{-}$ also have to converge absolutely, so they converge in the usual sense.
Proof step: If $\sum _{k=1}^{\infty }a_{k}^{+}$ and $\sum _{k=1}^{\infty }a_{k}^{-}$ converge, then $\sum _{k=1}^{\infty }a_{k}$ converges absolutely.
Let $\sum _{k=1}^{\infty }a_{k}^{+}$ and $\sum _{k=1}^{\infty }a_{k}^{-}$ be convergent. There is $|a_{k}|=a_{k}^{+}-a_{k}^{-}$, so by the computation rules for series, there is $\sum _{k=1}^{\infty }a_{k}^{+}-\sum _{k=1}^{\infty }a_{k}^{-}=\sum _{k=1}^{\infty }(a_{k}^{+}-a_{k}^{-})=\sum _{k=1}^{\infty }|a_{k}|$, which converges.
Example (absolutely convergent series)
The series $\sum _{k=1}^{\infty }{\tfrac {(-1)^{k+1}}{k^{2}}}$ converges absolutely: we can take the absolute values of the series elements and get the "absolute series" $\sum _{k=1}^{\infty }\left|{\tfrac {(-1)^{k+1}}{k^{2}}}\right|=\sum _{k=1}^{\infty }{\tfrac {1}{k^{2}}}$ . This series converges, as shown in the article Bounded series and convergence. Its limit is $\zeta (2)={\frac {\pi ^{2}}{6}}$.
Now, the criterion above implies that also $\sum _{k=1}^{\infty }a_{k}^{+}=\sum _{k=1}^{\infty }{\tfrac {1}{(2k-1)^{2}}}$ and $\sum _{k=1}^{\infty }a_{k}^{-}=\sum _{k=1}^{\infty }-{\tfrac {1}{(2k)^{2}}}$ must converge. Conversely, if one can show that $\sum _{k=1}^{\infty }{\tfrac {1}{(2k-1)^{2}}}$ and $\sum _{k=1}^{\infty }-{\tfrac {1}{(2k)^{2}}}$ converge, then the criterion implies that $\sum _{k=1}^{\infty }{\tfrac {(-1)^{k+1}}{k^{2}}}$ must converge absolutely.
Question: Do the "budget series" $\sum _{k=1}^{\infty }a_{k}^{+}$ and $\sum _{k=1}^{\infty }a_{k}^{-}$ always converge whenever $\sum _{k=1}^{\infty }a_{k}$ converges in the original sense?
No, because the "budgets" might cancel as $\infty -\infty =c\in \mathbb {R}$. An example is the alternating harmonic series $\sum _{k=1}^{\infty }(-1)^{k+1}{\tfrac {1}{k}}$. This series is convergent. However, the "budget series" $\sum _{k=1}^{\infty }a_{k}^{+}=\sum _{k=1}^{\infty }{\tfrac {1}{2k-1}}$ and $\sum _{k=1}^{\infty }a_{k}^{-}=\sum _{k=1}^{\infty }-{\tfrac {1}{2k}}$ both diverge, as their absolutes make up the divergent harmonic series.

## Re-arrangement of series

In some cases, it might be convenient to re-arrange elements within a series. The important question is now: does the limit stay invariant under any re-arrangement? A mathematician divides series into two sets, depending on what the answer to that question is:

### unconditional convergence

    A series convergences unconditionally, if it has the same limit as any series obtained by re-arrangement of the elements.

### conditional convergence

    A series converges conditionally, if there are re-arrangements, under which have a different limit than the original series.
For real-valued sequences, a series converges unconditionally, if and only if it converges absolutely. The proof will be given in the next article Rearrangement theorem for series. The above notion of conditional and unconditional convergence becomes important for non-real valued series. then, absolute convergence might be not equivalent to unconditional convergence and one needs two different notions to distinguish both situations.