Kernel (algebra) 1

Kernel (algebra)
In the various branches of mathematics that fall under the heading of abstract algebra, the kernel of a
homomorphism measures the degree to which the homomorphism fails to be injective.[1] [2] An important special
case is the kernel of a matrix, also called the null space.
The definition of kernel takes various forms in various contexts. But in all of them, the kernel of a homomorphism is
trivial (in a sense relevant to that context) if and only if the homomorphism is injective. The fundamental theorem on
homomorphisms (or first isomorphism theorem) is a theorem, again taking various forms, that applies to the quotient
algebra defined by the kernel.
In this article, we first survey kernels for some important types of algebraic structures; then we give general
definitions from universal algebra for generic algebraic structures.

Survey of examples

Linear operators
Let V and W be vector spaces and let T be a linear transformation from V to W. If 0W is the zero vector of W, then the
kernel of T is the preimage of the singleton set {0W }; that is, the subset of V consisting of all those elements of V
that are mapped by T to the element 0W. The kernel is usually denoted as "ker T ", or some variation thereof:

Since a linear transformation preserves zero vectors, the zero vector 0V of V must belong to the kernel. The
transformation T is injective if and only if its kernel is only the singleton set {0V }.
It turns out that ker T is always a linear subspace of V. Thus, it makes sense to speak of the quotient space V /(ker T ).
The first isomorphism theorem for vector spaces states that this quotient space is naturally isomorphic to the image
of T (which is a subspace of W). As a consequence, the dimension of V equals the dimension of the kernel plus the
dimension of the image.
If V and W are finite-dimensional and bases have been chosen, then T can be described by a matrix M, and the kernel
can be computed by solving the homogeneous system of linear equations M v = 0. In this representation, the kernel
corresponds to the null space of M. The dimension of the null space, called the nullity of M, is given by the number
of columns of M minus the rank of 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 from the real line to itself such that
x f ''(x) + 3f '(x) = f (x),
let V be the space of all twice differentiable functions, let W be the space of all functions, and define a linear operator
T from V to W by
(T f )(x) = x f ''(x) + 3f '(x) - f (x)
for f in V and x an arbitrary real number. Then all solutions to the differential equation are in 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).
Kernel (algebra) 2

Group homomorphisms
Let G and H be groups and let f be a group homomorphism from G to H. If eH is the identity element of H, then the
kernel of f is the preimage of the singleton set {eH }; that is, the subset of G consisting of all those elements of G that
are mapped by f to the element eH . The kernel is usually denoted "ker f " (or a variation). In symbols:

Since a group homomorphism preserves identity elements, the identity element eG of G must belong to the kernel.
The homomorphism f is injective if and only if its kernel is only the singleton set {eG}.
It turns out that ker f is not only a subgroup of G but in fact a normal subgroup. Thus, it makes sense to speak of the
quotient group G /(ker f ). The first isomorphism theorem for groups states that this quotient group is naturally
isomorphic to the image of f (which is a subgroup of H).
In the special case of abelian groups, this works in exactly the same way as in the previous section.

Ring homomorphisms
Let R and S be rings (assumed unital) and let f be a ring homomorphism from R to S. If 0S is the zero element of S,
then the kernel of f is the preimage of the singleton set {0S}; that is, the subset of R consisting of all those elements
of R that are mapped by f to the element 0S. The kernel is usually denoted "ker f" (or a variation). In symbols:

Since a ring homomorphism preserves zero elements, the zero element 0R of R must belong to the kernel. The
homomorphism f is injective if and only if its kernel is only the singleton set {0R}.
It turns out that, although ker f is generally not a subring of R since it may not contain the multiplicative identity, it is
nevertheless a two-sided ideal of R. Thus, it makes sense to speak of the quotient ring R/(ker f). The first
isomorphism theorem for rings states that this quotient ring is naturally isomorphic to the image of f (which is a
subring of S).
To some extent, this can be thought of as a special case of the situation for modules, since these are all bimodules
over a ring R:
• R itself;
• any two-sided ideal of R (such as ker f);
• any quotient ring of R (such as R/(ker f)); and
• the codomain of any ring homomorphism whose domain is R (such as S, the codomain of f).
However, the isomorphism theorem gives a stronger result, because ring isomorphisms preserve multiplication while
module isomorphisms (even between rings) in general do not.
This example captures the essence of kernels in general Mal'cev algebras.

Monoid homomorphisms
Let M and N be monoids and let f be a monoid homomorphism from M to N. Then the kernel of f is the subset of the
direct product M × M consisting of all those ordered pairs of elements of M whose components are both mapped by f
to the same element in N. The kernel is usually denoted "ker f" (or a variation). In symbols:

Since f is a function, the elements of the form (m,m) must belong to the kernel. The homomorphism f is injective if
and only if its kernel is only the diagonal set {(m,m) : m in M}.
It turns out that ker f is an equivalence relation on M, and in fact a congruence relation. Thus, it makes sense to speak
of the quotient monoid M/(ker f). The first isomorphism theorem for monoids states that this quotient monoid is
naturally isomorphic to the image of f (which is a submonoid of N).
Kernel (algebra) 3

This is very different in flavour from the above examples. In particular, the preimage of the identity element of N is
not enough to determine the kernel of f. This is because monoids are not Mal'cev algebras.

Universal algebra
All the above cases may be unified and generalized in universal algebra.

General case
Let A and B be algebraic structures of a given type and let f be a homomorphism of that type from A to B. Then the
kernel of f is the subset of the direct product A × A consisting of all those ordered pairs of elements of A whose
components are both mapped by f to the same element in B. The kernel is usually denoted "ker f" (or a variation). In
symbols:

Since f is a function, the elements of the form (a,a) must belong to the kernel.
The homomorphism f is injective if and only if its kernel is only the diagonal set {(a,a) : a in A}.
It turns out that ker f is an equivalence relation on A, and in fact a congruence relation. Thus, it makes sense to speak
of the quotient algebra A/(ker f). The first isomorphism theorem in general universal algebra states that this quotient
algebra is naturally isomorphic to the image of f (which is a subalgebra of B).
Note that the definition of kernel here (as in the monoid example) doesn't depend on the algebraic structure; it is a
purely set-theoretic concept. For more on this general concept, outside of abstract algebra, see kernel of a function.

Mal'cev algebras
In the case of Mal'cev algebras, this construction can be simplified. Every Mal'cev algebra has a special neutral
element (the zero vector in the case of vector spaces, the identity element in the case of groups, and the zero element
in the case of rings or modules). The characteristic feature of a Mal'cev algebra is that we can recover the entire
equivalence relation ker f from the equivalence class of the neutral element.
To be specific, let A and B be Mal'cev algebraic structures of a given type and let f be a homomorphism of that type
from A to B. If eB is the neutral element of B, then the kernel of f is the preimage of the singleton set {eB}; that is, the
subset of A consisting of all those elements of A that are mapped by f to the element eB. The kernel is usually denoted
"ker f" (or a variation). In symbols:

Since a Mal'cev algebra homomorphism preserves neutral elements, the identity element eA of A must belong to the
kernel. The homomorphism f is injective if and only if its kernel is only the singleton set {eA}.
The notion of ideal generalises to any Mal'cev algebra (as linear subspace in the case of vector spaces, normal
subgroup in the case of groups, two-sided ring ideal in the case of rings, and submodule in the case of modules). It
turns out that although ker f may not be a subalgebra of A, it is nevertheless an ideal. Then it makes sense to speak of
the quotient algebra G/(ker f). The first isomorphism theorem for Mal'cev algebras states that this quotient algebra is
naturally isomorphic to the image of f (which is a subalgebra of B).
The connection between this and the congruence relation is for more general types of algebras is as follows. First, the
kernel-as-an-ideal is the equivalence class of the neutral element eA under the kernel-as-a-congruence. For the
converse direction, we need the notion of quotient in the Mal'cev algebra (which is division on either side for groups
and subtraction for vector spaces, modules, and rings). Using this, elements a and a of A are equivalent under the
kernel-as-a-congruence if and only if their quotient a/a is an element of the kernel-as-an-ideal.
Kernel (algebra) 4

Algebras with nonalgebraic structure

Sometimes algebras are equipped with a nonalgebraic structure in addition to their algebraic operations. For
example, one may consider topological groups or topological vector spaces, with are equipped with a topology. In
this case, we would expect the homomorphism f to preserve this additional structure; in the topological examples, we
would want f to be a continuous map. The process may run into a snag with the quotient algebras, which may not be
well-behaved. In the topological examples, we can avoid problems by requiring that topological algebraic structures
be Hausdorff (as is usually done); then the kernel (however it is constructed) will be a closed set and the quotient
space will work fine (and also be Hausdorff).

Kernels in category theory

The notion of kernel in category theory is a generalisation of the kernels of abelian algebras; see Kernel (category
theory). The categorical generalisation of the kernel as a congruence relation is the kernel pair. (There is also the
notion of difference kernel, or binary equaliser.)

References
[1] Dummit, David S.; Foote, Richard M. (2004). Abstract Algebra (3rd ed.). John Wiley & Sons. ISBN 0-471-43334-9.
[2] Lang, Serge (2002). Algebra. Graduate Texts in Mathematics. Springer. ISBN 0-387-95385-X.
Article Sources and Contributors 5

Article Sources and Contributors

Kernel (algebra)  Source: http://en.wikipedia.org/w/index.php?oldid=427398692  Contributors: Arthur Rubin, AxelBoldt, Bryan Derksen, CRGreathouse, Charles Matthews, Cmichael,
Constantine, Cronholm144, Cwkmail, DMY, DigitalPowerExpert, Dysprosia, Giftlite, HenHei, Hugo Herbelin, Ideyal, JackSchmidt, JeLuF, Jim.belk, Joriki, Josh Parris, Kukini, Lethe, Markus
Krötzsch, MathMartin, Mathieu Perrin, Mhss, Michael Hardy, Patrick, Radagast83, Reyk, Rich Farmbrough, Salix alba, Sam Hocevar, Silly rabbit, TakuyaMurata, Tarquin, TheProject,
Thryduulf, Toby Bartels, Topbanana, Ultramarine, Useight, Waltpohl, Wsiegmund, Xtv, 25 anonymous edits

License
Creative Commons Attribution-Share Alike 3.0 Unported
http:/ / creativecommons. org/ licenses/ by-sa/ 3. 0/