class in nLab
Context
Foundations
The basis of it all
Set theory
- fundamentals of set theory
- material set theory
- presentations of set theory
- structuralism in set theory
- class-set theory
- constructive set theory
- algebraic set theory
Foundational axioms
-
basic constructions:
-
strong axioms
-
further
Removing axioms
Type theory
natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
Modalities, Closure and Reflection
Contents
Idea
In set theory, a class is a proposition or truth value in the context of a set free variable. In dependent type theory with a type universe UU, a class is an h-proposition in the context of a free variable x:Ux:U.
In set-level dependent type theory with a separate set or type judgment but no type universes, there are no set/type free variables. However, one could nevertheless interpret a class in dependent type theory as a generalized modal operator on sets/types which takes sets to h-propositions by the propositions as some types interpretation. If we use the propositions as types interpretation of dependent type theory, then a class in any dependent type theory is just a generalized modal operator on sets/types. The generalized modal operators here are not required to be either idempotent or monadic.
One could internalize the notion of class inside of the foundations, and this internal notion of class is used to address size issues in foundations, and in particular, are used in category theory for defining various locally small categories and large categories.
Definitions
There are multiple ways to define a class in different foundations of mathematics. Let us work in natural deduction.
-
Suppose we are given an unsorted set theory as logic over type theory whose objects are sets. A class CC is a proposition or truth value in the context of a free variable AA.
Γ,A|Φ⊢Cprop\Gamma, A \vert \Phi \vdash C \; \mathrm{prop}
-
Suppose we are given a simply sorted set theory or dependently sorted set theory as logic over type theory with a sort Set\mathrm{Set} of sets. A class CC is a proposition or truth value in the context of a free variable for a set A:SetA:\mathrm{Set}.
Γ,A:Set|Φ⊢Cprop\Gamma, A:\mathrm{Set} \vert \Phi \vdash C \; \mathrm{prop}
-
Suppose we are given an unsorted set theory as logic over type theory whose objects are “probable sets”, with a predicate isSet(A)\mathrm{isSet}(A) saying whether a “probable set” AA is a set. A class CC is a proposition or truth value in the context of a free variable AA and the true proposition isSet(A)true\mathrm{isSet}(A) \; \mathrm{true}.
Γ,A|Φ,isSet(A)true⊢Cprop\Gamma, A \vert \Phi, \mathrm{isSet}(A) \; \mathrm{true} \vdash C \; \mathrm{prop}
-
Suppose we are given a simply sorted set theory or dependently sorted set theory as logic over type theory with a sort ProbSet\mathrm{ProbSet} of “probable sets” with a predicate isSet(A)\mathrm{isSet}(A) on ProbSet\mathrm{ProbSet} saying whether a term A:ProbSetA:\mathrm{ProbSet} is a set. A class CC is a proposition or truth value in the context of a free variable for a probable set A:ProbSetA:\mathrm{ProbSet} and the true proposition isSet(A)true\mathrm{isSet}(A) \; \mathrm{true}.
Γ,A:ProbSet|Φ,isSet(A)true⊢Cprop\Gamma, A:\mathrm{ProbSet} \vert \Phi, \mathrm{isSet}(A) \; \mathrm{true} \vdash C \; \mathrm{prop}
-
Suppose we are given a dependent type theory with a type universes 𝒰\mathcal{U} and a separate type judgment, as well as a type of all propositions Ω\Omega. Then a class CC is a proposition in the context of a type A:𝒰A:\mathcal{U}
Γ,A:𝒰⊢C:Ω\Gamma, A:\mathcal{U} \vdash C:\Omega
-
Suppose we are given a dependent type theory with a type universes 𝒰\mathcal{U} and a separate type judgment, and are using the propositions as some types interpretation of dependent type theory. Then a class CC is a type in the context of a type A:𝒰A:\mathcal{U}
Γ,A:𝒰⊢Ctype\Gamma, A:\mathcal{U} \vdash C \; \mathrm{type}
with the rule
Γ,A:𝒰⊢CtypeΓ⊢B:𝒰Γ⊢p C(B):isProp(C[B/A])\frac{\Gamma, A:\mathcal{U} \vdash C \; \mathrm{type} \quad \Gamma \vdash B:\mathcal{U}}{\Gamma \vdash p^C(B):\mathrm{isProp}(C[B/A])}
-
Suppose we are given a dependent type theory with a type universes 𝒰\mathcal{U} and a separate type judgment, and are using the propositions as types interpretation of dependent type theory. Then a class CC is a type in the context of a type A:𝒰A:\mathcal{U}
Γ,A:𝒰⊢Ctype\Gamma, A:\mathcal{U} \vdash C \; \mathrm{type}
-
Suppose we are given a dependent type theory with a sequence of Russell universes 𝒰 i\mathcal{U}_i but no separate type judgment, and are using the propositions as some types interpretation of dependent type theory. Then a class CC is an h-proposition in the successor universe 𝒰 s 𝒩(i)\mathcal{U}_{s_\mathcal{N}(i)} in the context of a type A:𝒰 iA:\mathcal{U}_i
Ξ|Γ,A:𝒰 i⊢C:Prop 𝒰 s 𝒩(i)\Xi \vert \Gamma, A:\mathcal{U}_i \vdash C:\mathrm{Prop}_{\mathcal{U}_{s_\mathcal{N}(i)}}
-
Suppose we are given a dependent type theory with a sequence of Russell universes 𝒰 i\mathcal{U}_i but no separate type judgment, and are using the propositions as types interpretation of dependent type theory. Then a class CC is a type in the successor universe 𝒰 s 𝒩(i)\mathcal{U}_{s_\mathcal{N}(i)} in the context of a type A:𝒰 iA:\mathcal{U}_i
Ξ|Γ,A:𝒰 i⊢C:𝒰 s 𝒩(i)\Xi \vert \Gamma, A:\mathcal{U}_i \vdash C:\mathcal{U}_{s_\mathcal{N}(i)}
-
Suppose we are given a dependent type theory with a separate type judgment but no universes. Then a class CC is a generalized modal operator on the type theory, which isn’t required to be either idempotent or monadic, such that given a type AA, the type C(A)C(A) is an h-proposition.
Γ⊢AtypeΓ⊢C(A)typeΓ⊢AtypeΓ⊢p A C:isProp(C(A))\frac{\Gamma \vdash A \; \mathrm{type}}{\Gamma \vdash C(A) \; \mathrm{type}} \qquad \frac{\Gamma \vdash A \; \mathrm{type}}{\Gamma \vdash p_A^C:\mathrm{isProp}(C(A))}
-
Suppose we are given a dependent type theory with a separate type judgment but no type universes, and are using the propositions as types interpretation of dependent type theory. Then a class CC is a generalized modal operator on the type theory which isn’t required to be either idempotent or monadic.
Γ⊢AtypeΓ⊢C(A)type\frac{\Gamma \vdash A \; \mathrm{type}}{\Gamma \vdash C(A) \; \mathrm{type}}
Examples
-
In set theory, there is a class ∃a.a∈A\exists a.a \in A for whether the set AA is an inhabited set. In dependent type theory, the class is the propositional truncation modal operator [A][A].
-
In set theory, there is a class ∀a.a∈A∧∀b.b∈A∧a=b\forall a.a \in A \wedge \forall b.b \in A \wedge a = b for whether the set AA is a subsingleton. In dependent type theory, the class is the isProp modal operator Π(a:A).Π(b:A).(a= Ab)\Pi (a:A).\Pi (b:A).(a =_A b).
-
In set theory, there is a class ∃a.a∈A∧∀b.b∈A∧a=b\exists a.a \in A \wedge \forall b.b \in A \wedge a = b for whether the set AA is a singleton. In dependent type theory, the class is the isContr modal operator Σ(a:A).Π(b:A).(a= Ab)\Sigma (a:A).\Pi (b:A).(a =_A b).
Internal classes
It is possible to internalize the notion of class inside of the foundations itself. Classes are either primitive, such as in class theory, or a derived concept from a notion of universe in the foundations, such as in set theory or type theory. These internal classes are useful to address size issues in foundations, and in particular, are used in category theory for defining various locally small categories and large categories.
Classes as primitive
There are foundational theories called class theories where classes are primitives, rather than propositions in the context of a free variable x:Setx:\mathrm{Set}. This is similar to dependently sorted allegorical set theories, where relations are primitives, rather than propositions in the context of free variables a:Aa:A and b:Bb:B.
-
Material class theory: Classes are primitives of the theory, and sets are defined as specific kinds of classes. Examples include Morse-Kelley class theory and von Neumann–Bernays–Gödel class theory.
-
Structural class theory: A class is an object of a category of classes, and sets are defined as specific kinds of classes. Examples include category with class structure and the branch of algebraic set theory
Classes as derived from universes
In set theory
There are many notions of universe in set theory, including Grothendieck universes, well-pointed Heyting pretopoi, and well-pointed division allegories.
Let UU be a universe. Then a class relative to UU is a subset C⊆UC \subseteq U with a given injection i:C↪Ui:C \hookrightarrow U. If one has choice, any subset comes with a given injection via the axiom of choice. Thus, by this definition, it is a injective family of U U -small sets.
Equivalently, a class CC relative to UU is an endofunction C:U→UC:U \to U such that for all UU-small sets A∈UA \in U, C(A)C(A) is a subsingleton subset.
In dependent type theory
In dependent type theory, let (U,T)(U, T) be a univalent Tarski universe, let (Set U,Set T)(\mathrm{Set}_U, \mathrm{Set}_T) be the univalent h-groupoid of UU-small h-sets, let V UV_U be the material cumulative hierarchy higher inductive type relative to UU. Then a class is an endofunction C:Set U→Set UC:\mathrm{Set}_U \to \mathrm{Set}_U such that for all UU-small sets A:Set UA:\mathrm{Set}_U, (C(A))(C(A)) is a UU-small h-proposition, and a material class is a function C:V U→Set UC:V_U \to \mathrm{Set}_U such that for all material sets A:V UA:V_U, (C(A))(C(A)) is a UU-small h-proposition.
Proper classes
A proper class is a class which is not a set. What a set is differs from foundations to foundations.
What not being a set means depends upon the foundation; in material set theory, one would use the property of not being equal to any sets, while in structural set theory, one would use the property of not being in bijection with any sets.
Given a notion of universe, a proper class relative to UU is a class relative to UU which is not a set. If classes are defined as subsets of UU with an injection into UU, then a proper class is a class which is not a singleton subset.
In the context of the global axiom of choice, a proper class is a class which can be put in bijection with the class of all ordinals, OrdOrd.
Category of classes
The category of classes is closed under all large colimits and small limits. See the linked article for more information and precise definitions.
Just as an elementary topos is an axiomatization of basic properties of the category Set, a category with class structure is an axiomatization of basic properties of the category ClassClass. See also algebraic set theory.
See also
References
For the definition of a material class relative to a universe UU in homotopy type theory, see section 10.5.3 of:
- Univalent Foundations Project, Homotopy Type Theory – Univalent Foundations of Mathematics, Institute for Advanced Study (2013) [web, pdf]
A paper detailing one approach to the technical side of how classes appear in category theory (namely using Grothendieck universes) is
- Paul Blain Levy, Formulating Categorical Concepts using Classes [arXiv:1801.08528]
Last revised on November 19, 2022 at 19:01:51. See the history of this page for a list of all contributions to it.