Given that, let's say we want to rearrange the a_i in Σa_i to converge to some arbitrary real number M. Take all the positive a_i in order and call that set A_+ and take all the negative a_i in order and call that set A_-. From [1] we know that both A_+ and A_- have an infinite number of elements.
You then construct a new series like so. Take the fewest elements from A_+ (in the order they appear in the original series) such that their sum is greater than M. Next, add to that sum the fewest number of elements from A_- (also in order) such that this new sum is smaller than M. Go back to taking elements from A_+ until you're just larger M and then back to taking elements from A_- until you're just under M. Repeat this ping-pong maneuver ad infinitum to construct a new series.
You can prove that this new series converges (conditionally) to M.
[1]: Here's a hint. What can we say about Σ|a_i| if we know that Σa_i converges but has only a finite number of negative terms?
That's true, but that's not enough for your proof -- e.g. \sum (-1)^n/n^2 also has infinitely many positive and negative terms, but converges absolutely.
What you need is that sum of all elements in at least one of A_+, A_- (thus also the sum of all elements in the second one) diverges (the order you take the sum in doesn't matter here, as you surely know).
\sum_{i=1}^{\infty} \frac{(-1)^i}{i^2}
is not conditionally convergent, so it is not a counterexample to my original statement. Here I take conditionally convergent to mean "the series converges, but it does not converge absolutely." :)What's more, if Σa_i is conditionally convergent then the sums of both A_+ and A_- diverge. You're right that one has to use this fact in the full proof.
"A series is said to be conditionally convergent iff it is convergent, the series of its positive terms diverges to positive infinity, and the series of its negative terms diverges to negative infinity. […] The Riemann series theorem states that, by a suitable rearrangement of terms, a conditionally convergent series may be made to converge to any desired value, or to diverge. The Riemann series theorem can be proved by first taking just enough positive terms to exceed the desired limit, then taking just enough negative terms to go below the desired limit, and iterating this procedure. Since the terms of the original series tend to zero, the rearranged series converges to the desired limit. A slight variation works to make the new series diverge to positive infinity or to negative infinity."
The correct method is to calculate the partial sum of the first N term: S_N=sum_{n=1}_N (-1)^n. When N is even the amount of 1 and -1 are equal and the partial sum is 0. When N is odd then there is an additional 1 and the partial sum is 1. So the partial sum has no limit and then 1 - 1 + 1 - 1 ... is not convergent.
Conditionally convergent series like 1-1/2+1/3-1/4+1/5-1/6+ ... =ln(2) are much better. (The problem is that 1+1/2+1/3+1/4+1/5+1/6+ ... = infinity.) You can operate with them almost freely, but you can’t rearrange the order of an infinite number of term.
The unconditionally convergent series like 1+1/4+1/9+1/16+...=pi^2/6 are almost like finite summations. You can do whatever sensible operation you want and the result will be correct.
"they [normal rules of algebra] don't even apply to all converging infinite sums"
I know that 1 - 1 + 1... is not convergent, but that's a non-sequitur relative to the claim that you made.
> The unconditionally convergent series like 1+1/4+1/9+1/16+...=pi^2/6 are almost like finite summations. You can do whatever sensible operation you want and the result will be correct.
Yes, that's what I thought.
http://www.amazon.com/Calculus-Vol-One-Variable-Introduction...
Unfortunately, I don't know any online references out of the top of my mind.
Can you point me to a reference?