Set TheoryTopic #10 of 40

Set Identities

Commutative, associative, distributive laws, De Morgan's laws for sets, and proving set equality.

Complete List of Set Identities

Identity Laws

A∪∅=AA \cup \emptyset = A A∩U=AA \cap U = A

Domination Laws

A∪U=UA \cup U = U A∩∅=∅A \cap \emptyset = \emptyset

Idempotent Laws

A∪A=AA \cup A = A A∩A=AA \cap A = A

Complementation Law

A‾‾=A\overline{\overline{A}} = A

Commutative Laws

A∪B=B∪AA \cup B = B \cup A A∩B=B∩AA \cap B = B \cap A

Associative Laws

(A∪B)∪C=A∪(B∪C)(A \cup B) \cup C = A \cup (B \cup C) (A∩B)∩C=A∩(B∩C)(A \cap B) \cap C = A \cap (B \cap C)

Distributive Laws

A∩(B∪C)=(A∩B)∪(A∩C)A \cap (B \cup C) = (A \cap B) \cup (A \cap C) A∪(B∩C)=(A∪B)∩(A∪C)A \cup (B \cap C) = (A \cup B) \cap (A \cup C)

De Morgan's Laws

A∪B‾=A‾∩B‾\overline{A \cup B} = \overline{A} \cap \overline{B} A∩B‾=A‾∪B‾\overline{A \cap B} = \overline{A} \cup \overline{B}

Absorption Laws

A∪(A∩B)=AA \cup (A \cap B) = A A∩(A∪B)=AA \cap (A \cup B) = A

Complement Laws

A∪A‾=UA \cup \overline{A} = U A∩A‾=∅A \cap \overline{A} = \emptyset U‾=∅\overline{U} = \emptyset ∅‾=U\overline{\emptyset} = U

Additional Useful Identities

Set Difference

A−B=A∩B‾A - B = A \cap \overline{B} A−(A−B)=A∩BA - (A - B) = A \cap B A−(B∪C)=(A−B)∩(A−C)A - (B \cup C) = (A - B) \cap (A - C) A−(B∩C)=(A−B)∪(A−C)A - (B \cap C) = (A - B) \cup (A - C)

Symmetric Difference

A⊕B=(A∪B)−(A∩B)A \oplus B = (A \cup B) - (A \cap B) A⊕B=(A−B)∪(B−A)A \oplus B = (A - B) \cup (B - A) A⊕B=(A∩B‾)∪(A‾∩B)A \oplus B = (A \cap \overline{B}) \cup (\overline{A} \cap B) A⊕A=∅A \oplus A = \emptyset A⊕∅=AA \oplus \emptyset = A A⊕B=B⊕AA \oplus B = B \oplus A (A⊕B)⊕C=A⊕(B⊕C)(A \oplus B) \oplus C = A \oplus (B \oplus C)

Subset Properties

A⊆B  ⟺  A∩B=AA \subseteq B \iff A \cap B = A A⊆B  ⟺  A∪B=BA \subseteq B \iff A \cup B = B A⊆B  ⟺  A−B=∅A \subseteq B \iff A - B = \emptyset A⊆B  ⟺  B‾⊆A‾A \subseteq B \iff \overline{B} \subseteq \overline{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 \cap (B \cup C) = (A \cap B) \cup (A \cap C)

AABBCCB∪CB \cup CA∩(B∪C)A \cap (B \cup C)A∩BA \cap BA∩CA \cap C(A∩B)∪(A∩C)(A \cap B) \cup (A \cap C)
00000000
00110000
01010000
01110000
10000000
10111011
11011101
11111111

Columns 5 and 8 are identical ✓

Method 2: Element Argument

Show both sets contain exactly the same elements.

Example: Prove A∩B‾=A‾∪B‾\overline{A \cap B} = \overline{A} \cup \overline{B}

Proof: x∈A∩B‾x \in \overline{A \cap B}   ⟺  x∉(A∩B)\iff x \notin (A \cap B)   ⟺  ¬(x∈A∧x∈B)\iff \neg(x \in A \land x \in B)   ⟺  x∉A∨x∉B (De Morgan’s for logic)\iff x \notin A \lor x \notin B \text{ (De Morgan's for logic)}   ⟺  x∈A‾∨x∈B‾\iff x \in \overline{A} \lor x \in \overline{B}   ⟺  x∈A‾∪B‾\iff x \in \overline{A} \cup \overline{B} □\square

Method 3: Chain of Identities

Transform one side to the other using known identities.

Example: Prove A∪(A∩B)=AA \cup (A \cap B) = A

Proof: A∪(A∩B)A \cup (A \cap B) =(A∩U)∪(A∩B) (identity law)= (A \cap U) \cup (A \cap B) \text{ (identity law)} =A∩(U∪B) (distributive law)= A \cap (U \cup B) \text{ (distributive law)} =A∩U (domination law)= A \cap U \text{ (domination law)} =A (identity law)= A \text{ (identity law)} □\square

Duality Principle

Every set identity has a dual obtained by:

  • Swapping ∪\cup and ∩\cap
  • Swapping ∅\emptyset and UU

If an identity is true, its dual is also true.

Examples of Duals

IdentityDual
A∪∅=AA \cup \emptyset = AA∩U=AA \cap U = A
A∪U=UA \cup U = UA∩∅=∅A \cap \emptyset = \emptyset
A∪(B∩C)=(A∪B)∩(A∪C)A \cup (B \cap C) = (A \cup B) \cap (A \cup C)A∩(B∪C)=(A∩B)∪(A∩C)A \cap (B \cup C) = (A \cap B) \cup (A \cap C)
A∪B‾=A‾∩B‾\overline{A \cup B} = \overline{A} \cap \overline{B}A∩B‾=A‾∪B‾\overline{A \cap B} = \overline{A} \cup \overline{B}

Common Proof Patterns

Showing A⊆BA \subseteq B

Let x∈Ax \in A be arbitrary. Show x∈Bx \in B.

Showing A=BA = B

  1. Show A⊆BA \subseteq B
  2. Show B⊆AB \subseteq A

Showing A=∅A = \emptyset

Assume x∈Ax \in A and derive a contradiction.

Showing A≠BA \neq B

Find an element in one set but not the other.