15.8. Set Identities

Welcome everyone! Today we'll begin with the definition of sets. A set is defined as an unordered collection of distinct objects. Can someone give me an example of a set?

How about the set of numbers 1, 2, and 3?

Exactly! It doesn't matter if we write it as {1, 2, 3} or {3, 2, 1}; they represent the same set. What do you think about empty sets?

The empty set has no elements in it, right?

That's correct! The empty set is denoted by the symbol ϕ. Remember, it's different from a singleton set, which has one element.

Is the empty set the same as the singleton set containing the empty set?

Great question! No, they are different. The empty set ϕ has no elements, while {ϕ} contains one element, which is the empty set itself.

I see, so the presence of the braces makes it a different set.

Exactly! To recap: a set is an unordered collection of unique elements, and the empty set is not the same as the singleton set containing it.

Now let's talk about subsets. A set A is a subset of set B if all elements of A are also in B. Can someone explain the notation?

We write A ⊆ B to indicate that A is a subset of B.

Correct! And what about the cardinality of a set?

It's the number of elements in a set, right?

Yes! We represent it using |S|. If the number of elements is infinite, we say the set is infinite. What’s an example of a finite set?

The set of all even numbers less than 10, like {2, 4, 6, 8}.

Exactly! There are 4 elements, so |S| = 4. Remember that the empty set is a subset of any set, including itself!

That’s helpful! So, an empty set is always a subset?

Yes, that's a key concept. To summarize: if A is a subset of B, then all elements in A must also be in B, and |A| tells us how many elements are in A.

Let’s move on to set operations. Who can tell me about the union of two sets?

The union includes all elements that are in either set, right?

Yes! We denote it as A ∪ B. And what about intersection?

Intersection includes elements common to both sets, written as A ∩ B.

Exactly! Now, if we subtract A from B, what do we get?

That would be A - B, which is the elements in A that aren’t in B.

Perfect! And how do we express the complement of set A?

The complement is written as A', which includes all elements not in A.

Correct! To summarize: union combines elements, intersection finds common elements, difference subtracts, and complement includes everything outside the set.

Now let’s talk about identities in sets. What’s an example of a set identity?

De Morgan's laws!

Right! They show the relationships between union and intersection. Can you state one?

The complement of A ∩ B is the same as A' ∪ B'.

Excellent! How can we prove that two sets are equal?

We show that every element in set A is in set B, and every element in B is in A.

Exactly! This method demonstrates that A equals B if they are subsets of each other. Let's summarize what we learned about identities and proof techniques.