In an arbitrary (strict) 2-category, given a parallel pair of 1-cells their pseudocoequalizer is a triple where is a functor, is an invertible 2-cell such that for any other 1-cell and an invertible 2-cell there is a unique 1-cell such that and .
When the 2-category is Cat, the pseudocoequalizers exist for all parallel pairs of functors. The following explicit construction does the job.
First form a graph whose vertices (objects) are the objects of and which has the set of arrows where
(i) morphisms from form a copy of the set
(ii) formal arrows , for all form a set
(iii) formal arrows for all form a set
Then form a free category on this graph with composition . The category is the quotient of by the smallest equivalence relation on the set of morphisms containing the relations from (in other words for all pairs of morphisms in ), the relations , for all and for all morphism in .
Let be the class in of the morphism . The tautological map is in fact a functor (which is identity on objects). The maps are in fact components of a natural isomorphism of functors . The triple is in fact a pseudocoequalizer of the parallel pair .
Given and invertible as above, one defines first the functor by for all objects in , for all , and for all . This functor trivially extends to a functor on the free category . Finally one checks that the extension factors down to a (unique) functor . Then and .
In , the pseudocoequalizer has an additional property which does not hold for pseudocoequalizers in an arbitrary 2-category. Namely, suppose we are given 1-cells , a 2-cell and invertible 2-cells , such that the diagram
commutes. Let be the functors induced by universality of pseudocoequalizers satisfying and . Then there is a unique 2-cell such that . Its components are in fact identical to the components of , i.e. for all , one has . The fact that these components form a natural transformation , includes both the naturality of and the identity above for each object , and for each morphism in the following diagrams commute:
Last revised on September 9, 2019 at 15:11:47. See the history of this page for a list of all contributions to it.