Category Theory
Zulip Server
Archive

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.


Stream: practice: communication

Topic: Proof: the associativity square is a pullback => monoid i...


view this post on Zulip Eric M Downes (Jun 29 2024 at 04:08):

@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 C\sf C with finite product ×\times and zero object 00 its identity, the Lawvere syntax for a semigroup object MC0M\in {\sf C}_0 is (MacLane, pp. 4, 170)

(1)      μ(idM×μ)=μ(μ×idM):M3M(1)~~~~~~\mu\circ(id_M\times\mu)=\mu\circ(\mu\times id_M):M^3\to M

MM is further a monoid when there exists η:0M\eta:0\to M obeying

(2)      μ(idM×η)=μ(η×idM)=idM:MM(2)~~~~~~\mu\circ(id_M\times\eta)=\mu\circ(\eta\times id_M)=id_M:M\to M

Where recall 0×MMM×00\times M\cong M\cong M\times 0.

If equation (1) associativity, is a pullback square (MacLane p. 71), recall that any LC0L\in{\sf C}_0 with morphisms to M2M^2 gives a unique morphism ω\omega:

(3)     LC0, α,β:LM2(3)~~~~~\forall L\in{\sf C}_0,~\forall\,\alpha,\beta:L\to M^2
     μα=μβ    !ω:LM3~~~~~\mu\circ\alpha=\mu\circ\beta\implies\exists! \,\omega:L\to M^3
     α=(μ×idM)ω     β=(idM×μ)ω~~~~~\alpha=(\mu\times id_M)\circ \omega~~~~~\beta=(id_M\times\mu)\circ \omega

This pullback diagram has a symmetry. Making this explicit defines a dual morphism ω\omega^*:

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 ω\omega^* by applying an automorphic functor ^*. We swap the positions of α,β:LM2\alpha,\beta:L\to M^2 with respect to the only other asymmetric components of (1L): μ×idM, idM×μ\mu\times id_M,~id_M\times\mu. The result is that duals α:=β, β:=α\alpha^*:=\beta,~ \beta^*:=\alpha, and ω\omega^* are determined by universal property of the pullback, and only those morphisms and objects depending on α,β,ω\alpha,\beta,\omega are swapped by ^*. Swapping twice returns us to the original diagram, so

ω=ω\omega^{**}=\omega

Observing of left/right projections, that
πLβ=πLω, πRα=πRω\pi_L\circ\beta=\pi_L\circ\omega, ~\pi_R\circ\alpha=\pi_R\circ\omega
and vice versa for ω\omega^*, we expect to distill the adjointness between α,β\alpha,\beta into their common factor, the middle-projection πCω\pi_C\circ\omega. An involution of MM capturing this duality for (ω,ω)(\omega,\omega^*) must satisfy

(4)      ξω:MM;    ξωπCω=πCω(α,β)    ξωξω=idM(4)~~~~~~\xi_\omega:M\leadsto M;~~~~\xi_\omega\circ\pi_C\circ\omega^*=\pi_C\circ\omega(\alpha,\beta)~~~~\xi_\omega^*\circ\xi_\omega=id_M
if it exists.

Dia. 2. Factoring the pullback UP morphism ω\omega of the constant η\eta yields the inverse ξ\xi, proving the monoid MM a group.

ω\omega of the constant η\eta yields the inverse ξ\xi, proving the monoid MM a group.">

We will exhibit a global ξ\xi by considering
L=M, α=idM×η, β=η×idML=M,~\alpha=id_M\times\eta,~\beta=\eta\times id_M

By eq (2) the monoid identity, the final product at MM is just the image of idMid_M and the pullback square applies, so the common factor πCω(η,η)\pi_C\circ\omega(\eta,\eta) will be relevant to any generalized element of MM. WLOG we consider the commuting triangle involving η×idM\eta\times id_M. By the universal property of the product, we can factor idMid_M out of the fibration on the right.

η×idMη     μ×idMμ     ω(πL×πC)ω\eta\times id_M\mapsto \eta~~~~~\mu\times id_M\mapsto \mu~~~~~\omega\mapsto(\pi_L\times\pi_C)\circ\omega

Recalling eq (4) the constraints for ξω\xi_\omega, we define ξC1\xi\in{\sf C}_1

ξ:=πCω(η,η):MM\xi:=\pi_C\circ\omega(\eta,\eta):M\to M

and observe ω(η,η)=ω(η,η)    ξ=ξ\omega(\eta,\eta)^*=\omega(\eta,\eta) \implies \xi=\xi^* We refactor, distributing \circ over ×\times:

(πL×πC)ω(η,η)=(idM×ξ)Δ(\pi_L\times\pi_C)\circ\omega(\eta,\eta)=(id_M\times\xi)\circ\Delta.

We invoke the unique morphism M!0M\overset{!}{\to}0, recovering the standard syntactic diagram for the inversion morphism of a group object, shown in diagram (4), lower right. An analogous argument using idM×ηid_M\times\eta proves the same for multiplication of inversion on the left. We remark with pleasure how the existence of an involution on MM is reflected by the Yoneda lemma, in the C2C_2-symmetry of this pullback diagram. \square

References

Thank you for reading!

view this post on Zulip Ralph Sarkis (Jun 29 2024 at 07:26):

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 Set\mathbf{Set} ? 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 Set\mathbf{Set} is a good idea, sometimes it is not.)

view this post on Zulip Eric M Downes (Jun 29 2024 at 13:00):

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 C\sf C 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 Ab\sf Ab for instance because there aren't enough abelian group homomorphisms α,β\alpha,\beta to specify all the multiplicative inverses in a field... which is comforting because ξ\xi isn't a group homomorphism over addition! :)

The first thing I did is try to disprove it in Set{\sf Set}, actually. I used the cancellative monoid (N,+,0)(\mathbb{N},+,0) 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
α(x,y)β(z,w)    ω(x,u,w)\alpha\mapsto(x,y)\land\beta\mapsto(z,w)\implies\omega\mapsto(x,u,w)
so uu acts as an adjoint between the two coordinates; xu=z,y=uwxu=z, y=uw. The dual ω\omega^* then swaps the coordinate position relative to the id×μid\times\mu and you have x=zu,uy=wx=zu^*, u^*y=w exactly s it should be for the inverse.

view this post on Zulip Eric M Downes (Jun 29 2024 at 13:46):

For now I'll just claim to have proved this for categories with finite universal products ×\times, and will come back to the monoidal category question once any ither objections have been resolved.

view this post on Zulip Ralph Sarkis (Jun 29 2024 at 15:06):

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.

view this post on Zulip Ralph Sarkis (Jun 29 2024 at 15:06):

Eric M Downes said:

dual morphism ω\omega^*

Duality refers to reversing the direction of arrows (going from C\mathsf{C} to Cop\mathsf{C}^{\mathrm{op}}), so I would not use this word here, nor this notation. Maybe writing ω=ωα,β\omega = \omega_{\alpha,\beta} and ω=ωβ,α\omega^* = \omega_{\beta,\alpha} 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 ω\omega for some α,β\alpha,\beta, what does it do on other morphisms ? Moreover, if ω\omega also makes that pullback diagram commute for α\alpha' and β\beta', is it possible that the two "duals" you have defined are different ? Using my notation, maybe ωα,β=ωα,β\omega_{\alpha,\beta} = \omega_{\alpha',\beta'} but ωβ,αωβ,α\omega_{\beta,\alpha} \neq \omega_{\beta',\alpha'}, so ω\omega^* could be two different things (or even more).

view this post on Zulip Ralph Sarkis (Jun 29 2024 at 15:20):

Let me give you the solution for Set\mathbf{Set} that you may want to adapt (I haven't thought about this generalization too much).

Solution in Set

view this post on Zulip Eric M Downes (Jun 29 2024 at 17:45):

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 "x,xx^*,x are dual" \sim "xx^* is the image of xx under an involution" but I am happy to change this; my audience is CTists after all!)

Maybe writing ω=ωα,β\omega = \omega_{\alpha,\beta} and ω=ωβ,α\omega^* = \omega_{\beta,\alpha} is enough.

Yep, I like that. Keep It Simple. :)

What is the fibration?

I was thinking of LML\to M as a fibration and so μ(μ×id)\mu\circ(\mu\times id) has a different "pullback fibration" than μ(id×μ)\mu\circ(id\times\mu).

What term would you use for "μ×idM\mu\times id_M composes after ω\omega differently than idM×μid_M\times\mu 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.

view this post on Zulip Eric M Downes (Jun 29 2024 at 17:50):

(As far as your solution in Set\sf Set, 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.)

view this post on Zulip Todd Trimble (Jun 29 2024 at 17:58):

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 Set\mathbf{Set} ? 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 Set\mathbf{Set} 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 CC in which the statement is interpreted, the collection of representable functors

CC(c,)SetC \overset{C(c, -)}{\longrightarrow} \mathsf{Set}

jointly preserves and reflects limits, so verification in sets suffices. This can be seen as a basic "completeness theorem".

view this post on Zulip Todd Trimble (Jun 29 2024 at 18:00):

(Sorry, I was interpreting this in the cartesian monoidal case. But the principle seems worth pointing out anyway.)

view this post on Zulip Eric M Downes (Jun 29 2024 at 19:23):

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 AA and functors from the category of AA's to Set\sf Set, but more general. If there is a phrase / theorem for this, I will add it to my reading list.

view this post on Zulip Eric M Downes (Jun 29 2024 at 19:33):

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 C2C_2-action on the pullback diagram for Ralph. I think it may be more parsimonious just to swap μ×idM,idM×μ\mu\times id_M,id_M\times\mu so I need to specify all the diagrams that tell us "wether C1fidM×μ\mathsf{C}_1\ni f\cong id_M\times\mu or not".

view this post on Zulip Eric M Downes (Jun 30 2024 at 06:26):

Okay, good news I was able to simplify everything; we don't need a functor or even a group-action by C2C_2. Womp-womp news is that the proof (updated above) reduces to something that really is obviously set theory in disguise, as Todd was implying.

view this post on Zulip Eric M Downes (Jun 30 2024 at 07:08):

And yeah, the difference with Ralph's proof is pretty minimal. I take my source object as MM itself instead of {}\set* but the effect is the same, to get pairs (g,1), (1,g)(g,1), ~(1,g).