nLab
(n,r)-category

Context

Higher category theory

higher category theory

Basic concepts

Basic theorems

Applications

Models

Morphisms

Functors

Universal constructions

Extra properties and structure

1-categorical presentations

Contents

Idea

An (n,r)(n,r)-category is a higher category such that, essentially:

Put another way: given a sequence of (higher) categories C 0,C 1,...,C nC_0, C_1, ..., C_n in which each C i+1C_{i+1} is of the form Hom(A,B)Hom(A, B) for some 00-cells AA and BB from C iC_i, let us say that C nC_n is a depth-nn Hom-category of C 0C_0. (We can also cleanly extend this notion to depth-\infty Hom-categories, by taking the position that there are none). An (n,r)(n, r)-category, then, is one in which every depth-rr Hom-category is an \infty-groupoid, and, furthermore, every depth-(n+2)(n+2) Hom-category is a point. (The appearance of n+2n+2 here rather than nn allows us to make sense of this definition even when nn is as low as 2-2, and suggests that perhaps, had history gone differently, the conventions would be to number these differently.)

So (n,r)(n,r)-categories are a generalisation of both nn-categories and nn-groupoids, covering all of the ground in between (and a bit beyond). As nn increases, there are many more possibilities, until there are infinitely many kinds of (,r)(\infty,r)-categories.

Eric: What is the category of all (small) (n,r)(n,r)-categories? An (n+1,r+1)(n+1,r+1)-category?

Urs Schreiber: yes, that should be right. Roughly the argument is that a (k+1)(k+1)-morphism of (n,r)Cat(n,r)Cat is a (n,k)-transformation:

  • a 1-morphism in (n,r)Cat(n,r)Cat is an nn-functor CFDC \stackrel{F}{\to} D , hence an “(n,0)(n,0)-transformation”

  • a 2-morphism is a transformation between nn-functors, hence a “(n,1)-transformation”.

  • and so on

  • finally an (n+1)(n+1)-morphism is an (n,n)(n,n)-transformation.

So (n,r)Cat(n,r)Cat is an (n+1)(n+1)-category.

The invertibiliy of the (n,k)(n,k)-transformations is that of their components which are (k)(\ell \geq k)-morphisms in the target nn-category DD. So if all (>r)(\ell \gt r)-morphisms in DD are invertible, then so are all (n,>r)(n,\ell \gt r)-transformations between CC and DD hence all (>r+1)(\ell \gt r+1)-morphisms in (n,r)Cat(n,r)Cat. So (n,r)Cat(n,r)Cat is an (n+1,r+1)(n+1,r+1)-category.

Definition

Given a notion of \infty-category (as weak or strict as you like), then an (n,r)(n,r)-category can be defined to be an \infty-category such that

  • any jj-morphism is an equivalence, for j>rj \gt r;
  • any two parallel jj-morphisms are equivalent, for j>nj \gt n.

As explained below, we may assume that n2n \geq -2 and 0rn+10 \leq r \leq n + 1 (but still allowing r=0r = 0 for n=2n = - 2).

For finite rr, we can also define this inductively in terms of (∞,r)-categories as follows:

Definition

For 2n-2 \leq n \leq \infty, an (n,0)-category is an ∞-groupoid that is n-truncated: an n-groupoid.

For 0<r<0 \lt r \lt \infty, an (n,r)-category is an (∞,r)-category CC such that for all objects X,YCX,Y \in C the (,r1)(\infty,r-1)-categorical hom-object C(X,Y)C(X,Y) is an (n1,r1)(n-1,r-1)-category.

(Even for r=r = \infty, this definition makes sense, taking 1\infty - 1 to be \infty, as long as we know that an (1,)(-1,\infty)-category is the same thing as a (1,0)(-1,0)-category. But this may be overkill.)

You can also start with a notion of nn-poset, then define an (n,r)(n,r)-category to be an (n+1)(n+1)-poset such that any jj-morphism is an equivalence for j>rj \gt r. Or, for rnr \leq n, you can start with a notion of nn-category, then define an (n,r)(n,r)-category to be an nn-category such that any jj-morphism in an equivalence for j>rj \gt r.

To interpret this correctly for low values of jj, we must assume that all objects (00-morphisms) in a given \infty-category are parallel, which leads us to speak of the two (1)(-1)-morphisms that serve as their common source and target and to accept any object as an equivalence between these. In particular, any jj-morphism is an equivalence for j<1j \lt 1, so if r=0r = 0, then the condition is satisfied for any smaller value of rr. Thus, we assume that r0r \geq 0.

To say that parallel (1)(-1)-morphisms must be equivalent is meaningful; it requires that there be an object. One can continue to (2)(-2)-morphisms and so on, but there is nothing to vary about these; so we assume that n2n \geq -2. In other words, a (2)(-2)-category will automatically be an nn-category for any smaller value of nn.

If any two parallel jj-morphisms are equivalent, then any jj-morphism between equivalent (j1)(j-1)-morphisms is an equivalence (being parallel to an identity for j>0j \gt 0 and automatically for j<1j \lt 1). Accordingly, any (n,r)(n,r)-category for r>n+1r \gt n + 1 is also an (n,n+1)(n,n+1)-category. Thus, we assume that rn+1r \leq n + 1. However, when n=2n = -2, this contradicts the assumption that r0r \geq 0, so we allow r=0r = 0 in that case just to talk about n=2n = -2.

Homotopy-theoretic relation

From the point of view of homotopy theory, the notion of (n,r)(n,r)-categories may be understood as a combination of the notion of homotopy n-type and that of directed space.

Recall that an (∞,0)-category is an ∞-groupoid. In light of the homotopy hypothesis – that identifies \infty-groupoids with (nice) topological spaces and n-groupoids with homotopy n-types – and in view of the notion of directed space, the following terminology is suggestive:

An (n,r)(n,r)-category is an rr-directed homotopy nn-type.

Here we read

  • 00-directed as undirected

and

  • 11-directed as directed .

Then, indeed, we have for instance that

Mike Shulman: I am not convinced that the homotopy hypothesis applies to anything directed. I’ll believe that maybe an rr-directed nn-type (whatever that means) should have a fundamental (n,r)(n,r)-category, and that this operation has a left adjoint that geometrically realizes an (n,r)(n,r)-category as an rr-directed nn-type. But I don’t see why to expect this adjunction to be an equivalence in the directed world, unless all of your rr-directed nn-types come equipped with a chosen CW-complex-like nn-skeleton which you restrict your fundamental categories to.

More concretely: take the interval category. Realize it as a directed space; presumably you get a directed topological interval [0,1][0,1]. Now take the fundamental category of this space: you get the ordered set [0,1][0,1] considered as a category—quite different from the interval category! In order to get back the interval category, you need to do something like remember the endpoints of the directed topological interval, and only use these chosen points as the objects of your fundamental category. Perhaps everyone talking about identifying directed homotopy types with higher categories has some fix like this in mind, but if so I think it should be stressed. (Alternately, maybe someone can tell me why I’m completely wrong.)

David Roberts: Perhaps one could take a leaf out of Ronnie Brown’s book and consider filtered/stratified directed spaces. The relative fundamental category is, as you point out, the 'correct' answer.

Urs Schreiber: right. I didn’t mean to imply that there is an established theory of directed spaces that yields a directed homotopy hypothesis-theorem yet. Instead the idea was that “in view of the homotopy hypothesis” we should be entitled to think of an (n,r)(n,r)-category as an rr-directed nn-type. Over at directed space I say more explicitly that one option is to defined what a (nice) rr-directed nn-type is this way. I have very little online time today, otherwise I would now add a paragraph along these lines to the above. Maybe one of you feels like doing it. I still think that th slogan “An (n,r)(n,r)-category is an rr-directed nn-type.” is a very useful guiding principle, and be it for the right definition of directed space. My impression is that the theory of directed spaces is at the time still tentative and not set in stonee. But if that’s wrong, then I’d still keep the above slogan but put an explicit caveat that this uses the notion “diected space” differently to that established in the literature.

David Corfield: During a discussion on fundamental categories with duals of statified spaces, we had this description of a project to provide a geometric picture of directed homtopy. Speaking of categories with duals, couldn’t nLab do with some more pages on them?

Mike Shulman: Your definition at directed space (“a directed space is a topological space in which not every cell is traversable in all directions”) doesn’t say anything about a stratification, so I think it’s misleading to then say that they could be defined as (n,r)(n,r)-categories without making a point that this would change the notion. My impression from the very little I’ve read about directed spaces is that they don’t necessarily come with any sort of stratification. Do we have any reason to want to define “rr-directed nn-type” to mean “(n,r)(n,r)-category”, other than that it would be cute if the homotopy hypothesis could be generalized? We like (n,r)(n,r)-categories for lots of reasons—but would calling them rr-directed nn-types really be useful to us or anyone else?

Toby: I don't think that it helps our understanding of (n,r)(n,r)-categories, at least not yet, which is why I moved this section down here. But I think that it may help us to understand directed spaces, particularly to suggest the idea that spaces might be rr-directed.

Urs Schreiber: I agree with Mike that the statements may currently be too misleading, and with Toby about what they should still achieve for us. Will try to improve on the state of the two entries a bit tomorrow – unless someone beats me to it.

David Roberts: Going back to Mike’s original comment, having read a little about fundamental categories (fingers automatically started typing ‘groupoid’ there :), the concept of equivalence of categories has to be expanded so as to capture ‘directed homotopy equivalence’. In particular, there is the notions of past retract? and future retract? - these should be considered as equivalences, but are not equivalences of categories in the usual sense. From memory they are more like (co)relexive subcategories.

Special cases

An (n,n)-category is simply an nn-category. An (n,n+1)(n,n+1)-category is an (n+1)(n+1)-poset. Note that an \infty-category and an \infty-poset are the same thing. An (n,0)(n,0)-category is an nn-groupoid. Even though they have no special name, (n,1)(n,1)-categories are widely studied.

For low values of nn, many of these notions coincide. For instance, a 00-groupoid is the same as a 00-category, namely a set. And (1)(-1)-groupoid, (1)(-1)-category, and 00-poset all mean the same thing (namely, a truth value) while (2)(-2)-groupoid, (2)(-2)-category, and (1)(-1)-poset likewise all mean the same thing (namely, the point).

Of particular importance is the case where n=n = \infty. See

Topos cases

An analogous systematics exists for (n,r)(n,r)-categories that in additions have the property of being a topos or higher topos.

The periodic table

There is a periodic table of (n,r)(n,r)-categories:

$r$↓\$n$→$-2$$-1$$0$$1$$2$...
$0$trivialtruth valuesetgroupoid2-groupoid...
$1$\"\"posetcategory(2,1)-category...
$2$\"\"\"2-poset2-category...
$3$\"\"\"\"3-poset...
\"\"\"\"\"

Models for weak (n,r)-categories

There are various model category models for collections of (n,r)(n,r)-categories.

Revised on June 29, 2014 10:33:56 by Todd Trimble (67.81.95.215)