Power Set¶
Definition¶
The power set of a set , denoted or , is the set of all subsets of :
Interpretation¶
The power set collects every possible choice of elements from , including the empty choice and the full set itself. Its elements are themselves sets: for one writes , but .
The figure shows the eight subsets of : at the bottom, then the three one-element and the three two-element subsets, and at the top. A line joins two subsets that differ by one element. The count comes from deciding for each of the three elements independently whether it is in or out, which also explains the notation .
The same object appears in probability: every event of a die roll is a subset of , so it is an element of , which has elements.
Key Results¶
- If is finite with elements, then has elements.
- Cantor's theorem shows that for any set , the power set has strictly larger cardinality than .
Examples¶
- If , then .
- If , then , so the power set of the empty set has one element.
Prerequisites¶
Related Concepts¶
Sources¶
- Math II: Linear Algebra · Week 1
Aliases: powerset Keywords: set of all subsets Symbols: element of, subset
Last updated: 20 October 2026 03:02
Power SetCantor's TheoremSetSubsetContinuum HypothesisSample SpaceAleph Null