nLab
n-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

For nn \in \mathbb{N}, an nn-category is like

  • a directed space in which (kn)(k \leq n)-dimensional paths have a direction, while all higher dimensional paths may be reversed;

  • a nn-fold higher analog of what a category is to a set

nn-Categories are the main subject of higher category theory, and give the nn-Lab its name. In their modern formulation in homotopy theory they are known as (∞,n)-categories (see there for more details).

Semi-formally, nn-categories can be described as follows. An nn-category is an ∞-category such that all (n+1)(n+1)-morphisms are equivalences, and all parallel pairs of jj-morphisms are equivalent for j>nj > n. (One says that the \infty-category is trivial in degree greater than nn.) This is the same thing as an (n,n)(n,n)-category in the sense of (n,r)(n,r)-categories.

Up to equivalence, you may assume that all equivalent pairs of jj-morphisms for j>nj > n are in fact equal, and many authorities include this as a requirement. On the other hand, you can also write down a definition of nn-category from scratch (without passing through \infty-categories), and then this question never comes up. The point is that you don't talk about jj-morphisms for j>nj > n; you stop at nn-morphisms.

On the nnLab, the term “nn-category” usually means a weak nn-category, in which the compositions of cells obeys the usual associativity, unit, and exchange laws only up to coherent equivalence. This sort of nn-category is somewhat tricky to define; there are a number of proposals, not yet shown to be equivalent. By contrast, strict n-categories are easy to define, but are not sufficient for most examples when n3n\ge 3 (see semistrict n-category).

Examples

One also speaks of (1)(-1)-categories and (2)(-2)-categories, but these concepts are not as well behaved.

Categories of nn-categories

Just as the collection of all (small) sets is the prototypical example of a category, so the collection of all small nn-categories is the prototypical example of an (n+1)(n+1)-category.

Actually, if you define things cleverly, then you can get an (n+1)(n+1)-category of all nn-categories. If one assumes the Axiom of Universes, then there is a sequence of Grothendieck universes

U 0U 1U 2U_0 \subset U_1 \subset U_2 \subset \cdots

and we can say a set is U iU_i-small if it is an element of U iU_i. This allows us to make the following definitions:

  • Set\Set is the category of all U 0U_0-small sets;
  • Cat\Cat is the 2-category of all U 1U_1-small categories;
  • 2Cat2\Cat is the 3-category of all U 2U_2-small 2-categories;
  • etc.

This is a convenient way to settle size questions once and for all for finite nn, but it doesn't really work for \infty-categories.

For more, see the discussion at sci.logic.

Definitions

Here is a list of (some of) the proposed definitions of (weak) nn-category, with references, and also a list of (some of) the comparisons that have been done.

List of definitions

Many of these definitions are actually “truncations” of definitions of (weak) ∞-categories (aka ω-categories). Some others are truncations of a definition of (∞,n)-categories. A nice overview of (many) of these can be found in Tom Leinster’s paper “A survey of definitions of nn-category.”

Someone should add some more references!

  • Classical explicit definitions of “fully weak” nn-category exist for n4n\le 4. Weak 0-categories are sets, weak 1-categories are simply categories (due to Eilenberg and Mac Lane), weak 2-categories are bicategories (due to Benabou), weak 3-categories are tricategories (due to Gordon?PowerStreet), and weak 4-categories are tetracategories (due to Todd Trimble). Going on in this way is generally admitted to be infeasible beyond n=4n=4.

  • Street's definition: an nn-category is a simplicial set satisfying certain horn-filling conditions. See weak complicial set and simplicial model for weak ω-categories. This is a truncation of a definition of ω\omega-category. It can be specialized to yield a notion of (,n)(\infty,n)-category. The resulting notion of (,1)(\infty,1)-category is a quasicategory, and the resulting notion of \infty-groupoid is a Kan complex.

  • BaezDolan definition: an nn-category is an opetopic set having enough nn-universal fillers. Alternate definitions of opetopes (aka multitopes) have been given by HermidaMakkaiPower and Leinster; a comparison is due to Eugenia Cheng, see these three papers. Makkai’s version can do ω\omega.

  • Penon?’s definition: (someone describe this please!) Penon’s original definition turned out to be too strict (see Batanin and Cheng–Makkai) because it used reflexive globular sets, but a modification of it using globular sets is still a contender.

  • BataninLeinster definition: an nn-category is an nn-globular set with an action of a suitable globular operad. This is a truncation of a definition of ω\omega-category; see Batanin ω-category.

  • Trimble-style definition: An nn-category is a category weakly enriched over (n1)(n-1)-categories, where the weakness is parametrized by an operad. This definition is inductive and thus cannot do ω\omega in an obvious way, but it has been accomplished using terminal coalgebras; see Trimble n-category. Alternately, by starting with enrichment in spaces or simplicial sets, one can obtain directly a notion of (∞,n)-category. The resulting notion of (∞,1)-category is an A A_\infty-category.

  • Tamsamani?Simpson definition: An nn-category is a simplicial object in (n1)(n-1)-categories satisfying object-discreteness and the Segal condition. This definition is inductive (it is a different way of formalizing “iterated weak enrichment”) and thus cannot do ω\omega in an obvious way. It does have a natural extension to (,n)(\infty,n)-categories, and the resulting notion of (∞,1)-category reduces to a Segal category. The iterated version of this is that of Segal n-category. This notion of “weak enrichment” in a cartesian model category? is studied carefully in Simpson’s book Homotopy Theory of Higher Categories.

  • Moerdijk and Weiss’s definition uses yet another way of formalizing “iterated weak enrichment,” using dendroidal sets and quasi-operad?s.

  • Joyal’s definition: An nn-category is an nn-cellular set satisfying horn-filling conditions. This definition can do ω\omega by using ω\omega-cellular sets instead of nn-cellular sets, and it can do (,n)(\infty,n) by requiring different horn-filling conditions on nn-cellular sets. The notion of (∞,1)-category one obtains in this way is a quasicategory, and the resulting notion of \infty-groupoid is a Kan complex. For n>1n\gt 1, however, the obvious “horn-filling conditions” are not quite right; Dimitri Ara has shown how to correct them (albeit not very explicitly), obtaining a definition he calls an n-quasicategory, which form a model category Quillen equivalent to Rezk’s definition (below).

  • Barwick’s definition (popularized by Lurie in solving the Baez–Dolan cobordism hypothesis): an (,n)(\infty,n)-category is an nn-fold simplicial topological space satisfying completeness and the Segal condition. See n-fold complete Segal space. An nn-category is again defined as an (,n)(\infty,n)-category in which all kk-cells are essentially unique for k>nk\gt n. It is not clear whether this definition can do ω\omega. An (,1)(\infty,1)-category with this definition is also the same as a complete Segal space.

  • Rezk’s definition: An (,n)(\infty,n)-category is a simplicial nn-cellular set satisfying fibrancy, completeness, and the Segal condition. An nn-category can then be defined as an (,n)(\infty,n)-category in which all kk-cells are essentially unique for k>nk\gt n. This definition can potentially do ω\omega, although it seems not to have been written down yet. An (,1)(\infty,1)-category with this definition is the same as a complete Segal space. See Theta space.

  • G. Maltsiniotis has apparently extracted a definition of \infty-groupoid from Pursuing Stacks and generalized it to a definition of \infty-category; see this and this.

Comparisons

  • All definitions produce the correct well-known notion of 1-category, up to minor inessential details.

  • Since all the common definitions of (∞,1)-category are known to be equivalent (give references!), the definitions of Street, Trimble, Tamsamani–Simpson, Joyal, Barwick, and Rezk can be said to agree for (,1)(\infty,1)-categories.

  • Julie Bergner has shown that all the notions of \infty-groupoid obtained from the common notions of (,1)(\infty,1)-category are equivalent, so the definitions of Street, Trimble, Tamsamani–Simpson, Joyal, Barwick, and Rezk can also be said to agree for (,0)(\infty,0)-categories.

  • It is known that the notions of (n,0)(n,0)-category obtained from categories, bicategories, and tricategories model all homotopy n-types for n3n\le 3. Thus, in these cases, the classical definitions can be said to agree with those listed in the previous example.

  • In Tom Leinster’s paper, proofs are sketched showing that the notion of 2-category obtained in each case looks somewhat like the notion of bicategory.

  • Nick Gurski has shown in “Nerves of bicategories as stratified simplicial sets” that Street’s definition is correct for n=2n=2 (that is, it agrees with bicategories).

  • Eugenia Cheng has shown that the opetopic definition is correct for n=2n=2 (that is, it agrees with bicategories).

  • Eugenia Cheng has more recently also shown that from any sequence of operads used for iterated enrichment in a Trimble-style definition, one can construct a Batanin–Leinster-style globular operad whose algebras are the nn-categories obtained in the Trimblean inductive manner. Not all globular operads can be obtained in this way, however, since those that arise have strict interchange.

Please add any other comparisons you are aware of!

Revised on October 8, 2013 13:47:09 by Mike Shulman (192.195.154.58)