Basic Operations
Union
The union of A and B contains elements in either set:
A∪B={x∣x∈A∨x∈B}
Example: {1,2,3}∪{3,4,5}={1,2,3,4,5}
Intersection
The intersection of A and B contains elements in both sets:
A∩B={x∣x∈A∧x∈B}
Example: {1,2,3}∩{3,4,5}={3}
Difference (Relative Complement)
The difference A−B contains elements in A but not in B:
A−B=A∖B={x∣x∈A∧x∈/B}
Example: {1,2,3}−{3,4,5}={1,2}
Complement
The complement of A contains all elements not in A (relative to universal set U):
A=Ac=U−A={x∈U∣x∈/A}
Symmetric Difference
The symmetric difference contains elements in exactly one set:
A⊕B=A△B=(A−B)∪(B−A)
=(A∪B)−(A∩B)
Example: {1,2,3}⊕{3,4,5}={1,2,4,5}
Venn Diagrams
Venn diagrams visualize set operations with overlapping circles.
Two Sets
| Region | Description |
|---|
| A∩B | Intersection (overlap) |
| A−B | Only in A |
| B−A | Only in B |
| A∪B | All shaded areas |
| A∪B | Outside both circles |
Generalized Operations
Union of Multiple Sets
⋃i=1nAi=A1∪A2∪⋯∪An
Intersection of Multiple Sets
⋂i=1nAi=A1∩A2∩⋯∩An
Properties of Set Operations
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)
Identity Laws
A∪∅=A
A∩U=A
Complement Laws
A∪A=U
A∩A=∅
A=A
Idempotent Laws
A∪A=A
A∩A=A
Domination Laws
A∪U=U
A∩∅=∅
Absorption Laws
A∪(A∩B)=A
A∩(A∪B)=A
De Morgan's Laws
A∪B=A∩B
A∩B=A∪B
Generalized De Morgan's Laws
⋃i=1nAi=⋂i=1nAi
⋂i=1nAi=⋃i=1nAi
Disjoint Sets
Two sets are disjoint if they have no common elements:
A∩B=∅
A collection of sets is pairwise disjoint if every pair is disjoint:
Ai∩Aj=∅ for all i=j
Cardinality and Set Operations
Inclusion-Exclusion (Two Sets)
∣A∪B∣=∣A∣+∣B∣−∣A∩B∣
Inclusion-Exclusion (Three Sets)
∣A∪B∪C∣=∣A∣+∣B∣+∣C∣−∣A∩B∣−∣A∩C∣−∣B∩C∣+∣A∩B∩C∣
Complement
∣A∣=∣U∣−∣A∣
Difference
∣A−B∣=∣A∣−∣A∩B∣
Proving Set Equality
Method 1: Element Argument
Show A⊆B and B⊆A:
- Take arbitrary x∈A, show x∈B
- Take arbitrary x∈B, show x∈A
Method 2: Set Identities
Transform one side to the other using known identities.
Example
Prove: A−(B∪C)=(A−B)∩(A−C)
Proof:
x∈A−(B∪C)
⟺x∈A∧x∈/(B∪C)
⟺x∈A∧(x∈/B∧x∈/C)
⟺(x∈A∧x∈/B)∧(x∈A∧x∈/C)
⟺x∈(A−B)∧x∈(A−C)
⟺x∈(A−B)∩(A−C) □