Definition:Cartesian Product/Finite
< Definition:Cartesian Product(Redirected from Definition:Finite Cartesian Product)
Jump to navigation
Jump to search
Definition
Let $\sequence {S_n}$ be a sequence of sets.
The cartesian product of $\sequence {S_n}$ is defined as:
- $\ds \prod_{k \mathop = 1}^n S_k = \set {\tuple {x_1, x_2, \ldots, x_n}: \forall k \in \N^*_n: x_k \in S_k}$
It is also denoted $S_1 \times S_2 \times \cdots \times S_n$.
Thus $S_1 \times S_2 \times \cdots \times S_n$ is the set of all ordered $n$-tuples $\tuple {x_1, x_2, \ldots, x_n}$ with $x_k \in S_k$.
In particular:
- $\ds \prod_{k \mathop = 1}^2 S_k = S_1 \times S_2$
Also known as
The concept $\ds \prod_{k \mathop = 1}^n S_k$ is also seen defined as the direct product of $\sequence {S_n}$.
Some sources use the notation $\huge {\boldsymbol \times}$ instead of $\ds \prod$.
Also see
- Generalized Cartesian products of algebraic structures:
- Results about Cartesian products can be found here.
Source of Name
This entry was named for René Descartes.
Sources
- 1951: Nathan Jacobson: Lectures in Abstract Algebra: Volume $\text { I }$: Basic Concepts ... (previous) ... (next): Introduction $\S 2$: Product sets, mappings
- 1959: E.M. Patterson: Topology (2nd ed.) ... (previous) ... (next): Chapter $\text {II}$: Topological Spaces: $\S 8$. Notations and definitions of set theory
- 1960: Paul R. Halmos: Naive Set Theory ... (previous) ... (next): $\S 11$: Numbers
- 1964: Steven A. Gaal: Point Set Topology ... (previous) ... (next): Introduction to Set Theory: $1$. Elementary Operations on Sets
- 1965: Seth Warner: Modern Algebra ... (previous) ... (next): Chapter $\text {III}$: The Natural Numbers: $\S 18$: Induced $N$-ary Operations
- 1968: Ian D. Macdonald: The Theory of Groups ... (previous) ... (next): Appendix: Elementary set and number theory
- 1971: Allan Clark: Elements of Abstract Algebra ... (previous) ... (next): Chapter $1$: The Notation and Terminology of Set Theory: $\S 9$
- 1972: A.G. Howson: A Handbook of Terms used in Algebra and Analysis ... (previous) ... (next): $\S 2$: Sets and functions: Graphs and functions
- 1975: T.S. Blyth: Set Theory and Abstract Algebra ... (previous) ... (next): $\S 6$. Indexed families; partitions; equivalence relations
- 1975: Bert Mendelson: Introduction to Topology (3rd ed.) ... (previous) ... (next): Chapter $1$: Theory of Sets: $\S 5$: Products of Sets
- 1978: Thomas A. Whitelaw: An Introduction to Abstract Algebra ... (previous) ... (next): $\S 8$: Cartesian product of sets
- 1982: P.M. Cohn: Algebra Volume 1 (2nd ed.) ... (previous) ... (next): Chapter $1$: Sets and mappings: $\S 1.2$: Sets
- 1993: Keith Devlin: The Joy of Sets: Fundamentals of Contemporary Set Theory (2nd ed.) ... (previous) ... (next): $\S 1$: Naive Set Theory: $\S 1.5$: Relations
- 1996: Winfried Just and Martin Weese: Discovering Modern Set Theory. I: The Basics ... (previous) ... (next): Part $1$: Not Entirely Naive Set Theory: Chapter $1$: Pairs, Relations, and Functions
- 2000: James R. Munkres: Topology (2nd ed.) ... (previous) ... (next): $1$: Set Theory and Logic: $\S 5$: Cartesian Products
- 2008: David Joyner: Adventures in Group Theory (2nd ed.) ... (previous) ... (next): Chapter $2$: 'And you do addition?': $\S 2.1$: Functions
- 2012: M. Ben-Ari: Mathematical Logic for Computer Science (3rd ed.) ... (previous) ... (next): Appendix $\text{A}.3$: Definition $\text{A}.17$