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.
@John Baez said:
Here's a theorem I learned yesterday from Tom Leinster. Take the definition of monoid written out using commutative diagrams, where the associative law becomes a commutative square. What's a monoid where this commutative square is a pullback? It's a group.
I ran into this comment last week and decided to prove the theorem John mentions above without looking at Paolo's paper or looking up any of the stuff @Todd Trimble said about frobenius algebras, etc. It was a lot of fun, and I am happy to say I have worked pretty diligently at correctness, unlike my usual mistake-filled posts. I'm including it here in case anyone feels like giving feedback on proofs, proof writing, etc. or even just style.
That is no small investment of time! So I won't be offended if this just sits here; this was its own reward.
Here we prove a theorem, the result of which was relayed by Tom Leinster. (Baez, 2023) Specifically that a monoid object internal to a category is a group object when its association square is a pullback. Our proof proceeds by exploiting a symmetry of the pullback diagram.
Recall for a monoidal category with finite product and zero object its identity, the Lawvere syntax for a semigroup object is (MacLane, pp. 4, 170)
is further a monoid when there exists obeying
Where recall .
If equation (1) associativity, is a pullback square (MacLane p. 71), recall that any with morphisms to gives a unique morphism :
This pullback diagram has a symmetry. Making this explicit defines a dual morphism :
Diagram 1. The universal property of the pullback (to Left) implies a duality (to Right).
Even if the monoid is commutative, the fibration is not, so we uniquely determine a dual by applying an automorphic functor . We swap the positions of with respect to the only other asymmetric components of (1L): . The result is that duals , and are determined by universal property of the pullback, and only those morphisms and objects depending on are swapped by . Swapping twice returns us to the original diagram, so
Observing of left/right projections, that
and vice versa for , we expect to distill the adjointness between into their common factor, the middle-projection . An involution of capturing this duality for must satisfy
if it exists.
We will exhibit a global by considering
By eq (2) the monoid identity, the final product at is just the image of and the pullback square applies, so the common factor will be relevant to any generalized element of . WLOG we consider the commuting triangle involving . By the universal property of the product, we can factor out of the fibration on the right.
Recalling eq (4) the constraints for , we define
and observe We refactor, distributing over :
.
We invoke the unique morphism , recovering the standard syntactic diagram for the inversion morphism of a group object, shown in diagram (4), lower right. An analogous argument using proves the same for multiplication of inversion on the left. We remark with pleasure how the existence of an involution on is reflected by the Yoneda lemma, in the -symmetry of this pullback diagram.
References
Thank you for reading!
I will try to read this later, but I see that you are using the universal property of the product while it seems from the original thread that this result holds in any monoidal category.
Also, did you first try to prove it in the category ? I think there is a very short proof (2-3 lines), but I don't know if it can be generalized. (Sometimes proving things using the intuition in is a good idea, sometimes it is not.)
Oh great point on monoidal product! Lawvere theories involve (finite) product preserving functors from a 'syntactic category', and I just used that. Except that I call a monoidal category, which is sloppy. I'll review how MacLane handles this, but IIRC the monoid object construction works in any monoidal category, so then its just a question of "can you have this kind of pullback?". It seems this particular pullback square can't be established for monoid objects in for instance because there aren't enough abelian group homomorphisms to specify all the multiplicative inverses in a field... which is comforting because isn't a group homomorphism over addition! :)
The first thing I did is try to disprove it in , actually. I used the cancellative monoid which is where the comment "even if the monoid is commutative, the fibration is not" comes from. It clarified how the pullback relates to inverses. If I were being more pedagogical I'd have included that, and maybe should have anyway. Essentially, component-wise
so acts as an adjoint between the two coordinates; . The dual then swaps the coordinate position relative to the and you have exactly s it should be for the inverse.
For now I'll just claim to have proved this for categories with finite universal products , and will come back to the monoidal category question once any ither objections have been resolved.
Ralph Sarkis said:
I will try to read this later
Sorry, but there are several mistakes from the start which make it hard for me to follow.
Eric M Downes said:
dual morphism
Duality refers to reversing the direction of arrows (going from to ), so I would not use this word here, nor this notation. Maybe writing and is enough. You might say this will be weird to define a functor, but see my third comment.
the fibration is not
What is the fibration?
automorphic functor
This is not a well-defined operation. First, you have only defined this functor on morphisms that arise as for some , what does it do on other morphisms ? Moreover, if also makes that pullback diagram commute for and , is it possible that the two "duals" you have defined are different ? Using my notation, maybe but , so could be two different things (or even more).
Let me give you the solution for that you may want to adapt (I haven't thought about this generalization too much).
Solution in Set
Thanks for engaging Ralph!
Ralph Sarkis said:
Duality refers to reversing the direction of arrows
Thanks! I didn't know that dual always meant "op" now! (FWIW [[dual]] was/is used widely in algebra, geometry, and physics etc. as something like " are dual" " is the image of under an involution" but I am happy to change this; my audience is CTists after all!)
Maybe writing and is enough.
Yep, I like that. Keep It Simple. :)
What is the fibration?
I was thinking of as a fibration and so has a different "pullback fibration" than .
What term would you use for " composes after differently than does"?
This is not a well-defined operation.
Totally fair! I had described it in words, but I can certainly define this precisely on morphisms with a \begin{cases}...
and show it is a functor explicitly.
Thanks again for your comments. I'll just edit the source, above, as reposting would be more annoying.
(As far as your solution in , thank you! I'll certainly look at it. But at least at this point I still maintain that my proof is correct; right now I am just seeing a failure to communicate on my part, which is important and I want to fix. So thank you again for engaging.)
Ralph Sarkis said:
I will try to read this later, but I see that you are using the universal property of the product while it seems from the original thread that this result holds in any monoidal category.
Also, did you first try to prove it in the category ? I think there is a very short proof (2-3 lines), but I don't know if it can be generalized. (Sometimes proving things using the intuition in is a good idea, sometimes it is not.)
There's a general principle that for any statement that can be expressed in the language of limits, which applies in this case, the statement is true iff it holds in the category of sets. The idea is that the Yoneda embedding preserves and reflects limits, i.e., for any category in which the statement is interpreted, the collection of representable functors
jointly preserves and reflects limits, so verification in sets suffices. This can be seen as a basic "completeness theorem".
(Sorry, I was interpreting this in the cartesian monoidal case. But the principle seems worth pointing out anyway.)
Todd Trimble said:
There's a general principle that for any statement that can be expressed in the language of limits, which applies in this case, the statement is true iff it holds in the category of sets.
That is fascinating, thank you! This seems closely related to the correspondence between algebraic theories of and functors from the category of 's to , but more general. If there is a phrase / theorem for this, I will add it to my reading list.
It sounds like a [[concrete category]] (although I was recommended recently not to think as much in terms of concreteness, as its not as broadly useful a concept.)
Anyway, back to specifying my alleged-functor that is a -action on the pullback diagram for Ralph. I think it may be more parsimonious just to swap so I need to specify all the diagrams that tell us "wether or not".
Okay, good news I was able to simplify everything; we don't need a functor or even a group-action by . Womp-womp news is that the proof (updated above) reduces to something that really is obviously set theory in disguise, as Todd was implying.
And yeah, the difference with Ralph's proof is pretty minimal. I take my source object as itself instead of but the effect is the same, to get pairs .