Set

Set Operations

### Subjects to be Learned

- union of sets
- intersection of sets
- difference of sets
- complement of set
- ordered pair, ordered n-tuple
- equality of ordered n-tuples
- Cartesian product of sets

### Contents

Sets can be combined in a number of different ways to produce another set. Here four basic operations are introduced and their properties are discussed.

**Definition (Union):** The **union** of sets *A* and *B*, denoted by
*A*
*B* ,
is the set defined as

*A*
*B*
= { *x* | *x*
*A*
*x*
*B* }

**Example 1:** If *A*
= {*1, 2, 3*}
and
*B*
= {*4, 5*} ,
then
*A*
*B*
= {*1, 2, 3, 4, 5*} .

**Example 2:** If *A*
= {*1, 2, 3*}
and
*B*
= {*1, 2, 4, 5*} ,
then
*A*
*B*
= {*1, 2, 3, 4, 5*} .

Note that elements are not repeated in a set.

**Definition (Intersection):** The **intersection** of sets *A* and *B*, denoted by
*A*
*B* ,
is the set defined as

*A*
*B*
= { *x* | *x*
*A*
*x*
*B* }

**Example 3:** If *A*
= {*1, 2, 3*}
and
*B*
= {*1, 2, 4, 5*} ,
then
*A*
*B*
= {*1, 2*} .

**Example 4:** If *A*
= {*1, 2, 3*}
and
*B*
= {*4, 5*} ,
then
*A*
*B*
=
.

**Definition (Difference):** The **difference** of sets *A*
from *B
*, denoted by
*A*
** - ***B* ,
is the set defined as

*A*
** - ***B*
= { *x* | *x*
*A*
*x*
*B* }

**Example 5:** If *A*
= {*1, 2, 3*}
and
*B*
= {*1, 2, 4, 5*} ,
then
*A*
** - ***B*
= {*3*} .

**Example 6:** If *A*
= {*1, 2, 3*}
and
*B*
= {*4, 5*} ,
then
*A*
** - ***B*
= {*1, 2, 3*} .

Note that in general
*A*
** - ***B*
*B*
** - ***A*

**Definition (Complement):** For a set *A*, the difference
*U*
** - ***A* ,
where *U* is the universe,
is called the **complement** of *A*
and it is denoted by
** .**

Thus ** **
is the set of everything that is not in *A*.

The fourth set operation is the **Cartesian product**
We first define an **ordered pair** and Cartesian product of
two sets using it. Then the Cartesian product of multiple sets is defined using
the concept of *n*-tuple.

**Definition (ordered pair):**

An **ordered pair** is a pair of objects with an order
associated with them. For more rigorous definition of ordered pair
** click here. **

If objects are represented by *x* and *y*, then we write the ordered
pair as **<***x, y*>.

Two ordered pairs **<***a, b*> and **<***c, d*> are
**equal**
if and only if *a* = *c* and *b* = *d*.
For example the ordered pair **<***1, 2*> is not equal to the ordered pair **
<***2, 1*>.

**Definition (Cartesian product):**

The set of all ordered pairs **<***a, b*>, where *a* is an element
of
*A* and *b* is an element of *B*,
is called the **Cartesian product** of *A* and *B*
and is denoted by *A*
*B*.
The concept of Cartesian product can be extended to that of more than two sets.
First we are going to define
the concept of *ordered n-tuple*.

**Definition (ordered n-tuple):**
An **ordered ***n*-tuple is a set of *n*
objects with an order
associated with them (rigorous definition
to be filled in).
If *n* objects are represented by *x*_{1}, *x*_{2},
..., *x*_{n}, then we write the ordered *n*-tuple as
**<***x*_{1}, *x*_{2}, ..., *x*_{n}> .

**Definition (Cartesian product):**
Let *A*_{1}, ..., *A*_{n} be *n* sets.
Then the set of all ordered *n*-tuples
**<***x*_{1}, ..., *x*_{n}> ,
where *x*_{i}
*A*_{i}
for all *i*,
*1*
*i*
*n* ,
is called the **Cartesian product** of
*A*_{1}, ..., *A*_{n}, and is denoted by
*A*_{1}
...
*A*_{n} .

**Definition (equality of ***n*-tuples):
Two ordered *n*-tuples
**<***x*_{1}, ..., *x*_{n}> and
**<***y*_{1}, ..., *y*_{n}>
are **equal** if and only if
*x*_{i} = *y*_{i} for all *i*,
*1*
*i*
*n* .

For example the ordered *3*-tuple **<***1, 2, 3*>
is not equal to the ordered *n*-tuple **<***2, 3, 1*>.

### Test Your Understanding of Set Operations

**
Next -- Properties of Set Operations **

Back to Schedule

Back to Table of Contents