Laws of Set Operations
What You'll Learn
You'll learn the fundamental algebraic laws—commutative, associative, distributive, and De Morgan's—that let you simplify and manipulate set expressions just like algebraic equations.
Why These Laws Matter
Just as arithmetic has rules (like a + b = b + a), set operations follow predictable patterns. These laws prove that certain set expressions are always equivalent, no matter what sets you substitute in. They're your toolkit for simplifying complex set expressions and proving set identities.
The Core Laws
Commutative Laws
The order doesn't matter:
- Union: A ∪ B = B ∪ A
- Intersection: A ∩ B = B ∩ A
Associative Laws
Grouping doesn't matter when combining three sets:
- (A ∪ B) ∪ C = A ∪ (B ∪ C)
- (A ∩ B) ∩ C = A ∩ (B ∩ C)
Distributive Laws
Operations distribute over each other (like multiplication over addition):
- Union over intersection: A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
- Intersection over union: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
De Morgan's Laws
Complementing a union or intersection flips the operation:
- (A ∪ B)′ = A′ ∩ B′
- (A ∩ B)′ = A′ ∪ B′
Think of it this way: "Not (A or B)" means "not A and not B."
Practical Use
These laws let you rewrite expressions in simpler forms. For example, to simplify (A ∩ B) ∪ (A ∩ C), you can factor out A using the distributive law to get A ∩ (B ∪ C).
Key Takeaway: Set operations obey algebraic-like laws (commutative, associative, distributive, De Morgan's) that enable systematic manipulation and simplification of set expressions, forming the foundation for rigorous reasoning about sets.