In set theory, relationships between sets are fundamental for understanding structure and hierarchy. Three key concepts in this context are:
These concepts are widely used in logic, combinatorics, and computer science.
Two sets are said to be equal if they contain exactly the same elements.
A = B
A = {1, 2, 3}
B = {3, 2, 1}
✔ A = B because:
A set A is a subset of set B if every element of A is also an element of B.
A ⊆ B
A = {1, 2}
B = {1, 2, 3}
✔ A ⊆ B
If A ⊆ B and A ≠ B, then A is a proper subset of B.
A ⊂ B
A = {1, 2}
B = {1, 2, 3}
✔ A ⊂ B
Every set is a subset of itself:
A ⊆ A
Empty set is a subset of every set:
∅ ⊆ A
The power set of a set A is the set of all possible subsets of A.
P(A)
Let:
A = {1, 2}
Subsets of A:
{}{1}{2}{1, 2}Power set:
P(A) = { {}, {1}, {2}, {1, 2} }
Let:
A = {a, b}
P(A) = { {}, {a}, {b}, {a, b} }
If a set has n elements, then:
|P(A)| = 2^n
A = {1, 2, 3}
Number of subsets:
|P(A)| = 2^3 = 8
| Concept | Meaning | Example |
|---|---|---|
| Equal Sets | Same elements | {1,2} = {2,1} |
| Subset | All elements contained | {1} ⊆ {1,2} |
| Power Set | Set of all subsets | P({1,2}) |
2^n)A ⊆ B)2^n