Let f:M→Nf:M\to N be a . The kernel of ff is

ker⁡(f)={m∈M:f(m)=0}.\ker(f)=\{m\in M: f(m)=0\}.

It is a , as recorded in .

Kernels measure injectivity: ff is injective iff ker⁡(f)=0\ker(f)=0. They also define the notion of exactness (see , where kernels match images).

Examples
  • For f:Z2→Zf:\mathbb Z^2\to\mathbb Z given by f(a,b)=a+bf(a,b)=a+b, one has ker⁡(f)={(t,−t):t∈Z}\ker(f)=\{(t,-t):t\in\mathbb Z\}.
  • For f:Z→Zf:\mathbb Z\to\mathbb Z given by f(n)=knf(n)=kn, the kernel is 00 if k≠0k\ne 0 and all of Z\mathbb Z if k=0k=0.
  • (Edge case) If N=0N=0, then ker⁡(f)=M\ker(f)=M for every f:M→0f:M\to 0.