Let C\mathcal C be a and let f,g:A→Bf,g:A\to B be parallel in C\mathcal C.

An equalizer of ff and gg is a morphism e:E→Ae:E\to A such that:

  1. (Equalizing condition) f∘e=g∘ef\circ e = g\circ e,
  2. (Universal property) for any morphism h:X→Ah:X\to A with f∘h=g∘hf\circ h=g\circ h, there exists a unique morphism u:X→Eu:X\to E such that
    e∘u=h.e\circ u = h.
Equivalent characterizations

Equivalently, e:E→Ae:E\to A is universal among arrows into AA on which ff and gg agree:

Rendered tikz-cd diagram

with f∘e=g∘ef\circ e=g\circ e and f∘h=g∘hf\circ h=g\circ h.

Remarks

An equalizer (when it exists) is a special case of a .

Properties
  • The equalizer morphism e:E→Ae:E\to A is always a : it is “injective” in the categorical sense.
  • In an , the equalizer of f,gf,g can be identified with a :
    Eq(f,g)  ≅  ker⁡(f−g).\mathrm{Eq}(f,g)\;\cong\;\ker(f-g).
Examples
  1. Set\mathbf{Set}. If f,g:A→Bf,g:A\to B are functions, the equalizer is the subset
    E={a∈A∣f(a)=g(a)}⊆A,E=\{a\in A \mid f(a)=g(a)\}\subseteq A,
    with e:E↪Ae:E\hookrightarrow A the inclusion.
  1. Grp\mathbf{Grp}. For homomorphisms f,g:G→Hf,g:G\to H, the equalizer is the subgroup
    E={x∈G∣f(x)=g(x)}≤G,E=\{x\in G \mid f(x)=g(x)\}\le G,
    included into GG.
  1. Ab\mathbf{Ab} (or RR-Mod). For module homomorphisms f,g:M→Nf,g:M\to N, the equalizer is the submodule
    E=ker⁡(f−g)⊆M,E=\ker(f-g)\subseteq M,
    with the inclusion E↪ME\hookrightarrow M.