Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
This used to redirect to lax natural transformation, which doesn’t leave much room to talk about the strong case. So I created pseudonatural transformation and had things redirect there, although I didn’t actually make use yet of that room.
I copied a definition of pseudonatural transformation from Schur functor over to pseudonatural transformation. Maybe someone can use it to complete the definition of lax natural transformation - right now that fizzles out just when it’s getting really interesting!
The entry pseudonatural transformations states that
A pseudonatural transformation is called a pseudonatural equivalence if each component ϕ(s) is an equivalence in the 2-category C. This is equivalent to ϕ itself being an equivalence in the 2-category [S,C] of 2-functors, pseudonatural transformations, and modifications.
An equivalence in [S,C] has as its components equivalences ϕ(s), which, furthermore, are natural in s (as equivalences). So the above claim seems to imply that any pseudonatural transformation that is an objectwise equivalence can be made into a pseudonatural equivalence, i.e., the inverse to ϕ(s) can be chosen naturally in s.
How does this claim not contradict the existence of fully faithful essentially surjective morphisms of Lie groupoids or stacks that do not have an inverse (except as a bibundle)? Such a morphism of stacks would give us a pseudonatural transformation of presheaves of groupoids that on every object is a fully faithful essentially surjective morphism of groupoids. So the above claim seems to imply that it is invertible as a morphism of presheaves of groupoids.
Dmitri Pavlov, please note that this is not claiming to answer your question in any way, I am only contextualizing/situating the question a bit, for inexperienced readers:
This question calls into question a 2-categorical and equivalenceological (please forgive this neologism) analogue of the following true characterization from basic 1-category-theory:
Let be functors. Let be a natural transformation. Then
(each component of is an isomorphism)
if and only if
( is an isomorphism within the functor category )
I believe the answer is that an “essentially surjective” morphism of stacks is not actually objectwise essentially surjective; it’s only essentially surjective “up to passage to covers”.
Re #5: I see, so perhaps this can be interpreted as saying that (pseudo)functors (with values in groupoids, say) and pseudonatural transformations form a model category where all objects are cofibrant and fibrant, in complete analogy to the model category of Grothendieck fibrations in groupoids?
A pseudofunctor can be constructed from a Grothendieck fibration with a cleavage, so perhaps the model category of pseudofunctors can be constructed as the model category of algebraically fibrant objects in Grothendieck fibrations? (Like for Kan complexes here: https://arxiv.org/abs/1003.1342.)
Well, the category of pseudofunctors and pseudonatural transformations is not complete and cocomplete as a 1-category, so it can’t be a model category. I suppose it could be a “model bicategory” if that has been defined.
I think the category of Grothendieck fibrations is not complete and cocomplete either unless you consider cloven fibrations and cleavage-preserving functors, in which case it’s equivalent (as a 1-category already) to the category of pseudofunctors into and strict natural transformations between them.
Re #7: Sorry, I meant to say that Grothendieck fibrations are fibrant objects in a model structure on all functors (the Grothendieck fibration property can be defined as a right lifting property). (And fibers can be forced to be groupoids without losing (co)completeness.)
When the fibers are groupoids, I think that’s true, but when the fibers are arbitrary categories you need liftings with universal properties, which I don’t think can be expressed as a fibrancy condition.
1 to 9 of 9