Let be a locally cartesian closed category. A polynomial functor is specified by the data
in . The resulting functor is the composite
When , this is a polynomial endofunctor.
Sometimes this general notion is called a dependent polynomial functor, with “polynomial (endo)functor” reserved for the “one-variable” case, when is the terminal object.
The data , , and that specify a polynomial functor is sometimes referred to as a container (or an indexed container, with container reserved for the case ). Other times container is used as a synonym for “polynomial functor”. Sometimes the data are instead referred to as a polynomial to distinguish them from the “polynomial functor” they determine.
If is an identity, the functor is sometimes called a linear functor or a linear polynomial functor. Note that this notion makes sense even if is not locally cartesian closed; all it needs are pullbacks. More generally, we can make sense of polynomial functors in any category with pullbacks if we restrict to be an exponentiable morphism.
is given by
On the other hand the dependent polynomial functor associated to
Under cardinality this becomes matrix multiplication acting on vectors (with entries in the natural numbers). So in this case the dependent polynomial functor is a linear functor of several variables, an integral transform.
Any polynomial functor, as defined above, is automatically equipped with a tensorial strength, when the slice categories of are regarded as tensored over in the canonical way. The following theorem is proven in Gambino–Kock:
There is a bicategory whose objects are the objects of , whose morphisms from to are diagrams of the form
and whose 2-morphisms are diagrams of the form
This bicategory is equivalent to the 2-category whose objects are slice categories of , whose morphisms are polynomial functors regarded as strong functors, and whose 2-morphisms are strength-respecting natural transformations.
In particular, “being polynomial” is a mere property of a strong functor between slice categories. That is, the data are uniquely determined, up to isomorphism, by the strong functor they generate. (Note, though, that the property of “being polynomial” depends on a prior identification of the domain and codomain as being slice categories of some specified ambient category . In particular, a functor might be polynomial when its domain and codomain are regarded as slice categories of , but not when they are regarded as slices of over — this happens when but .)
Note that the above bicategory contains, as a locally full sub-bicategory, the usual bicategory of spans. Thus, as a special case, the bicategory of spans is equivalent to the 2-category of “linear” polynomial functors. Both of these are instances of Lack's coherence theorem.
There is a particular subclass of the 2-morphism in this bicategory that is also interesting: a 2-morphism corresponds to a cartesian natural transformation if and only if the map is an isomorphism. Since anything isomorphic to a pullback is a pullback, in this case the diagram can be drawn more simply by omitting the upper square and merely asking that the lower square be a pullback.
Furthermore, this bicategory is actually the horizontal bicategory of a double category, indeed a framed bicategory, in which the vertical arrows are the arrows of , and the cells are diagrams as above but allowing also morphisms and on the left and right.
Polynomial endofunctors are important in the definition of W-types in categories.
Polynomial functors are a special case of parametric right adjoints.
Kripke frames (with a transition relation of arity ) as studied in modal logic are coalgebras for the power-set functor . Kripke frames for a more general modal similarity type are a coalgebras of a functor of the form . Kripke models are coalgebras of functor where is the set of propositional variables of the logic in consideration. In particular all the functors appearing here are polynomial functors. So, at least in some aspects, the study of modal logics reduces to the study of (certain) polynomial functors
The relation of plain polynomial functors to trees is discussed in
Dependent (multivariate) polynomial functors are considered in
Joachim Kock, Data types with symmetries and polynomial functors over groupoids, 28th Conference on the Mathematical Foundations of Programming Semantics (Bath, June 2012); in Electronic Notes in Theoretical Computer Science. (arXiv:1210.0828)