Class (set theory)

Uses your system voice; voice and rate in settings.

Snapshot

≈ 7 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In set theory and its applications throughout mathematics, a class is a collection of mathematical objects (often sets) that can be unambiguously defined by a property that all its members share. Classes act as a way to have set-like collections while differing from sets so as to avoid paradoxes, especially Russell's paradox (see ). The precise definition of "class" depends on foundational context. In work on Zermelo–Fraenkel set theory, the notion of class is informal, whereas other set theories, such as von Neumann–Bernays–Gödel set theory, axiomatize the notion of "proper class", e.g., as entities that are not members of another entity. 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. In Quine's set-theoretical writing, the phrase "ultimate class" is often used instead of the phrase "proper class" emphasising that in the systems he considers, certain classes cannot be members, and are thus the final term in any membership chain to which they belong. Outside set theory, the word "class" is sometimes used synonymously with "set". This usage dates from a historical period when classes and sets were not distinguished as they are in modern set-theoretic terminology.…

In set theory and its applications throughout mathematics, a class is a collection of mathematical objects (often sets) that can be unambiguously defined by a property that all its members share. Classes act as a way to have set-like collections while differing from sets so as to avoid paradoxes, especially Russell's paradox (see ). The precise definition of "class" depends on foundational context. In work on Zermelo–Fraenkel set theory, the notion of class is informal, whereas other set theories, such as von Neumann–Bernays–Gödel set theory, axiomatize the notion of "proper class", e.g., as entities that are not members of another entity. 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. In Quine's set-theoretical writing, the phrase "ultimate class" is often used instead of the phrase "proper class" emphasising that in the systems he considers, certain classes cannot be members, and are thus the final term in any membership chain to which they belong. Outside set theory, the word "class" is sometimes used synonymously with "set". This usage dates from a historical period when 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 rather perhaps take place without considering that certain classes can fail to be sets. ZF set theory does not formalize the notion of classes, so each formula with classes must be reduced syntactically to a formula without classes. For example, one can reduce the formula A = \{x\mid x=x \} to \forall x(x\in A\leftrightarrow x=x) . For a class A and a set variable symbol x , it is necessary to be able to expand each of the formulas x\in A , x=A , A\in x , and A=x into a formula without an occurrence of a class. p. 339 Semantically, in a metalanguage, the classes can be described as equivalence classes of logical formulas: If \mathcal A is a structure interpreting ZF, then the object language "class-builder expression" \{x \mid \phi \} is interpreted in \mathcal A by the collection of all the elements from the domain of \mathcal A on which \phi(x) holds; thus, the class can be described as the set of all predicates equivalent to \phi (which includes \phi itself). In particular, one can identify the "class of all sets" with the set of all predicates equivalent to x=x . Because classes do not have any formal status in the theory of ZF, the axioms of ZF do not immediately apply to classes. However, if an inaccessible cardinal \kappa is assumed, then the sets of smaller rank form a model of ZF (a Grothendieck universe), and its subsets can be thought of as "classes". In ZF, the concept of a function can also be generalised to classes. A class function is not a function in the usual sense, since it is not a set; it is rather a formula \Phi(x,y) with the property that for any set x there is no more than one set y such that the pair (x,y) satisfies \Phi . For example, the class function mapping each set to its powerset may be expressed as the formula y = \mathcal P(x) . The fact that the ordered pair (x,y) satisfies \Phi may be expressed with the shorthand notation \Phi(x)=y . Another approach is taken by the von Neumann–Bernays–Gödel axioms (NBG); classes are the basic objects in this theory, and a set is then defined to be a class that is an element of some other class. However, the class existence axioms of NBG are restricted so that they only quantify over sets, rather than over all classes. This causes NBG to be a conservative extension of ZFC. Morse–Kelley set theory admits proper classes as basic objects, like NBG, but also allows quantification over all proper classes in its class existence axioms. This causes Morse–Kelley set theory to be strictly stronger than both NBG and ZFC. Other set theories, such as New Foundations or the theory of semisets, still give rise to "proper classes" (insofar as they require classes that are not sets), because they do not postulate that all subclasses of a set are themselves sets. For example, any set theory with a universal set must include proper classes that are subclasses of sets.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1330650700 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

3 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.