Kernel (categorical)

In a pointed category, the kernel of f:A→B is the equalizer of f and the zero morphism A→B.
Kernel (categorical)

Kernels are a categorical version of “solutions of f(x)=0f(x)=0”, defined using universal properties.

Throughout, assume C\mathcal C is a with a zero object (e.g. any ), so that for any objects A,BA,B there is a distinguished zero morphism 0A,B:AB0_{A,B}:A\to B.

Definition (Kernel)

Given a morphism f:ABf:A\to B in C\mathcal C, a kernel of ff is a morphism

k:KA k:K\to A

such that:

  1. fk=0K,Bf\circ k = 0_{K,B}, and
  2. (Universal property) for every morphism t:TAt:T\to A with ft=0T,Bf\circ t=0_{T,B}, there exists a unique morphism u:TKu:T\to K with ku=t. k\circ u = t.

Equivalently, k:KAk:K\to A is an of the parallel pair f,0A,B:ABf,0_{A,B}:A\rightrightarrows B.

A kernel, if it exists, is unique up to unique . In any category, kernels are (because equalizers are monic).

Examples

  1. Ab\mathbf{Ab}. For a homomorphism f:ABf:A\to B of abelian groups, ker(f)A\ker(f)\subseteq A with inclusion ker(f)A\ker(f)\hookrightarrow A is the categorical kernel.

  2. RR-Mod\mathbf{Mod}. For an RR-linear map f:MNf:M\to N, the usual submodule {mM:f(m)=0}\{m\in M : f(m)=0\} with inclusion is the kernel.

  3. Grp\mathbf{Grp}. For a group homomorphism f:GHf:G\to H, the usual kernel {gG:f(g)=e}\{g\in G : f(g)=e\} with inclusion is the categorical kernel (here the zero morphism GHG\to H is the constant map to the identity element).