Power Set

The power set of a set S, denoted P(S) or 2^S, is the set of all subsets of S. For a finite set with n elements, the power set has 2^n elements — hence the notation. The power set operation is the engine of combinatorial explosion in set theory: applying it repeatedly generates the stages of the von Neumann universe, and the question of whether there are cardinalities between a set and its power set is the Continuum Hypothesis.

The power set operation is not merely a combinatorial device. It is the mechanism by which new mathematical possibilities are generated from old ones. Every subset of S is a selection — a choice of which elements to include and which to exclude — and the power set is the set of all possible selections. The Axiom of Choice is the assertion that such selections can be made systematically, even for infinite collections.

The power set is the simplest operation that generates uncountable complexity from countable simplicity. It is the mathematical equivalent of the phase transition from the finite to the infinite.\n\nCantor's Theorem proves that the power set of any set has strictly greater cardinality than the set itself — the engine that drives the infinite hierarchy of infinities.