Set Identities

Why This Matters

Set identities are the algebraic backbone of set theory—they're the rules that let you manipulate, simplify, and transform set expressions with confidence. You're being tested not just on whether you can recall that $A \cup B = B \cup A$, but on whether you can apply these identities to simplify complex expressions, construct proofs, and recognize equivalent forms. These identities mirror logical equivalences in propositional logic, which means mastering them here pays dividends across discrete mathematics, computer science, and formal reasoning.

Think of set identities as your toolkit for problem-solving. Each identity captures a fundamental truth about how sets behave under union, intersection, and complementation. On exams, you'll need to chain multiple identities together to prove statements or simplify expressions—so don't just memorize formulas. Know which identity applies in which situation, and understand the underlying principle each one demonstrates.

---

Structural Identities: Order and Grouping Don't Matter

These identities establish that union and intersection are well-behaved operations—you can rearrange and regroup freely without changing results. This flexibility is what makes algebraic manipulation of sets possible.

Commutative Laws

• Order is irrelevant—$A \cup B = B \cup A$ and $A \cap B = B \cap A$ hold for all sets
• Mirrors arithmetic commutativity where $a + b = b + a$, reinforcing the algebraic structure of set operations
• Proof strategy: When simplifying expressions, freely reorder terms to group related sets together

Associative Laws

• Grouping doesn't affect outcome—$(A \cup B) \cup C = A \cup (B \cup C)$ and $(A \cap B) \cap C = A \cap (B \cap C)$
• Parentheses become optional for chains of the same operation, letting you write $A \cup B \cup C$ unambiguously
• Critical for proofs: Allows you to regroup terms strategically when working toward a target expression

Idempotent Laws

• Repetition changes nothing—$A \cup A = A$ and $A \cap A = A$
• Eliminates redundancy in expressions; if you see the same set appearing multiple times, collapse it
• Unique to set operations: Unlike arithmetic (where $a + a = 2a$), sets don't "stack"

---

Identity and Domination: The Extremes

These identities describe how sets interact with the two "extreme" sets: the empty set $\emptyset$ and the universal set $U$. Understanding these boundary cases is essential for simplification and proof construction.

Identity Laws

• Empty set is the union identity—$A \cup \emptyset = A$ because adding nothing changes nothing
• Universal set is the intersection identity—$A \cap U = A$ because intersecting with everything keeps only what's in $A$
• Analogous to arithmetic: $\emptyset$ behaves like 0 in addition; $U$ behaves like 1 in multiplication

Domination Laws

• Universal set dominates union—$A \cup U = U$ because $U$ already contains everything
• Empty set dominates intersection—$A \cap \emptyset = \emptyset$ because there's nothing to intersect with
• Simplification shortcut: Spot these patterns early to collapse complex expressions quickly

---

Distribution and Absorption: Combining Operations

These identities govern how union and intersection interact with each other. They're your primary tools for expanding or factoring set expressions.

Distributive Laws

• Intersection distributes over union—$A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$
• Union distributes over intersection—$A \cup (B \cap C) = (A \cup B) \cap (A \cup C)$
• Key difference from arithmetic: Both directions work for sets, unlike numbers where only multiplication distributes over addition

Absorption Laws

• Union absorbs intersection—$A \cup (A \cap B) = A$ because $A \cap B \subseteq A$
• Intersection absorbs union—$A \cap (A \cup B) = A$ because $A \subseteq A \cup B$
• Simplification power: When you see a set combined with an expression containing itself, absorption likely applies

---

Complement Identities: Negation and Duality

These identities describe how complements behave—the relationship between a set and everything not in it. De Morgan's Laws are particularly high-yield for exams and proofs.

Complement Laws

• Union with complement gives universal set—$A \cup A' = U$ covers all possibilities
• Intersection with complement gives empty set—$A \cap A' = \emptyset$ since nothing is both in and out of $A$
• Foundational for proofs: These establish that $A$ and $A'$ partition the universal set

Double Complement Law

• Complementing twice returns the original—$(A')' = A$
• Negation is reversible: What's outside of "outside $A$" is just $A$ itself
• Proof technique: Use this to eliminate double negations when simplifying complement expressions

De Morgan's Laws

• Complement of union becomes intersection of complements—$(A \cup B)' = A' \cap B'$
• Complement of intersection becomes union of complements—$(A \cap B)' = A' \cup B'$
• Most frequently tested identity: Memorize both directions and practice applying them in chains

---

Quick Reference Table

---

Self-Check Questions

1. Which two identities both allow you to rearrange set expressions, and what's the key difference between them?

2. You encounter the expression $A \cup (A \cap B)$. Which identity simplifies this, and what's the result?

3. Compare and contrast the Identity Laws and Domination Laws: how does each involve $\emptyset$ and $U$, and when does the original set "survive" versus get overwritten?

4. Simplify $(A \cap B)'$ using De Morgan's Laws. Now apply the Double Complement Law to $((A')')$. How do these two types of complement identities serve different purposes?

5. An FRQ asks you to prove that $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$. Which identity is this, and what's the analogous identity with union and intersection swapped?