Class (set theory)

related topics
{math, number, function}
{theory, work, human}
{language, word, form}

In set theory and its applications throughout mathematics, a class is a collection of sets (or sometimes other mathematical objects) which can be unambiguously defined by a property that all its members share. The precise definition of "class" depends on foundational context. In work on ZF set theory, the notion of class is informal, whereas other set theories, such as NBG set theory, axiomatize the notion of "class".

Every set is a class, no matter which foundation is chosen. A class that is not a set (informally in Zermelo–Fraenkel) is called a proper class, and a class that is a set is sometimes called a small class. For instance, the class of all ordinal numbers, and the class of all sets, are proper classes in many formal systems.

Outside set theory, the word "class" is sometimes used synonymously with "set". This usage dates from a historical period where classes and sets were not distinguished as they are in modern set-theoretic terminology. Many discussions of "classes" in the 19th century and earlier are really referring to sets, or perhaps to a more ambiguous concept.



The collection of all algebraic objects of a given type will usually be a proper class. Examples include the class of all groups, the class of all vector spaces, and many others. In category theory, a category whose collection of objects forms a proper class (or whose collection of morphisms forms a proper class) is called a large category.

The surreal numbers are a proper class of objects that has the properties of a field.

Within set theory, many collections of sets turn out to be proper classes. Examples include the class of all sets, the class of all ordinal numbers, and the class of all cardinal numbers.

One way to prove that a class is proper is to place it in bijection with the class of all ordinal numbers. This method is used, for example, in the proof that there is no free complete lattice.


The paradoxes of naive set theory can be explained in terms of the inconsistent assumption that "all classes are sets". With a rigorous foundation, these paradoxes instead suggest proofs that certain classes are proper. For example, Russell's paradox suggests a proof that the class of all sets which do not contain themselves is proper, and the Burali-Forti paradox suggests that the class of all ordinal numbers is proper.

Classes in formal set theories

ZF set theory does not formalize the notion of classes. They can instead be described in the metalanguage, as equivalence classes of logical formulas. For example, if \mathcal A is a structure interpreting ZF, then the metalanguage expression \{x\mid x=x \} is interpreted in \mathcal A by the collection of all the elements from the domain of \mathcal A; that is, all the sets in \mathcal A. So we can identify the "class of all sets" with the predicate x=x or any equivalent predicate.

Full article ▸

related documents
Unitary matrix
Unit interval
Euler's identity
Parse tree
Disjunctive normal form
Elias gamma coding
Linear function
Inverse transform sampling
Earley parser
Discrete probability distribution
Inner automorphism
Regular graph
Urysohn's lemma
Specification language
Profinite group
Irreducible fraction
Algebraic closure
Klein four-group
Just another Perl hacker
Hausdorff maximal principle
Row and column spaces
Identity matrix
Bernoulli's inequality
Additive function
Random sequence
Complete graph