Ordered pair

An ordered pair $(x,y)$ is a pair of objects in which there is a first component $x$ and a second component $y$. Two ordered pairs $(u,v)$ and $(x,y)$ are equal if and only if $u=x$ and $v=y$. In general, $(x,y)$ will not be equal to $(y,x)$. The order of the objects in an ordered pair matters.

Cartesian product

The Cartesian product of the sets $X$ and $Y$, denoted as $X\times Y$, is defined as the set of ordered pairs $(x,y)$ where $x$ belongs to $X$ and $y$ belongs to $Y$. In formula form: $$X\times Y = \{(x,y)\mid x\in X\text{ and } y\in Y\}$$ We also denote $X\times X$ as $X^2$.

Examples

If $X=\{1,2\}$ and $Y=\{a,b\}$, then $$\begin{aligned} X\times Y&=\bigl\{(1,a), (1,b), (2,a), (2,b)\bigr\}\\[0.25cm] Y\times X&=\bigl\{(a,1), (a,2), (b,1), (b,2)\bigr\}\\[0.25cm] X\times X&=\bigl\{(1,1), (1,2), (2,1), (2,2)\bigr\}\end{aligned}$$
$\mathbb{R}\times \mathbb{R} = \mathbb{R}^2$

Ordered triple

An ordered triple $(x,y,z)$ is a set of three objects in which there is a first component $x$, a second component $y$, and a third component $z$. Two ordered triples $(u,v,w)$ and $(x,y,z)$ are equal if and only if $u=x$ and $v=y$ and $w=z$. The order of the objects in an ordered triple matters.

Cartesian product

The Cartesian product of the sets $X$, $Y$, and $Z$, denoted as $X\times Y\times Z$, is defined as the set of ordered triples $(x,y,z)$ where $x$ belongs to $X$, $y$ belongs to $Y$, and $z$ belongs to $Z$. In formula form: $$X\times Y\times Z= \{(x,y,z)\mid x\in X\text{ and } y\in Y\text{ and } z\in Z\}$$ We also denote $X\times X\times X$ as $X^3$.

Examples

If $X=\{1,2\}$, $Y=\{a,b\}$, and $Z=\{\alpha,\beta\}$, then $$\begin{aligned} X\times Y\times Z &=\bigl\{(1,a,\alpha), (1,a,\beta),\\ &\phantom{=\bigl\{\;} (1,b,\alpha), (1,b,\beta),\\ &\phantom{=\bigl\{\;} (2,a,\alpha), (2,a,\beta),\\ &\phantom{=\bigl\{\;} (2,b,\alpha), (2,b,\beta)\bigr\}\end{aligned}$$ $\mathbb{R}\times \mathbb{R} \times \mathbb{R}= \mathbb{R}^3$

Ordered $\boldsymbol{n}$-tuple

An ordered $\boldsymbol{n}$-tuple $(x_1,x_2,\ldots x_n)$ can be defined recursively for every natural number $n\ge 1$ as $$\begin{aligned} (x_1,x_2,\ldots x_n) &= \bigl((x_1,x_2,\ldots, x_{n-1}),x_n\bigr)\\ (x) &= x\end{aligned}$$ For every $n\in \mathbb{N}$, $n\ge 1$: $(x_1,x_2,\ldots, x_n)=(y_1,y_2,\ldots, y_n)$ if and only if $x_1=y_1$ and $x_2=y_2$ and $\dots$ and $x_n=y_n$.

We denote the product of $n$ times the same set $X$ as $X^n$.

Examples

$\mathbb{R}^3=(\mathbb{R}\times \mathbb{R})\times\mathbb{R}$

If $X=\{1,2\}$, then with recursion: $$\begin{aligned} X^3 &=X^2\times X\\[0.25cm] &=\bigl\{(1,1),(1,2), (2,1), (2,2)\bigr\}\times\{1,2\}\\[0.25cm] &= \Bigl\{\bigl((1,1),1\bigr),\bigl((1,1),2\bigr),\bigl((1,2),1\bigr)\\[0.25cm] &\phantom{===}\! \bigl((1,2),2\bigr), \bigl((2,1),1\bigr),\bigl((2,1),2\bigr),\\[0.25cm]&\phantom{===} \!\bigl((2,2),1\bigr),\bigl((2,2),2\bigr)\Bigr\}\end{aligned}$$