Algabreic Manipulation of Sigma Notation

[r16]

Even though this question deals mostly with arithmetic and geometic series, this notation is used in linear algebra and differential geomety quite a bit so I will inquire of this matter here.

What are the rules for algabreically dealing with sigma notation. When you change the value of an index from for example $i=0$ becomes $i=1$ how do you adjust the rest of the problem taking that transformation into account. Another question I have is how do you deal with injecting more into and taking quantities out of the sum, (passing through the sigma), and how that effects the rest of the sum. My final big concern is what conditions need to be met to combine / pull apart sums.

Of course any more rules or comments would be greatly appreciated.

Here is an example:
According to http://en.wikipedia.org/wiki/Evaluating_sums for the derivation of a general rule for an geometric series they have this proof:

$$S = \sum_{i=0}^{n} ar^{i}$$
$$S-rS = S(1-r) = \sum_{i=0}^{n} ar^{i} - \sum_{i=0}^{n} ar^{i+1} =<br /> a (\sum_{i=0} ^{n} r^{i} - \sum_{i=1}^{i+1} r^{i}) = a(1-r^{n+1})$$

I get confused when $\sum_{i=0}^{n} ar^{i+1}$ ends up as $\sum_{i=1}^{i+1} r^{i}$. How does $n$ become $i+1$ and $i=0$ becomes $i=1$.

I become futher confused on how the sums disappear into the answer, how the $i$ becomes an $n$.

 

[Hurkyl]

(The following applies to finite sums. Some things will change for infinite sums)


Remember that a sum really is just adding together every element in a given sequence, so all the properties of addition apply: in particular, the distributive, commutative, and associative rules.

As for indexing, when you're adding a bunch of numbers together, it doesn't matter in what order you do it, nor how you label the numbers: as long as the multiset of summands remains unchanged, the sum remains unchanged.

For example, the (n+1) summands in the expression $\sum_{i=0}^n r^{i}$ are exactly the same as the (n+1) summands in the expression $\sum_{i=0}^{n} r^{n - i}$, so the sums must be equal.


(p.s. you've made a typo in your proof of the geometric series formula)

 

[r16]

thx that really helps: breaking it down back into addition. Ill remember that for the future

 

[TenaliRaman]

I have made a small edit to that wiki page now. That should clear things up a bit.

-- AI

 

[r16]

How would things change if the series were an infinite series?

 

[Hurkyl]

When an infinite sum is absolutely convergent, it tends to (always?) behave nicely. But otherwise, the order you do the addition matters: you can get different values by summing terms in different orders.

One example of this is if I'm adding infinitely many 1's and infinitely many (-1)'s.

I could alternate one of each, giving the sum

$$\sum_{n = 0}^{+\infty} (1 + (-1)) = \sum_{n = 0}^{+\infty} 0 = 0$$

Or I could alternate between two 1's followed by a (-1):

$$\sum_{n = 0}^{+\infty} (1 + 1 + (-1)) = \sum_{n = 0}^{+\infty} 1 = +\infty$$

Or, I could add up the 1's, then add up the (-1)'s, and find it doesn't exist:
$$\sum_{n = 0}^{+\infty} 1 + \sum_{n = 0}^{+\infty} (-1) = +\infty + -\infty = \mathrm{D.N.E.}$$


One can get this effect simply by reordering a summation too, without doing the regrouping I did above: see the Riemann series theorem.

 

[r16]

I have made a small edit to that wiki page now. That should clear things up a bit.

-- AI

I had an inkling it was incorrect, i just didnt have the confidence to change it