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: theory: category theory

Topic: reflecting structure


view this post on Zulip Matteo Capucci (he/him) (Aug 25 2023 at 09:51):

Categories-with-structure can often be thought as pseudoalgebras of some 2-monad on Cat\bf Cat, whose maps preserve their structure (up to coherent iso). I wonder how to make sense of maps reflecting structure instead. Any idea?

view this post on Zulip James Deikun (Aug 25 2023 at 10:25):

I don't have an answer to this precise question off the top of my head, but there's a whole network of preservation theorems similar to the HSP theorem for different logical doctrines and some of them involve reflection of structure. Functors reflecting structure probably involve a categorified version of one of these doctrines.

view this post on Zulip Ralph Sarkis (Aug 25 2023 at 14:54):

What does it mean to reflect structure in general? I know about order-reflecting, but I can't wrap my head around what it would mean for a function to reflect a binary operation (say, of a monoid).

view this post on Zulip Matteo Capucci (he/him) (Aug 25 2023 at 15:35):

Well uhm good question... In general it seems to mean that if C and D both have Xs, then F:CDF:C \to D reflects them when an X for F(c) in D is actually given by F(c'), where c' is X of c in C.

So for a monoidal structure... I guess it just means preserving? Because there is at most one c1c2c_1 \otimes c_2 and thus we are asking for F(c1)F(c2)F(c_1)\otimes F(c_2) to be F(c1c2)F(c_1 \otimes c_2).

Also in general one talks about reflecting structure between categories which might not have all that structure... So you can have a limit-reflecting functor landing in a category with not so many limits.

view this post on Zulip Mike Shulman (Aug 25 2023 at 20:26):

For sets with structure, we can say that a function f:XYf:X\to Y preserves some nn-ary relations RR and SS when f!(R)Sf_!(R) \subseteq S, or equivalently Rf(S)R \subseteq f^*(S). If RR and SS are graphs of (n1)(n-1)-ary operations, that's are equivalent to saying that ff commutes with those operations.

Dually, we could say that it reflects it if f(S)Rf^*(S) \subseteq R, or equivalently Sf(R)S\subseteq f_*(R). In the graph case I think that's a bit weaker than saying that ff commutes with the operations; in the case of a binary operation it says that if f(x)f(y)=f(z)f(x) \otimes f(y) = f(z) then z=xyz = x \otimes y, but doesn't assert that the image of ff is closed under the operation.

To categorify that, I guess we'd have to replace relations with spans or fibrations or something.