The notion of Reedy category, though useful, is in some contexts inconveniently restrictive, since no Reedy category can contain any nonidentity isomorphisms. This is problematic for many “shape categories” such as Connes’ category of cycles , Segal’s category , the tree category , and so on. The notion of generalized Reedy category lifts this restriction, while maintaining the truth of the main theorem about Reedy categories: the existence of the Reedy model structure.
A generalized Reedy category is a category together with two wide subcategories and , and a function called degree, for some ordinal , such that
The last condition implies that the isomorphism in the penultimate condition must be unique. It is not self-dual, but has an obvious dual version. A generalized Reedy category is said to be dualizable if it satisfies both this condition and its dual.
For clarity, in the context of generalized Reedy categories, an ordinary Reedy category may be called a strict Reedy category.
Any Reedy category is a generalized Reedy category.
Any groupoid is also a generalized Reedy category, with .
Connes’ category of cycles .
Segal’s category .
the Moerdijk-Weiss tree category .
Any generalized direct category or generalized inverse category is also a generalized Reedy category, in which either or consists only of the isomorphisms.