Class (set theory)

Collection of sets in mathematics that can be defined based on a property of its members

In set theory and its applications throughout mathematics, a class is a collection of sets (or sometimes other mathematical objects) 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 § Paradoxes). 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 where classes and sets were not distinguished as they are in modern set-theoretic terminology.[1] 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.[non-primary source needed]

## Examples

[edit]

The collection of all algebraic structures 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 have 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 universal class), 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 on three or more generators.

## Paradoxes

[edit]

The paradoxes of naive set theory can be explained in terms of the inconsistent tacit assumption that "all classes are sets". With a rigorous foundation, these paradoxes instead suggest proofs that certain classes are proper (i.e., that they are not sets). 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. The paradoxes do not arise with classes because there is no notion of classes containing classes. Otherwise, one could, for example, define a class of all classes that do not contain themselves, which would lead to a Russell paradox for classes. A conglomerate, on the other hand, can have proper classes as members.[2]

## Classes in formal set theories

[edit]

ZF set theory does not formalize the notion of classes, so each formula with classes must be reduced syntactically to a formula without classes.[3] For example, one can reduce the formula  A = { x ∣ x = x } {\displaystyle A=\\{x\mid x=x\\}} to  ∀ x ( x ∈ A ↔ x = x ) {\displaystyle \forall x(x\in A\leftrightarrow x=x)} . For a class  A {\displaystyle A} and a set variable symbol  x {\displaystyle x} , it is necessary to be able to expand each of the formulas  x ∈ A {\displaystyle x\in A} ,  x = A {\displaystyle x=A} ,  A ∈ x {\displaystyle A\in x} , and  A = x {\displaystyle A=x} into a formula without an occurrence of a class.[4]p. 339

Semantically, in a metalanguage, the classes can be described as equivalence classes of logical formulas: If  A {\displaystyle {\mathcal {A}}} is a structure interpreting ZF, then the object language "class-builder expression"  { x ∣ ϕ } {\displaystyle \\{x\mid \phi \\}} is interpreted in  A {\displaystyle {\mathcal {A}}} by the collection of all the elements from the domain of  A {\displaystyle {\mathcal {A}}} on which  λ x ϕ {\displaystyle \lambda x\phi } holds; thus, the class can be described as the set of all predicates equivalent to  ϕ {\displaystyle \phi } (which includes  ϕ {\displaystyle \phi } itself). In particular, one can identify the "class of all sets" with the set of all predicates equivalent to  x = x {\displaystyle x=x} .[citation needed]

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 κ {\displaystyle \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  Φ ( x , y ) {\displaystyle \Phi (x,y)} with the property that for any set  x {\displaystyle x} there is no more than one set  y {\displaystyle y} such that the pair  ( x , y ) {\displaystyle (x,y)} satisfies  Φ {\displaystyle \Phi } . For example, the class function mapping each set to its powerset may be expressed as the formula  y = P ( x ) {\displaystyle y={\mathcal {P}}(x)} . The fact that the ordered pair  ( x , y ) {\displaystyle (x,y)} satisfies  Φ {\displaystyle \Phi } may be expressed with the shorthand notation  Φ ( x ) = y {\displaystyle \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 MK to be strictly stronger than both NBG and ZFC.

In other set theories, such as New Foundations or the theory of semisets, the concept of "proper class" still makes sense (not all classes are sets) but the criterion of sethood is not closed under subsets. For example, any set theory with a universal set has proper classes which are subclasses of sets.

## Notes

[edit]

1. ^ Bertrand Russell (1903). The Principles of Mathematics, Chapter VI: Classes, via Internet Archive
2. ^ Herrlich, Horst; Strecker, George (2007), "Sets, classes, and conglomerates" (PDF), Category theory (3rd ed.), Heldermann Verlag, pp. 9–12
3. ^ abeq2 – Metamath Proof Explorer, us.metamath.org, 1993-08-05, retrieved 2016-03-09
4. ^ J. R. Shoenfield, "Axioms of Set Theory". In Handbook of Mathematical Logic, Studies in Logic and the Foundations of mathematical vol. 90, ed. J. Barwise (1977)

## References

[edit]

* Jech, Thomas (2003), Set Theory, Springer Monographs in Mathematics (third millennium ed.), Berlin, New York: Springer-Verlag, ISBN 978-3-540-44085-7
* Levy, A. (1979), Basic Set Theory, Berlin, New York: Springer-Verlag
* Smullyan, Raymond M.; Fitting, Melvin (2010), Set Theory And The Continuum Problem, Dover Publications, ISBN 978-0-486-47484-7
* Monk, Donald J. (1969), Introduction to Set Theory, McGraw-Hill Book Co., ISBN 9780070427150

## External links

[edit]

* Weisstein, Eric W., "Set Class", MathWorld

* v
* t
* e

Mathematical logic

General|

* Axiom
* list
* Cardinality
* First-order logic
* Formal proof
* Formal semantics
* Foundations of mathematics
* Information theory
* Lemma
* Logical consequence
* Model
* Theorem
* Theory
* Type theory

Theorems (list)
and paradoxes|

* Gödel's completeness and incompleteness theorems
* Tarski's undefinability
* Banach–Tarski paradox
* Cantor's theorem, paradox and diagonal argument
* Compactness
* Halting problem
* Lindström's
* Löwenheim–Skolem
* Russell's paradox

Logics|

| Traditional|

* Classical logic
* Logical truth
* Tautology
* Proposition
* Inference
* Logical equivalence
* Consistency
* Equiconsistency
* Argument
* Soundness
* Validity
* Syllogism
* Square of opposition
* Venn diagram

|

Propositional|

* Boolean algebra
* Boolean functions
* Logical connectives
* Propositional calculus
* Propositional formula
* Truth tables
* Many-valued logic
* 3
* finite
* ∞

Predicate|

* First-order
* list
* Second-order
* Monadic
* Higher-order
* Fixed-point
* Free
* Quantifiers
* Predicate
* Monadic predicate calculus

Set theory|

* Set
* hereditary
* Class
* (Ur-)Element
* Ordinal number
* Extensionality
* Forcing
* Relation
* equivalence
* partition
* Set operations:
* intersection
* union
* complement
* Cartesian product
* power set
* identities

Types of sets|

* Countable
* Uncountable
* Empty
* Inhabited
* Singleton
* Finite
* Infinite
* Transitive
* Ultrafilter
* Recursive
* Fuzzy
* Universal
* Universe
* constructible
* Grothendieck
* Von Neumann

Maps and cardinality|

* Function/Map
* domain
* codomain
* image
* In/Sur/Bi-jection
* Schröder–Bernstein theorem
* Isomorphism
* Gödel numbering
* Enumeration
* Large cardinal
* inaccessible
* Aleph number
* Operation
* binary

Set theories|

* Zermelo–Fraenkel
* axiom of choice
* continuum hypothesis
* General
* Kripke–Platek
* Morse–Kelley
* Naive
* New Foundations
* Tarski–Grothendieck
* Von Neumann–Bernays–Gödel
* Ackermann
* Constructive

Formal systems (list),
language and syntax|

* Alphabet
* Arity
* Automata
* Axiom schema
* Expression
* ground
* Extension
* by definition
* conservative
* Relation
* Formation rule
* Grammar
* Formula
* atomic
* closed
* ground
* open
* Free/bound variable
* Language
* Metalanguage
* Logical connective
* ¬
* ∨
* ∧
* →
* ↔
* =
* Predicate
* functional
* variable
* propositional variable
* Proof
* Quantifier
* ∃
* !
* ∀
* rank
* Sentence
* atomic
* spectrum
* Signature
* String
* Substitution
* Symbol
* function
* logical/constant
* non-logical
* variable
* Term
* Theory
* list

Example axiomatic
systems (list)|

* of arithmetic:
* Peano
* second-order
* elementary function
* primitive recursive
* Robinson
* Skolem
* of the real numbers
* Tarski's axiomatization
* of Boolean algebras
* canonical
* minimal axioms
* of geometry:
* Euclidean:
* Elements
* Hilbert's
* Tarski's
* non-Euclidean

* Principia Mathematica

Proof theory|

* Formal proof
* Natural deduction
* Logical consequence
* Rule of inference
* Sequent calculus
* Theorem
* Systems
* axiomatic
* deductive
* Hilbert
* list
* Complete theory
* Independence (from ZFC)
* Proof of impossibility
* Ordinal analysis
* Reverse mathematics
* Self-verifying theories

Model theory|

* Interpretation
* function
* of models
* Model
* equivalence
* finite
* saturated
* spectrum
* submodel
* Non-standard model
* of arithmetic
* Diagram
* elementary
* Categorical theory
* Model complete theory
* Satisfiability
* Semantics of logic
* Strength
* Theories of truth
* semantic
* Tarski's
* Kripke's
* T-schema
* Transfer principle
* Truth predicate
* Truth value
* Type
* Ultraproduct
* Validity

Computability theory|

* Church encoding
* Church–Turing thesis
* Computably enumerable
* Computable function
* Computable set
* Decision problem
* decidable
* undecidable
* P
* NP
* P versus NP problem
* Kolmogorov complexity
* Lambda calculus
* Primitive recursive function
* Recursion
* Recursive set
* Turing machine
* Type theory

Related|

* Abstract logic
* Algebraic logic
* Automated theorem proving
* Category theory
* Concrete/Abstract category
* Category of sets
* History of logic
* History of mathematical logic
* timeline
* Logicism
* Mathematical object
* Philosophy of mathematics
* Supertask

Mathematics portal

* v
* t
* e

Set theory

Overview|

* Set (mathematics)

Axioms|

* Adjunction
* Choice
* countable
* dependent
* global
* Constructibility (V=L)
* Determinacy
* projective
* Extensionality
* Infinity
* Limitation of size
* Pairing
* Power set
* Regularity
* Union
* Martin's axiom

* Axiom schema
* replacement
* specification

Operations|

* Cartesian product
* Complement (i.e. set difference)
* De Morgan's laws
* Disjoint union
* Identities
* Intersection
* Power set
* Symmetric difference
* Union

* Concepts
* Methods

* Almost
* Cardinality
* Cardinal number (large)
* Class
* Constructible universe
* Continuum hypothesis
* Diagonal argument
* Element
* ordered pair
* tuple
* Family
* Forcing
* One-to-one correspondence
* Ordinal number
* Set-builder notation
* Transfinite induction
* Venn diagram

Set types|

* Amorphous
* Countable
* Empty
* Finite (hereditarily)
* Filter
* base
* subbase
* Ultrafilter
* Fuzzy
* Infinite (Dedekind-infinite)
* Recursive
* Singleton
* Subset · Superset
* Transitive
* Uncountable
* Universal

Theories|

* Alternative
* Axiomatic
* Naive
* Cantor's theorem

* Zermelo
* General
* Principia Mathematica
* New Foundations
* Zermelo–Fraenkel
* von Neumann–Bernays–Gödel
* Morse–Kelley
* Kripke–Platek
* Tarski–Grothendieck

* Paradoxes
* Problems

* Russell's paradox
* Suslin's problem
* Burali-Forti paradox

Set theorists|

* Paul Bernays
* Georg Cantor
* Paul Cohen
* Richard Dedekind
* Abraham Fraenkel
* Kurt Gödel
* Thomas Jech
* John von Neumann
* Willard Quine
* Bertrand Russell
* Thoralf Skolem
* Ernst Zermelo

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template