Subobject classifier

In , a subobject classifier is a special object Ω of a category such that, intuitively, the subobjects 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 {true, false}. As an example, the set Ω = {0,1} is a subobject classifier in the 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 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 → {0,1}, which is defined as follows: (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 Ω = {0,1} are isomorphic. To categorize this notion, recall that, in category theory, a subobject is actually 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: {0} → {0, 1} that maps 0 to 1. The subset A of S can now be defined as the of true along the characteristic function χA, shown on the following diagram: Defined that way, χ is a morphism SubC(S) → HomC(S, Ω). By definition, Ω is a subobject classifier if this morphism is an isomorphism. For the general definition, we start with a category C that has a terminal object, which we denote by 1.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (6)

Topos

In mathematics, a topos (USˈtɒpɒs, UKˈtoʊpoʊs,_ˈtoʊpɒs; plural topoi ˈtɒpɔɪ or ˈtoʊpɔɪ, or toposes) is a that behaves like the category of sheaves of sets on a topological space (or more generally: on a site). Topoi behave much like the and possess a notion of localization; they are a direct generalization of point-set topology. The Grothendieck topoi find applications in algebraic geometry; the more general elementary topoi are used in logic. The mathematical field that studies topoi is called topos theory.

Subobject classifier

Functor category

In , a branch of mathematics, a functor category is a category where the objects are the functors and the morphisms are natural transformations between the functors (here, is another object in the category). Functor categories are of interest for two main reasons: many commonly occurring categories are (disguised) functor categories, so any statement proved for general functor categories is widely applicable; every category embeds in a functor category (via the Yoneda embedding); the functor category often has nicer properties than the original category, allowing certain operations that were not available in the original setting.