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: where y is the power set of x, . In English, this says: Given any set x, there is a set such that, given any set z, this set z is a member of if and only if every element of z is also an element of x. More succinctly: for every set , there is a set consisting precisely of the subsets of . Note the subset relation 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, . By the axiom of extensionality, the set 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. The power set axiom allows a simple definition of the Cartesian product of two sets and : Notice that and, for example, considering a model using the Kuratowski ordered pair, and thus the Cartesian product is a set since One may define the Cartesian product of any finite collection of sets recursively: 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. The power set axiom does not specify what subsets of a set exist, only that there is a set containing all those that do. Not all conceivable subsets are guaranteed to exist. In particular, the power set of an infinite set would contain only "constructible sets" if the universe is the constructible universe but in other models of ZF set theory could contain sets that are not constructible.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (9)

Related courses (2)

Related lectures (19)

Cartesian product

In mathematics, specifically set theory, the Cartesian product of two sets A and B, denoted A × B, is the set of all ordered pairs (a, b) where a is in A and b is in B. In terms of set-builder notation, that is A table can be created by taking the Cartesian product of a set of rows and a set of columns. If the Cartesian product rows × columns is taken, the cells of the table contain ordered pairs of the form (row value, column value).

Axiom of infinity

In axiomatic set theory and the branches of mathematics and philosophy that use it, the axiom of infinity is one of the axioms of Zermelo–Fraenkel set theory. It guarantees the existence of at least one infinite set, namely a set containing the natural numbers. It was first published by Ernst Zermelo as part of his set theory in 1908. In the formal language of the Zermelo–Fraenkel axioms, the axiom reads: In words, there is a set I (the set that is postulated to be infinite), such that the empty set is in I, and such that whenever any x is a member of I, the set formed by taking the union of x with its singleton {x} is also a member of I.

Axiom of pairing

In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of pairing is one of the axioms of Zermelo–Fraenkel set theory. It was introduced by as a special case of his axiom of elementary sets. In the formal language of the Zermelo–Fraenkel axioms, the axiom reads: In words: Given any object A and any object B, there is a set C such that, given any object D, D is a member of C if and only if D is equal to A or D is equal to B.

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a

MATH-101(g): Analysis I

Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles d'une variable.

Sets, Functions and Relations: Constructing Sets CS-101: Advanced information, computation, communication I

Explains constructing sets and determining set cardinality.

Sets, Functions and Relations: Constructing Sets CS-101: Advanced information, computation, communication I

Covers power sets, tuples, Cartesian product, truth sets, and set cardinality with illustrative examples.

Sets: Basics

Covers the basics of sets, including types of numbers and set operations.