1.2.5. Properties of Set Operations

The commutative property states that the order of the sets in the operation does not affect the result. For union and intersection:

• A ∪ B = B ∪ A
• A ∩ B = B ∩ A

The commutative property of set operations tells us that when we combine two sets, the order in which we combine them does not matter. If we take the union (the combination) of two sets A and B, whether we say A union B or B union A, we will end up with the same set. The same applies for the intersection (the common elements).

Think of two friends who are mixing their book collections. If Friend A has books {1, 2, 3} and Friend B has books {3, 4, 5}, whether they combine A's collection first with B’s or B's with A's, the final pool of books will be the same: {1, 2, 3, 4, 5}.

The associative property states that the way sets are grouped in the operation does not affect the result. For union and intersection:

• A ∪ (B ∪ C) = (A ∪ B) ∪ C
• A ∩ (B ∩ C) = (A ∩ B) ∩ C

The associative property indicates that when performing operations on more than two sets, the grouping of sets does not change the outcome. For example, if we perform the operation of union on three sets A, B, and C, it does not matter how we group them (whether we first combine B and C, or A and B), the final result will be the same.

Imagine planning three gatherings with different friends: if you group the first two gatherings together and then invite the third friend to this combined gathering, it will be the same as inviting the first friend to the first gathering and then combining that with the gathering of the other two friends later. The total number of friends at the gatherings does not change, just the order of invites.

The distributive property involves two operations on a mixture of sets. For example:

• A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
• A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

The distributive property associates how operations interact with each other within pairs of sets. It tells us how we can distribute one operation over another. For example, if we take the union of set A with the intersection of sets B and C, we can achieve the same result by taking the intersection of set A with both B and C separately and then taking the union of those results.

Think about distributing tasks among students in different groups for a project. If you have students A, B, and C, when assigning a new task that involves collaboration (union) with a specific rule (intersection between two groups), there are multiple ways to agree on who does what without changing the overall responsibility.

De Morgan’s laws express the relationships between intersections and unions through complements:

• (A ∪ B)' = A' ∩ B'
• (A ∩ B)' = A' ∪ B'

De Morgan's laws provide a fundamental way to relate operations on sets using complements. They show how a negation of a union of two sets is equivalent to the intersection of their complements and vice versa. This means that if we want to find all elements not in the union of A and B, it is the same as finding the elements that are not in A and also not in B, leading to an intersection. Similarly for the intersection and union.

Imagine you have a collection of snacks represented by A and B, and you want to know which snacks you don't have in either collection. According to De Morgan's laws, instead of looking at what’s not in A or B together (union), you could look at what is missing in A and in B separately (intersection). This can simplify the search when organizing your snack collection!

--