The Axiom of the Power Set

dmuthuk

Hey everyone,

I am currently trying to learn a bit of set theory from Halmos' book "Naive Set Theory" since I have recently been concerned with the general notion of existence in various fields of mathematics.

Now, I am reading the "axiom of the power set" and I do find it a little troubling because I think that it might be possible to derive the existence of the power set from the axiom of specification (forming subsets), axiom of unions, axiom of pairing, and axiom of extentionality. So, I know have definitely gone wrong somewhere. Can someone help me find a flaw in the following argument:

Let E be a set. Each subset x of E exists by the axiom of specification. Then, each singleton set {x} exists by the axiom of pairing. By the axiom of unions, the union of this collection of singleton sets, each containing a subset of E as its only element, exists as a set. So, this is our desired power set. [QED]

Aside from this, I was wondering if anyone knows how to interpret the primitive relations of "equality" and "set membership" between any two sets. Can we think of these as "relations" on the set of all sets (which does not exist technically)?

Thanks,

Dilip

AKG

How do you know that the collection of singleton sets exists?

dmuthuk

Well, we know by the axiom of pairing that given any two sets x and y, there exists a third set {x,y}. We can always assume these sets are equal, can't we? Then, we can say that given any set x, {x,x} exists which is simply {x}.

dmuthuk

Oh, sorry, I think I misunderstood your question. When I say collection, I am not treating this collection as a set just yet. We can always consider a "collection" of sets, I assume. So, for instance, we have the collection of singleton sets , {x}, {y}, and {z}. The axiom of unions says that the set {x,y,z} exists.

Hurkyl

The union of a collection of sets is merely a collection; you cannot assume it is a set.

This is desired behavior -- the union of the collection of all singleton sets is the collection of all sets. If we could prove that was a set, then we could derive a contradiction via Russel's paradox.

The axiom of union says that the union of a set of sets is a set.

honestrosewater

If you are perched above in some meta-structure, meta-theory, or meta-whatever, sure, the identity and membership relations are relations on your domain (the set or class containing all of the individuals in your structure).

All of your axioms and the rules that you use to prove things from them make up a set theory. And the world of objects that you consider as existing and being related to each other in ways described by your set theory make up a mathematical structure of sets.

Mathematical structures are studied in model theory, and the usual definition of a structure is simply a set (your domain) with some relations and operations on it, relations and operations having their familiar definitions. You can also allow the domain to be a proper class rather than a set, as I have seen done specifically when defining a structure of sets. In that case, some of your relations might also have to be considered proper classes. But I have never bothered to understand the technical reasons for this (it strikes me as superfluous, but what do I know), so I can't help you there.

dmuthuk

Thanks for clarifying this. I didn't realize that the collection of all singleton sets {x} where x is a subset of E, has to be a set in order to apply the axiom of unions. So, I guess I had misunderstood this axiom (i.e. collection=set). Thanks, again.

Hurkyl

Incidentally, I would avoid the word "collection" if I could -- the word set and class are fairly well established. Every set is a class, and a proper class is a class that is not a set.

The word "collection" isn't standardized (as far as I know) -- one has to guess if you are using it to mean set or class. I'm assuming you are using it to mean class. (So I continued with that terminology)

AKG

You define the union of a class x to be the class

[tex]\cup x =_{def} \{y\ :\ (\exists z \in x)(y\in z)\}[/tex]

The union axioms then says [itex](\forall x)(\exists y)(y = \cup x)[/itex]. You're trying to use this axiom by letting x be the collection of singletons, which will make y the power set. But when you see [itex](\forall x)[/itex] in set theory, it means "for all sets x" so you can only apply this axiom when x is a set. The union axioms says that the union of every set exists (and in set theory, to exist means to be a set), not that the union of every class exists. That would be absurd. In particular, it would imply that a universe exists, i.e. there exists a set containing all sets. And you know this to lead to the classical paradoxes of naive set theory.

dmuthuk

I haven't studied "classes" yet, but I assume they are pseudo-sets of a sort that fail to be sets becuase they violate some axiom? For example, is the universal "set" and the "set" of all sets that are not members of themselves classes? And, so the functions and relations that are defined on these classes (which we usually think of as subsets of cartesian products) are now classes as well, I assume.

Hurkyl

A class is indeed formally similar to a set. The simplest description is that a class is something defined by a logical formula. For example, the class of singleton sets:

x in SingletonSet iff there exists a y such that x = {y}.

We usually use the set-builder notation for classes too:

SingletonSet := { x in Set | There exists y such that x = {y} }.

The axiom of replacement works for classes and logical functions, so you can write it in the simpler fashion:

SingletonSet := { {x} | x in Set }.

But note that we cannot carry out Russell's paradox: we can form the class

Russell := { x in Set | x is not in x },

but all we can prove is that Russell is not a set, and thus must be a proper class.

dmuthuk

Hey, I had a thought. We have established that it doesn't make sense to take the union of a "collection" of sets unless we can be sure that such a collection defines a set. But, is it possible to use the axiom of pairing to somehow turn this collection into a set? I know it's not possible since otherwise we wouldn't have the power set axiom, but why so? For instance, can we somehow generalize the pairing scheme to an arbitrary collection of sets rather than just two. For instance, if we had the singletons {x}, {y} and {z}, can we argue that {{x},{y},{z}} exists?

Now, surely, if we were only interested in singleton sets to begin with, then we wouldn't need the power set axiom to argue that the power sets of singleton sets exist. We can just use the axiom of pairing since singleton sets like {x} have only two subsets, x, and the empty set, and so we can just pair them up into a set using the axiom of pairing. So, why can't we generalize the pairing axiom?

Hurkyl

Yes:
{x} is a set
{y} is a set
{{x}, {y}} is a set
{z} is a set
{{z}} is a set
{ {{x}, {y}}, {{z}} }
{ {x}, {y}, {z} }

You can extend this to any finite number of singletons, but you need more to move onto infinite sets.


Here's a quick fact that might convince you of the necessity of something like the power set axiom it: once you start dealing with infinite sets, the axiom of the power set is the only way to make "bigger" sets. Without it, there is no way to prove the existence of an uncountable set. e.g. the union of countably many countable sets is countable.

honestrosewater

Adding a tiny bit to what Hurkyl said, a nice thing about sets is that you can think of a set as a single object. Some classes are not so nice, so to avoid problems, you start out assuming that every "collection" is a class and is not nice enough to be a set until you can prove that is it. See what Wikipedia has to say about limitation of size. They list a book about it too.

dmuthuk

Hi, thanks guys. So, I guess the power set axiom is not needed for any finite set.

honestrosewater

Well, stepping back from a specific axiomatization of set theory for a second, there are 3 ways to define a set (or class) (haha, I've said this exact thing before here, so I'll just copy+paste):

1) Extension -- name all members of S.
2) Intension -- name a definite property that all members of S have.
3) Induction/Recursion

a) basis clause -- name at least one member of S.
b) induction clause -- give rule(s) to get more members from those in (a) -- if x is in S, then x' is in S.
c) extremal clause -- says that nothing else is in S.

If the set is finite, you can simply list its members. I imagine you don't need very liberal axioms to allow that. Maybe it would be a useful exercise to look at each axiom and identify which method it uses. For example, the Axiom of Pairing uses (1).

Oh, I should probably try to head off any confusion or complaints by noting that a proof is usually defined to be finite in length.

Also, (1) will only give you a finite set, if that wasn't clear. (If you can furthermore only invoke a (1)-type axiom a finite number of times, as is the case for finite-length proofs, can you ever prove the existence of any infinite set that way (assuming you didn't already have one)?)

matt grime

There isn't a way to prove there are uncountable sets with it either. This is Skolem's paradox - the are countable models for ZF. It's only when you give a model and state what the power set is that you get uncountable sets. At least that is my lax understanding of Skolem.