Sets and classes

Question

I don't quite understand the difference between sets and classes.

A class consists of sets. Why is not a class a set?

A group itself is a set. A isomorphic class of group is not a set, right?

Could you explain how to distinguish a set from a class.

Answer 1

Working in the set theory ZFC, all reasoning about classes is strictly informal. A class is informally taken to consist of all sets satisfying some condition. For example, the 'universe' is the collection of sets $x$ which satisfy $x=x$. More formally, two formulae $\phi$ and $\psi$ (with one free variable) refer to the same class if $\forall x(\phi(x) \leftrightarrow \psi(x))$, and a set $x$ is a 'member' of the class referred to by $\phi$ if and only if $\phi(x)$ is true. We denote this class by $\{ x\, :\, \phi(x)\}$, so for example $\{ x\, :\, x=x \}$ is the universe, the class of all sets.

All sets are themselves classes, but it's possible for a class not to be a set. Let $V$ denote the class of all sets satisfying $x=x$. If $V$ were a set then by the axiom schema of separation would dictate that $W = \{ x \in V\, :\, x \not \in x \}$ were a set. But then $W \in W \leftrightarrow W \not \in W$, which is obviously nonsense; so the bit where we went wrong must have been to assume that $V$ is a set! This is Russell's paradox.

Some set theories treat classes as formal objects, such as NBG and MK.

Anyway, yes, a group is defined to be a set $G$ with some operation on it, but the class of groups isomorphic to $G$ cannot be a set. To see a simple example, the isomorphism class of the trivial group contains $\{ x \}$ for each set $x$, with the trivial group operation $x \cdot x = x$. The class of all such groups cannot be a set since if it were then it would biject with the universe via $\{x\} \mapsto x$, thus making the universe a set by the axiom schema of replacement (contradicting what we saw above).

Answer 2

In addition to all that has been written here, and before (see links below), let me give you the most informal intuition on this subject.

Consider the natural numbers $\Bbb N$. Each proper initial segment is finite, and in fact represents a particular finite number. But there is no number represented by $\Bbb N$. Why? Because $\Bbb N$ is too large to be a natural number. Natural numbers are finite, but collections of natural numbers don't have to be finite.

In modern set theories such as ZFC, the objects of the universe are sets. And every set has a size, or cardinality. Classes are those collections of sets that do not have a size. Much like $\Bbb N$ is an initial segment which is too big to be finite, classes are collections which are too big to be sets. (One remark is that in some set theories classes are objects and have measurable sizes, but those go beyond the scope of ZFC and naive set theory.)

Some links, where many words have been written:

1. difference between class, set , family and collection
2. Difference between a class and a set
3. What should we call the 'sets' which don't exist under certain set theory axioms?
4. Does $A=\{a|\forall x\in \emptyset\ H(x,a) \}$ make sense?

Answer 3

Naively, every collection of things forms a set. However, Russell's paradox shows that such naive construction lead to contradiction. Thus, there is a need to be more precise. One way of doing it is to say: we can't guarantee no contradictions for all conceivable collections of things, but perhaps we can guarantee that for some smaller collection of collections there are no problems. So, we set out to make a distinction between collections that are ok, and we call them sets, and collections that may not be ok, which we call proper classes. We can't actually prove that for sets there are no problems but we hope it's the case and work under the assumption that a model of sets exists.

Within this model, as long as the entities you are concerned with are sets then you can do all of the standard things we do with sets, and no such construction will lead to a contradiction. If however you deal with some proper classes then the model says "you are on you own here buddy". The model can't guarantee that anything you do with proper classes will be safe. It might, but who knows.

More formally, and to answer your questions, the elements in a class are all sets. But not all classes are themselves sets. A group does have an underlying set. An isomorphism class of a group though is not a set but is a proper class. I hope this helps.

Answer 4

Informally, a class is any collection of objects, potentially one that is "too large" to be called a set. For example, the class of all sets is a class that is not a set, because if we called it a set, then we would introduce paradoxes like Russell's paradox into set theory. Sets are classes, but not all classes are sets.

More formally, in the first-order language of set theory (in ZFC for concreteness), classes are another way of talking about first-order formulas in the metalanguage. That is, if $\phi$ is a first-order formula in the language of set theory, then we get a "class" $$A_\phi=\{x\mid\phi(x)\}.$$ We say that the class $A_\phi$ "is a set" if there exists a set $y$ such that $$\forall x(x\in y \leftrightarrow \phi(x));$$in this case we would write (abusing notation) $y=A$, but this would really just be shorthand for the formula above. Similarly we define expressions like "$y\in A_\phi$" to mean just the formula $\phi(y)$. Thus, working with classes is the same as working with first-order formulas. Moreover, as I mentioned above, every set "is a class." Indeed, if we have a set $x$, then we can define the class $$A=\{y\mid y\in x\}.$$ Then $A=x$ in the sense defined above. The reason that not all classes are sets is that not all first-order formulas in the language of set theory give rise to sets. For example, if $\phi$ is the formula $x=x$, then the class $$V=\{x\mid \phi(x)\}$$ would contain every set. If $V$ were a set, then we would get problems like Russell's paradox.

As Ittay Weiss notes, classes are not actually present in ZFC; they are only used in the metalanguage.