Axiom of power set

From Exampleproblems

Jump to: navigation, search

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:

\forall A, \exists\; {\mathcal{P}(A)}, \forall B: B \in {\mathcal{P}(A)} \iff (\forall C: C \in B \implies C \in A)

Or in words:

Given any set A, there is a set \mathcal{P}(A) such that, given any set B, B is a member of \mathcal{P}(A) if and only if B is a subset of A.

By the axiom of extensionality this set is unique. We call the set \mathcal{P}(A) the power set of A. Thus the essence of the axiom is:

Every set has a power set.

The axiom of power set is generally considered uncontroversial, and it or an equivalent appears in just about any alternative axiomatisation of set theory.

Consequences

The Power Set Axiom allows the definition of the Cartesian product of two sets X and Y:

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

The Cartesian product is a set since

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 \times \cdots \times X_n = (X_1 \times \cdots \times X_{n-1}) \times X_n.

This article incorporates material from Axiom of power set on PlanetMath, which is licensed under the GFDL.fr:Axiome de l'ensemble des parties it:Assioma dell'insieme potenza sv:Potensmängdsaxiomet

Retrieved from "http://www.exampleproblems.com/wiki/index.php/Axiom_of_power_set"
visitor stats