Math equation demo

From PKC
Revision as of 16:16, 28 June 2021 by Admin (talk | contribs)
Jump to navigation Jump to search

In more explicit terms, the equaliser consists of an object E and a morphism eq : EX satisfying , and such that, given any object O and morphism m : OX, if , then there exists a unique morphism u : OE such that .


A morphism is said to equalise and if .[1]

  1. Barr, Michael; Wells, Charles (1998). Category theory for computing science (PDF). p. 266. Archived from the original (PDF) on 2016-03-04. Retrieved 2013-07-20.  Unknown parameter |url-status= ignored (help)