Axiom of power set

Concept in axiomatic set theory

This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. Please help to improve this article by introducing more precise citations. (May 2020) (Learn how and when to remove this template message)

|

The elements of the power set of the set {x, y, z} ordered with respect to inclusion.

In mathematics, the axiom of power set is one of the Zermelo–Fraenkel axioms of axiomatic set theory.

In the formal language of the Zermelo–Fraenkel axioms, the axiom reads:

∀ x ∃ y ∀ z [ z ∈ y ⟺ ∀ w ( w ∈ z ⇒ w ∈ x ) ] {\displaystyle \forall x\,\exists y\,\forall z\,[z\in y\iff \forall w\,(w\in z\Rightarrow w\in x)]}

where y is the Power set of x,  P ( x ) {\displaystyle {\mathcal {P}}(x)} .

In English, this says:

Given any set x, there is a set  P ( x ) {\displaystyle {\mathcal {P}}(x)} such that, given any set z, this set z is a member of  P ( x ) {\displaystyle {\mathcal {P}}(x)} if and only if every element of z is also an element of x.

More succinctly: for every set  x {\displaystyle x} , there is a set  P ( x ) {\displaystyle {\mathcal {P}}(x)} consisting precisely of the subsets of  x {\displaystyle x} .

Note the subset relation  ⊆ {\displaystyle \subseteq } is not used in the formal definition as subset is not a primitive relation in formal set theory; rather, subset is defined in terms of set membership,  ∈ {\displaystyle \in } . By the axiom of extensionality, the set  P ( x ) {\displaystyle {\mathcal {P}}(x)} is unique.

The axiom of power set appears in most axiomatizations of set theory. It is generally considered uncontroversial, although constructive set theory prefers a weaker version to resolve concerns about predicativity.

## Consequences[edit]

The Power Set Axiom allows a simple definition of the Cartesian product of two sets  X {\displaystyle X} and  Y {\displaystyle Y} :

X × Y = { ( x , y ) : x ∈ X ∧ y ∈ Y } . {\displaystyle X\times Y=\\{(x,y):x\in X\land y\in Y\\}.}

Notice that

x , y ∈ X ∪ Y {\displaystyle x,y\in X\cup Y}
{ x } , { x , y } ∈ P ( X ∪ Y ) {\displaystyle \\{x\\},\\{x,y\\}\in {\mathcal {P}}(X\cup Y)}

and, for example, considering a model using the Kuratowski ordered pair,

( x , y ) = { { x } , { x , y } } ∈ P ( P ( X ∪ Y ) ) {\displaystyle (x,y)=\\{\\{x\\},\\{x,y\\}\\}\in {\mathcal {P}}({\mathcal {P}}(X\cup Y))}

and thus the Cartesian product is a set since

X × Y ⊆ P ( P ( X ∪ Y ) ) . {\displaystyle X\times Y\subseteq {\mathcal {P}}({\mathcal {P}}(X\cup Y)).}

One may define the Cartesian product of any finite collection of sets recursively:

X 1 × ⋯ × X n = ( X 1 × ⋯ × X n − 1 ) × X n . {\displaystyle X_{1}\times \cdots \times X_{n}=(X_{1}\times \cdots \times X_{n-1})\times X_{n}.}

Note that the existence of the Cartesian product can be proved without using the power set axiom, as in the case of the Kripke–Platek set theory.

## References[edit]

* Paul Halmos, Naive set theory. Princeton, NJ: D. Van Nostrand Company, 1960. Reprinted by Springer-Verlag, New York, 1974. ISBN 0-387-90092-6 (Springer-Verlag edition).
* Jech, Thomas, 2003. Set Theory: The Third Millennium Edition, Revised and Expanded. Springer. ISBN 3-540-44085-2.
* Kunen, Kenneth, 1980. Set Theory: An Introduction to Independence Proofs. Elsevier. ISBN 0-444-86839-9.

This article incorporates material from Axiom of power set on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

* v
* t
* e

Set theory

Overview|

* Set (mathematics)

Axioms|

* Adjunction
* Choice
* countable
* dependent
* global
* Constructibility (V=L)
* Determinacy
* Extensionality
* Infinity
* Limitation of size
* Pairing
* Power set
* Regularity
* Union
* Martin's axiom

* Axiom schema
* replacement
* specification

Operations|

* Cartesian product
* Complement (i.e. set difference)
* De Morgan's laws
* Disjoint union
* Identities
* Intersection
* Power set
* Symmetric difference
* Union

* Concepts
* Methods

* Cardinality
* Cardinal number (large)
* Class
* Constructible universe
* Continuum hypothesis
* Diagonal argument
* Element
* ordered pair
* tuple
* Family
* Forcing
* One-to-one correspondence
* Ordinal number
* Set-builder notation
* Transfinite induction
* Venn diagram

Set types|

* Amorphous
* Countable
* Empty
* Finite (hereditarily)
* Filter
* base
* subbase
* Ultrafilter
* Fuzzy
* Infinite (Dedekind-infinite)
* Recursive
* Singleton
* Subset · Superset
* Transitive
* Uncountable
* Universal

Theories|

* Alternative
* Axiomatic
* Naive
* Cantor's theorem

* Zermelo
* General
* Principia Mathematica
* New Foundations
* Zermelo–Fraenkel
* von Neumann–Bernays–Gödel
* Morse–Kelley
* Kripke–Platek
* Tarski–Grothendieck

* Paradoxes
* Problems

* Russell's paradox
* Suslin's problem
* Burali-Forti paradox

Set theorists|

* Abraham Fraenkel
* Bertrand Russell
* Ernst Zermelo
* Georg Cantor
* John von Neumann
* Kurt Gödel
* Paul Bernays
* Paul Cohen
* Richard Dedekind
* Thomas Jech
* Thoralf Skolem
* Willard Quine

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template