nLab
bicategory

Idea

A bicategory is a particular algebraic notion of weak 2-category (in fact, the earliest to be formulated, and still the one in most common use). The idea is that a bicategory is a category weakly enriched over Cat: the hom-objects of a bicategory are hom-categories, but the associativity and unity laws of enriched categories hold only up to coherent isomorphism.

Definition

A bicategory $B$ consists of

• A collection of objects $x,y,z,\dots$, also called $0$-cells;
• For each pair of $0$-cells $x,y$, a category $B(x,y)$, whose objects are called morphisms or $1$-cells and whose morphisms are called 2-morphisms or $2$-cells;
• For each $0$-cell $x$, a distinguished $1$-cell $1_x\in B(x,x)$ called the identity morphism or identity $1$-cell at $x$;
• For each triple of $0$-cells $x,y,z$, a functor $\circ :B(y,z)\times B(x,y)\to B(x,z)$ called horizontal composition;
• For each pair of $0$-cells $x,y$, natural isomorphisms called unitors: ${\mathrm{id}}_{B(x,y)}\circ {\mathrm{const}}_{1_x}\cong {\mathrm{id}}_{B(x,y)}\cong {\mathrm{const}}_{1_y}\circ {\mathrm{id}}_{B(x,y)}:B(x,y)\to B(x,y)$; and
• For each quadruple of $0$-cells $w,x,y,z$, a natural isomorphism called the associator between the two functors from $B_{y,z}\times B_{x,y}\times B_{w,x}$ to $B_{w,z}$ built out of $\circ$; such that
• Such that the pentagon identity is satisfied by the associators.

If there is exactly one $0$-cell, say $*$, then the definition is exactly the same as a monoidal structure on the category $B(*,*)$. This is one of the motivating examples behind the delooping hypothesis and the general notion of k-tuply monoidal n-category.

Details

Here we spell out the above definition in full detail. Compare to the detailed definition of strict $2$-category, which is written in the same style but is simpler.

A bicategory $B$ consists of

• a collection $\mathrm{Ob}B$ or ${\mathrm{Ob}}_B$ of objects or $0$-cells,
• for each object $a$ and object $b$, a collection $B(a,b)$ or ${\mathrm{Hom}}_B(a,b)$ of morphisms or $1$-cells $a\to b$, and
• for each object $a$, object $b$, morphism $f:a\to b$, and morphism $g:a\to b$, a collection $B(f,g)$ or $2{\mathrm{Hom}}_B(f,g)$ of $2$-morphisms or $2$-cells $f\Rightarrow g$ or $f\Rightarrow g:a\to b$,

equipped with

• for each object $a$, an identity $1_a:a\to a$ or ${id}_a:a\to a$,
• for each $a,b,c$, $f:a\to b$, and $g:b\to c$, a composite $f;g:a\to c$ or $g\circ f:a\to c$,
• for each $f:a\to b$, an identity or $2$-identity $1_f:f\Rightarrow f$ or ${Id}_f:f\to f$,
• for each $f,g,h:a\to b$, $\eta :f\Rightarrow g$, and $\theta :g\Rightarrow h$, a vertical composite $\theta •\eta :f\Rightarrow h$,
• for each $a,b,c$, $f:a\to b$, $g,h:b\to c$, and $\eta :g\Rightarrow h$, a left whiskering $\eta ◃f:g\circ f\Rightarrow h\circ f$,
• for each $a,b,c$, $f,g:a\to b$, $h:b\to c$, and $\eta :f\Rightarrow g$, a right whiskering $h▹\eta :h\circ f\Rightarrow h\circ g$,
• for each $f:a\to b$, a left unitor ${\lambda }_f:f\circ {id}_a\Rightarrow f$ and an inverse left unitor ${\overline{\lambda }}_f:f\Rightarrow f\circ {id}_a$,
• for each $f:a\to b$, a right unitor ${\rho }_f:{id}_b\circ f\Rightarrow f$, and an inverse right unitor ${\overline{\rho }}_f:f\Rightarrow {id}_b\circ f$, and
• for each $a\stackrel{f}{\to }b\stackrel{g}{\to }c\stackrel{h}{\to }d$, an associator ${\alpha }_{f,g,h}:h\circ (g\circ f)\Rightarrow (h\circ g)\circ f$ and an inverse associator ${\overline{\alpha }}_{f,g,h}:(h\circ g)\circ f\Rightarrow h\circ (g\circ f)$,

such that

• for each $\eta :f\Rightarrow g:a\to b$, the vertical composites $\eta •{Id}_f$ and ${Id}_g•\eta$ both equal $\eta$,
• for each $f\stackrel{\eta }{\Rightarrow }g\stackrel{\theta }{\Rightarrow }h\stackrel{\iota }{\Rightarrow }i:a\to b$, the vertical composites $\iota •(\theta •\eta )$ and $(\iota •\theta )•\eta$ are equal,
• for each $a\stackrel{f}{\to }b\stackrel{g}{\to }c$, the whiskerings ${Id}_g◃f$ and $g▹{Id}_f$ both equal ${Id}_{g\circ f}$,
• for each $f:a\to b$ and $g\stackrel{\eta }{\Rightarrow }h\stackrel{\theta }{\Rightarrow }i:b\to c$, the vertical composite $(\theta ◃f)•(\eta ◃f)$ equals the whiskering $(\theta •\eta )◃f$,
• for each $f\stackrel{\eta }{\Rightarrow }g\stackrel{\theta }{\Rightarrow }h:a\to b$ and $i:b\to c$, the vertical composite $(i▹\theta )•(i▹\eta )$ equals the whiskering $i▹(\theta •\eta )$,
• for each $\eta :f\Rightarrow g:a\to b$, the vertical composites ${\lambda }_g•(\eta ◃{id}_a)$ and $\eta •{\lambda }_f$ are equal,
• for each $\eta :f\Rightarrow g:a\to b$, the vertical composites ${\rho }_g•({id}_b▹\eta )$ and $\eta •{\rho }_f$ are equal,
• for each $a\stackrel{f}{\to }b\stackrel{g}{\to }c$ and $\eta :h\Rightarrow i:c\to d$, the vertical composites ${\alpha }_{f,g,i}•(\eta ◃(g\circ f))$ and $((\eta ◃g)◃f)•{\alpha }_{f,g,h}$ are equal,
• for each $f:a\to b$, $\eta :g\Rightarrow h:b\to c$, and $i:c\to d$, the vertical composites ${\alpha }_{f,h,i}•(i▹(\eta ◃f))$ and $((i▹\eta )◃f)•{\alpha }_{f,g,i}$ are equal,
• for each $\eta :f\Rightarrow g:a\to b$ and $b\stackrel{h}{\to }c\stackrel{i}{\to }d$, the vertical composites ${\alpha }_{g,h,i}•(i▹(h▹\eta ))$ and $((i\circ h)▹\eta )•{\alpha }_{f,h,i}$ are equal,
• for each $\eta :f\Rightarrow g:a\to b$ and $\theta :h\Rightarrow i:b\to c$, the vertical composites $(i▹\eta )•(\theta ◃f)$ and $(\theta ◃g)•(h▹\eta )$ are equal,
• for each $f:a\to b$, the vertical composites ${\lambda }_f•{\overline{\lambda }}_f:f\Rightarrow f$ and ${\overline{\lambda }}_f•{\lambda }_f:f\circ {id}_a\Rightarrow f\circ {id}_a$ equal the appropriate identity $2$-morphisms,
• for each $f:a\to b$, the vertical composites ${\rho }_f•{\overline{\rho }}_f:f\Rightarrow f$ and ${\overline{\rho }}_f•{\rho }_f:{id}_b\circ f\Rightarrow {id}_b\circ f$ equal the appropriate identity $2$-morphisms,
• for each $a\stackrel{f}{\to }b\stackrel{g}{\to }c\stackrel{h}{\to }d$, the vertical composites ${\alpha }_{f,g,h}•{\overline{\alpha }}_{f,g,h}:(h\circ g)\circ f\Rightarrow (h\circ g)\circ f$ and ${\overline{\alpha }}_{f,g,h}•{\alpha }_{f,g,h}:h\circ (g\circ f)\Rightarrow h\circ (g\circ f)$ equal the appropriate identity $2$-morphisms,
• for each $a\stackrel{f}{\to }b\stackrel{g}{\to }c$, the vertical composite $({\lambda }_g◃f)•{\alpha }_{f,{id}_b,g}$ equals the whiskering $g▹{\rho }_f$, and
• for each $a\stackrel{f}{\to }b\stackrel{g}{\to }c\stackrel{h}{\to }d\stackrel{i}{\to }e$, the vertical composites $(({\alpha }_{g,h,i}◃f)•{\alpha }_{f,h\circ g,i})•(i▹{\alpha }_{f,g,h})$ and ${\alpha }_{f,g,i\circ h}•{\alpha }_{g\circ f,h,i}$ are equal.

It is quite possible that there are errors or omissions in this list, although they should be easy to correct. The point is not that one would want to write out the definition in such elementary terms (although apparently I just did anyway) but rather that one can.

Examples

• Any strict 2-category is a bicategory in which the unitors and associator are identities. This includes Cat, MonCat?, the algebras for any strict 2-monad, and so on, at least as classically conceived.

• Categories, anafunctors, and natural transformations, which is a more appropriate definition of Cat in the absence of the axiom of choice, form a bicategory that is not a strict 2-category. Indeed, without the axiom of choice, the proper notion of bicategory is anabicategory.

• Rings, bimodules, and bimodule homomorphisms are the prototype for many similar examples. Notably, we can generalize from rings to enriched categories.

• Objects, spans, and morphisms of spans in any category with pullbacks also form a bicategory.

• The fundamental 2-groupoid? of a space is a bicategory which is not necessarily strict (although it can be made strict fairly easily when the space is Hausdorff by quotienting by thin homotopy, see path groupoid and fundamental infinity-groupoid). When the space is a CW-complex, there are easier and more computationally amenable equivalent strict 2-categories, such as that arising from the fundamental crossed complex.

Coherence theorems

One way to state the coherence theorem for bicategories is that every bicategory is equivalent to a strict $2$-category. This “strictification” is not obtained naively by forcing composition to be associative, but (at least in one construction) by freely adding new composites which are strictly associative. Another way to state the coherence theorem is that every formal diagram of the constraints (associators and unitors) commutes.

Note that $n=2$ is the greatest value of $n$ for which every weak $n$-category is equivalent to a fully strict one; see semi-strict infinity-category and Gray-category.

The proof of the coherence theorem is basically the same as the proof of the coherence theorem for monoidal categories. An abstract approach can be found in Power’s paper “A general coherence result.”

Terminology

Classically, “2-category” meant strict 2-category, with “bicategory” used for the weak notion. This led to the more general use of the prefix “2-” for strict (that is, strictly Cat-enriched) notions and “bi-” for weak ones. For example, classically a “2-adjunction” means a Cat-enriched adjunction, consisting of two strict 2-functors $F,G$ and a strictly Cat-natural isomorphism of categories $D(FX,Y)\cong C(X,GY)$, while a “biadjunction” means the weak version, consisting of two weak 2-functors and a pseudo natural equivalence $D(FX,Y)\simeq C(X,GY)$. Similarly for “2-equivalence” and “biequivalence,” and “2-limit” and “bilimit.”

We often use “2-category” to mean a strict or weak 2-category without prejudice, although we do still use “bicategory” to refer to the particular classical algebraic notion of weak 2-category. We try to avoid the more general use of “bi-” meaning “weak,” however. For one thing, is it confusing; a “biproduct” could mean a weak 2-limit, but it could also mean an object which is both a product and a coproduct (which happens quite frequently in additive categories).

Moreover, in most cases the prefix is unnecessary, since once we know we are working in a bicategory, there is usually no point in considering strict notions at all. Fully weak limits are really the only sensible ones to ask for in a bicategory, and likewise for fully weak adjunctions and equivalences. Even in a strict 2-category, while we might need to say “strict” sometimes to be clear, we don't need to say “$2$-”, since we know that we are not working in a mere category. (Max Kelly pushed this point.)

When we do have a strict 2-category, however, other strict notions can be quite technically useful, even if our ultimate interest is in the weak ones. This is somewhat analogous to the use of strict structures to model weak ones in homotopy theory; see here and here for good introductions to this sort of thing.

Related concepts

• category

• bicategory

  (infinity,2)-category

• tricategory

• tetracategory

• n-category

• (infinity,n)-category

Discussion about the use of the term “weak enrichment” above is at weak enrichment.

References

See the references at 2-category.