# Set Theory Notation

I am reading Enderton's Set Theorey, in which he showed proof for a theorem: There is no set to which every set belongs. In the proof, he wrote:

Let A be a set; we will construct a set not belonging to A. Let $B=\{x\in A|x\not \in x\}$.

I have no trouble understanding the proof. My question is: Beside the fact that $A$ is a set whose members are $x$, what is $A$?

$A$ is a set of what?

-
What exactly is meant in $B=\{x\in A|x\not \in x\}$ I don't understand how this means that $B$ is not a subset of $A$? Can't we simply write $B = \{x|x \not \in A\}$? – Quixotic Jun 3 '11 at 15:15
@Tretwick: $B$ is a subset of $A$. But $B$ does not belong to $A$ - that is, $B\notin A$. The definition $B=\{x\in A|x\not \in x\}$ is correct. – Zev Chonoles Jun 3 '11 at 15:17
@ Zev Chonoles:Thanks,I was confused with "$x\notin x$".Is this same book the OP is talking about? – Quixotic Jun 3 '11 at 15:29
@Zec Chonoles:B is a subset of A but B does not belong to A..how this is possible? :/ – Quixotic Jun 3 '11 at 15:33
@Tretwick: "$B$ belongs to $A$" is one way of saying $B\in A$. The distinction is between $B\subset A$ or $B\in A$. For example, $1\in\mathbb{R}$, but $1\not\subset\mathbb{R}$; and $\{1\}\notin\mathbb{R}$, but $\{1\}\subset\mathbb{R}$. – Zev Chonoles Jun 3 '11 at 15:38

The idea is that $A$ can be any set. It's like talking about a real number "$a$". What is $a$? Well, it represents a single real number, but we have not specified which one yet; until we do, we can only do things with $a$ that we know we can do with any real number (note that this is different than $a$ being a variable).

So, $A$ is an arbitrary set. The proof works because we have shown that for any chosen set $A$, we can construct a set not belonging to $A$.

In many formulations of set theory (including presumably the one used in Enderton), the only things we can talk about are sets. Everything is a set. That explains the (otherwise odd-looking) expression "$x\notin x$"; we aren't used to sets being denoted by lower-case letters, but actually the elements of $A$ are other sets. The elements of any set are other sets, because sets are the only things we can talk about.

-

I think that the question is less about the notation and more about the philosophy of set theory, and in particular $ZFC$.

When coming to study set theory, you are not given a formal definition of the notion of a set. It might seem a bit circular, but a set is just an element of the universe of set theory.

You can have set theory with atoms, i.e. elements which are not sets, and you can have set theory without atoms, i.e. everything is a set.

What happens is that you understand from the real world, what is a set. It is a collection of things, many times it is a collection of things which you can describe nicely, i.e. there exists some sentence which is true for all the things in your collection, and only for them.

Examples can be "All the apples in this house." to describe a collection of apples, "All the people registered to math.SE whom are taller than 1.77m", to describe a certain collection of users on this website.

In mathematics however, it turns out that just taking arbitrary collections can be problematic, things like "The collection of all collections", and "The collection of all collections which are not in themselves", etc. give rise to some problems when defined formally into the language of set theory (the language which describes the $\in$-relations as "being an element of ...")

The result is that with respect to a certain model of the axioms of (some) set theory, a set is just a collection which happens to be an element of the universe.

For example, in $ZFC$ if there exists an inaccessible cardinal, then there is some $M\in V$, and $M$ is a transitive model of $ZFC$. Now take all the ordinals in $M$ - this is not a set in $M$, as the Burali-Forti paradox proves. However the ordinals in $M$ is a collection which is a set in $V$.

So to answer your question, in the $ZFC$ interpretation of set theory, a set is a collection of sets which is also a set. This is clear when reviewing the von Neumann construction of the universe:

$$V_0 = \emptyset,\quad V_\alpha = \bigcup_{\beta<\alpha} \mathcal P(V_\beta)$$

And the universe is simply "$V_{\mathbf{Ord}}$" where $\mathbf{Ord}$ is the class of all ordinals.

So what is an element in this universe? It appears at some stage $\alpha$ for the first time: If it was the empty set, then it is a set by definition. Otherwise it is a set of things which appeared before - and thus sets.

We have, if so, that every set is either empty, or all its elements are sets.

-

For an arbitrary set $A$, the proof construct a set $B$ such that $B\notin A$, thus there is no set to which every set belongs.

-
This does not answer the question. – Stefan Walter Jun 3 '11 at 15:20