Complete List of Set Identities
Identity Laws
A∪∅=A
A∩U=A
Domination Laws
A∪U=U
A∩∅=∅
Idempotent Laws
A∪A=A
A∩A=A
Complementation Law
A=A
Commutative Laws
A∪B=B∪A
A∩B=B∩A
Associative Laws
(A∪B)∪C=A∪(B∪C)
(A∩B)∩C=A∩(B∩C)
Distributive Laws
A∩(B∪C)=(A∩B)∪(A∩C)
A∪(B∩C)=(A∪B)∩(A∪C)
De Morgan's Laws
A∪B=A∩B
A∩B=A∪B
Absorption Laws
A∪(A∩B)=A
A∩(A∪B)=A
Complement Laws
A∪A=U
A∩A=∅
U=∅
∅=U
Additional Useful Identities
Set Difference
A−B=A∩B
A−(A−B)=A∩B
A−(B∪C)=(A−B)∩(A−C)
A−(B∩C)=(A−B)∪(A−C)
Symmetric Difference
A⊕B=(A∪B)−(A∩B)
A⊕B=(A−B)∪(B−A)
A⊕B=(A∩B)∪(A∩B)
A⊕A=∅
A⊕∅=A
A⊕B=B⊕A
(A⊕B)⊕C=A⊕(B⊕C)
Subset Properties
A⊆B⟺A∩B=A
A⊆B⟺A∪B=B
A⊆B⟺A−B=∅
A⊆B⟺B⊆A
Proving Set Identities
Method 1: Membership Table
Similar to truth tables, use 1 for membership and 0 for non-membership.
Example: Prove A∩(B∪C)=(A∩B)∪(A∩C)
| A | B | C | B∪C | A∩(B∪C) | A∩B | A∩C | (A∩B)∪(A∩C) |
|---|
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Columns 5 and 8 are identical ✓
Method 2: Element Argument
Show both sets contain exactly the same elements.
Example: Prove A∩B=A∪B
Proof:
x∈A∩B
⟺x∈/(A∩B)
⟺¬(x∈A∧x∈B)
⟺x∈/A∨x∈/B (De Morgan’s for logic)
⟺x∈A∨x∈B
⟺x∈A∪B □
Method 3: Chain of Identities
Transform one side to the other using known identities.
Example: Prove A∪(A∩B)=A
Proof:
A∪(A∩B)
=(A∩U)∪(A∩B) (identity law)
=A∩(U∪B) (distributive law)
=A∩U (domination law)
=A (identity law) □
Duality Principle
Every set identity has a dual obtained by:
- Swapping ∪ and ∩
- Swapping ∅ and U
If an identity is true, its dual is also true.
Examples of Duals
| Identity | Dual |
|---|
| A∪∅=A | A∩U=A |
| A∪U=U | A∩∅=∅ |
| A∪(B∩C)=(A∪B)∩(A∪C) | A∩(B∪C)=(A∩B)∪(A∩C) |
| A∪B=A∩B | A∩B=A∪B |
Common Proof Patterns
Showing A⊆B
Let x∈A be arbitrary. Show x∈B.
Showing A=B
- Show A⊆B
- Show B⊆A
Showing A=∅
Assume x∈A and derive a contradiction.
Showing A=B
Find an element in one set but not the other.