Definition. Lax and Pseudonatural Transformations

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.

lax-natural-transformation definition entries/bicategory/lax-natural-transformation.hel