A Reedy category is a category equipped with a structure enabling the inductive construction of diagrams and natural transformations of shape .
The most important consequence of a Reedy structure on is the existence of a model structure on the functor category whenever is a model category (no extra hypotheses on are required): the
A Reedy category is a category equipped with two lluf subcategories and and a function called degree, where is an ordinal number, such that:
Any ordinal , considered as a poset and hence a category, is a Reedy category with , the discrete category on , and the identity.
The opposite of any Reedy category is a Reedy category; simply exchange and .
The prototypical examples of Reedy categories are the simplex category and its opposite . More generally, for any simplicial set , its category of simplices is a Reedy category.
One problem with the notion of Reedy category is that it is evil: it is not invariant under equivalence of categories. It’s not hard to see that any Reedy category is necessarily skeletal. In fact, it’s even worse: no Reedy category can have any nonidentity isomorphisms! This is problematic for many -like categories such as the category of cycles, Segal’s category , the tree category , and so on.
The following generalization of the notion of Reedy category, due to Ieke Moerdijk and Clemens Berger, avoids these problems and maintains the truth of the Theorem relating Reedy categories and model structures from Reedy model structure. Define a generalized Reedy category to be a category with the same structure , , and as before, but now such that
The last condition is not self-dual, but has an obvious dual version.
There is also a generalization of the notion of Reedy category to the context of enriched category theory: this is an enriched Reedy category.