2-natural transformation?
homotopy hypothesis-theorem
delooping hypothesis-theorem
stabilization hypothesis-theorem
n-category = (n,n)-category
n-groupoid = (n,0)-category
2-functor / pseudofunctor
A pseudofunctor is a specific algebraic notion of weak -functor between bicategories (including strict 2-categories), i.e. a functor which preserves composition and identities only up to coherent specified isomorphism.
In general, there is not much reason to say “pseudofunctor” instead of “functor,” since the only relevant type of functor between arbitrary bicategories is weak. However, if the domain and codomain are known to be strict 2-categories (including ordinary -categories), it can be helpful to say “pseudofunctor” or “weak functor” to emphasize that it is not a strict 2-functor. Note that if the codomain is a -category, then there is no difference.
Pseudo or weak functors are also to be distinguished from lax functors and oplax functors, which preserve identities and composition only up to a transformation in one direction or the other, which may be non-invertible.
An older terminology, which should probably be avoided at all costs, uses “homomorphism of bicategories” for a weak functor and “morphism of bicategories” for a lax one.
Given bicategories and , a pseudofunctor (or weak -functor, or just functor) consists of:
for each object of , an object of ;
for each hom-category in , a functor ;
for each object of , an invertible 2-morphism (-cell) ;
for each triple of -objects, a isomorphism (natural in and ) ;
for each hom-category ,
and
commute; and
for each quadruple of -objects,
commutes.
If we remove the requirement that and be invertible, then we have the definition of lax functor. If we reverse the direction of these as well, then we have an oplax functor.
Historically the term ‘pseudofunctor’ was conceived by Grothendieck who weakened, around 1957, the concept of a contravariant functor from a 1-category to Cat, by effectively replacing the -category Cat by the 2-category and allowing (contravariant) functoriality up to coherent -cells. This was recorded in his Bourbaki seminar on descent via pseudofunctors. Later in SGA1 Grothendieck (with the assistance of Pierre Gabriel) replaced pseudofunctors in the treatment of descent by more invariant fibered categories. Benabou, in his 1967 treatise introducing bicategories, generalized the pseudofunctors of Grothendieck to pseudofunctors between arbitrary bicategories but under the name ‘homomorphism of bicategories’.
Tim: in specifying a pseudo functor you have to decide whether the isomorphism goes from to or in the other direction. Of course they are equivalent as each will be inverse to the other. You might say that one is lax and pseudo the other op-lax and pseudo. When specifying the Grothendieck construction for such a functor, which is to be preferred?
Both are about equally represented in the literature that I have seen which gets confusing. (In other words, I’m confused!)
Toby: As you suggest, the two versions are equivalent, so in a way it doesn't make a difference. But it might be nice to settle a convention in case we need it.
Tim: I have been using (for the Menagerie) the idea that there are pseudofunctors presented in two equivalent flavours lax pseudofunctor and oplax ones.
Mike: Well, the natural comparison maps that you get in a Grothendieck fibration go in the “lax” direction , since they are induced by the universal property of cartesian arrows. In particular, if you have a functor with “weakly cartesian” liftings that don’t compose, then it is a lax functor. Not a very strong argument, but if we just want some convention it might be a reason to pick lax. I think that making too big a deal out of the difference would be misleading, though.