You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
A monad on is called a lifting of monad on along if the following three equations hold:
Given a monad that lifts along , a monad on and a monad isomorphism . Can I find a monad on such that lifts and moreover there is an isomorphism ? (optionally it satisfies ). I summarized this situation in the picture below.
image.png
I don't believe this is true with no assumption on because I don't even know how to construct the functor . If has a left adjoint , then I can define
I am stuck here because I don't even know how to show is a functor lifting of . However, the possibility that it is not a monad lifting breaks my mind, because it feels like functoriality or naturality of some stuff would fail in some way. Yet, I cannot prove how this does not work...
Right, that's not true with no assumptions on . Your proposed doesn't work either in general, because you have which can't be expected to equal unless .
If you want to work in an isomorphism-invariant way, you can either talk about liftings up to isomorphism, or take to be a [[displayed category]] over .
Mike Shulman said:
Right, that's not true with no assumptions on . Your proposed doesn't work either in general, because you have which can't be expected to equal unless .
Exactly, but I am not able to think of an example because if it feels like the isomorphism has to make some weird choices of bijections that would not make it natural.
Mike Shulman said:
If you want to work in an isomorphism-invariant way, you can either talk about liftings up to isomorphism, or take to be a [[displayed category]] over .
Thanks! I think that would probably work in my case, but unfortunately I want to work with monad liftings for Applications™. I guess this will just make my theorems a bit uglier.
Here's an easy way to see that it's not possible in general. Suppose there are two objects such that , say. Then since both equal . But we can choose in such a way that , which implies there cannot be a that is lifted by since otherwise and would both equal .
And we can do that even if has a left adjoint.
It is this "we can choose" that makes me not totally convinced. Because after choosing that, we also need to choose and , and then you need to check that is compatible with possible morphisms between and .
It's easy to modify any functor by isomorphisms to a naturally isomorphic one. If is any functor and you choose for every an object and an isomorphism , this choice of on objects extends uniquely to a functor such that is a natural transformation. For in , define , and then the naturality squares hold by definition.
So in this case, given the functor , we just need to choose some object such that , and an isomorphism , and set for all . Then this makes a functor isomorphic to , and we can transport the monad structure across that isomorphism.
Ah, thanks a lot. I am going to sleep better :smile: