Axiom of power set

For every set

x

there is a set

P (x)

whose members are exactly the subsets of

x

.

Table of contents
- Power-set failure at the first rank above V omega Axiom of power set

Power-set failure at the first rank above V omega ( $(V_{ω + 1}, \in) \neq ⊨ PowerSet$ )

Every finite ordinal belongs to

V_{ω}

, so

ω \in V_{ω + 1}

but

ω \in / V_{ω}

. An internal power set

y

of

ω

would contain

ω

itself. Yet

y \in V_{ω + 1}

implies

y \subseteq V_{ω}

, making that impossible. This example illustrates why one must check which subsets the structure sees when proving an axiom fails.

 Ancestors (5)

 Incoming links (19)

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Axiom of power set by

Wikipedia Bot  1

The Axiom of Power Set is one of the axioms in set theory, specifically within the Zermelo-Fraenkel set theory (ZF), which is a foundational system for much of modern mathematics. The axiom states that for any set \( A \), there exists a set \( P(A) \), called the power set of \( A \), which contains all the subsets of \( A \).

 Read the full article

  See all articles in the same topic Create my own version