Tag. bicategory
Notes (9)
Definition. Bicategory bicategory
A bicategory is a notion of weak 2-category that arises as a category weakly enriched in categories. That is, instead of having hom sets, between any two objects a bicategory has hom categories such that the enriched category laws hold up to invertible 2-cell rather than strictly.
A bicategory consists of
- A type of objects , or 0-cells
- For all , a category . We may elide the subscript and simply write this as . Refer to the objects of as 1-cells between and , and we may write as or . For , refer to the morphisms in between and as 2-cells and write the morphism as or
- For each , an identity 1-cell
- For all , a composition functor . For 1-cells and , write their composite as
For all , a natural isomorphism, the associator between the two composite functors that compose the leftmost, respectively rightmost, pair first:
Its component at 1-cells is the invertible 2-cell
For all , natural isomorphisms, the left unitor and right unitor , each between an endofunctor of and the identity functor:
where and in the pairings denote the constant functors at the identity 1-cells. The components at a 1-cell are the invertible 2-cells
such that for all and the triangle below commutes in :
and such that for all composable 1-cells the pentagon below commutes:
Definition. Monad in a bicategory monad-in-a-bicategory
Fix a bicategory , with composition , identity 1-cells , associator , and unitors . A monad in internalises the usual notion of monad: it is an endo-1-cell carrying a multiplication and a unit that satisfy the monoid laws up to the coherence cells of the bicategory.
A monad in consists of
- a 0-cell , the object the monad acts on;
- an endo-1-cell ;
- a multiplication 2-cell ;
- a unit 2-cell ;
such that is associative: the following diagram of 2-cells commutes in , where the top map is the associator that rebrackets the threefold composite:
and such that and satisfy the unit laws: the following two diagrams commute in , where the hypotenuses are the left and right unitors:
Taking to be the bicategory of categories, functors, and natural transformations recovers an ordinary monad on a category: is the endofunctor, the multiplication, and the unit, with the coherence cells all identities.
Definition. The Bicategory of Categories bicategory-of-categories
The bicategory of categories has
- as 0-cells, categories (at a fixed pair of universe levels, for objects and for morphisms);
- as hom-category , the functor category , so 1-cells are functors and 2-cells are natural transformations;
- as identity 1-cell, the identity functor;
as composition, on functors. On natural transformations and the horizontal composite is given directly by its components
Every component of the left unitor, the right unitor and the associator is an identity morphism, and their inverses are identities too. So the only content of the triangle and pentagon is that composites of identities are identities.
is still a bicategory and not a strict 2-category: and agree on objects and on morphisms, but in the formalization they are not the same functor definitionally. The structure cells are there to name that agreement.
A monad in is an ordinary monad on a category, and a prestack is a pseudofunctor into .
Definition. Lax Functor lax-functor
A lax functor between bicategories consists of
- a map on 0-cells, ;
- for all , a functor , acting on 1-cells and 2-cells;
- a unit comparison, natural 2-cells ;
- a composition comparison, 2-cells natural in and ;
such that three coherence laws hold, one for each structure cell of :
- left unit: ;
- right unit: ;
- associativity: .
Here between 2-cells is vertical composition, and and are whiskerings.
Lax functors compose: and . The coherence laws of the composite follow from those of and and naturality of , without using the triangle or pentagon of any of the bicategories involved.
A lax functor whose comparison cells are invertible is a pseudofunctor.
Definition. Lax and Pseudonatural Transformations lax-natural-transformation
Let be lax functors. A lax natural transformation consists of
- for each 0-cell , a 1-cell ;
for each 1-cell , a 2-cell filling the naturality square,
- such that is natural in : for a 2-cell , ;
- and such that respects the comparison cells of and : one law relating to , and the unitors, and one relating to , , , and the associators.
A lax natural transformation is pseudonatural when every is invertible. As with pseudofunctors, this is a property, so the pseudonatural transformations are a full subcategory of the category of lax transformations and modifications.
Between prestacks the 1-cells are taken to be pseudonatural. The reason is biuniversality: a transformation whose components are all equivalences of categories is an equivalence of prestacks only if its naturality cells are invertible, and a biuniversal element should be exactly a representation of a prestack up to such an equivalence.
Definition. Locally Discrete Bicategory locally-discrete-bicategory
Every category is a bicategory with only identity 2-cells. Its 0-cells are the objects of , and the hom-category is the discrete category on the set : a 2-cell is a proof that . Composition and identities are those of ; the unitors and associator are the unit and associativity laws of . Since the homs of are sets, any two parallel 2-cells are equal, so the triangle and pentagon hold trivially.
A functor gives a pseudofunctor , whose comparison 2-cells are the functor laws of .
The locally discrete bicategory is how ordinary indexed categories enter bicategorical language: a prestack on is a pseudofunctor , and its Grothendieck construction is a displayed category over .
Definition. Opposite Bicategory opposite-bicategory
The opposite of a bicategory has the same 0-cells and reverses the 1-cells but not the 2-cells:
Composition swaps its arguments, . The left unitor of is the right unitor of and vice versa, and the associator of is the inverse of the associator of , with its arguments reversed.
Since the 2-cells keep their direction, a lax functor induces a lax (not oplax) functor with the same action on cells. Reversing the 2-cells instead gives the bicategory , whose hom-categories are the opposites .
Duality saves work: a coherence lemma about can often be obtained by instantiating a companion lemma at , which swaps left and right.
Definition. Pseudofunctor pseudofunctor
A pseudofunctor is a lax functor whose unit and composition comparisons
are invertible 2-cells. So preserves identities and composition up to coherent isomorphism.
Being pseudo is a property of a lax functor: invertibility of a 2-cell is a proposition, since inverses are unique. The data of a pseudofunctor is exactly the data of a lax functor, and everything proved about lax functors applies to pseudofunctors unchanged. Pseudofunctors are closed under composition and identities, as lax functors are, because invertible 2-cells are closed under composition and under the action of a functor on hom-categories.
The main examples here are prestacks, pseudofunctors . When is locally discrete on a category , these are the pseudofunctors of fibred category theory.
Definition. Total Bicategory total-bicategory
The total bicategory of a displayed bicategory over packages the base and the displayed data together, one dimension up from the total category of a displayed category.
- Its 0-cells are pairs of a 0-cell of and a displayed 0-cell over it.
- Its hom-category from to is the total category of the displayed hom-category . So a 1-cell is a pair and a 2-cell is a pair .
- Identities, composition, unitors and associator are pairs of the base structure and the displayed structure over it, and the triangle and pentagon hold because they hold in the base and, over that, in the displayed bicategory.
Projecting to first components is a pseudofunctor whose unit and composition comparisons are identity 2-cells.