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.
Let be a monoid, and let be the monoid of endomorphisms on the carrier (not necessarily monoid homomorphisms). I'm interested in the following -set:
Notice, behaves kind of like the free -set functor , but it extends the action to all endomorphisms , not just those of the form (which, of course, forms forms a monoid homomorphism (defined by ).
Using this , we get a functor . If we consider as a functor mapping into the [[full image]] of , then is the right adjoint to ! (The induced monad is the free -set monad.)
My question is as follows: is this "well-known", or easy to construct out of (or the free -set) somehow? I know there's lots of structure available (e.g., and ), but it's not clear to me how to assemble this into .
(I came up with this construction "manually", so maybe there's something cleaner! Really, all I want is a way to decompose the monad in such a way that the left adjoint lands in a category where the objects come equipped with -actions.)
(Another remark: I proved that this works given
Btw, a minor notational thing: mathematicians use +, 0 for commutative monoids and , 1 for not-necessarily-commutative monoids, so seeing all these +'s and 0's gets the wrong part of my brain to turn on.
(Sorry, good point - edited! The construction I'm presenting works for any monoid on ; although, I'm mainly interested in commutative monoids anyway, so if there's some way to answer my question that uses commutativity somehow, I'd be perfectly happy.)
So let's see if I understand this. You're taking a monoid and a set and getting (by which you mean the monoid of endomorphisms of , not the monoid of all functions from to ) to act on in the obvious way. And you're wanting a slick way to show that there's a functor from to - that sends any set to , made into an -set this way.
I'm just trying to restate your question in a more informal way.
Yes, exactly! (And, I'd like that functor to have a right adjoint.)
Oops, race condition - I do care about all functions to (not just monoid homomorphisms)! (Although if restricting to monoid homomorphisms helps somehow, that would be interesting to know.)
(For a concrete example, let let ; I'm interested in applying .)
Okay, all functions. In that case you're really just using the fact that is a monoid that acts on . So we might change your question to this more general one where we've got a monoid that acts on a set .
I've got a monoid that acts on a set . Then for any set , acts on in the obvious way. Can we show that there's a functor from to - that sends any set to , made into an -set in this way, and does this functor have a right adjoint?
This is more general so a priori less likely to be true, but I don't see how taking , helps, so I'd be more inclined to think about this more general version.
Yes, this is a great framing, thanks. Although, I'm willing to land in a category with -sets as objects but possibly more restrictive homomorphisms (this [[full image]] idea).
Given just the action, I can define the functor .
To define a right adjoint, my idea was to restrict the functor to (the objects are -sets but the morphisms are morphisms of -sets), where is a monoid homomorphism from (which now needs a monoid structure) to .
Then, I'm able to define a right adjoint when I also assume that (which, admittedly, feels like it comes out of nowhere).
This thing feels wrong to me; I have to go to work now, and let someone else pick up the baton now and carry it further, but given the functor from to - that we're talking about, if it has a right adjoint it should be fairly simple to describe this right adjoint directly and check that it's a right adjoint straight from the definition of "adjoint". If that works, there are also people here who might be able to solve the problem in a slicker way.
Sounds good, thanks for the advice! I'd be happy to avoid the full image as well, although so far that's the only solution that I've found that gives me a right adjoint inducing the monad*.
*I do need to assume a monoid structure on for this to even be a monad...
I'm reminded of this result, which might be relevant:
![]()
This is from "Monoid Properties as Invariants of Toposes of Monoid Actions" by Jens Hemelaer and Morgan Rogers.
Yes, that could imply my guess if we specialize by taking to be the trivial monoid.
In case it helps Harrison: is a funky name for the category of -sets, where is the monoid with the reversed multiplication
An -set is also known as a right -set. If you don't like this you can say the in my comment was secretly . (We are now using in a different way than in your original question.)
So, the key idea is that we get the right adjoint by using . If you don't know what that means, I'm sure @David Egolf (he/him) would be happy to explain. :grinning_face_with_smiling_eyes:
Yes, this sounds quite reasonable... although maybe with and or something? Wondering if I can then horizontally compose the adjunctions, where my is (free -set) followed by or something... (pondering on scratch paper now)
Oh, yes, I think this is exactly the right thing!!
![]()
Letting my , I get that
This is fantastic, thanks so much!!! What a great paper (link), thanks @David Egolf (he/him)!
Ohh, although, I suppose it's simpler to do what @John Baez suggests (, , and ), indeed, and the same argument applies. :)
(oh, duh, because !)
Yes, this is looking good. And this theorem should be fairly easy to prove, or at least convince yourself of, since there are explicit "formulas" for both functors in the adjunction.
Indeed - in retrospect, it feels like it was staring me in the face!
(After equipping a set with an -action, just define the left adjoint , the copower of with ; and then , which is a set. And they're obviously adjoint, because this is the definition of copower! :man_facepalming:)
Well, at some point you have to check that these functors exist, and that they're adjoint.
Thanks for dusting off our paper @David Egolf (he/him) :smile_cat:
Upon further thought, this may not be exactly what I'm looking for... the right adjoint is , not what I wrote above. This seems rather bad - with , I get . When and , this is just , since and has to be the identity function. But I wanted ...
Seemingly relatedly, for my application, I do want a map that gives me an -action for everything in the image of . When I chose to be (using my "full image" idea), this was immediate, but for , this isn't the case...
Since the full image idea does work but just feels a bit ad-hoc, maybe I should frame the question differently. The full image category on (given a monoid homomorphism ) is a full subcategory of . Is it possible that the inclusion has a left adjoint ? If so, then my original adjunction will just be the following composite of adjunctions:
![]()
My eyes go blurry when I see a wall of symbols like that; for me at least it's better if you instead, or also, say in words what you're thinking. For example why did you "want" R(L(X) = S X?
Sorry, right - I was writing the symbols to record my thoughts, but maybe it's not so human-readable. :) Maybe the following message is the better one for reading - I want a map for whatever the right adjoint is.
With my full image idea, this is immediate, since just gets the carrier of (what I've been writing ). But with , I no longer have this (unless the monoid is commutative to begin with or something, which I certainly don't want to assume).
The full-subcategory idea "smells right" to me for my application - I'm really working in type theory, and it would make lots of sense if my construction was just a reflector/modality applied to the free -set...
Yesterday I thought I had pierced the veil and figured out what you were trying to do. Now I no longer know what you're trying to do, and I'd probably only understand it if you gave a complete new description, not just corrections like "I used to want this, and now I want this".
Other readers, younger and more focused on what you're doing, may not have my problem!
I also thought what you suggested was the right solution, but realized upon studying this adjunction more that it's not quite what I'm looking for. Let me try to give a fresh description of the problem:
I have two monoids, and , along with a monoid homomorphism . (Typically for me, with addition and is arbitrary functions with composition.)
I'm interested in viewing the free -set as an -set, which I can do since (in my cases of interest) I have an -action structure on , written . I'm working in a type theory whose semantics lets me choose a pair of adjoint functors , and I want it to be the case that objects of come equipped with an -action, viewable through as maps for all .
Because of this last condition (which I was so used to when I posed my earlier question that I didn't even think to mention it, sorry!), it seems like I should choose my category to have objects being -sets and let genuinely extract the carrier of an -set.
If I let be the category of -sets, though, the left adjoint to will be the free -set, but I only care about the free -set! And for type theory-esque reasons, I can only pick a single adjunction. So, my idea is to let have objects be -sets, but have a morphism from be a morphism of -sets from (this is the [[full image]] category of ).
With this in mind, I'm set. The free -set functor is genuinely left adjoint to : since the maps of only preserve -set structure and thus the "free-ness" is successfully only with respect to the -set structure, the notion of free is what I want, . To prove this, I only need the mildly odd condition connecting the monoid homomorphism and the action that .
The question is, though, whether this can be recovered out of more elementary parts. , , and all have tons of structure: there are
My best guess (based on domain-specific intuition) for what might happen is that the inclusion functor from the full image category might have a left adjoint :
Harrison Grodin said:
Is it possible that the inclusion has a left adjoint ? If so, then my original adjunction will just be the following composite of adjunctions:
That would be great, since it would render this "full image" business as just the category of algebras for the idempotent monad . And then my construction would just be , applying this elusive to the free -set in such a way that its carrier remains .
So: I'd be very happy if I could find this left adjoint ! If that doesn't exist, maybe this construction I'm interested in can come out of some other composite of adjoints or something, but I feel less certain about where to look...
(Thanks for going through this, btw - I appreciate your time and thoughts!)