TheoremBase

The Product of Two Sums over Finite Index Sets is a Sum over the Cartesian Product

Statement

Let KK be a field, let FF and GG be nonempty finite sets, and let a:F→Ka:F\to K and b:G→Kb:G\to K be maps. Let F×GF\times G be the Cartesian product of FF and GG, formed with the ordered pair; it is nonempty, and it is finite by claim 1 of Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets. For p∈F×Gp\in F\times G write p1∈Fp_{1}\in F and p2∈Gp_{2}\in G for the unique elements with p=(p1,p2)p=(p_{1},p_{2}), unique by Characteristic Property of the Ordered Pair. Sums over a finite index set are those of Sum over a Finite Index Set.

Then

(∑x∈Fa(x))(∑y∈Gb(y))=∑p∈F×Ga(p1) b(p2).\Bigl(\sum_{x\in F}a(x)\Bigr)\Bigl(\sum_{y\in G}b(y)\Bigr)=\sum_{p\in F\times G}a(p_{1})\,b(p_{2}).

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…