# Exchange of Order of Summation with Dependency on Both Indices/Infinite Series

Jump to navigation
Jump to search

## Theorem

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

Let $S: \Z \times \Z \to \set {\T, \F}$ be a propositional functions on the Cartesian product of the set of integers with itself.

Let $\ds \sum_{\map R i} x_i$ denote a summation over $R$.

Let the fiber of truth of both $R$ and $S$ be infinite.

Let:

- $\ds \sum_{\map R i} \sum_{\map S {i, j} } \size {a_{i j} }$

exist.

Then:

- $\ds \sum_{\map R i} \sum_{\map S {i, j} } a_{i j} = \sum_{\map {S'} j } \sum_{\map {R'} {i, j} } a_{i j}$

where:

- $\map {S'} j$ denotes the propositional function:
- there exists an $i$ such that both $\map R i$ and $\map S {i, j}$ hold

- $\map {R'} {i, j}$ denotes the propositional function:
- both $\map R i$ and $\map S {i, j}$ hold.

## Proof

This theorem requires a proof.You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{ProofWanted}}` from the code.If you would welcome a second opinion as to whether your work is correct, add a call to `{{Proofread}}` the page. |

## 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