Skip to main content
Mathematics LibreTexts

11.7: Absolute Convergence

  • Page ID
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    Roughly speaking there are two ways for a series to converge: As in the case of \(\sum 1/n^2\), the individual terms get small very quickly, so that the sum of all of them stays finite, or, as in the case of \( \sum (-1)^{n-1}/n\), the terms do not get small fast enough (\(\sum 1/n\) diverges), but a mixture of positive and negative terms provides enough cancellation to keep the sum finite. You might guess from what we've seen that if the terms get small fast enough to do the job, then whether or not some terms are negative and some positive the series converges.

    Theorem 11.6.1

    If \(\sum_{n=0}^\infty |a_n|\) converges, then \(\sum_{n=0}^\infty a_n\) converges.

    Note that \( 0\le a_n+|a_n|\le 2|a_n|\) so by the comparison test \(\sum_{n=0}^\infty (a_n+|a_n|)\) converges. Now \[ \sum_{n=0}^\infty (a_n+|a_n|) -\sum_{n=0}^\infty |a_n| = \sum_{n=0}^\infty a_n+|a_n|-|a_n| = \sum_{n=0}^\infty a_n \] converges by theorem 11.2.2.


    So given a series \(\sum a_n\) with both positive and negative terms, you should first ask whether \(\sum |a_n|\) converges. This may be an easier question to answer, because we have tests that apply specifically to terms with non-negative terms. If \(\sum |a_n|\) converges then you know that \(\sum a_n\) converges as well. If \(\sum |a_n|\) diverges then it still may be true that \(\sum a_n\) converges---you will have to do more work to decide the question. Another way to think of this result is: it is (potentially) easier for \(\sum a_n\) to converge than for \(\sum |a_n|\) to converge, because the latter series cannot take advantage of cancellation.

    If \(\sum |a_n|\) converges we say that \(\sum a_n\) converges absolutely; to say that \(\sum a_n\) converges absolutely is to say that any cancellation that happens to come along is not really needed, as the terms already get small so fast that convergence is guaranteed by that alone. If \(\sum a_n\) converges but \(\sum |a_n|\) does not, we say that \(\sum a_n\) converges conditionally. For example \(\sum_{n=1}^\infty (-1)^{n-1} {1\over n^2}\) converges absolutely, while \(\sum_{n=1}^\infty (-1)^{n-1} {1\over n}\) converges conditionally.

    Example 11.6.2


    \[\sum_{n=2}^\infty {\sin n\over n^2}\]



    In example 11.5.2 we saw that

    \[\sum_{n=2}^\infty {|\sin n|\over n^2}\]

    converges, so the given series converges absolutely.

    Example 11.6.3

    Does \(\sum_{n=0}^\infty (-1)^{n}{3n+4\over 2n^2+3n+5}\) converge?


    Taking the absolute value,

    \[\sum_{n=0}^\infty {3n+4\over 2n^2+3n+5}\]

    diverges by comparison to

    \[\sum_{n=1}^\infty {3\over 10n},\]

    so if the series converges it does so conditionally. It is true that


    so to apply the alternating series test we need to know whether the terms are decreasing. If we let

    \[ f(x)=(3x+4)/(2x^2+3x+5)\]


    \[ f'(x)=-(6x^2+16x-3)/(2x^2+3x+5)^2,\]

    and it is not hard to see that this is negative for \(x\ge1\), so the series is decreasing and by the alternating series test it converges.


    This page titled 11.7: Absolute Convergence is shared under a CC BY-NC-SA 4.0 license and was authored, remixed, and/or curated by David Guichard via source content that was edited to the style and standards of the LibreTexts platform; a detailed edit history is available upon request.