Definition:Cartesian Product/Countable
Jump to navigation
Jump to search
Definition
Let $\sequence {S_n}_{n \mathop \in \N}$ be an infinite sequence of sets.
The cartesian product of $\sequence {S_n}$ is defined as:
- $\ds \prod_{k \mathop = 1}^\infty S_k = \set {\tuple {x_1, x_2, \ldots, x_n, \ldots}: \forall k \in \N: x_k \in S_k}$
It defines the concept:
- $S_1 \times S_2 \times \cdots \times S_n \times \cdots$
Thus $\ds \prod_{k \mathop = 1}^\infty S_k$ is the set of all infinite sequences $\tuple {x_1, x_2, \ldots, x_n, \ldots}$ with $x_k \in S_k$.
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
- 1960: Paul R. Halmos: Naive Set Theory ... (previous) ... (next): $\S 11$: Numbers
- 1975: Bert Mendelson: Introduction to Topology (3rd ed.) ... (previous) ... (next): Chapter $1$: Theory of Sets: $\S 5$: Products of Sets
- 2000: James R. Munkres: Topology (2nd ed.) ... (previous) ... (next): $1$: Set Theory and Logic: $\S 5$: Cartesian Products
![]() | This page may be the result of a refactoring operation. As such, the following source works, along with any process flow, will need to be reviewed. When this has been completed, the citation of that source work (if it is appropriate that it stay on this page) is to be placed above this message, into the usual chronological ordering. In particular: Technically speaking, this definition was done from the point of view of an indexed family such that the indexing set is countable. If you have access to any of these works, then you are invited to review this list, and make any necessary corrections. 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 {{SourceReview}} from the code. |
- 1971: Robert H. Kasriel: Undergraduate Topology ... (previous) ... (next): $\S 1.15$: Sequences: Definition $15.5$