Publication details
Lax Familial Representability and Lax Generic Factorizations
| Authors | |
|---|---|
| Year of publication | 2020 |
| Type | Article in Periodical |
| Magazine / Source | Theory and Applications of Categories |
| MU Faculty or unit | |
| Citation | |
| Web | http://www.tac.mta.ca/tac/volumes/35/37/35-37.pdf |
| Keywords | generic factorizations; lax conical colimit of representables |
| Description | A classical result due to Diers shows that a copresheaf F: A -> Set on a category A is a coproduct of representables precisely when each connected component of F's category of elements has an initial object. Most often, this condition is imposed on a copresheaf of the form B (X, T-) for a functor T : A -> B, in which case this property says that T admits generic factorizations at X, or equivalently that T is familial at X. A classical result due to Diers shows that a copresheaf F: A -> Set on a category A is a coproduct of representables precisely when each connected component of F's category of elements has an initial object. Most often, this condition is imposed on a copresheaf of the form B (X, T-) for a functor T : A -> B, in which case this property says that T admits generic factorizations at X, or equivalently that T is familial at X. Here we generalize these results to the two-dimensional setting, replacing A with an arbitrary bicategory A, and Set with Cat. In this two-dimensional setting, simply asking that a pseudofunctor F: A -> Cat be a coproduct of representables is often too strong of a condition. Instead, we will only ask that F be a lax conical colimit of representables. This in turn allows for the weaker notion of lax generic factorizations (and lax familial representability) for pseudofunctors of bicategories T : A -> B. We also compare our lax familial pseudofunctors to Weber's familial 2-functors, finding our description is more general (not requiring a terminal object in A), though essentially equivalent when a terminal object does exist. Moreover, our description of lax generics allows for an equivalence between lax generic factorizations and lax familial representability. Finally, we characterize our lax familial pseudofunctors as right lax F-adjoints followed by locally discrete fibrations of bicategories, which in turn yields a simple definition of parametric right adjoint pseudofunctors. We also compare our lax familial pseudofunctors to Weber's familial 2-functors, finding our description is more general (not requiring a terminal object in A), though essentially equivalent when a terminal object does exist. Moreover, our description of lax generics allows for an equivalence between lax generic factorizations and lax familial representability. Finally, we characterize our lax familial pseudofunctors as right lax F-adjoints followed by locally discrete fibrations of bicategories, which in turn yields a simple definition of parametric right adjoint pseudofunctors. |