# Axiom of power set

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 P \, \forall B \, [B \in P \iff \forall C \, (C \in B \Rightarrow C \in A)]$

where P stands for the power set of A, $\mathcal{P}(A)$. In English, this says:

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 every element of B is is also an element of A.

Subset is not used in the formal definition because the subset relation is defined axiomatically; axioms must be independent from each other. By the axiom of extensionality this set is unique, which means that every set has a power set.

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

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

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

Notice that

$x, y \in X \cup Y$
$\{ x \}, \{ x, y \} \in \mathcal{P}(X \cup Y)$
$(x, y) = \{ \{ x \}, \{ x, y \} \} \in \mathcal{P}(\mathcal{P}(X \cup Y))$

and thus 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.$

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

• 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.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 12, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9844887852668762, "perplexity": 296.2858452147163}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2014-23/segments/1405997890181.84/warc/CC-MAIN-20140722025810-00152-ip-10-33-131-23.ec2.internal.warc.gz"}