Re:Quiver: A Modern Commutative Diagram Editor
by sebmellen on Friday December 27, 2024 @03:02PM
(#42525531)
Thank you. Very clear and simple. I love math conceptually, but I wish there were more resources expressing these concepts in plain English!
Re:Quiver: A Modern Commutative Diagram Editor
by layer8 on Friday December 27, 2024 @04:50PM
(#42526377)
I wouldn’t say that the paths are equal. They are different paths, because they consist of different edges going through different nodes. It’s the composite end-to-end functions that result from the paths that are equal.
So n(g(f(•))), s(r(l(•))), s(m(f(•))) are all paths/function calls you could make to get from A to C'. Since the diagram is said to be commutative, those paths are all equal.
Being a monomoprishm, epimorphism, or isomorphism are all important properties of functions that say you're allowed to "cancel" on both sides of an equality. e.g. in general, if f(g(x))=f(h(x)), you can't conclude that g(x)=h(x). If f can be cancelled in that way, it's called a monomorphism. Similarly if g(f(x))=h(f(x)) lets you cancel the f to get g(x)=h(x), f is called an epimorphism. An isomorphism is both. This kind of thing let's you "walk backwards" along some paths in the diagram in certain situations.
One flavor of theorem you might see in category theory (like the example five lemma[0]) looks like "look at this diagram. if g is an epimorphism and h is a monomorphism then f is an isomorphism". So if I know I can cancel this way and that way, I learn I can cancel this other way.
[0] https://en.wikipedia.org/wiki/Five_lemma
> The five lemma states that, if the rows are exact, m and p are isomorphisms, l is an epimorphism, and q is a monomorphism, then n is also an isomorphism.