Properties of Sets

Section 6.2 Properties of Sets

Now that we have defined operations on sets such as union and intersection, we can look at various properties of these operations. In the last section we saw that intersection involves an “and” statement, while union involves an “or.” As we work with these properties we will be able to see connections between properties of sets and the logical connectives we saw in Chapter 2.

🔗

One of our goals in this section is to learn how to prove properties such as the following subset relations.

🔗

Subset Relations.

$A \cap B \subseteq A;$ $A \cap B \subseteq B .$
$A \subseteq A \cup B;$ $B \subseteq A \cup B .$
Transitivity.
If $A \subseteq B$ and $B \subseteq C$ then $A \subseteq C .$

🔗

Recall from Definition 6.1.1, we can think of the statement

X \subseteq Y

as the conditional statement, if

x \in X

then

x \in Y .

🔗

Proving Subset.

To prove

X \subseteq Y :

🔗

Assume $x \in X .$
Show $x \in Y .$

🔗

Based in their definitions from Section 6.1, we can translate other sets into logical statements, as well. These translations are how we will prove properites of sets using elements.

🔗

Translating Set Statements to Logical Statements.

$x \in X \cup Y$ if and only if $x \in X$ or $x \in Y$
$x \in X \cap Y$ if and only if $x \in X$ and $x \in Y$
$x \in X - Y$ if and only if $x \in X$ and $x \notin Y$
$x \in X^{C}$ if and only if $x \notin X$
$(x, y) \in X \times Y$ if and only if $x \in X$ and $y \in Y$

🔗

Example 6.2.1. Proving a Subset Property.

Prove

A \cap B \subseteq A .

Proof.

Let

x \in A \cap B .

Then

x \in A

and

x \in B .

Thus,

x \in A .

Therefore,

A \cap B \subseteq A .

Activity 6.2.1.

Prove

A \cap B \subseteq B .

Be sure to write what you want to assume and what you want to show.

🔗

Activity 6.2.2.

Prove

B \subseteq A \cup B .

Be sure to write what you want to assume and what you want to show.

🔗

Activity 6.2.3.

Prove if

A \subseteq B

and

B \subseteq C

then

A \subseteq C .

Be sure to write what you want to assume and what you want to show.

🔗

Proving Set Equality.

To prove

X = Y

show

🔗

$X \subseteq Y,$ ie, show if $x \in X$ then $x \in Y,$ and
$Y \subseteq X,$ ie, show if $x \in Y$ then $x \in X .$

🔗

Example 6.2.2. Proving Two Sets are Equal.

Prove

A \cup (B \cap C) = (A \cup B) \cap (A \cup C) .

Proof.

(\subseteq) :

Let

x \in A \cup (B \cap C) .

Then

x \in A

x \in B \cap C .

Case 1:

x \in A .

Then

x \in A \cup B

by the second subset relation. Similarly,

x \in A \cup C .

Thus,

x \in A \cup B

and

x \in A \cup C .

Therefore,

x \in (A \cup B) \cap (A \cup C) .

Case 2:

x \in B \cap C .

Then

x \in B

and

x \in C .

Then

x \in A \cup B

and

x \in A \cup C

by the second subset relation. Thus,

x \in A \cup B

and

x \in A \cup C .

Therefore,

x \in (A \cup B) \cap (A \cup C) .

(\supseteq) :

Let

x \in (A \cup B) \cap (A \cup C) .

Then

x \in A \cup B

and

x \in A \cup C .

Case 1:

x \in A .

Then

x \in A \cup (B \cap C)

by the second subset relation (since we can do the union with any set).

Case 2:

x \notin A .

Since

x \in A \cup B

by assumption,

x \in A

x \in B .

Since

x \notin A,

x \in B .

Similarly, since

x \in A \cup C,

and

x \notin A,

x \in C .

Thus,

x \in B \cap C .

Therefore,

x \in A \cup (B \cap C)

(again by the second subset relation).

The proofs in Example 6.2.1 and Example 6.2.2 are called element arguments. This type of proof uses elements and the definitions of sets and subsets. You start with

x

being an element of the set of interest, use what you know about the set to then get

x

as an element of another set. This technique generalizes to sets in all different mathematical contexts.

🔗

The next theorem shows that the empty set is a subset of every set.

🔗

Theorem 6.2.3.

For all sets

A,

\emptyset \subseteq A .

🔗

Proof.

By contradiction, assume there exists a set

A

such that

\emptyset ⊈ A .

This means there exists

x \in \emptyset

such that

x \notin A .

But we cannot have

x \in \emptyset .

Hence, we have a contradiction. Therefore,

\emptyset \subseteq A .

There are many times in mathematics that we need to prove that a set is empty. We might need do do this if we need sets to be disjoint, or if we need to prove that there are no elements with a particular property. The common method for proving a set is empty is to use contradiction. Note, usually if we want to prove

A = B,

we show both subsets (

A \subseteq B,

B \subseteq A

), but we just showed

\emptyset \subseteq A,

always. So we just need to show

A \subseteq \emptyset .

We do this by contradiction.

🔗

Proving a Set is Empty.

To show

A = \emptyset :

🔗

Assume $x \in A .$
Reach a contradiction.

🔗

Example 6.2.4. Proving a Set is Empty.

Prove

U^{C} = \emptyset,

where

U

is the universal set.

Proof.

Let

x \in U^{C} .

Then

x \notin U .

But since

U

contains everything,

x \in U,

which is a contradiction. Therefore,

U^{C} = \emptyset .

Activity 6.2.4.

Prove

A \cap A^{C} = \emptyset .

Be sure to write what you want to assume and what you want to show.

🔗

Activity 6.2.5.

Prove if

A \subseteq B

then

A \cup C \subseteq B \cup C .

Note, you need to show

A \cup C \subseteq B \cup C .

So how do you show a subset? What set should you assume

x

is in?

🔗

Summary of Set Identities.

Let

U

be the universal set, and

A, B,

and

C

subsets of the universal set.

🔗

Commutative Laws.
$A \cup B = B \cup A; A \cap B = B \cap A$
Associative Laws.
$(A \cup B) \cup C = A \cup (B \cup C); (A \cap B) \cap C = A \cap (B \cap C)$
Distributive Laws.
$A \cup (B \cap C) = (A \cup B) \cap (A \cup C);$ $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$
Identity Laws.
$A \cup \emptyset = A; A \cap U = A$
Complement Laws.
$A \cup A^{C} = U; A \cap A^{C} = \emptyset$
Double Complement Law.
$(A^{C})^{C} = A$
Idempotent Laws.
$A \cup A = A; A \cap A = A$
Universal Bound Laws.
$A \cup U = U; A \cap \emptyset = \emptyset$
DeMorgan’s Laws.
$(A \cup B)^{C} = A^{C} \cap B^{C}; (A \cap B)^{C} = A^{C} \cup B^{C}$
Absorption Laws.
$A \cup (A \cap B) = A; A \cap (A \cup B) = A$
Complements.
$U^{C} = \emptyset; \emptyset^{C} = U$
Set Difference Law.
$A - B = A \cap B^{C}$

🔗

Reading Questions Check Your Understanding

Let

A, B, C

be sets.

🔗

1.

True or false:

A \cap C = C \cap A .

🔗

True.
False.

🔗

2.

True or false:

A \cap (B \cup C) = (A \cap B) \cup (A \cap C) .

🔗

True.
False.

🔗

3.

True or false:

A \cap (B \cup C) = (A \cap B) \cup C .

🔗

True.
False.

🔗

4.

True or false:

A \cup \emptyset = \emptyset .

🔗

True.
False.

🔗

5.

True or false:

(A \cup B)^{C} = A^{C} \cup B^{C} .

🔗

True.
False.

🔗

6.

True or false:

B - A = A - B .

🔗

True.
False.

🔗

7.

Let

U

be the universal set. True or false:

\emptyset \subseteq U .

🔗

True.
False.

🔗

8.

True or false:

A \subseteq A \cup (B \cap C) .

🔗

True.
False.

🔗

9.

True or false:

B \subseteq A \cup (B \cap C) .

🔗

True.
False.

🔗

Exercises Exercises

1.

Fill in the blanks.

🔗

To say that an element is in $A \cap (B \cup C)$ means that it is in ___ and in ___.
To say that an element is in $(A \cap B) \cup C$ means that it is in ___ or in ___.
To say that an element is in $A - (B \cap C)$ means that it is in ___ and not in ___.