HOME

TheInfoList



OR:

In mathematics, especially in
category theory Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory ...
, a subobject classifier is a special object Ω of a category such that, intuitively, the
subobject In category theory, a branch of mathematics, a subobject is, roughly speaking, an object that sits inside another object in the same category. The notion is a generalization of concepts such as subsets from set theory, subgroups from group theory ...
s of any object ''X'' in the category correspond to the morphisms from ''X'' to Ω. In typical examples, that morphism assigns "true" to the elements of the subobject and "false" to the other elements of ''X.'' Therefore, a subobject classifier is also known as a "truth value object" and the concept is widely used in the categorical description of logic. Note however that subobject classifiers are often much more complicated than the simple binary logic truth values .


Introductory example

As an example, the set Ω = is a subobject classifier in the
category of sets In the mathematical field of category theory, the category of sets, denoted by Set, is the category whose objects are sets. The arrows or morphisms between sets ''A'' and ''B'' are the functions from ''A'' to ''B'', and the composition of mor ...
and functions: to every subset ''A'' of ''S'' defined by the inclusion function '' j '' : ''A'' → ''S'' we can assign the function ''χA'' from ''S'' to Ω that maps precisely the elements of ''A'' to 1 (see characteristic function). Every function from ''S'' to Ω arises in this fashion from precisely one subset ''A''. To be clearer, consider a
subset In mathematics, a Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they a ...
''A'' of ''S'' (''A'' ⊆ ''S''), where ''S'' is a set. The notion of being a subset can be expressed mathematically using the so-called characteristic function χ''A'' : S → , which is defined as follows: :\chi_A(x) = \begin 0, & \mboxx\notin A \\ 1, & \mboxx\in A \end (Here we interpret 1 as true and 0 as false.) The role of the characteristic function is to determine which elements belong to the subset ''A''. In fact, χ''A'' is true precisely on the elements of ''A''. In this way, the collection of all subsets of ''S'' and the collection of all maps from ''S'' to Ω = are
isomorphic In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between the ...
. To categorize this notion, recall that, in category theory, a subobject is actually represented by a pair consisting of an object and a monic arrow (interpreted as the inclusion into another object). Accordingly, true refers to the element 1, which is selected by the arrow: true: → that maps 0 to 1. The subset ''A'' of ''S'' can now be defined as the pullback of true along the characteristic function χ''A'', shown on the following diagram: Defined that way, χ is a morphism ''Sub''C(''S'') → HomC(S, Ω). By definition, Ω is a subobject classifier if this morphism is an isomorphism.


Definition

For the general definition, we start with a category C that has a
terminal object In category theory, a branch of mathematics, an initial object of a category is an object in such that for every object in , there exists precisely one morphism . The dual notion is that of a terminal object (also called terminal element): ...
, which we denote by 1. The object Ω of C is a subobject classifier for C if there exists a morphism :1 → Ω with the following property: :For each monomorphism ''j'': ''U'' → ''X'' there is a unique morphism ''χ j'': ''X'' → Ω such that the following
commutative diagram 350px, The commutative diagram used in the proof of the five lemma In mathematics, and especially in category theory, a commutative diagram is a diagram such that all directed paths in the diagram with the same start and endpoints lead to the s ...
:is a pullback diagram—that is, ''U'' is the limit of the diagram: The morphism ''χ j'' is then called the classifying morphism for the subobject represented by ''j''.


Further examples


Sheaves of sets

The category of sheaves of sets on a
topological space In mathematics, a topological space is, roughly speaking, a Geometry, geometrical space in which Closeness (mathematics), closeness is defined but cannot necessarily be measured by a numeric Distance (mathematics), distance. More specifically, a to ...
''X'' has a subobject classifier Ω which can be described as follows: For any
open set In mathematics, an open set is a generalization of an Interval (mathematics)#Definitions_and_terminology, open interval in the real line. In a metric space (a Set (mathematics), set with a metric (mathematics), distance defined between every two ...
''U'' of ''X'', Ω(''U'') is the set of all open subsets of ''U''. The terminal object is the sheaf 1 which assigns the singleton to every open set ''U'' of ''X.'' The morphism η:1 → Ω is given by the family of maps η''U'' : 1(''U'') → Ω(''U'') defined by η''U''(*)=''U'' for every open set ''U'' of ''X''. Given a sheaf ''F'' on ''X'' and a sub-sheaf ''j'': ''G'' → ''F'', the classifying morphism ''χ j'' : ''F'' → Ω is given by the family of maps ''χ j,U'' : ''F''(''U'') → Ω(''U''), where ''χ j,U''(''x'') is the union of all open sets ''V'' of ''U'' such that the restriction of ''x'' to ''V'' (in the sense of sheaves) is contained in ''jV''(''G''(''V'')). Roughly speaking an assertion inside this topos is variably true or false, and its truth value from the viewpoint of an open subset ''U'' is the open subset of ''U'' where the assertion is true.


Presheaves

Given a small category C, the category of presheaves \mathrm^ (i.e. the
functor category In category theory, a branch of mathematics, a functor category D^C is a category where the objects are the functors F: C \to D and the morphisms are natural transformations \eta: F \to G between the functors (here, G: C \to D is another object i ...
consisting of all contravariant functors from C to \mathrm) has a subobject classifer given by the functor sending any c \in C to the set of
sieves A sieve (), fine mesh strainer, or sift is a tool used for separation process, separating wanted elements from unwanted material or for controlling the particle size distribution of a sample, using a screen such as a warp and weft, woven mes ...
on c. The classifying morphisms are constructed quite similarly to the ones in the sheaves-of-sets example above.


Elementary topoi

Both examples above are subsumed by the following general fact: every elementary topos, defined as a category with finite limits and power objects, necessarily has a subobject classifier.Pedicchio & Tholen (2004) p.8 The two examples above are Grothendieck topoi, and every Grothendieck topos is an elementary topos.


Related concepts

A quasitopos has an object that is almost a subobject classifier; it only classifies strong subobjects.


Notes


References

* * * * * * * * * * *{{cite book , last = Taylor , first = Paul , title = Practical Foundations of Mathematics , publisher =
Cambridge University Press Cambridge University Press was the university press of the University of Cambridge. Granted a letters patent by King Henry VIII in 1534, it was the oldest university press in the world. Cambridge University Press merged with Cambridge Assessme ...
, location = Cambridge , year = 1999 , isbn = 0-521-63107-6 Topos theory Objects (category theory)