Skip to main content
Mathematics LibreTexts

3.5: Cartesian Products of Sets

  • Page ID
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)

    Given a collection of sets, we can form new sets by taking unions, intersections, complements, and set differences. In this section, we introduce a type of “product" of sets. You have already encountered this concept when you learned to plot points in the plane. You also crossed paths with this notion if you have taken a course in linear algebra.

    Definition 3.44. For each \(n\in \mathbb{N}\), we define an \(n\)-tuple to be an ordered list of \(n\) elements of the form \((a_1, a_2,\ldots,a_n)\). We refer to \(a_i\) as the \(i\)th component (or coordinate) of \((a_1, a_2,\ldots,a_n)\). Two \(n\)-tuples \((a_1, a_2,\ldots,a_n)\) and \((b_1, b_2,\ldots,b_n)\) are equal if \(a_i=b_i\) for all \(1\leq i\leq n\). A \(2\)-tuple \((a,b)\) is more commonly referred to as an ordered pair while a \(3\)-tuple \((a,b,c)\) is often called an ordered triple.

    Occasionally, other symbols are used to surround the components of an \(n\)-tuple, such as square brackets “\([\ ]\)" or angle brackets “\(\langle\ \rangle\)". In some programming languages, curly braces “\(\{\ \}\)" are used to specify arrays. However, we avoid this convention in mathematics since curly braces are the standard notation for sets. The term “tuple" can also occur when discussing other mathematical objects, such as vectors.

    We can use the notion of \(n\)-tuples to construct new sets from existing sets.

    Definition 3.45. If \(A\) and \(B\) are sets, the Cartesian product (or direct product) of \(A\) and \(B\), denoted \(A\times B\) (read as “\(A\) times \(B\)" or “\(A\) cross \(B\)"), is the set of all ordered pairs where the first component is from \(A\) and the second component is from \(B\). In set-builder notation, we have \[A\times B := \{(a,b)|a\in A, b\in B\}.\] We similarly define the Cartesian product of \(n\) sets, say \(A_1, \ldots, A_n\), by \[\prod_{i=1}^{n}A_i := A_1 \times \cdots \times A_n := \{a_1, \ldots , a_n \mid a_j\in A_j \mbox{ for all } 1\leq j\leq n\},\] where \(A_i\) is referred to as the \(i\)th factor of the Cartesian product. As a special case, the set \[\underbrace{A\times \cdots \times A}_{n\text{ factors}}\] is often abbreviated as \(A^n\).

    Cartesian products are named after French philosopher and mathematician René Descartes (1596–1650). Cartesian products will play a prominent role in Chapter 7.

    Example 3.46. If \(A=\{a,b,c\}\) and \(B=\{smiley,frownie\}\), then \[A\times B=\{(a,smiley), (a,frownie),(b,smiley),(b,frownie), (c,smiley),(c,frownie)\}.\]

    Example 3.47. The standard two-dimensional plane \(\mathbb{R}^2\) and standard three space \(\mathbb{R}^{3}\) are familiar examples of Cartesian products. In particular, we have \[\mathbb{R}^2=\mathbb{R}\times \mathbb{R}=\{(x,y)\mid x,y\in \mathbb{R}\}\] and \[\mathbb{R}^3=\mathbb{R}\times \mathbb{R}\times \mathbb{R}=\{(x,y,z)\mid x,y,z\in \mathbb{R}\}.\]

    Example 3.48. Consider the sets \(A\) and \(B\) from Example 3.46.

    1. Find \(B\times A\).
    2. Find \(B\times B\).

    Problem 3.49. If \(A\) and \(B\) are sets, why do you think that \(A\times B\) is referred to as a type of “product"? Think about the area model for multiplication of natural numbers.

    Problem 3.50. If \(A\) and \(B\) are both finite sets, then how many elements will \(A\times B\) have?

    Problem 3.51. Let \(A=\{1, 2, 3\}\), \(B=\{1,2\}\), and \(C=\{1,3\}\). Find \(A \times B\times C\).

    Problem 3.52. Let \(X=[0,1]\) and \(Y=\{1\}\). Write each of the following using set-builder notation and then describe the set geometrically (e.g., draw a picture).

    1. \(X\times Y\)
    2. \(Y\times X\)
    3. \(X\times X\)
    4. \(Y\times Y\)

    Problem 3.53. If \(A\) is a set, then what is \(A\times \emptyset\) equal to?

    Problem 3.54. Given sets \(A\) and \(B\), when will \(A\times B\) be equal to \(B\times A\)?

    Problem 3.55. Write \(\mathbb{N}\times \mathbb{R}\) using set-builder notation and then describe this set geometrically by interpreting it as a subset of \(\mathbb{R}^2\).

    We now turn our attention to subsets of Cartesian products.

    Theorem 3.56. Let \(A\), \(B\), \(C\), and \(D\) be sets. If \(A\subseteq C\) and \(B\subseteq D\), then \(A\times B\subseteq C\times D\).

    Problem 3.57. Is it true that if \(A\times B\subseteq C\times D\), then \(A\subseteq C\) and \(B\subseteq D\)? Do not forget to think about cases involving the empty set.

    Problem 3.58. Is every subset of \(C\times D\) of the form \(A\times B\), where \(A\subseteq C\) and \(B\subseteq D\)? If so, prove it. If not, find a counterexample.

    Problem 3.59. If \(A\), \(B\), and \(C\) are nonempty sets, is \(A\times B\) a subset of \(A\times B\times C\)?

    Problem 3.60. Let \(A=[2,5]\), \(B=[3,7]\), \(C=[1,3]\), and \(D=[2,4]\). Compute each of the following.

    1. \((A\cap B)\times (C\cap D)\)
    2. \((A\times C)\cap (B\times D)\)
    3. \((A\cup B)\times (C\cup D)\)
    4. \((A\times C)\cup (B\times D)\)
    5. \(A\times (B\cap C)\)
    6. \((A\times B)\cap (A\times C)\)
    7. \(A\times (B\cup C)\)
    8. \((A\times B)\cup (A\times C)\)

    Problem 3.63. Let \(A\), \(B\), \(C\), and \(D\) be sets. Determine whether each of the following statements is true or false. If a statement is true, prove it. Otherwise, provide a counterexample.

    1. \((A\cap B)\times (C\cap D)=(A\times C)\cap (B\times D)\)
    2. \((A\cup B)\times (C\cup D)=(A\times C)\cup (B\times D)\)
    3. \(A\times (B\cap C)=(A\times B)\cap (A\times C)\)
    4. \(A\times (B\cup C)=(A\times B)\cup (A\times C)\)
    5. \(A\times (B\setminus C) = (A\times B)\setminus (A\times C)\)

    Problem 3.62 If \(A\) and \(B\) are sets, conjecture a way to rewrite \((A\times B)^C\) in a way that involves \(A^C\) and \(B^C\) and then prove your conjecture.

    This page titled 3.5: Cartesian Products of Sets is shared under a CC BY-SA 4.0 license and was authored, remixed, and/or curated by Dana Ernst.

    • Was this article helpful?