ConceptComplete

Kernel and Cokernel

Kernels and cokernels are the categorical generalizations of null spaces and quotients. In a preadditive category, the kernel of ff is the equalizer of ff and 00, and the cokernel is the coequalizer. They are the fundamental building blocks of exact sequences and homological algebra.


Definitions

Definition3.6Kernel

In a preadditive category, the kernel of a morphism f:A→Bf : A \to B is a morphism ι:K→A\iota : K \to A such that f∘ι=0f \circ \iota = 0 and for every g:X→Ag : X \to A with f∘g=0f \circ g = 0, there exists a unique gˉ:X→K\bar{g} : X \to K with ι∘gˉ=g\iota \circ \bar{g} = g.

ker⁡f=eq(f,0:A→B)\ker f = \mathrm{eq}(f, 0 : A \to B)

Definition3.7Cokernel

The cokernel of f:A→Bf : A \to B is a morphism π:B→C\pi : B \to C such that π∘f=0\pi \circ f = 0 and for every h:B→Yh : B \to Y with h∘f=0h \circ f = 0, there exists a unique hˉ:C→Y\bar{h} : C \to Y with hˉ∘π=h\bar{h} \circ \pi = h.

coker f=coeq(f,0:A→B)\mathrm{coker}\, f = \mathrm{coeq}(f, 0 : A \to B)

Definition3.8Image and Coimage

For a morphism f:A→Bf : A \to B in an abelian category:

  • The image is im f=ker⁡(coker f)↣B\mathrm{im}\, f = \ker(\mathrm{coker}\, f) \rightarrowtail B.
  • The coimage is coim f=coker(ker⁡f):A↠coim f\mathrm{coim}\, f = \mathrm{coker}(\ker f) : A \twoheadrightarrow \mathrm{coim}\, f.

In an abelian category, the canonical map coim f→im f\mathrm{coim}\, f \to \mathrm{im}\, f is an isomorphism.


Examples

ExampleKernel and cokernel in R-Mod

In R-ModR\text{-}\mathbf{Mod}, for f:M→Nf : M \to N:

  • ker⁡f={m∈M:f(m)=0}\ker f = \{m \in M : f(m) = 0\} with the inclusion ker⁡f↪M\ker f \hookrightarrow M.
  • coker f=N/im f\mathrm{coker}\, f = N / \mathrm{im}\, f with the projection N↠N/im fN \twoheadrightarrow N / \mathrm{im}\, f.
  • im f=f(M)⊆N\mathrm{im}\, f = f(M) \subseteq N.
ExampleKernel in Ab

In Ab\mathbf{Ab}, the kernel of f:A→Bf : A \to B is the usual kernel subgroup ker⁡f=f−1(0)\ker f = f^{-1}(0). The cokernel is B/f(A)B / f(A).

ExampleKernel of a matrix

In Vectk\mathbf{Vect}_k, the kernel of a linear map T:V→WT : V \to W represented by a matrix AA is the null space ker⁡A={v:Av=0}\ker A = \{v : Av = 0\}. The cokernel is W/col(A)W / \mathrm{col}(A), and im T=col(A)\mathrm{im}\, T = \mathrm{col}(A).

ExampleKernel of a chain map

In Ch(A)\mathbf{Ch}(\mathcal{A}), the kernel of f∙:A∙→B∙f_\bullet : A_\bullet \to B_\bullet is computed degreewise: (ker⁡f)n=ker⁡(fn:An→Bn)(\ker f)^n = \ker(f^n : A^n \to B^n). The differentials on ker⁡f\ker f are the restrictions of the differentials on A∙A_\bullet.

ExampleCokernel in the category of sheaves

In Sh(X)\mathbf{Sh}(X), the cokernel of f:F→Gf : \mathcal{F} \to \mathcal{G} is the sheafification of the presheaf U↦G(U)/f(F(U))U \mapsto \mathcal{G}(U) / f(\mathcal{F}(U)). The presheaf cokernel is not always a sheaf, so sheafification is necessary.

ExampleKernel in a poset: no kernels in general

Poset categories (viewed as preadditive with trivial abelian group structure) generally do not have kernels or cokernels, since the zero morphism condition has no meaning. Kernels and cokernels are meaningful only in preadditive (enriched over Ab) categories.

ExampleNormal monomorphisms

In an abelian category, every monomorphism ι:K↣A\iota : K \rightarrowtail A is a kernel of some morphism — specifically, it is the kernel of its cokernel: ι=ker⁡(coker ι)\iota = \ker(\mathrm{coker}\, \iota). Such monomorphisms are called normal. In Grp\mathbf{Grp}, only inclusions of normal subgroups are normal monomorphisms.

ExampleRank-nullity as kernel-cokernel

For a linear map T:V→WT : V \to W in Vectkfd\mathbf{Vect}_k^{\mathrm{fd}}, dim⁡V=dim⁡(ker⁡T)+dim⁡(im T)\dim V = \dim(\ker T) + \dim(\mathrm{im}\, T) and dim⁡W=dim⁡(im T)+dim⁡(coker T)\dim W = \dim(\mathrm{im}\, T) + \dim(\mathrm{coker}\, T). This gives dim⁡V−dim⁡W=dim⁡(ker⁡T)−dim⁡(coker T)\dim V - \dim W = \dim(\ker T) - \dim(\mathrm{coker}\, T).

ExampleKernels and exact functors

A functor F:A→BF : \mathcal{A} \to \mathcal{B} between abelian categories is left exact if it preserves kernels (equivalently, preserves all finite limits). It is right exact if it preserves cokernels. It is exact if it preserves both.

ExampleHom is left exact

For any object AA in an abelian category, the functor Hom(A,−)\mathrm{Hom}(A, -) is left exact: it preserves kernels but not necessarily cokernels. The failure of right exactness leads to the Ext functor as the right derived functor.

ExampleTensor is right exact

The functor M⊗R−M \otimes_R - is right exact: it preserves cokernels but not necessarily kernels. The failure of left exactness leads to the Tor functor as the left derived functor.

ExampleCanonical factorization

In an abelian category, every morphism f:A→Bf : A \to B factors as:

A→πcoim f→∼im f→ιBA \xrightarrow{\pi} \mathrm{coim}\, f \xrightarrow{\sim} \mathrm{im}\, f \xrightarrow{\iota} B

where π\pi is an epimorphism, the middle map is an isomorphism, and ι\iota is a monomorphism. This is the canonical factorization of ff.


Properties

Theorem3.3Properties of kernels and cokernels

In an abelian category:

  1. ff is monic if and only if ker⁡f=0\ker f = 0.
  2. ff is epic if and only if coker f=0\mathrm{coker}\, f = 0.
  3. ff is an isomorphism if and only if ker⁡f=0\ker f = 0 and coker f=0\mathrm{coker}\, f = 0.
  4. ker⁡(coker(ker⁡f))=ker⁡f\ker(\mathrm{coker}(\ker f)) = \ker f and coker(ker⁡(coker f))=coker f\mathrm{coker}(\ker(\mathrm{coker}\, f)) = \mathrm{coker}\, f.
RemarkLooking ahead

Kernels and cokernels are the ingredients for defining exact sequences, which in turn are the subject matter of the Snake Lemma and Five Lemma.