Category of small categoriesIn mathematics, specifically in , the category of small categories, denoted by Cat, is the whose objects are all and whose morphisms are functors between categories. Cat may actually be regarded as a with natural transformations serving as 2-morphisms. The initial object of Cat is the empty category 0, which is the category of no objects and no morphisms. The terminal object is the terminal category or trivial category 1 with a single object and morphism. The category Cat is itself a , and therefore not an object of itself.
Full and faithful functorsIn , a faithful functor is a functor that is injective on hom-sets, and a full functor is surjective on hom-sets. A functor that has both properties is called a fully faithful functor. Explicitly, let C and D be () and let F : C → D be a functor from C to D. The functor F induces a function for every pair of objects X and Y in C. The functor F is said to be faithful if FX,Y is injective full if FX,Y is surjective fully faithful (= full and faithful) if FX,Y is bijective for each X and Y in C.
Monoid (category theory)In , a branch of mathematics, a monoid (or monoid object, or internal monoid, or algebra) (M, μ, η) in a (C, ⊗, I) is an M together with two morphisms μ: M ⊗ M → M called multiplication, η: I → M called unit, such that the pentagon and the unitor diagram commute. In the above notation, 1 is the identity morphism of M, I is the unit element and α, λ and ρ are respectively the associativity, the left identity and the right identity of the monoidal category C. Dually, a comonoid in a monoidal category C is a monoid in the Cop.
Product orderIn mathematics, given a partial order and on a set and , respectively, the product order (also called the coordinatewise order or componentwise order) is a partial ordering on the Cartesian product Given two pairs and in declare that if and Another possible ordering on is the lexicographical order, which is a total ordering. However the product order of two total orders is not in general total; for example, the pairs and are incomparable in the product order of the ordering with itself.
Metric mapIn the mathematical theory of metric spaces, a metric map is a function between metric spaces that does not increase any distance. These maps are the morphisms in the , Met. Such functions are always continuous functions. They are also called Lipschitz functions with Lipschitz constant 1, nonexpansive maps, nonexpanding maps, weak contractions, or short maps. Specifically, suppose that and are metric spaces and is a function from to . Thus we have a metric map when, for any points and in , Here and denote the metrics on and respectively.
Fundamental groupoidIn algebraic topology, the fundamental groupoid is a certain topological invariant of a topological space. It can be viewed as an extension of the more widely-known fundamental group; as such, it captures information about the homotopy type of a topological space. In terms of , the fundamental groupoid is a certain functor from the category of topological spaces to the category of groupoids. Let X be a topological space. Consider the equivalence relation on continuous paths in X in which two continuous paths are equivalent if they are homotopic with fixed endpoints.
Category of relationsIn mathematics, the Rel has the class of sets as and binary relations as . A morphism (or arrow) R : A → B in this category is a relation between the sets A and B, so R ⊆ A × B. The composition of two relations R: A → B and S: B → C is given by (a, c) ∈ S o R ⇔ for some b ∈ B, (a, b) ∈ R and (b, c) ∈ S. Rel has also been called the "category of correspondences of sets". The category Rel has the Set as a (wide) , where the arrow f : X → Y in Set corresponds to the relation F ⊆ X × Y defined by (x, y) ∈ F ⇔ f(x) = y.
Scott continuityIn mathematics, given two partially ordered sets P and Q, a function f: P → Q between them is Scott-continuous (named after the mathematician Dana Scott) if it preserves all directed suprema. That is, for every directed subset D of P with supremum in P, its has a supremum in Q, and that supremum is the image of the supremum of D, i.e. , where is the directed join. When is the poset of truth values, i.e. Sierpiński space, then Scott-continuous functions are characteristic functions of open sets, and thus Sierpiński space is the classifying space for open sets.
Restriction (mathematics)In mathematics, the restriction of a function is a new function, denoted or obtained by choosing a smaller domain for the original function The function is then said to extend Let be a function from a set to a set If a set is a subset of then the restriction of to is the function given by for Informally, the restriction of to is the same function as but is only defined on .
Inclusion mapIn mathematics, if is a subset of then the inclusion map (also inclusion function, insertion, or canonical injection) is the function that sends each element of to treated as an element of A "hooked arrow" () is sometimes used in place of the function arrow above to denote an inclusion map; thus: (However, some authors use this hooked arrow for any embedding.) This and other analogous injective functions from substructures are sometimes called natural injections.
