Partial functionIn mathematics, a partial function f from a set X to a set Y is a function from a subset S of X (possibly the whole X itself) to Y. The subset S, that is, the domain of f viewed as a function, is called the domain of definition or natural domain of f. If S equals X, that is, if f is defined on every element in X, then f is said to be a total function. More technically, a partial function is a binary relation over two sets that associates every element of the first set to at most one element of the second set; it is thus a functional binary relation.
Disjoint unionIn mathematics, a disjoint union (or discriminated union) of a family of sets is a set often denoted by with an injection of each into such that the of these injections form a partition of (that is, each element of belongs to exactly one of these images). A disjoint union of a family of pairwise disjoint sets is their union. In , the disjoint union is the coproduct of the , and thus defined up to a bijection. In this context, the notation is often used. The disjoint union of two sets and is written with infix notation as .
Zero morphismIn , a branch of mathematics, a zero morphism is a special kind of morphism exhibiting properties like the morphisms to and from a zero object. Suppose C is a , and f : X → Y is a morphism in C. The morphism f is called a constant morphism (or sometimes left zero morphism) if for any W in C and any g, h : W → X, fg = fh. Dually, f is called a coconstant morphism (or sometimes right zero morphism) if for any object Z in C and any g, h : Y → Z, gf = hf. A zero morphism is one that is both a constant morphism and a coconstant morphism.
CoequalizerIn , a coequalizer (or coequaliser) is a generalization of a quotient by an equivalence relation to objects in an arbitrary . It is the categorical construction to the equalizer. A coequalizer is a colimit of the diagram consisting of two objects X and Y and two parallel morphisms f, g : X → Y. More explicitly, a coequalizer of the parallel morphisms f and g can be defined as an object Q together with a morphism q : Y → Q such that q ∘ f = q ∘ g.
Equaliser (mathematics)In mathematics, an equaliser is a set of arguments where two or more functions have equal values. An equaliser is the solution set of an equation. In certain contexts, a difference kernel is the equaliser of exactly two functions. Let X and Y be sets. Let f and g be functions, both from X to Y. Then the equaliser of f and g is the set of elements x of X such that f(x) equals g(x) in Y. Symbolically: The equaliser may be denoted Eq(f, g) or a variation on that theme (such as with lowercase letters "eq").
Grothendieck universeIn mathematics, a Grothendieck universe is a set U with the following properties: If x is an element of U and if y is an element of x, then y is also an element of U. (U is a transitive set.) If x and y are both elements of U, then is an element of U. If x is an element of U, then P(x), the power set of x, is also an element of U. If is a family of elements of U, and if I is an element of U, then the union is an element of U. A Grothendieck universe is meant to provide a set in which all of mathematics can be performed.
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 .
SubobjectIn , a branch of mathematics, a subobject is, roughly speaking, an that sits inside another object in the same . The notion is a generalization of concepts such as subsets from set theory, subgroups from group theory, and subspaces from topology. Since the detailed structure of objects is immaterial in category theory, the definition of subobject relies on a morphism that describes how one object sits inside another, rather than relying on the use of elements. The concept to a subobject is a .
Enriched categoryIn , a branch of mathematics, an enriched category generalizes the idea of a by replacing hom-sets with objects from a general . It is motivated by the observation that, in many practical applications, the hom-set often has additional structure that should be respected, e.g., that of being a vector space of morphisms, or a topological space of morphisms. In an enriched category, the set of morphisms (the hom-set) associated with every pair of objects is replaced by an in some fixed monoidal category of "hom-objects".
