Showing changes from revision #1 to #2:
Added | Removed | Changed
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
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.
which If we denote consider by , is as called a semantics for a type theory we can ask howpolynomial functor . If 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 , is this the preserves identity display we maps call if is a display maps and these are closed under composition.linear polynomial functor . This forms construction pullbacks exists along e.g. if , is and locally cartesian closed. 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.
If Initial algebras for polynomial functors, inductive families: A (weakly) initial algebra for an inductive polynomial functor we consider call aninductive family . as An a inductive semantics family exists for a all type inductive theory polynomial we functors. 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 Examples: 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.
(1) If is a display map, then
A (2a) (weakly) If initial algebra for an inductive polynomial functor we call aninductive family . An (the inductive corresponding family exists for all inductive polynomial functors. 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 the same situation as 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).