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

  1. A type of objects 𝒦︀0, or 0-cells
  2. For all 𝑥,𝑦:𝒦︀0, a category 𝒦︀1(𝑥,𝑦). 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 𝑓⇒𝛼𝑔
  3. For each 𝑥:𝒦︀0, an identity 1-cell 1𝑥:𝒦︀(𝑥,𝑥)
  4. For all 𝑥,𝑦,𝑧:𝒦︀0, a composition functor 𝒦︀⋆𝑥,𝑦,𝑧:𝒦︀(𝑥,𝑦)×𝒦︀(𝑦,𝑧)→𝒦︀(𝑥,𝑧). For 1-cells 𝑓:𝑥→𝑦 and 𝑔:𝑦→𝑧, write their composite as 𝑓⋆𝑔:𝑥→𝑧
  5. For all 𝑤,𝑥,𝑦,𝑧:𝒦︀0, a natural isomorphism, the associator 𝛼 between the two composite functors 𝒦︀(𝑤,𝑥)×𝒦︀(𝑥,𝑦)×𝒦︀(𝑦,𝑧)→𝒦︀(𝑤,𝑧) that compose the leftmost, respectively rightmost, pair first:

    𝒦︀⋆𝑤,𝑦,𝑧∘(𝒦︀⋆𝑤,𝑥,𝑦×id)⇒𝒦︀⋆𝑤,𝑥,𝑧∘(id×𝒦︀⋆𝑥,𝑦,𝑧)

    Its component at 1-cells 𝑓,𝑔,ℎ is the invertible 2-cell

    𝛼𝑓,𝑔,ℎ:(𝑓⋆𝑔)⋆ℎ⇒𝑓⋆(𝑔⋆ℎ)
  6. For all 𝑥,𝑦:𝒦︀0, natural isomorphisms, the left unitor 𝜆 and right unitor 𝜌, each between an endofunctor of 𝒦︀(𝑥,𝑦) and the identity functor:

    𝒦︀⋆𝑥,𝑥,𝑦∘⟨1𝑥,id⟩⇒id𝒦︀⋆𝑥,𝑦,𝑦∘⟨id,1𝑦⟩⇒id

    where 1𝑥 and 1𝑦 in the pairings ⟨−,−⟩ denote the constant functors at the identity 1-cells. The components at a 1-cell 𝑓:𝒦︀(𝑥,𝑦) are the invertible 2-cells

    𝜆𝑓:1𝑥⋆𝑓⇒𝑓𝜌𝑓:𝑓⋆1𝑦⇒𝑓
  7. such that for all 𝑓:𝒦︀(𝑥,𝑦) and 𝑔:𝒦︀(𝑦,𝑧) the triangle below commutes in 𝒦︀(𝑥,𝑧):

  8. 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 1𝑥, 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

  1. a 0-cell 𝑥, the object the monad acts on;
  2. an endo-1-cell 𝑡:𝒦︀(𝑥,𝑥);
  3. a multiplication 2-cell 𝜇:𝑡⋆𝑡⇒𝑡;
  4. a unit 2-cell 𝜂:1𝑥⇒𝑡;
  5. such that 𝜇 is associative: the following diagram of 2-cells commutes in 𝒦︀(𝑥,𝑥), where the top map is the associator that rebrackets the threefold composite:

  6. 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: Id∘𝐹 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

  1. a map on 0-cells, 𝑥↦𝐹𝑥;
  2. for all 𝑥,𝑦, a functor 𝐹𝑥,𝑦:ℬ︀(𝑥,𝑦)→𝒞︀(𝐹𝑥,𝐹𝑦), acting on 1-cells and 2-cells;
  3. a unit comparison, natural 2-cells 𝐹𝑥0:1𝐹𝑥⇒𝐹(1𝑥);
  4. a composition comparison, 2-cells 𝐹𝑓,𝑔2:𝐹𝑓⋆𝐹𝑔⇒𝐹(𝑓⋆𝑔) natural in 𝑓 and 𝑔;
  5. such that three coherence laws hold, one for each structure cell of ℬ︀:

    • left unit: (𝐹0▷𝐹𝑓)⋆𝐹1,𝑓2⋆𝐹(𝜆𝑓)=𝜆𝐹𝑓;
    • right unit: (𝐹𝑓◁𝐹0)⋆𝐹𝑓,12⋆𝐹(𝜌𝑓)=𝜌𝐹𝑓;
    • associativity: (𝐹𝑓,𝑔2▷𝐹ℎ)⋆𝐹𝑓⋆𝑔,ℎ2⋆𝐹(𝛼𝑓,𝑔,ℎ)=𝛼𝐹𝑓,𝐹𝑔,𝐹ℎ⋆(𝐹𝑓◁𝐹𝑔,ℎ2)⋆𝐹𝑓,𝑔⋆ℎ2.

Here ⋆ between 2-cells is vertical composition, and 𝜃▷ℎ and ℎ◁𝜃 are whiskerings.

Lax functors compose: (𝐺∘𝐹)0=𝐺0⋆𝐺(𝐹0) and (𝐺∘𝐹)𝑓,𝑔2=𝐺𝐹𝑓,𝐹𝑔2⋆𝐺(𝐹𝑓,𝑔2). The coherence laws of the composite follow from those of 𝐹 and 𝐺 and naturality of 𝐺2, 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

  1. for each 0-cell 𝑥, a 1-cell 𝜎𝑥:𝐹𝑥→𝐺𝑥;
  2. for each 1-cell 𝑓:𝑥→𝑦, a 2-cell filling the naturality square,

    𝜎𝑓:𝐹𝑓⋆𝜎𝑦⇒𝜎𝑥⋆𝐺𝑓;
  3. such that 𝜎𝑓 is natural in 𝑓: for a 2-cell 𝜃:𝑓⇒𝑔, (𝐹𝜃▷𝜎𝑦)⋆𝜎𝑔=𝜎𝑓⋆(𝜎𝑥◁𝐺𝜃);
  4. and such that 𝜎 respects the comparison cells of 𝐹 and 𝐺: one law relating 𝜎1𝑥 to 𝐹0, 𝐺0 and the unitors, and one relating 𝜎𝑓⋆𝑔 to 𝜎𝑓, 𝜎𝑔, 𝐹2, 𝐺2 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 𝒞︀op→𝖢𝖠𝖳, and its Grothendieck construction is a displayed category over 𝒞︀.

Definition. Opposite Bicategory opposite-bicategory

The opposite ℬ︀op of a bicategory ℬ︀ has the same 0-cells and reverses the 1-cells but not the 2-cells:

ℬ︀op(𝑥,𝑦)=ℬ︀(𝑦,𝑥).

Composition swaps its arguments, 𝑓⋆op𝑔=𝑔⋆𝑓. The left unitor of ℬ︀op is the right unitor of ℬ︀ and vice versa, and the associator of ℬ︀op 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 ℬ︀op→𝒞︀op with the same action on cells. Reversing the 2-cells instead gives the bicategory ℬ︀co, whose hom-categories are the opposites (ℬ︀(𝑥,𝑦))op.

Duality saves work: a coherence lemma about ℬ︀ can often be obtained by instantiating a companion lemma at ℬ︀op, which swaps left and right.

Definition. Pseudofunctor pseudofunctor

A pseudofunctor 𝐹:ℬ︀→𝒞︀ is a lax functor whose unit and composition comparisons

𝐹𝑥0:1𝐹𝑥⇒𝐹(1𝑥)𝐹𝑓,𝑔2:𝐹𝑓⋆𝐹𝑔⇒𝐹(𝑓⋆𝑔)

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 ℬ︀op→𝖢𝖠𝖳. When ℬ︀ is locally discrete on a category 𝒞︀, these are the pseudofunctors 𝒞︀op→𝖢𝖠𝖳 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.

tag-bicategory tag