Solving Transformations for One of the Two n-Functors
Posted by Urs Schreiber
Here is a supposedly basic -categorical question which I keep running into, and which doesn’t seem to be addressed in the literature that I am aware of, nor by the people that I talk to:
fix some integer and some notion of -category of -categories. Then
Given two parallel -functors and , what is the minimum of conditions and extra structure on a transformation such that the consistency equation for the component map of may be solved for in terms of the data given by , and ?
Under which conditions does a morphism of -functors allow to “solve for” one of the two -functors, in terms of the other?
To start with, a sufficient condition is certainly to demand that is an equivalence, and to let be a specified weak inverse of with specified (weak) unit and counit , and, if , further structure.
For instance, to give the simplest example, if two 1-functors and are related by an invertible natural transformation we can “solve for and ” in that for any morphisms in the domain, we have with the right hand side not involving itself.
But, while demanding to be an equivalence is sufficient for doing this, it is far from necessary.
For 1-functors, the sufficient and necessary condition is that has a right inverse.
But already for 2-functors, the situation becomes more interesting. While I am not quite sure about necessity, I think that a sufficient condition for 2-functors which is truly weaker than demanding an equivalence of 2-functors is to demand that fits into a special ambidextrous adjunction: a left and a right adjunction such that the counit of one is the right-inverse of the unit of the other. See definition 3 here.
This allows to “solve for ”, as described on p. 50.
Now, I have come to begin wondering about the analogous question for .
More concretely, I am encountering the following issue: I seem to have a morphism of 3-functors, which behaves a lot like one would expect a pseudoadjunction to behave. But there is one crucial difference:
where in the defintion of an adjunction one usually has an identity morphism, I want a “weak” identity morphism: a morphism which is the identity only lax-ly and op-lax-ly, hence one which is a monad and co-monad on its domain.
I went back to Aaron Lauda’s Frobenius algebras and ambidextrous adjunctions, where on pages 16 and following Verity’s notion of pseudoadjunction is recalled, but it seems I am looking for something even weaker than that: the 2-morphisms on p. 16 labeled “” I would like to allow to be just monads and comonads instead of identities.
I’d be grateful for any comments on this.