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: Categories of Abstract Relations


view this post on Zulip Chad Nester (Apr 16 2020 at 13:19):

Hello all. This is something I'm pretty interested in recently, and I'm slowly learning about the ways you can have a "category of relations". Maybe we can have a topic about them?

My more immediate motivation is that I'm reading about relations in regular categories (i.e., subobjects given by jointly monic spans), and I can't figure out how to prove that the relation given by (f,g)(f,g) is simple if and only if ff is monic. I feel like I am missing something obvious, and I wonder if anyone knows how this works? By simple I mean that R;R1R^\circ ; R \leq 1.

view this post on Zulip Morgan Rogers (he/him) (Apr 16 2020 at 13:22):

You need double $ to make TeX formatting work :+1:
Try drawing the pullback diagram + image factorisation that defines that composite

view this post on Zulip Chad Nester (Apr 16 2020 at 13:46):

Thanks for the formatting tip!

I understand that if ff is monic, then immediately we have that R;RR^\circ ; R is simple, but am still struggling with the other direction

view this post on Zulip Morgan Rogers (he/him) (Apr 16 2020 at 13:52):

"1" is the diagonal relation, right? So that if RRR^\circ R factors through it, both legs of this composite must be equal?