Cartesian Products of Sets

Section Cartesian Products of Sets

The final operation on sets that we discuss is the Cartesian product (or cross product). This is an operation that we have seen before. When we draw the graph of a line

y = m x + b

in the plane, we plot the points

(x, m x + b) .

These points are ordered pairs of real numbers. We can extend this idea to any sets.

🔗

Definition 1.5.

🔗

Let

A

and

B

are sets. The Cartesian product of

A

and

B

is the set

A \times B = {(a, b) ∣ a \in A and b \in B} .

🔗

In other words, the Cartesian product of

A

and

B

is the set of ordered pairs

(a, b)

with

a

coming from

A

and

b

coming from

B .

Note that the order is important.

🔗

Activity 1.7.

🔗

(a)

🔗

List all of the elements in

{red, blue} \times {car, truck, van} .

🔗

(b)

🔗

A

has

m

elements and

B

has

n

elements, how many elements does the set

A \times B

have? Explain.

🔗

There is no reason to restrict ourselves to a Cartesian product of just two sets. This is an idea that we have encountered before. The Cartesian product

R \times R

is the standard real plane that we denote as

R^{2}

and the Cartesian product

R \times R \times R

is the three-dimensional real space denoted as

R^{3} .

If we have an indexed collection

{X_{i}}

of sets, with

i

running through the set of positive integers, then we can define the Cartesian product of the sets

X_{i}

as the set of infinite sequences

(x_{1}, x_{2}, \dots, x_{n}, \dots),

where

x_{i} \in X_{i}

for each

i \in Z^{+} .

We denote this cartesian product as

Π_{i \in Z^{+}} X_{i} = Π_{i = 1}^{\infty} X_{i} .

🔗

The capital pi (

Π

) is used to represent a product an an analog of the capital sigma (

Σ

) that is used to represent a sum. We will study sequences in more detail later.

🔗

To conclude this section we summarize some properties of sets. Many of these properties can be extended to arbitrary collections of sets. Most of the proofs are straightforward. The associative and distributive laws are left for Exercise 3.

🔗