In category theory and its applications to other branches of mathematics,[] kernels are a generalization of the kernels of group homomorphisms, the kernels of module homomorphisms and certain other kernels from algebra. Intuitively, the kernel of the morphismf : X → Y is the "most general" morphism k : K → X that yields zero when composed with f. Note that kernel pairs and difference kernels sometimes go by the name "kernel"; while related, these aren't quite the same thing and are not discussed in this article.
Definition
Let C be a category. In order to define a kernel in the general category-theoretical sense, C needs to have zero morphisms. In that case, if f : X → Y is an arbitrary morphism in C, then a kernel of f is an equaliser of f and the zero morphism from X to Y. In symbols: To be more explicit, the following universal property can be used. A kernel of f is an objectK together with a morphism k : K → X such that:
f∘k is the zero morphism from K to Y;
Given any morphism k′ : K′ → X such that f∘k′ is the zero morphism, there is a unique morphism u : K′ → K such that k∘u = k′.
Note that in many concrete contexts, one would refer to the object K as the "kernel", rather than the morphism k. In those situations, K would be a subset of X, and that would be sufficient to reconstruct k as an inclusion map; in the nonconcrete case, in contrast, we need the morphism k to describe howK is to be interpreted as a subobject of X. In any case, one can show that k is always a monomorphism. One may prefer to think of the kernel as the pair rather than as simply K or k alone. Not every morphism needs to have a kernel, but if it does, then all its kernels are isomorphic in a strong sense: if k : K → X and are kernels of f : X → Y, then there exists a unique isomorphism φ : K → L such that ∘φ = k.
The dual concept to that of kernel is that of cokernel. That is, the kernel of a morphism is its cokernel in the opposite category, and vice versa. As mentioned above, a kernel is a type of binary equaliser, or difference kernel. Conversely, in a preadditive category, every binary equaliser can be constructed as a kernel. To be specific, the equaliser of the morphisms f and g is the kernel of the differenceg − f. In symbols: It is because of this fact that binary equalisers are called "difference kernels", even in non-preadditive categories where morphisms cannot be subtracted. Every kernel, like any other equaliser, is a monomorphism. Conversely, a monomorphism is called normal if it is the kernel of some morphism. A category is called normal if every monomorphism is normal. Abelian categories, in particular, are always normal. In this situation, the kernel of the cokernel of any morphism turns out to be the image of that morphism; in symbols: When m is a monomorphism, it must be its own image; thus, not only are abelian categories normal, so that every monomorphism is a kernel, but we also know which morphism the monomorphism is a kernel of, to wit, its cokernel. In symbols:
Relationship to algebraic kernels
defines a notion of kernel for homomorphisms between two algebraic structures of the same kind. This concept of kernel measures how far the given homomorphism is from being injective. There is some overlap between this algebraic notion and the categorical notion of kernel since both generalize the situation of groups and modules mentioned above. In general, however, the universal-algebraic notion of kernel is more like the category-theoretic concept of kernel pair. In particular, kernel pairs can be used to interpret kernels in monoid theory or ring theory in category-theoretic terms.
