Zoran Skoda
split equalizer

(wiki note: here we use codecogs method for creating diagrams)

A fork

is split if it can be embedded into a diagram

in which se=id As e = id_A, tg=id Bt g = id_B and tf=est f = e s (we used here Leibniz order for composition of morphisms).

Surely, ff and gg can be interchanged in the definition (a matter of unimportant convention).

Every split fork is an absolute equalizer, but not conversely. See also split coequalizer.

Last revised on June 3, 2014 at 00:53:38. See the history of this page for a list of all contributions to it.