Set Theory

Section 6.1 Set Theory

In this section we review the set theory definitions of element and subset from Section 1.2. Then we introduce several definitions for operations on sets.

🔗

We have been using some of the set notation throughout the course. We review it here for convenience. We usually use capital letters for sets, such as

S

A .

If we want to talk about elements in a set

S,

we use the notation

x \in S .

We read this notation as “

x

is in

S

” or “

x

is an element of

S .

” If

x

is not in

S,

then we use the notation

x \notin S .

🔗

In general, if we use

P (x)

to describe a property of

x,

we use the notation

🔗

{x \in S : P (x)}

🔗

and read the statement as "

x

S

such that

x

has property

P .

🔗

We gave an initial definition of subset in Definition 1.2.2, and introduced the notation for subset:

A \subseteq B .

Now that we will be working with sets more formally, we give a more formal definition of a subset, which will be easier to use in proofs.

🔗

Definition 6.1.1.

A

is a subset of

B,

A \subseteq B,

if for all

x,

x \in A

then

x \in B .

🔗

A

is a not a subset of

B,

A ⊈ B,

if there exists

x,

such that

x \in A

and

x \notin B .

🔗

Definition 6.1.2.

We say two sets are equal,

A = B,

A \subseteq B

and

B \subseteq A .

🔗

Definition 6.1.3.

A

is a proper subset of

B

A \subseteq B

and

A \neq B .

🔗

To important sets are the universal set,

U,

which is the set of everything, and the empty set,

\emptyset,

which is the set with nothing. The universal set depends on the context. For example, in calculus, the universal set is often the set of real numbers. In number theory, it could just be the integers. In computer science, it could be the set of sequences of 0 and 1. When dealing with abstract sets, we might want to define a convenient universal set.

🔗

We now give the element definitions for common set operations, along with the Venn diagrams for each of the sets.

🔗

Definition 6.1.4.

The set

A \cup B

is the union of sets

A

and

B

where

x \in A \cup B

if and only if

x \in A

x \in B .

🔗

In set notation,

A \cup B = {x \in U : x \in A or x \in B} .

🔗

Figure 6.1.5. Venn diagram for $A \cup B$
🔗

Definition 6.1.6.

The set

A \cap B

is the intersection of sets

A

and

B

where

x \in A \cap B

if and only if

x \in A

and

x \in B .

🔗

In set notation,

A \cap B = {x \in U : x \in A and x \in B} .

🔗

Figure 6.1.7. Venn diagram for $A \cap B$
🔗

Definition 6.1.8.

The set

A - B

is the set difference of sets

A

and

B

where

x \in A - B

if and only if

x \in A

and

x \notin B .

🔗

In set notation,

A - B = {x \in U : x \in A and x \notin B} .

🔗

Figure 6.1.9. Venn diagram for $A - B$
🔗

A common alternate notation for set difference is

A ∖ B .

🔗

Definition 6.1.10.

The set

A^{C}

is the complement of set

A

where

x \in A^{C}

if and only if

x \notin A .

🔗

In set notation,

A^{C} = {x \in U : x \notin A} .

🔗

Figure 6.1.11. Venn diagram for $A^{C}$
🔗

Example 6.1.12. Operations on Sets.

Let

A = {x \in R : 0 \leq x \leq 4}

and

B = {x \in R : - 1 < x < 1} .

Note, these sets can also be defined with interval notation:

A = [0, 4], B = (- 1, 1) .

Find

A \cup B .

Answer 1.

(- 1, 4]

Find

A \cap B .

Answer 2.

[0, 1)

Find

A - B .

Answer 3.

[1, 4]

Find

B - A .

Answer 4.

(- 1, 0)

Find

A^{C} .

Answer 5.

(- \infty, 0) \cup (4, \infty)

Activity 6.1.1.

Let

A = {1, 2, 3, 4, 5, 6}

and

B = {2, 4, 6, 8, 10, 12}

and the Universal set

U = {n \in Z : 1 \leq n \leq 12} .

🔗

(a)

Find

A \cup B .

🔗

(b)

Find

A \cap B .

🔗

(c)

Find

A - B .

🔗

(d)

Find

B - A .

🔗

(e)

Find

B^{C} .

🔗

We can take the union or intersection of many sets using notation similar to summation notation:

🔗

⋃_{i = 1}^{n} A_{i} = A_{1} \cup A_{2} \cup \dots \cup A_{n}

⋂_{i = 1}^{n} A_{i} = A_{1} \cap A_{2} \cap \dots \cap A_{n} .

🔗

We can also take the intersection or union of infinitely many sets:

🔗

⋃_{i = 1}^{\infty} A_{i} = A_{1} \cup A_{2} \cup \dots \cup A_{n} \dots

⋂_{i = 1}^{\infty} A_{i} = A_{1} \cap A_{2} \cap \dots \cap A_{n} \dots

🔗

Activity 6.1.2.

Let

A_{i} = {1, 2, 3, \dots i} .

🔗

(a)

Find

A_{1}, A_{2}, A_{5},

and

A_{n} .

🔗

(b)

Find

⋃_{i = 1}^{5} A_{i} .

🔗

(c)

Find

⋂_{i = 1}^{5} A_{i} .

🔗

(d)

Find

⋃_{i = 1}^{\infty} A_{i} .

🔗

(e)

Find

⋂_{i = 1}^{\infty} A_{i} .

🔗

Definition 6.1.13.

The power set of a set

A

is the set of all subsets of

A .

We denote it

P (A)

🔗

Example 6.1.14. Power Set.

Let

A = {1, 2} .

Find

P (A) .

We need to find all the subsets of

{1, 2} .

The subsets are the elements of

P (A) .

The subsets are

\emptyset, {1}, {2}, {1, 2} .

Thus,

P (A) = {\emptyset, {1}, {2}, {1, 2}} .

Activity 6.1.3.

Let

A = {2, 4, 6} .

Find

P (A) .

🔗

Recall, in Definition 1.2.6, we defined the Cartesian product of two sets,

A \times B :

🔗

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

🔗

Example 6.1.15. Cartesian Product of Sets.

Let

A = {1, 2, 3}

and

B = {2, 4} .

Find

A \times B .

Answer.

{(1, 2), (1, 4), (2, 2), (2, 4), (3, 2), (3, 4)}

Definition 6.1.16.

We say two sets

A

and

B

are disjoint if

A \cap B = \emptyset .

🔗

Definition 6.1.17.

A set of subsets of a set

B,

{A_{1}, A_{2}, \dots, A_{n}},

is a partition of

B

🔗

$⋃_{i = 1}^{n} A_{i} = B,$
$A_{i} \cap A_{j} = \emptyset$ whenever $i \neq j .$

🔗

What this really says is that a set of subsets will be a partition of

B

if the union of the subsets is all of

B,

and the subsets are pairwise disjoint, meaning the intersection of any pair of sets is empty.

🔗

Example 6.1.18. Partition.

Let

B = {1, 2, 3, 4, 5, 6} .

Then let

A_{1} = {1}, A_{2} = {2, 4, 6}, A_{3} = {3, 5} .

We can see that

{A_{1}, A_{2}, A_{3}}

is a partition of

B

since

A_{1} \cup A_{2} \cup A_{3} = B

and the subsets have no elements in common, hence they are disjoint.

Now if we let

A_{1} = {1, 2, 3, 4}, A_{2} = {2, 3, 4, 5, 6} .

We can see that

{A_{1}, A_{2}}

is not a partition of

B

since

A_{1} \cap A_{2} = {2, 3, 4} \neq \emptyset .

Activity 6.1.4.

To prove

A \subseteq B,

assume

x \in A,

show

x \in B .

Prove

{6 k : k \in Z} \subseteq {3 k : k \in Z} .

Make sure in your proof you identify what you need to assume and what you need to show.

🔗

Activity 6.1.5.

Find a counterexample to prove

{3 k : k \in Z} ⊈ {6 k : k \in Z} .

🔗

Reading Questions Check Your Understanding

1.

Let

A = {2, 4, 6, 8}, B = {3, 4}, C = {1, 2, 4}, D = {0, 1}

🔗

Match each set with its elements.

🔗

$A \cap C$
${2, 4}$
$B \cap D$
$\emptyset$
$A \cup C$
${1, 2, 4, 6, 8}$
$B \cup D$
${0, 1, 3, 4}$
$A - C$
${6, 8}$
$B - D$
${3, 4}$
$B \times D$
${(3, 0), (3, 1), (4, 0), (4, 1)}$
$B \times B$
${(3, 3), (3, 4), (4, 4), (4, 3)}$

🔗

2.

Let

B = {3, 4}, D = {0, 1} .

🔗

True or false:

B \times D = D \times B .

🔗

True.
False.

🔗

3.

Let

B = {3, 4}, D = {0, 1} .

🔗

True or false:

B - D = D - B .

🔗

True.
False.

🔗

4.

Let

A = {2, 4, 6, 8}, C = {1, 2, 4} .

🔗

True or false:

A \cup C = C \cup A .

🔗

True.
False.

🔗

5.

Let

B = {3, 4} .

Find

P (B) .

🔗

Hint.

The elements of the power set are subsets of

B .

🔗

6.

Let

A = {2, 4, 6, 8} .

Give a partition of

A .

🔗

Hint.

Lots of subsets work, they just need to be disjoint and the union is all of

A .

🔗

Exercises Exercises

1.

For each of the following determine if

A \subseteq B .

Then determine if

B \subseteq A .

🔗

$A = {2, {2}, (\sqrt{2})^{2}}, B = {2, {2}, {{2}}} .$
$A = {{1, 2}, {2, 3}}, B = {1, 2, 3} .$
$A = {a, b, c}, B = {{a}, {b}, {c}} .$
$A = {\sqrt{16}, {4}}, B = {4} .$
$A = {x \in R : \cos x \in Z}, B = {x \in R : \sin x \in Z} .$

🔗

2.

Complete the following sentences without using the symbols

\cup, \cap,

- .

🔗

$x \notin A \cup B$ if and only if ___.
$x \notin A \cap B$ if and only if ___.
$x \notin A - B$ if and only if ___.

🔗

3.

Let

A = {1, 3, 5, 7, 9},

B = {3, 6, 9},

and

C = {2, 4, 6, 8} .

Find each of the following:

🔗

$A \cup B .$
$A \cap B .$
$A \cup C .$
$A \cap C .$
$A - B .$
$B - A .$
$B \cup C .$
$B \cap C .$

🔗

4.

Let the universal set be

R,

and let

A = {x \in R : 0 < x \leq 2},

B = {x \in R : 1 \leq x < 4},

and

C = {x \in R : 3 \leq x < 9} .

Find each of the following:

🔗

$A \cup B$
$A \cap B$
$A^{C}$
$A \cup C$
$A \cap C$
$B^{C}$
$A^{C} \cap B^{C}$
$A^{C} \cup B^{C}$
$(A \cap B)^{C}$
$(A \cup B)^{C}$

🔗

5.

Determine whether each of the following are true or false.

🔗

$Z^{+} \subseteq Q$
$R^{-} \subseteq Q$
$Q \subseteq Z$
$Z^{-} \cup Z^{+} = Z$
$Z^{-} \cap Z^{+} = \emptyset$
$Q \cap R = Q$
$Q \cup Z = Q$
$Z^{+} \cap R = Z^{+}$
$Z \cup Q = Z$

🔗

6.

Let

A = {a, b, c},

B = {b, c, d},

and

C = {b, c, e} .

🔗

Find $A \cup (B \cap C),$ $(A \cup B) \cap C,$ and $(A \cup B) \cap (A \cup C) .$ Which of these sets are equal?
Find $A \cap (B \cup C),$ $(A \cap B) \cup C,$ and $(A \cap B) \cup (A \cap C) .$ Which of these sets are equal?
Find $(A - B) - C$ and $A - (B - C) .$ Are these sets equal?

🔗

7.

Determine if the following statements are true or false. Give a justification for you answer.

🔗

The number 0 is in $\emptyset .$
$\emptyset = {\emptyset}$
$\emptyset \in {\emptyset}$
$\emptyset \in \emptyset$

🔗

8.

Let

A_{i} = {x \in R : - i \leq x \leq i}

(the interval

[- i, i]

) for all nonnegative integers

i .

🔗

Find $⋃_{i = 0}^{4} A_{i} .$
Find $⋂_{i = 0}^{4} A_{i} .$
Are $A_{0}, A_{1}, A_{2} \dots$ pairwise disjoint? Explain.
Find $⋃_{i = 0}^{n} A_{i} .$
Find $⋂_{i = 0}^{n} A_{i} .$
Find $⋃_{i = 1}^{\infty} A_{i} .$
Find $⋂_{i = 1}^{\infty} A_{i} .$

🔗

9.

Determine if the set of sets is a partition of the given set.

🔗

Is ${{a, d, e}, {b, c}, {d, f}}$ a partition of ${a, b, c, d, e, f} ?$
Is ${{w, x, v}, {u, y, q}, {p, z}}$ a partition of ${p, q, u, v, w, x, y, z} ?$
Is ${{5, 4}, {7, 2}, {1, 3, 4}, {6, 8}}$ a partition of ${1, 2, 3, 4, 5, 6, 7, 8} ?$
Is ${{3, 7, 8}, {2, 9}, {1, 4, 5}}$ a partition of ${1, 2, 3, 4, 5, 6, 7, 8, 9} ?$
Is ${{1, 5}, {4, 7}, {2, 8, 6, 3}}$ a partition of ${1, 2, 3, 4, 5, 6, 7, 8} ?$