Cardinality of Cartesian Product of Finite Sets/General Result

Theorem

Let $\ds \prod_{k \mathop = 1}^n S_k$ be the cartesian product of a (finite) sequence of sets $\sequence {S_n}$.

Then:

$\ds \card {\prod_{k \mathop = 1}^n S_k} = \prod_{k \mathop = 1}^n \card {S_k}$

This can also be written:

$\card {S_1 \times S_2 \times \ldots \times S_n} = \card {S_1} \times \card {S_2} \times \ldots \times \card {S_n}$

Corollary

Let $S$ be a finite set.

Let $S^n$ be a cartesian space on $S$.

Then:

$\card {S^n} = \card S^n$

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.