(2, 1)-category

In category theory in mathematics, a 2-category is a category with "morphisms between morphisms", called 2-morphisms. A basic example is the category Cat of all (small) categories, where a 2-morphism is a natural transformation between functors.

The concept of a strict 2-category was first introduced by Charles Ehresmann in his work on enriched categories in 1965. The more general concept of bicategory (or weak 2-category), where composition of morphisms is associative only up to a 2-isomorphism, was introduced in 1967 by Jean Bénabou.

A (2, 1)-category is a 2-category where each 2-morphism is invertible.

Definitions

A strict 2-category

By definition, a strict 2-category ''C'' consists of the data:
* a class of 0-''cells'',
* for each pairs of 0-cells $a, b$, a set $\operatorname(a, b)$ called the set of 1-''cells'' from $a$ to $b$,
* for each pairs of 1-cells $f, g$ in the same hom-set, a set $\operatorname(f, g)$ called the set of 2-''cells'' from $f$ to $g$,
* ''ordinary compositions'': maps $\circ : \operatorname(b, c) \times \operatorname(a, b) \to \operatorname(a, c)$,
* ''vertical compositions'': maps $\circ : \operatorname(g, h)\times \operatorname(f, g) \to \operatorname(f, h)$, where $f, g, h$ are in the same hom-set,
* ''horizontal compositions'': maps $* : \operatorname(u, v) \times \operatorname(f, g) \to \operatorname(u \circ f, v \circ g)$ for $f, g : a \to b$ and $u, v : b \to c$
that are subject to the following conditions
* the 0-cells, the 1-cells and the ordinary compositions form a category,
* for each $a, b$, $\operatorname(a, b)$ together with the vertical compositions is a category,
* the 2-cells together with the horizontal compositions form a category; namely, an object is a 0-cell and the hom-set from $a$ to $b$ is the set of all 2-cells of the form $\alpha : f \Rightarrow g$ with some $f, g : a \to b$,
* the interchange law: $(\delta * \beta) \circ (\gamma * \alpha)$, when defined, is the same as $(\delta \circ \gamma) * (\beta \circ \alpha)$.

The ''0-cells'', ''1-cells'', and ''2-cells'' terminology is replaced by ''0-morphisms'', ''1-morphisms'', and ''2-morphisms'' in some sources (see also Higher category theory). Vertical compositions and horizontal compositions are also written as $\circ_1, \circ_0$.

The interchange law can be drawn as a pasting diagram as follows:

Here the left-hand diagram denotes the vertical composition of horizontal composites, the right-hand diagram denotes the horizontal composition of vertical composites, and the diagram in the centre is the customary representation of both. The ''2-cell'' are drawn with double arrows ⇒, the ''1-cell'' with single arrows →, and the ''0-cell'' with points.

Since the definition, as can be seen, is not short, in practice, it is more common to use some generalization of category theory such as higher category theory (see below) or enriched category theory to define a strict 2-category. The notion of strict 2-category differs from the more general notion of a weak 2-category defined below in that composition of 1-cells (horizontal composition) is required to be strictly associative, whereas in the weak version, it needs only be associative up to a coherent 2-isomorphism.

As a category enriched over Cat

Given a monoidal category ''V'', a category ''C'' enriched over ''V'' is an abstract version of a category; namely, it consists of the data
*a class of ''objects'',
*for each pair of objects $a, b$, a ''hom-object'' $\operatorname(a, b)$ in $V$,
*''compositions'': morphisms $\operatorname(b, c) \otimes \operatorname(a, b) \to \operatorname(a, c)$ in $V$,
*''identities'': morphisms $1 \to \operatorname(a, a)$ in $V$
that are subject to the associativity and the unit axioms. In particular, if $V = \textbf$ is the category of sets with $\otimes$ cartesian product, then a category enriched over it is an ordinary category.

If $V = \textbf$, the category of small categories with $\otimes$ product of categories, then a category enriched over it is exactly a strict 2-category. Indeed, $\operatorname(a, b)$ has a structure of a category; so it gives the 2-cells and vertical compositions. Also, each composition is a functor; in particular, it sends 2-cells to 2-cells and that gives the horizontal compositions. The interchange law is a consequence of the functoriality of the compositions.

A similar process for 3-categories leads to tricategories, and more generally to weak ''n''-categories for ''n''-categories, although such an inductive approach is not necessarily common today.

A weak 2-category

A weak 2-category or a bicategory can be defined exactly the same way a strict 2-category is defined except that the horizontal composition is required to be associative up to a coherent isomorphism. The coherent condition here is similar to those needed for monoidal categories; thus, for example, a monoidal category is the same as a weak 2-category with one 0-cell.

In higher category theory, if ''C'' is an ∞-category (a weak Kan complex) whose structure is determined only by 0-simplexes, 1-simplexes and 2-simplexes, then it is a weak (2, 1)-category; i.e., a weak 2-category in which every 2-morphism is invertible. So, a weak 2-category is an (∞, 2)-category whose structure is determined only by 0, 1, 2-simplexes.

Examples

Category of small categories

The archetypal 2-category is the category of small categories, with natural transformations serving as 2-morphisms. The objects (''0-cells'') are all small categories, and for objects and the hom-set $\operatorname(a, b)$ acquires a structure of a category as a functor category. A vertical composition is the composition of natural transformations.

Similarly, given a monoidal category ''V'', the category of (small) categories enriched over ''V'' is a 2-category. Also, if $A$ is a category, then the comma category $\mathbf \downarrow A$ is a 2-category with natural transformations that map to the identity.

Grpd

Like Cat, groupoids (categories where morphisms are invertible) form a 2-category, where a 2-morphism is a natural transformation. Often, one also considers Grpd where all 2-morphisms are invertible transformations. In the latter case, it is a (2, 1)-category.

Ord

The category Ord of preordered sets is a 2-category since each hom-set has a natural preordered structure; thus a category structure by $f \le g \Leftrightarrow f(x) \le g(x)$ for each element ''x''.

More generally, the category of ordered objects in some category is a 2-category.

Boolean monoidal category

Consider a simple monoidal category, such as the monoidal preorder Bool based on the monoid M = (, ∧, T). As a category this is presented with two objects and single morphism ''g'': F → T.

We can reinterpret this monoid as a bicategory with a single object ''x'' (one 0-cell); this construction is analogous to construction of a small category from a monoid. The objects become morphisms, and the morphism ''g'' becomes a natural transformation (forming a functor category for the single hom-category B(''x'', ''x'')).

Coherence theorem

*Every bicategory is "biequivalent" to a 2-category. This is an instance of strictification (a process of replacing coherent isomorphisms with equalities.)

Duskin nerve

The Duskin nerve $N^(C)$ of a 2-category ''C'' is a simplicial set where each ''n''-simplex is determined by the following data: ''n'' objects $x_1, \dots, x_n$, morphisms $f_ : x_i \to x_j, \, i < j$ and 2-morphisms $\mu_ : f_ \circ f_ \rightarrow f_ , \, i < j < k$ that are subject to the (obvious) compatibility conditions. Then the following are equivalent:
*$C$ is a (2, 1)-category; i.e., each 2-morphism is invertible.
*$N^(C)$ is a weak Kan complex.
The Duskin nerve is an instance of the homotopy coherent nerve.

Functors and natural transformations

By definition, a functor is simply a structure-preserving map; i.e., objects map to objects, morphisms to morphisms, etc. So, a 2-functor between 2-categories can be defined exactly the same way. In practice though, this notion of a 2-functor is not used much. It is far more common to use their ''lax'' analogs (just as a weak 2-category is used more).

Let ''C,D'' be bicategories. We denote composition in "diagrammatic order". A ''lax functor P from C to D'', denoted $P: C\to D$, consists of the following data:
* for each object ''x'' in ''C'', an object $P_x\in D$;
* for each pair of objects ''x,y ∈ C'' a functor on morphism-categories, $P_: C(x,y)\to D(P_x,P_y)$;
* for each object ''x∈C'', a 2-morphism $P_:\text_\to P_(\text_x)$ in ''D'';
* for each triple of objects, ''x,y,z ∈C'', a 2-morphism $P_(f,g): P_(f);P_(g)\to P_(f;g)$ in ''D'' that is natural in ''f: x→y'' and ''g: y→z''.
These must satisfy three commutative diagrams, which record the interaction between left unity, right unity, and associativity between ''C'' and ''D''.

A lax functor in which all of the structure 2-morphisms, i.e. the $P_$ and $P_$ above, are invertible is called a pseudofunctor.

There is also a lax version of a natural transformation. Let ''C'' and ''D'' be 2-categories, and let $F,G\colon C\to D$ be 2-functors. A lax natural transformation $\alpha\colon F\to G$ between them consists of
* a morphism $\alpha_c\colon F(c)\to G(c)$ in ''D'' for every object $c\in C$ and
* a 2-morphism $\alpha_f\colon G(f)\circ\alpha_c \to \alpha_\circ F(f)$ for every morphism $f\colon c\to c'$ in ''C''
satisfying some equations (see or )

Related notion: double category

While a strict 2-category is a category enriched over Cat, a category internal to Cat is called a double category.

See also

* ''n''-category
* Doctrine (mathematics)
* Pseudofunctor
* String diagram
* 2-Yoneda lemma

Footnotes

References

*
*
*
*
*
*
*
*
*
*
*
*
*

Further reading

*

*
*

External links

*
*
*
*
*
*
*
*
{{Category theory

Higher category theory