Axiom of power set
Axiom ensuring every set has a power set.
Wikipedia / Wikimedia Commons
The axiom of power set is part of the Zermelo–Fraenkel axioms for set theory. For any set \(x\), it ensures the existence of a set \(\mathcal{P}(x)\)—called the power set of \(x\)—that contains exactly all the subsets of \(x\). Because of the axiom of extensionality, this \(\mathcal{P}(x)\) is unique. Most standard versions of set theory include this axiom, and it is usually seen as unproblematic, though constructive set theory uses a weaker form to address predicativity concerns.
In the formal language of Zermelo–Fraenkel set theory, the subset relation is not a basic symbol; it is defined using the membership relation \(\in\). The axiom is written as: \(\forall x \, \exists y \, \forall z \, [z \in y \iff \forall w \, (w \in z \Rightarrow w \in x)]\). In plain language: for any set \(x\), there exists a set \(y\) such that any set \(z\) is a member of \(y\) exactly when every element of \(z\) is also an element of \(x\).
One consequence of the power set axiom is that it allows a straightforward definition of the Cartesian product of two sets \(X\) and \(Y\): \(X \times Y = \{(x, y) : x \in X \land y \in Y\}\). Since \(x\) and \(y\) belong to \(X \cup Y\), the singletons \(\{x\}\) and pairs \(\{x, y\}\) are subsets of \(X \cup Y\), so they lie in \(\mathcal{P}(X \cup Y)\). Using the Kuratowski ordered pair, \((x, y) = \{\{x\}, \{x, y\}\}\) is an element of \(\mathcal{P}(\mathcal{P}(X \cup Y))\). Therefore \(X \times Y\) is a subset of \(\mathcal{P}(\mathcal{P}(X \cup Y))\), making it a set. The Cartesian product of any finite collection of sets can then be defined recursively: \(X_1 \times \cdots \times X_n = (X_1 \times \cdots \times X_{n-1}) \times X_n\). (Note that the Cartesian product can be proven to exist without the power set axiom, as in Kripke–Platek set theory.)
The axiom does not specify which subsets of a given set actually exist—it only guarantees a set containing all those that do. Not every conceivable subset is necessarily present. For instance, in the constructible universe, the power set of an infinite set contains only constructible sets. In other models of ZF, the universe may include sets that are not constructible.
- field
- Mathematics
- subfield
- Set theory
- part_of
- Zermelo–Fraenkel axioms
- guarantees
- Existence of power set for every set
- formal_statement
- ∀x ∃y ∀z [z ∈ y ⟺ ∀w (w ∈ z ⇒ w ∈ x)]
Lore & Background
The axiom of power set is a foundational principle in Zermelo–Fraenkel set theory. It asserts that for any set x, there exists a set y (the power set) whose members are exactly the subsets of x. In formal language, the subset relation is defined in terms of set membership, and the axiom is expressed as ∀x ∃y ∀z [z ∈ y ⟺ ∀w (w ∈ z ⇒ w ∈ x)]. This axiom is widely accepted, though constructive set theory adopts a weaker version due to predicativity concerns.
Reader's Guide
The power set axiom is significant because it enables the construction of the Cartesian product of two sets. Using the Kuratowski ordered pair, the Cartesian product X × Y can be shown to be a subset of P(P(X ∪ Y)), thus establishing its existence as a set. The axiom also allows recursive definition of Cartesian products for any finite collection of sets. However, the axiom does not specify which subsets of a set exist; it only guarantees a set containing all those that do. In models such as the constructible universe, the power set of an infinite set contains only constructible sets, while other models of ZF may include non-constructible sets. The axiom's role is foundational, but its limitations highlight the dependence on the underlying model of set theory.
Did You Know?
- The axiom of power set guarantees for every set x the existence of a set P(x) consisting precisely of the subsets of x.
- The subset relation ⊆ is not primitive in formal set theory; it is defined in terms of set membership ∈.
- The Cartesian product X × Y can be defined using the power set axiom, as X × Y ⊆ P(P(X ∪ Y)).
- The power set axiom does not specify what subsets of a set exist; only that there is a set containing all those that do.
Frequently Asked Questions
Who is Axiom of Power Set?
It is one of the foundational axioms in Zermelo–Fraenkel set theory, guaranteeing that every set has a corresponding collection of all its subsets. The axiom of extensionality then pins down that collection as unique, so no ambiguity remains.
What is Axiom of Power Set's role in the ZF universe?
It lets the theory iterate over subsets at every level, so the cumulative hierarchy of sets can keep growing without hitting a wall. Without it, many standard constructions in analysis and algebra simply would not go through.
How does Axiom of Power Set's story end?
Its consequences cascade through Cantor's theorem, which proves each power set is strictly larger than its base set, and together with the axiom of infinity it helps generate the full universe of sets. In constructive set theory, a weaker predicative variant is adopted to sidestep certain logical concerns.
Why is Axiom of Power Set important to fans of set theory?
It is the axiom that makes 'the set of all subsets' a legitimate object you can reason about, underpinning cardinal arithmetic, measure theory, and most of modern analysis. It is included in virtually every standard foundational system and is rarely a source of controversy.
What does Axiom of Power Set actually say in formal notation?
It asserts ∀x ∃y ∀z [z ∈ y ⟺ ∀w (w ∈ z ⇒ w ∈ x)], meaning for every set x there exists a set y whose members are exactly those sets all of whose elements lie in x. Note that the subset relation is not a primitive symbol in ZF; it is defined from the membership relation.
More in Set Theory And Foundations 1-20
Spotted an error? Know more?
This is a living reference — every entry is fact-audited, and reader corrections feed straight into our audit queue. Suggest an edit · See this site's audit record