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: learning: questions

Topic: transporting structure across an adjunction


view this post on Zulip David Egolf (Dec 03 2023 at 18:48):

Let us assume we have an adjunction FGF \dashv G where F:CDF: C \to D and G:DCG: D \to C. Then, for each object cCc \in C and object dDd \in D we have an isomorphism in Set\mathsf{Set}: D(Fc,d)C(c,Gd)D(Fc, d) \cong C(c, Gd).

Our adjunction has already told us about some structure in CC in terms of structure in DD. That is, we have learned that the set C(c,Gd)C(c,Gd) of morphisms from cc to GdGd in CC is isomorphic to the set D(Fc,d)D(Fc, d).

view this post on Zulip David Egolf (Dec 03 2023 at 18:49):

I'm wondering if in some cases we can get more structure on the data of CC from structure in DD. For example, consider the case where d=F(c)d = F(c). Then we have an isomorphism in Set\mathsf{Set}: D(Fc,Fc)C(c,GFc)D(Fc, Fc) \cong C(c, GFc). I notice in this case that D(Fc,Fc)D(Fc,Fc) supports more structure than that of a set. That is, D(Fc,Fc)D(Fc,Fc) can be turned into a monoid by using composition of the endomorphisms of FcFc.

view this post on Zulip David Egolf (Dec 03 2023 at 18:50):

I am curious if this monoid structure can be transported across the adjunction. To compose g:cGFcg: c \to GFc after f:cGFcf: c \to GFc we could maybe use this process:

(Here :C(c,GFc)D(Fc,Fc)\sharp: C(c, GFc) \cong D(Fc, Fc) and :D(Fc,Fc)C(c,GFc)\flat: D(Fc, Fc) \cong C(c, GFc) are inverse functions in Set\mathsf{Set}).

Do we actually get a monoid on C(c,GFc)C(c, GFc) in this way using the monoid structure on D(Fc,Fc)D(Fc,Fc)? I think we have an identity element, given by 1Fc:cGFc1_{Fc}^\flat: c \to GFc.

view this post on Zulip David Egolf (Dec 03 2023 at 18:50):

Note that for any f:cGFcf: c \to GFc, f1Fc=(f(1Fc))=(f1Fc)=(f)=ff \circ 1_{Fc}^\flat =( f^\sharp \circ (1_{Fc}^\flat)^\sharp)^\flat = (f^\sharp \circ 1_{Fc})^\flat = (f^\sharp)^\flat=f. We use the fact that \sharp and \flat are inverse functions in the last step.

We still need to check composition is associative. That is, do we have (gf)h=g(fh)(g \circ f) \circ h = g \circ (f \circ h) for arbitrary g,f,h:cGFcg,f,h:c \to GFc?

So, I think that the monoid structure on D(Fc,Fc)D(Fc, Fc) induces a monoid structure on C(c,GFc)C(c, GFc), thanks to our adjunction.

view this post on Zulip David Egolf (Dec 03 2023 at 18:50):

I'm curious if this can be generalized. Consider again a bijection provided by our adjunction: D(Fc,d)C(c,Gd)D(Fc, d) \cong C(c, Gd). Let us imagine the case where D=AbD = \mathsf{Ab}, the category of commutative groups, and where C=SetC = \mathsf{Set}. We can take F:SetAbF: \mathsf{Set} \to \mathsf{Ab} to be the functor that sends a set to the free commutative group on that set, and G:AbSetG: \mathsf{Ab} \to \mathsf{Set} to be the forgetful functor the sends a commutative group to its underlying set.

In this setting, our adjunction tells us Ab(Fc,d)Set(c,Gd)\mathsf{Ab}(Fc, d) \cong \mathsf{Set}(c, Gd). Now, the category Ab\mathsf{Ab} is special in that every hom-set is also a commutative group. Can we use a similar procedure as described above to induce a commutative group structure on Set(c,Gd)\mathsf{Set}(c, Gd)?

More generally, for an adjunction FGF \dashv G with F:CDF: C \to D and G:DCG: D \to C, if the hom-sets in DD have some additional structure, when can that additional structure be transferred to the corresponding hom-sets in CC?

view this post on Zulip Todd Trimble (Dec 03 2023 at 19:27):

I have only a few seconds to write this down, but in this regard, you might enjoy reading up on the Kleisli category construction, specifically composition of Kleisli morphisms, which is closely connected to what you're bringing up.

view this post on Zulip Mike Shulman (Dec 03 2023 at 19:29):

Another quick comment is that all mathematical structure can be transported across any isomorphism. So if you have an isomorphism XYX\cong Y and XX has some structure, whether it's a monoid or an abelian group or a topological space or what-have you, then you can transport it across that isomorphism to give YY the same structure. In particular, therefore, you can do this when XX and YY are hom-sets and the isomorphism comes from an adjunction.