Kernel (algebra) Survey Of Examples Linear Operators

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.

1 Survey of examples

1.1 Linear operators

Let V and W be vector spaces and let T be a linear transformation from V to W. If 0_W is the zero vector of W, then the kernel of T is the preimage of the singleton set {0_W}; that is, the subsetIf X and Y are sets and every element of X is also an element of Y, then we say or write: X is a subset of (or is included in) Y; X ⊆ Y; Y is a superset of (or includes X; Y ⊇ X. Every set Y is a subset of itself. A subset of Y which is not equa of V consisting of all those elements of V that are mapped by T to the element 0_W. The kernel is usually denoted "ker T" (or a variation). In symbols:

Since a linear transformation preserves zero vectors, the zero vector 0_V of V must belong to the kernel. The transformation T is injective if and only if its kernel is only the singleton set {0_V}.

It turns out that ker T is always a subspace of V. Thus, it makes sense to speak of the quotient spaceIn linear algebra, the quotient of a vector space V by a subspace N is a vector space obtained by "collapsing" N to zero. The space obtained is called a quotient space and is denoted V ''N (read V mod N . Definition Formally, the construction is as follow 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 basesAbstract algebra Algebra Linear algebra In mathematics, a subset B of a vector space V is said to be a basis of V if it satisfies one of the four equivalent conditions: B is both a set of linearly independent vectors and a generating set of V''. B is a mi have been chosen, then T can be described by a matrixAbstract algebra Algebra Linear algebra In mathematics, a matrix (plural matrices is a rectangular table of numbers or, more generally, of elements of a fixed ring. In this article, if unspecified, the entries of a matrix are always real or complex number M, and the kernel can be computed by solving the homogenous system of linear equations Mv = 0. In this representation, the kernel corresponds to the nullspace of M. The dimension of the nullspace, 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.

1.2 Group homomorphisms

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

Since a group homomorphism preserves identity elements, the identity element e_G of G must belong to the kernel. The homomorphism f is injective if and only if its kernel is only the singleton set {e_G}.

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.

1.3 Ring homomorphisms

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

Since a ring homomorphism preserves zero elements, the zero element 0_R of R must belong to the kernel. The homomorphism f is injective if and only if its kernel is only the singleton set {0_R}.

It turns out that, although ker f is generally not a subring of R, 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 algebra s.

1.4 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).

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.

2 Universal algebra

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

2.1 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.

2.2 Mal'cev algebras

In the case of Mal'cev algebra s, 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 e_B is the neutral element of B, then the kernel of f is the preimage of the singleton set {e_B}; that is, the subset of A consisting of all those elements of A that are mapped by f to the element e_B. The kernel is usually denoted "ker f" (or a variation). In symbols:

Since a Mal'cev algebra homomorphism preserves neutral elements, the identity element e_A of A must belong to the kernel. The homomorphism f is injective if and only if its kernel is only the singleton set {e_A}.

The notion of ideal generalises to any Mal'cev algebra (as 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 e_A 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.

2.3 Abelian algebras

I need to look up more stuff on universal algebra.

3 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 algebaic 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).

4 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.)

<Hide>

Home > Kernel (algebra)