nLab
generalized Reedy category

Contents

Idea

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.

Definition

A generalized Reedy category is a category R together with two wide subcategories R + and R , and a function d:ob(R)α called degree, for some ordinal α, such that

  • every non-isomorphism in R + raises degree,
  • every non-isomorphism in R lowers degree,
  • every isomorphism in R preserves degree,
  • R +R is the core of R (equivalently, every isomorphism is in both R + and R , i.e. they are not just wide but pseudomonic subcategories),
  • every morphism f factors as a map in R followed by a map in R +, uniquely up to isomorphism, and
  • If fR and θ is an isomorphism such that θf=f, then θ=1 (isomorphisms see the maps in R as epis).

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.

Examples

References