Exponential objectIn mathematics, specifically in , an exponential object or map object is the generalization of a function space in set theory. with all and exponential objects are called . Categories (such as of ) without adjoined products may still have an exponential law. Let be a category, let and be of , and let have all with .
Cartesian closed categoryIn , a is Cartesian closed if, roughly speaking, any morphism defined on a of two can be naturally identified with a morphism defined on one of the factors. These categories are particularly important in mathematical logic and the theory of programming, in that their internal language is the simply typed lambda calculus. They are generalized by , whose internal language, linear type systems, are suitable for both quantum and classical computation.
Direct image functorIn mathematics, the direct image functor is a construction in sheaf theory that generalizes the global sections functor to the relative case. It is of fundamental importance in topology and algebraic geometry. Given a sheaf F defined on a topological space X and a continuous map f: X → Y, we can define a new sheaf f∗F on Y, called the direct image sheaf or the pushforward sheaf of F along f, such that the global sections of f∗F is given by the global sections of F.
Subobject classifierIn , 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}.
Functor categoryIn , 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.
Category of topological spacesIn mathematics, the category of topological spaces, often denoted Top, is the whose s are topological spaces and whose morphisms are continuous maps. This is a category because the composition of two continuous maps is again continuous, and the identity function is continuous. The study of Top and of properties of topological spaces using the techniques of is known as categorical topology. N.B. Some authors use the name Top for the categories with topological manifolds, with compactly generated spaces as objects and continuous maps as morphisms or with the .
Functor represented by a schemeIn algebraic geometry, a functor represented by a scheme X is a set-valued contravariant functor on the category of schemes such that the value of the functor at each scheme S is (up to natural bijections) the set of all morphisms . The scheme X is then said to represent the functor and that classify geometric objects over S given by F. The best known example is the Hilbert scheme of a scheme X (over some fixed base scheme), which, when it exists, represents a functor sending a scheme S to a flat family of closed subschemes of .
Presheaf (category theory)In , a branch of mathematics, a presheaf on a is a functor . If is the poset of open sets in a topological space, interpreted as a category, then one recovers the usual notion of presheaf on a topological space. A morphism of presheaves is defined to be a natural transformation of functors. This makes the collection of all presheaves on into a category, and is an example of a . It is often written as . A functor into is sometimes called a profunctor.
Yoneda lemmaIn mathematics, the Yoneda lemma is arguably the most important result in . It is an abstract result on functors of the type morphisms into a fixed object. It is a vast generalisation of Cayley's theorem from group theory (viewing a group as a miniature category with just one object and only isomorphisms). It allows the of any into a (contravariant set-valued functors) defined on that category. It also clarifies how the embedded category, of representable functors and their natural transformations, relates to the other objects in the larger functor category.
Equivalence of categoriesIn , a branch of abstract mathematics, an equivalence of categories is a relation between two that establishes that these categories are "essentially the same". There are numerous examples of categorical equivalences from many areas of mathematics. Establishing an equivalence involves demonstrating strong similarities between the mathematical structures concerned.
GroupoidIn mathematics, especially in and homotopy theory, a groupoid (less often Brandt groupoid or virtual group) generalises the notion of group in several equivalent ways. A groupoid can be seen as a: Group with a partial function replacing the binary operation; in which every morphism is invertible. A category of this sort can be viewed as augmented with a unary operation on the morphisms, called inverse by analogy with group theory. A groupoid where there is only one object is a usual group.
Monad (category theory)In , a branch of mathematics, a monad (also triple, triad, standard construction and fundamental construction) is a in the of endofunctors of some fixed category. An endofunctor is a functor mapping a category to itself, and a monad is an endofunctor together with two natural transformations required to fulfill certain coherence conditions. Monads are used in the theory of pairs of adjoint functors, and they generalize closure operators on partially ordered sets to arbitrary categories.
Simplicial setIn mathematics, a simplicial set is an object composed of simplices in a specific way. Simplicial sets are higher-dimensional generalizations of directed graphs, partially ordered sets and . Formally, a simplicial set may be defined as a contravariant functor from the to the . Simplicial sets were introduced in 1950 by Samuel Eilenberg and Joseph A. Zilber. Every simplicial set gives rise to a "nice" topological space, known as its geometric realization.
Grothendieck topologyIn , a branch of mathematics, a Grothendieck topology is a structure on a category C that makes the objects of C act like the open sets of a topological space. A category together with a choice of Grothendieck topology is called a site. Grothendieck topologies axiomatize the notion of an open cover. Using the notion of covering provided by a Grothendieck topology, it becomes possible to define sheaves on a category and their cohomology. This was first done in algebraic geometry and algebraic number theory by Alexander Grothendieck to define the étale cohomology of a scheme.
Adjoint functorsIn mathematics, specifically , adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems (i.e.
EpimorphismIn , an epimorphism (also called an epic morphism or, colloquially, an epi) is a morphism f : X → Y that is right-cancellative in the sense that, for all objects Z and all morphisms , Epimorphisms are categorical analogues of onto or surjective functions (and in the the concept corresponds exactly to the surjective functions), but they may not exactly coincide in all contexts; for example, the inclusion is a ring epimorphism. The of an epimorphism is a monomorphism (i.e. an epimorphism in a C is a monomorphism in the Cop).
Inverse limitIn mathematics, the inverse limit (also called the projective limit) is a construction that allows one to "glue together" several related objects, the precise gluing process being specified by morphisms between the objects. Thus, inverse limits can be defined in any although their existence depends on the category that is considered. They are a special case of the concept of in category theory. By working in the , that is by reverting the arrows, an inverse limit becomes a direct limit or inductive limit, and a limit becomes a colimit.
Concrete categoryIn mathematics, a concrete category is a that is equipped with a faithful functor to the (or sometimes to another category, see Relative concreteness below). This functor makes it possible to think of the objects of the category as sets with additional structure, and of its morphisms as structure-preserving functions. Many important categories have obvious interpretations as concrete categories, for example the and the , and trivially also the category of sets itself. On the other hand, the is not concretizable, i.
Kripke semanticsKripke semantics (also known as relational semantics or frame semantics, and often confused with possible world semantics) is a formal semantics for non-classical logic systems created in the late 1950s and early 1960s by Saul Kripke and André Joyal. It was first conceived for modal logics, and later adapted to intuitionistic logic and other non-classical systems. The development of Kripke semantics was a breakthrough in the theory of non-classical logics, because the model theory of such logics was almost non-existent before Kripke (algebraic semantics existed, but were considered 'syntax in disguise').
Regular categoryIn , a regular category is a category with and coequalizers of a pair of morphisms called kernel pairs, satisfying certain exactness conditions. In that way, regular categories recapture many properties of abelian categories, like the existence of images, without requiring additivity. At the same time, regular categories provide a foundation for the study of a fragment of first-order logic, known as regular logic. A category C is called regular if it satisfies the following three properties: C is .
