Let be a diagram in a category ; a diagram of this type is called a container or a indexed container. Let , , denote base change resp. dependent product resp. dependent sum. Then the composite
which we denote by , is called a polynomial functor. If is the identity we call a linear polynomial functor. This construction exists e.g. if is locally cartesian closed.
If we consider as a semantics for a type theory we can ask how interacts with display maps: recall that by definition the class of display maps is closed under composition, pullbacks along arbitrary morphisms, and forming exponential objects. Since , this preserves display maps if is a display maps and these are closed under composition. forms pullbacks along , and forms exponential objects. In particular for to preserve display maps it is sufficient that and are display maps.
A polynomial functor where (but not necessarily ) is a display map, restricted to display maps, one could call a dependent polynomial functor or better an inductive polynomial functor.
Initial algebras for polynomial functors, inductive families: A (weakly) initial algebra for an inductive polynomial functor we call an inductive family. An inductive family exists for all inductive polynomial functors.
Examples:
(1) If is a display map, then
(2a) If (the corresponding polynomial functor is then constant) and is a display map, then the initial algebra of the polynomial functor is . In particular the functor for identity types is of this form.
(2b) If in (2a) is not a display map, then the initial algebra of is a map equipped with a map over with the property that every other map over with a display map, factors through .
The Coq defining an inductive family is
Inductive hfiber {A X} (I: A ->X) : (X->Type):=
inj : forall (x:A), hfiber I(Ix).
It is just the homotopy fiber of . In particular the identity type of is the homotopy fiber of the diagonal .
Last revised on February 28, 2013 at 07:36:58. See the history of this page for a list of all contributions to it.