Diagonal functorIn , a branch of mathematics, the diagonal functor is given by , which maps as well as morphisms. This functor can be employed to give a succinct alternate description of the product of objects within the : a product is a universal arrow from to . The arrow comprises the projection maps. More generally, given a , one may construct the , the objects of which are called . For each object in , there is a constant diagram that maps every object in to and every morphism in to .
Diagram (category theory)In , a branch of mathematics, a diagram is the categorical analogue of an indexed family in set theory. The primary difference is that in the categorical setting one has morphisms that also need indexing. An indexed family of sets is a collection of sets, indexed by a fixed set; equivalently, a function from a fixed index set to the class of sets. A diagram is a collection of objects and morphisms, indexed by a fixed category; equivalently, a functor from a fixed index category to some category.
Pullback (category theory)In , a branch of mathematics, a pullback (also called a fiber product, fibre product, fibered product or Cartesian square) is the of a consisting of two morphisms f : X → Z and g : Y → Z with a common codomain. The pullback is written P = X ×f, Z, g Y. Usually the morphisms f and g are omitted from the notation, and then the pullback is written P = X ×Z Y. The pullback comes equipped with two natural morphisms P → X and P → Y. The pullback of two morphisms f and g need not exist, but if it does, it is essentially uniquely defined by the two morphisms.
Comma categoryIn mathematics, a comma category (a special case being a slice category) is a construction in . It provides another way of looking at morphisms: instead of simply relating objects of a to one another, morphisms become objects in their own right. This notion was introduced in 1963 by F. W. Lawvere (Lawvere, 1963 p. 36), although the technique did not become generally known until many years later. Several mathematical concepts can be treated as comma categories. Comma categories also guarantee the existence of some s and colimits.
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.
Cone (category theory)In , a branch of mathematics, the cone of a functor is an abstract notion used to define the of that functor. Cones make other appearances in category theory as well. Let F : J → C be a in C. Formally, a diagram is nothing more than a functor from J to C. The change in terminology reflects the fact that we think of F as indexing a family of and morphisms in C. The J is thought of as an "index category". One should consider this in analogy with the concept of an indexed family of objects in set theory.
Product (category theory)In , the product of two (or more) in a is a notion designed to capture the essence behind constructions in other areas of mathematics such as the Cartesian product of sets, the direct product of groups or rings, and the product of topological spaces. Essentially, the product of a family of objects is the "most general" object which admits a morphism to each of the given objects.
Initial and terminal objectsIn , a branch of mathematics, an initial object of a C is an object I in C such that for every object X in C, there exists precisely one morphism I → X. The notion is that of a terminal object (also called terminal element): T is terminal if for every object X in C there exists exactly one morphism X → T. Initial objects are also called coterminal or universal, and terminal objects are also called final. If an object is both initial and terminal, it is called a zero object or null object.
Limit (category theory)In , a branch of mathematics, the abstract notion of a limit captures the essential properties of universal constructions such as , and inverse limits. The of a colimit generalizes constructions such as disjoint unions, direct sums, coproducts, s and direct limits. Limits and colimits, like the strongly related notions of universal properties and adjoint functors, exist at a high level of abstraction. In order to understand them, it is helpful to first study the specific examples these concepts are meant to generalize.
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.