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.
I am looking for a reference that states that if you have a strong monoidal functor F : A → B between monoidal categories, then if M is a monoid object in A, then FM is a monoid object in B and if a : M × A → A is a monoid action in A, then Fa ∘ μ, where μ : FA ⊗ FB → F(A ⊗ B), is a monoid action in B.
Having only a lax functor is sufficient. It is explained in the case of monoids for example in section 6.2 of Categorical semantics of linear logic by Paul-André Melliès.
Thanks for the reference. It does not seem to deal with monoid actions though. Also, I think you need the functor to be strong monoidal to preserve monoid actions.
Lax monoidal functors preserve monoid actions. One explanation is that a lax monoidal functor between monoidal categories is the same as a map between their underlying multicategories (and monoids as well as monoid actions live in multicategories). This correspondence appears as Example 2.1.10 in Tom Leinster's book Higher Operads, Higher Categories.
I don't think I can get away with that explanation at my current level of understanding. Proving part of the associativity of the action requires going from FM ⊗ (FM ⊗ FA) → FM ⊗ FA and I don't see how you can argue this without invoking μ⁻¹.
You can prove the associativity of the image of an action in exactly the same way you prove associativity of the image of a monoid itself, just using the three objects M,M,A instead of the three objects M,M,M.
Hmm... I guess I can use associativity of ⊗ first, combine FM ⊗ FM using μ, and then end up with FM ⊗ FA.
building the two morphisms doesn't require using though, you just use the lax structure morphisms of either on or
OK, I'm convinced that it's enough with F being lax.
I wanted to quote a reference, but I guess I can just say "(exercise for the reader)".
There has got to be a reference somewhere that not only states these results but proves them! I'm in favor of citing references with proofs even if the proofs are "well-known", because nobody knows all "well-known" results.
Unfortunately while Categories For The Working Mathematician defines lax monoidal functors (which Mac Lane calls simply "monoidal functors"!) and monoids in monoidal categories, it doesn't seem to state the facts we're talking about, not even that lax monoidal functors send monoids to monoids.
John Baez said:
Unfortunately while Categories For The Working Mathematician defines lax monoidal functors (which Mac Lane calls simply "monoidal functors"!)
That terminology is pretty common in older literature particularly.
Another place one might look for "standard facts" is Borceux's 3-volume handbook, but I forget how much he says about monoidal categories and I've run out of energy for looking up references.
I just checked Vol. 1 and 2 - there is nothing about monoidal functors. I doubt Vol. 3 would have anything in this regard given that it's about sheaf theory.
Okay, thanks. There should be a good reference book on monoidal categories that proves these basic facts, but I don't know if it exists yet!
I thought Tholen's book Monoidal Topology would have it, but it does not talk about monoidal functors weirdly enough.
The massive book Monoidal functors, species and Hopf algebras states and proves that lax monoidal functors preserve monoids in Proposition 3.29.
They do it the slick way, by observing that a monoid in a monoidal category can be identified with a lax monoidal functor and post-composing.
Oh, great! I like that book. So there's a good reference... just remember to point out the actual proposition number so readers don't need to look through the whole book. :wink:
I will check that book out. Thanks.
I don't know if that book tackles your other question: whether lax monoidal functors preserve monoid actions. Please let me know if you find out!
I had a look. Unfortunately, it does not have the result about preserving monoid actions.
Can you instantiate Lemma 3.3.7 in Actegories for the Working Amthematician to get what you want?
Ralph Sarkis said:
Can you instantiate Lemma 3.3.7 in Actegories for the Working Amthematician to get what you want?
Oh, that's interesting. It says "Any action of a monoid M on a set X is a 'discrete actegory', but it does not deal with the general case of monoid actions in a monoidal category.
Maybe you could find references for the following points and piece it together from them:
Of course another approach is to write a little appendix proving the results you need, so future generations can cite it!
I think it's really helpful to turn "folklore" into citable propositions with numbers like Prop. 39. When I do this, I admit that the results are well-known (by those who know them well).