Exchange of Order of Product

Theorem

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

Let $\ds \prod_{\map R i} x_i$ denote a product over $R$.


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


Then:

$\ds \prod_{\map R i} \prod_{\map S j} a_{i j} = \prod_{\map S j} \prod_{\map R i} a_{i j}$


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.



Also known as

The word interchange can often be seen for exchange.


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
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.