(in category theory/type theory/computer science)
of all homotopy types
of (-1)-truncated types/h-propositions
Subsets of a set correspond precisely to maps from to the set of truth values of classical logic via their characteristic function . The concept of a subobject classifier generalizes this situation to toposes other than Set:
A subobject classifier in a topos is a morphism such that every monomorphism in the topos (hence every subobject) is the pullback of this morphism along a unique morphism (the characteristic morphism of ) .
In this sense is the classifying object for subobjects and the generic subobject.
The existence of a subobject classifier in a category is a powerful property which induces much other structure that lies at the heart of topos theory.
By restricting the class of monomorphism appropriately, the concept can be relativized to the concept of an M-subobject classifier1: e.g. demanding only classification of strong monomorphisms leads to quasitoposes.
In type theory, a type closely related to the subobject classifier is the type of propositions, often denoted or (sometimes in homotopy type theory) .
In a category with finite limits, a subobject classifier is a monomorphism out of the terminal object, such that for every monomorphism in there is a unique morphism such that the following square commutes and is Cartesian (a pullback):
See for instance (MacLane-Moerdijk, p. 32).
Some terminology:
If it exists, the object is also called the object of truth values, a global element is called a truth value and the element is the truth value true, where all these terms allude to the internal logic of the category .
Note that the subobjects classified by the truth values are subterminal objects.
The morphism is also called the characteristic map or classifying map of the subobject .
If has finite limits and is in addition a locally small category, then it has a subobject classifier precisely if the subobject-assigning presheaf
is representable. In this case the representing object is the subobject classifier: there is a natural isomorphism
in .
Moreover, in this case is well powered.
This appears for instance as (MacLane-Moerdijk, prop. I.3.1).
In more detail: given a morphism in , the function
takes a subobject to the subobject of obtained by pulling back along . (Notice that monomorphisms, as discussed there, are stable under pullback.)
The representability of this functor means there is an object together with a subobject which is universal, meaning that given any subobject , there is a unique morphism such that is obtained as the pullback of along .
To see that a subobject classifier induces such a natural isomorphism, we need that the morphisms for corresponds to the morphisms . This is the pasting law for pullbacks.
Conversely, to see that a subobjects-representing object is a subobject classifier, use that by naturality we have for each morphism a commuting diagram
whose commutativity says that every element of is the pullback along some of the subobject of corresponding under the natural isomorphism to .
By further playing around with this one finds that this latter subobject of has to be a terminal object.
In the category Sets of sets, the 2-element set (the classical Boolean domain) plays the role of ; the morphism just names the element . Given a subset , the characteristic function is the function defined by if , and if .
It is not usually true in toposes that is the coproduct ; toposes where that occurs are called Boolean. Thus the category of sets is a Boolean topos, as is the presheaf topos when is a groupoid.
The subobject classifier in a presheaf topos is the presheaf that sends each object to the set of sieves on it
Here is equivalently the set of subobjects of the representable presheaf .
The corresponding morphism of presheaves is the natural transformation that picks over each object the maximal sieve .
If one views a presheaf over a small category as a set varying (or evolving) over , then the subobject classifier in may be viewed as encapsulating the ways of an element to be in the set ranging from ‘never’ to ‘always’ being in the set.
In these two extremes are the only possibilities, but in the general case there are ways to become an element ‘over time’.
It might be helpful to have a look at the simple example of a subobject classifier in the presheaf topos of directed graphs worked out at Quiv to get some intuition.
As a special case of presheaf toposes, for a discrete group and the topos of G-sets, there are precisely two sieves on the single object of the delooping groupoid : the trivial one and the empty one. Hence the subobject classifier here is the 2-element set as in Set, but now regarded as a -set with trivial -action.
For toposes of (left) actions of general monoids the picture changes dramatically, since then there will usually exist non-trivial left ideals and, accordingly, the structure of will become richer: Its underlying set has elements all left ideals, with acting on a left ideal by mapping it to the left ideal . (Of course, the same description of applies to the case of groups as well, it is just, that groups lack non-trivial left ideals!)
The following is adapted from p. 34 of Caramello.
Let be a Grothendieck site. A sieve on an object is -closed when, for any arrow , if then . It’s called closed since this is a closure property: contains all arrows it covers. If is a locale with the open covers topology, then this condition means that is a collection of subopens of which is closed under unions. Clearly, every sieve on can be saturated to a closed one.
The subobject classifier of is defined on objects as
and on morphisms as
where denotes, as above, pullback of sieves.
The arrow picks the maximal sieve on each object (the one generated by the identity).
Given a mono , the classifying arrow is given by
for any and .
An example of a non-Boolean topos is the category of sheaves over a “typical” topological space such as the real line in its usual topology. In this case, is the sheaf where the set of sections over an open subset is the set of open subsets of , with the obvious restriction maps; the sheaf topos in this case is guaranteed to be non-Boolean provided there are some non-regular open sets in (a open set is regular if it is the interior of its closure). The “internal logic” of such a topos is intuitionistic.
Let be a topos and any object. Write for the corresponding over-topos.
The subobject classifier of is .
This follows for instance from the statement that the inverse image of any base change geometric morphism is a logical functor and hence preserves subobject classifiers: Here we are looking at the base change along and hence .
But the statement is also easily directly checked.
The category of pointed sets has a subobject classifier (specified up to unique isomorphism as the pointed set with two elements).
If one is willing to admit non-locally small categories, then the category of classes in ZFC is not a topos (it is not cartesian closed) but has a subobject classifier: any two-element set.
The opposite of the category of commutative von Neumann algebras has a subobject classifier given by according to Simon Henry on MathOverflow, but is not a topos because it is not cartesian closed (see Dmitri Pavlov’s answer to the same MathOverflow question).
Suppose a category has a subobject classifier; this entails some striking structural consequences for . We list a few here:
Every monomorphism in is a regular monomorphism, i.e. is an equalizer of some pair of maps.
For the characteristic map of a mono , we find that is the equalizer of a pair of maps :
“Only if” is trivial. The “if” comes from the fact that an epic (epimorphic) equalizer must be an isomorphism, for if is the equalizer of and is epic, then , whence is their equalizer, so must have been an isomorphism.
Any two epi-mono factorizations of a map in are canonically isomorphic.
Suppose where are epic and are monic. Since is regular, it is the equalizer of some parallel pair as in the diagram
so that , whence since is epic, whence factors through as is the equalizer: for some . Then also since and is monic. We have that is monic since is, and is epic since is. Thus is an isomorphism.
Already these results impose some tight restrictions on . We get some more by exploiting the internal structure of .
The subobject classifier always comes with the structure of an internal poset; that is, a relation which is internally reflexive, antisymmetric, and transitive. This can be constructed directly (see Proposition below), or obtained via the Yoneda lemma since the collection of subobjects of any object is an external poset.
Similarly, since we assume that is finitely complete, each subobject poset has intersections (gotten as pullbacks or fiber products of pairs of monics ), and the intersection operation
is natural in . Hence we have a family of maps
natural in ; by the Yoneda lemma, we infer the presence of an internal intersection map
making an internal meet-semilattice.
More significantly, is an internal Heyting algebra. More accurately, it’s a Heyting algebra provided it has joins; without joins it is a cartesian closed poset:
There is an internal implication operator
uniquely specified by the internal condition
Construct as the equalizer of the pair of maps
and then define to be the characteristic map of . Now if are two maps , one calculates that is contained in the subobject classified by iff , which is just a way of saying .
In every subobject poset , meets distribute over any joins that exist.
Because is left adjoint to the external operator on , it preserves any joins that happen to exist in .
Normally these results are proved in the context of toposes, where we may say for example that is an internal Boolean algebra if and only if the topos is Boolean. But as the proofs above indicate, we need only exploit the definition of subobject classifier making reference only to finite limit structure.
In a topos, the subobject classifier is always injective, and, so is the power object for every object (See at injective object for some of the details). In particular, every object embeds into an injective object by the singleton monomorphism : ‘A topos has enough injective objects!’. More generally, injective objects in a topos are precisely the ones that are retracts of some (Cf. Borceux 1994, p.315; Moerdijk-MacLane 1994, p.210).
A curiosity from Johnstone’s Topos Theory, posed as an exercise, is that any monomorphism is an isomorphism and even an involution. Thus is a Hopfian object.
An online proof may be found here.
Suppose a topos has a connected components functor left adjoint to assigning to an object the set of it connected components. We call connected if is a singleton and contractible if is connected for all . It can be shown that provided preserves finite products, is contractible iff is connected which in turn implies the same for all other injective objects (see at sufficiently cohesive topos).
Now the subobject classifier has always two disjoint points , whence provided it is connected we can view it (together with its Heyting algebra structure) has a (highly nonlinear) generalized interval object and define a notion of homotopy relative to . The intuition here is that truth and falsity are continuously connected in such toposes and blend into each other, endowing (the logic in) with a certain Hegelian flavor. The contractability of was taken as a key property of a gros topos of spaces by William Lawvere. Further information on this particular class of cohesive toposes and discussion of properties of relevant in this context is at sufficiently cohesive topos.
As the previous section indicates, having a subobject classifier is a very strong property of a category and “most” categories with finite limits don’t have one.
For example, there is an easy condition ensuring a category2 with a terminal object can’t have a subobject classifier: if there are no nonidentity morphisms out of the terminal object. This includes the following examples.
Any top bounded partial order.
In , the category of rings, there are no nonidentity morphisms out of the terminal object the zero ring.
Here’s another obstacle:
But a real killer is the fact that all monos are regular, or its consequences of the category being balanced and uniqueness of epi-mono factorizations:
Even though all monos in Grp are regular, we can kill off by observing that if were a subobject classifier, the proof of Proposition indicates that every mono would have to be the kernel of . But not all monos in are kernels.
Perhaps an even more decisive killer is the observation that meets distribute over (arbitrary) joins in subobject orders. This eliminates many categories from consideration:
Lattices of subobjects in or are rarely distributive.
For any nontrivial category with biproducts, there are non-distributive subobject lattices. Take any object , so that we have three subobjects , , and . Then , whereas . Under distributivity we have
but forces . So the only such category that can have a subobject classifier is trivial.
Directly related to this distributivity property is the question when a variety of algebras has a subobject classifier (cf. Johnstone 1990, pp.448f).
There are many subclasses of monomorphisms, such as regular monomorphisms, strong monomorphisms, and extremal monomorphisms. As a result, there are weaker forms of subobject classifiers that only classify a subclass of monomorphisms instead of all monomorphisms.
Suppose there is a category with finite limits. Let be a subclass of monomorphisms in , whose elements we shall refer to as -monomorphisms. An -subobject classifier is an -monomorphism out of the terminal object, such that for every -monomorphism in there is a unique morphism such that there is a pullback diagram of the following form:
Strong subobject classifiers in particular are important in the definition of a quasitopos.
Let be an inaccessible cardinal. Then -compact subobject classifers are used in the syntactic category of Martin-Löf type theories like book HoTT.
In higher topoi the subobject classifiers are the universal fibrations:
In the (n+1,1)-topos or of (n,0)-categories the subobject classifier is the forgetful functor
from the -category of pointed -categories to that of -categories, which forgets the point.
This is described in more detail at generalized universal bundle. See also the discussion at stuff, structure, property.
In fact, using the notion of (-1,0)-category the subobject classifier in Set does fit precisely into this pattern:
the set of truth values may be regarded as the (0,1)-category of (-1,0)-categories (of which there are two) and the one-element set is the (0,1)-category of pointed (-1,0)-categories, of which there is one.
In the context of (∞,1)-topos theory subobject classifiers are discussed in section 6.1.6 of
Whereas for 1-toposes the subobject classifier is the key structural ingredient (besides the exactness properties), in higher topos theory this role is taken over by the object classifier, as pointed out in Lurie (2009).
quasitopos where a weaker notion of subobject classifier only classifies strong monomorphisms.
classifying space, classifying stack, moduli space, moduli stack, derived moduli space
The concept was introduced in
Discussion of the concept can be found in the usual suspects
Francis Borceux, Handbook of Categorical Algebra 3 , Cambridge UP 1994.
R. Goldblatt, Topoi - The Categorical Analysis of Logic, 2nd ed. North-Holland Amsterdam 1984. (Dover reprint New York 2006; project euclid)
Peter Johnstone, Topos Theory , Academic Press New York 1977.
Peter Johnstone, Sketches of an Elephant I , Oxford UP 2002.
Saunders MacLane, Ieke Moerdijk, Sheaves in Geometry and Logic , Springer Heidelberg 1994. (section I.3-4)
See also
Francis Borceux, When is a cogenerator in a topos ? , Cah. Top. Géom. Diff. Cat. XVI no.1 (1975) pp.3-15. (numdam)
Chang Ku Im, On elementary toposes , Bull. Korean Math. Soc. 16, No.2 (1980) pp.55-71. (pdf)
For sheaves
The existence of subobject classifiers in categories of algebras is considered in
Last revised on March 6, 2024 at 13:54:02. See the history of this page for a list of all contributions to it.