TOPICS
Search

Kernel


The kernel of a function f:A->B, where A is a set and B is a set with a distinguished element denoted by 0, is defined by

 Ker(f)={x:x in Asuch thatf(x)=0},

so the kernel gives the elements from the original set that are mapped to zero by the function. Ker(f) is therefore a subset of A. For a linear transformation, the kernel is also called the null space.

The related image of a function is defined by

 Im(f)={f(x):x in A}.

Im(f) is therefore a subset of B.

In a preadditive category, a kernel of a morphism f:A->B is a morphism i:K->A with fi=0 having the following universal property: for every morphism h:T->A satisfying fh=0, there is a unique morphism g:T->K such that h=ig. Here 0 denotes the zero element of the relevant hom-set. This definition does not require a zero object. The dual construction is the cokernel (The Stacks Project Authors 2026).


See also

Cokernel, Hom-Set, Image, Null Space, Preadditive Category, Rank-Nullity Theorem, Universal Property, Zero Morphism

Portions of this entry contributed by Rahmi Jackson

Explore with Wolfram|Alpha

References

The Stacks Project Authors. "Preadditive and Additive Categories." §12.3 in The Stacks Project, Tag 0106, 2026. https://stacks.math.columbia.edu/tag/0106.

Referenced on Wolfram|Alpha

Kernel

Cite this as:

Weisstein, Eric W., with contributions by Rahmi Jackson. "Kernel." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Kernel.html

Subject classifications