Let be a functor such that the category has a terminal object . Then can canonically be factored as the composite
of applied to the slice category , followed by dependent sum (projection on the source).
We say that is a parametric right adjoint, or p.r.a., if the functor is a right adjoint. Parametric right adjoints are also called local right adjoints, though this terminology conflicts with that of local adjunctions (see locally). It is equivalent to the notion of right multi-adjoint, but multi-adjoints can be formulated without assuming has a terminal object.
A monad is called p.r.a. if its functor part is p.r.a. and moreover its unit and multiplication are cartesian. Thus in particular it is a cartesian monad. A p.r.a. monad is also called a strongly cartesian monad.
Since creates connected limits, if is p.r.a. then it preserves connected limits, and in particular preserves pullbacks. It follows that any p.r.a. monad is a cartesian monad.
Conversely, a functor between presheaf categories is p.r.a. if it preserves connected limits. The reason is that (in the notation above), if preserves connected limits, then preserves all small limits, and a limit-preserving functor from a cototal category such as a presheaf category to a locally small category is a right adjoint.
Any polynomial functor is p.r.a., since then can be identified with , which has the left adjoint .
If is a presheaf category and is p.r.a., then the comma category (also called the Artin gluing in this context) is again a presheaf category. Conversely, if is a presheaf category, then preserves connected limits, and thus is p.r.a.
A parametric right adjoint functor (with locally small codomain) has in particular a left multi-adjoint, which sends each object to the family of all units , where ranges over all morphisms and is the left adjoint of . This is because any morphism induces a unique composite , and hence a unique factorization through . Conversely, if has a terminal object and has a left multi-adjoint, then it is a parametric right adjoint.
Central to the theory of parametric right adjoints is the notion of -generic morphisms. For any functor , a morphism is (strictly) -generic if any commutative square of the following form:
has a unique filler of the form .
A generic factorization of a map is a factorization
such that is -generic. Note that by the definition of genericity, generic factorizations are unique whenever they exist. If is a monad and any map has a generic factorization, then there is an induced orthogonal factorization system on the Kleisli category of in which -generic maps are the left class and the right class are the “free” maps, i.e. those which factor through the unit of .
A functor is a parametric right adjoint iff every map has a generic factorization.
This is Proposition 2.6 of (Weber08). In fact, the generic factorizations are precisely the universal maps in the left multi-adjoint of mentioned above.
P.r.a. functors between presheaf categories have an especially nice form.
A functor between presheaf categories is p.r.a. iff any map has a generic factorization, where is the representable presheaf on an object .
This is Proposition 2.10 of (Weber08). The “only if” direction is the previous proposition, while for the “if” direction, the given hypothesis allows us to define the functor
sending an object to the object occurring in its generic factorization. Note that is equivalently the opposite of the category of elements of . The definition of genericity, along with the Yoneda lemma, then shows that
which preserves connected limits, since it is a coproduct of representables.
In particular, a p.r.a. functor is determined by giving the object together with the functor . We can think of as the setof all possible “shapes” which allows us to “glue together” to obtain an element of shape , and as specifying exactly what each of those shapes looks like. Then the above formula for says that we look at all possible shapes we can glue to get something of shape , and for each such we look at all the “diagrams” in of the corresponding shape .
We can extract from this a description that is clearly a generalization of a polynomial functor.
A functor between presheaf categories is p.r.a. iff when expressed in terms of discrete fibrations, it is the composite
for a polynomial in
where is a discrete fibration and is a two-sided discrete fibration (with in particular a fibration and an opfibration).
Let be the Grothendieck construction of , so that , and the two-sided Grothendieck construction of regarded as a profunctor from to . The above formula tells us that , and when rewritten in terms of discrete fibrations this gives the above formula. More details are in Remark 2.12 of (Weber08).
That is, a p.r.a. functor between presheaf categories is the restriction to discrete fibrations of a certain kind of polynomial functor between slices of . When and are discrete categories, then so are and , so that p.r.a. functors between presheaf categories are a direct generalization of polynomial functors between slices of . But on the other hand, we can also say that polynomial functors between slices of Cat are a direct generalization of p.r.a. functors between presheaf categories.
Consider the free category monad on the category of quivers, such that is the quiver with the same objects as and whose arrows are finite composable strings of arrows in .. Here is the monoid regarded as a one-object category, and thus an object of is a quiver together with a natural number assigned to each edge. For any quiver , the natural augmentation assigns to each composable string of arrows its length.
The left adjoint of this functor takes as input a quiver with natural number “lengths” assigned to each of its arrows, and creates a new quiver by gluing together a copy of the quiver (with no arrows other than those drawn) for each arrow of “length” . Thus is a parametric right adjoint.
is of course a presheaf category , where is the category . The category , i.e. the opposite of the category of elements of , has objects and nonidentity arrows for all . Finally, the functor sends to the quiver with one object and no arrows, and to the quiver described above.
Parametric right adjoints were introduced in:
See also:
Mark Weber, Generic morphisms, parametric representations, and weakly cartesian monads, Theory and Applications of Categories, Vol. 13, 2004, No. 14, pp 191-234. (tac)
Mark Weber, Familial 2-functors and parametric right adjoints, Theory and Applications of Categories, Vol. 18, 2007, No. 22, pp 665-732. (tac)
Clemens Berger, Paul-André Melliès, Mark Weber, Monads with Arities and their Associated Theories, Journal of Pure and Applied Algebra 216, 2011. (arXiv:1101.3064, doi:10.1016/j.jpaa.2012.02.039)
In database theory p.r.a.s between copresheaf categories, known as data migration functor, are treated in
For a discussion of the extension of the orthogonal factorisation system on the Kleisli category to the Eilenberg–Moore category, see the discussion in:
Last revised on July 29, 2024 at 18:53:47. See the history of this page for a list of all contributions to it.