A split equalizer consists of and with , together with maps , satisfying , , and . If , these identities give , so is its unique factorization through . Thus it is an equalizer, and every functor preserves it: all the defining identities survive application of the functor. Interchanging gives the other orientation of the same convention.
For a monad , the map is a split equalizer of with retraction and splitting . The map is a split equalizer of with retraction and splitting . Each assertion follows from the two unit laws and naturality of the unit or multiplication. No assumption that preserves arbitrary equalizers is needed.
Articles by others on the same topic
There are currently no matching articles.