# The Unapologetic Mathematician

## Commutativity in Series II

We’ve seen that commutativity fails for conditionally convergent series. It turns out, though, that things are much nicer for absolutely convergent series. Any rearrangement of an absolutely convergent series is again absolutely convergent, and to the same limit.

Let $\sum_{k=0}^\infty a_k$ be an absolutely convergent series, and let $p:\mathbb{N}\rightarrow\mathbb{N}$ be a bijection. Define the rearrangement $b_k=a_{p(k)}$.

Now given an $\epsilon>0$, absolute convergence tells us we can pick an $N$ so that any tail of the series of absolute values past that point is small. That is, for any $n\geq N$ we have

$\displaystyle\sum\limits_{k=n+1}^\infty\left|a_k\right|<\frac{\epsilon}{2}$

Now for $0\leq n\leq N$, the function $p^{-1}$ takes only a finite number of values (the inverse function exists because $p$ is a bijection). Let $M$ be the largest such value. Thus if $m>M$ we will know that $p(m)>N$. Then for any such $m$ we have

$\displaystyle\sum\limits_{j=m+1}^{m+d}\left|b_k\right|=\sum\limits_{j=m+1}^{m+d}\left|a_{p(k)}\right|\leq\sum\limits_{k=N+1}^\infty\left|a_k\right|$

and we know that the sum on the right is finite by the assumption of absolute convergence. Thus the tail of the series of $b_j$ — and thus the series itself — must converge. Now a similar argument to the one we used when we talked about associativity for absolutely convergent series shows that the rearranged series has the same sum as the original.

This is well and good, but it still misses something. We can’t handle reorderings that break up the order structure. For example, we might ask to add up all the odd terms, and then all the even terms. There is no bijection $p$ that handles this situation. And yet we can still make it work.

Unfortunately, I arrive in Maryland having left my references back in New Orleans. For now, I’ll simply assert that for absolutely convergent series we can perform these more general rearrangements, though I’ll patch this sometime.

### Like this:

Posted by John Armstrong | Analysis, Calculus

## 3 Comments	»

1. [...] in Series III Okay, here’s the part I promised I’d finish last Friday. How do we deal with rearrangements that “go to infinity” more than once? That is, we [...]

Pingback by | May 12, 2008 | Reply

2. [...] series converges absolutely, we can adjust the order of summations freely. Indeed, we’ve seen examples of other rearrangements that all go through as soon as the convergence is [...]

Pingback by | September 16, 2008 | Reply

3. [...] going to sort of wave my hands here, motivating it by the fact that absolute convergence makes things [...]

Pingback by | September 22, 2008 | Reply

« Previous | Next »

## About this weblog

This is mainly an expository blath, with occasional high-level excursions, humorous observations, rants, and musings. The main-line exposition should be accessible to the “Generally Interested Lay Audience”, as long as you trace the links back towards the basics. Check the sidebar for specific topics (under “Categories”).

I’m in the process of tweaking some aspects of the site to make it easier to refer back to older topics, so try to make the best of it for now.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 17, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9095591306686401, "perplexity_flag": "head"}