Properties of Power Sets
What you'll learn: You'll discover the essential properties of power sets—how their size relates to the original set, how subsets are ordered by inclusion, and the special role of the empty set.
Core Idea
A power set ℘(A) contains all possible subsets of set A, and this structure reveals beautiful mathematical patterns. Three key properties stand out:
Cardinality Relationship
If set A has n elements, then ℘(A) has exactly 2ⁿ elements. Why? Each element in A faces a binary choice: either it's in a particular subset or it's out. With n independent choices of 2 options each, you get 2 × 2 × ... × 2 (n times) = 2ⁿ total subsets.
Example: If A = {1, 2, 3}, then |A| = 3, so |℘(A)| = 2³ = 8 subsets.
Inclusion Ordering (Partial Order)
The subsets in ℘(A) form a natural hierarchy via the subset relation (⊆). We say X ⊆ Y means "X is included in Y." This creates a partial order: it's reflexive (X ⊆ X), antisymmetric (if X ⊆ Y and Y ⊆ X, then X = Y), and transitive (if X ⊆ Y and Y ⊆ Z, then X ⊆ Z). Not every pair needs to be comparable—think of {1,2} and {2,3} in ℘({1,2,3}): neither contains the other.
The Empty Set as Universal Subset
The empty set ∅ appears in every power set and is a subset of every set in that power set. It's the "bottom" element in the inclusion ordering—the smallest possible subset. Think of it as the baseline: you can always choose to include nothing from the original set.
Key Takeaway: Power sets always have 2ⁿ elements, are naturally ordered by inclusion (forming a partial order), and always contain the empty set as their minimal element.