# Translation of Index Variable of Summation

Jump to navigation
Jump to search

## Theorem

Let $R: \Z \to \left\{ {\mathrm T, \mathrm F}\right\}$ be a propositional function on the set of integers.

Let $\displaystyle \sum_{R \left({j}\right)} a_j$ denote a summation over $R$.

Then:

- $\displaystyle \sum_{R \left({j}\right)} a_j = \sum_{R \left({c \mathop + j}\right)} a_{c \mathop + j} = \sum_{R \left({c \mathop - j}\right)} a_{c \mathop - j}$

where $c$ is an integer constant which is not dependent upon $j$.

### Corollary

- $\displaystyle \sum_{j \mathop = m}^n a_j = \sum_{j \mathop = m + c}^{n + c} a_{j - c}$

where $c$ is an integer constant which is not dependent upon $j$.

## Proof

First we consider the case where the fiber of truth of $R$ is finite.

### Infinite case

Now consider the case where the fiber of truth of $R$ is infinite.

## Examples

- $\displaystyle \sum_{1 \mathop \le j \mathop \le n} a_j = \sum_{1 \mathop \le j - 1 \mathop \le n} a_{j - 1} = \sum_{2 \mathop \le j \mathop \le n + 1} a_{j - 1}$

## Also known as

This operation is often referred to as Adjustment of Indices.

Some expositions, when invoking this result, refer to it as an instance of Permutation of Indices of Summation, otherwise known as permutation of the range.

## Sources

- 1997: Donald E. Knuth:
*The Art of Computer Programming: Volume 1: Fundamental Algorithms*(3rd ed.) ... (previous) ... (next): $\S 1.2.3$: Sums and Products