In algebra, the kernel of a homomorphism (function that preserves the structure) is generally the inverse image of 0 0 0 (except for groups whose operation is denoted multiplicatively, where the kernel is the inverse image of 1 1 1). An important special case is the kernel of a linear map. The kernel of a matrix, also called the null space, is the kernel of the linear map defined by the matrix.

The kernel of a homomorphism is reduced to 0 0 0 (or 1 1 1) if and only if the homomorphism is injective, that is if the inverse image of every element consists of a single element. This means that the kernel can be viewed as a measure of the degree to which the homomorphism fails to be injective.

For some types of structure, such as abelian groups and vector spaces, the possible kernels are exactly the substructures of the same type. This is not always the case, and, sometimes, the possible kernels have received a special name, such as normal subgroup for groups and two-sided ideals for rings.

Kernels allow defining quotient objects (also called quotient algebras in universal algebra, and cokernels in category theory). For many types of algebraic structure, the fundamental theorem on homomorphisms (or first isomorphism theorem) states that image of a homomorphism is isomorphic to the quotient by the kernel.

The concept of a kernel has been extended to structures such that the inverse image of a single element is not sufficient for deciding whether a homomorphism is injective. In these cases, the kernel is a congruence relation.

This article is a survey for some important types of kernels in algebraic structures.

Contents

• 1 Survey of examples
• • 1.1 Linear maps
  • 1.2 Group homomorphisms
  • • 1.2.1 Example
  • 1.3 Ring homomorphisms
  • 1.4 Monoid homomorphisms
• 2 Universal algebra
• • 2.1 General case
  • 2.2 Malcev algebras
• 3 Algebras with nonalgebraic structure
• 4 Kernels in category theory
• 5 See also
• 6 Notes
• 7 References

1 Survey of examples

1.1 Linear maps

Main article: Kernel (linear algebra)

Let V V V and W W W be vector spaces over a field (or more generally, modules over a ring) and let T T T be a linear map from V V V to W W W. If 0 W 0_W 0W​ is the zero vector of W W W, then the kernel of T T T is the preimage of the zero subspace { 0 W 0_W 0W​}; that is, the subset of V V V consisting of all those elements of V V V that are mapped by T T T to the element 0 W 0_W 0W​. The kernel is usually denoted as k e r   T ker \ T ker T, or some variation thereof:
ker ⁡ T = { v ∈ V : T ( v ) = 0 W } . {\displaystyle \ker T=\{\mathbf {v} \in V:T(\mathbf {v} )=\mathbf {0} _{W}\}.} kerT={v∈V:T(v)=0W​}.
Since a linear map preserves zero vectors, the zero vector 0 V 0_V 0V​ of V V V must belong to the kernel. The transformation T T T is injective if and only if its kernel is reduced to the zero subspace.

The kernel k e r   T ker \ T ker T is always a linear subspace of V V V. Thus, it makes sense to speak of the quotient space V / ( k e r   T ) V/(ker \ T) V/(ker T). The first isomorphism theorem for vector spaces states that this quotient space is naturally isomorphic to the image of T T T (which is a subspace of W W W). As a consequence, the dimension of V V V equals the dimension of the kernel plus the dimension of the image.

If V V V and W W W are finite-dimensional and bases have been chosen, then T T T can be described by a matrix M M M, and the kernel can be computed by solving the homogeneous system of linear equations M v = 0 Mv = 0 Mv=0. In this case, the kernel of T T T may be identified to the kernel of the matrix M M M, also called “null space” of M M M. The dimension of the null space, called the nullity of M M M, is given by the number of columns of M M M minus the rank of M M M, as a consequence of the rank–nullity theorem.

Solving homogeneous differential equations often amounts to computing the kernel of certain differential operators. For instance, in order to find all twice-differentiable functions f f f from the real line to itself such that
x f ′ ′ ( x ) + 3 f ′ ( x ) = f ( x ) , {\displaystyle xf''(x)+3f'(x)=f(x),} xf′′(x)+3f′(x)=f(x),
let V V V be the space of all twice differentiable functions, let W W W be the space of all functions, and define a linear operator T T T from V V V to W W W by
( T f ) ( x ) = x f ′ ′ ( x ) + 3 f ′ ( x ) − f ( x ) {\displaystyle (Tf)(x)=xf''(x)+3f'(x)-f(x)} (Tf)(x)=xf′′(x)+3f′(x)−f(x)
for f f f in V V V and x x x an arbitrary real number. Then all solutions to the differential equation are in k e r   T ker \ T ker T.

One can define kernels for homomorphisms between modules over a ring in an analogous manner. This includes kernels for homomorphisms between abelian groups as a special case. This example captures the essence of kernels in general abelian categories; see Kernel (category theory).

1.2 Group homomorphisms

1.2.1 Example

1.3 Ring homomorphisms

1.4 Monoid homomorphisms

2 Universal algebra

2.1 General case

2.2 Malcev algebras

3 Algebras with nonalgebraic structure

4 Kernels in category theory

5 See also

6 Notes

7 References