Odtnhj

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] 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 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 maps

Let V and W be vector spaces over a field (or more generally, modules over a ring) and let T be a linear map from V to W. If 0_W is the zero vector of W, then the kernel of T is the preimage of the zero subspace 0_W; that is, the subset of V consisting of all those elements of V that are mapped by T to the element 0_W. The kernel is usually denoted as $ker T$ , or some variation thereof:

displaystyle operatorname ker T=mathbf v in V:T(mathbf v )=mathbf 0 _Wtext.

Since a linear map 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 reduced to the zero subspace.

The kernel 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 Mv = 0. In this case, the kernel of T may be identified to the kernel of the matrix M, also called "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

displaystyle xf''(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

displaystyle (Tf)(x)=xf''(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).

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:

displaystyle operatorname ker f=gin G:f(g)=e_Hmbox.

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. This is true because if the homomorphism f is not injective, then there exists $displaystyle a,bin G$ with $aneq b$ such that $displaystyle f(a)=f(b)$ . This means that $displaystyle f(a)f(b)^-1=e_H$ , which is equivalent to stating that $displaystyle f(ab^-1)=e_H$ since group homomorphisms carry inverses into inverses and since $displaystyle f(a)f(b^-1)=f(ab^-1)$ . In other words, $displaystyle ab^-1in operatorname ker f$ . Conversely, if there exists an element $displaystyle gneq e_Gin operatorname ker f$ , then $displaystyle f(g)=f(e_G)=e_H$ , thus f is not injective.

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 0_S is the zero element of S, then the kernel of f is its kernel as linear map over the integers, or, equivalently, as additive groups. It is the preimage of the zero ideal 0_S, which 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:

displaystyle operatorname ker f=rin R:f(r)=0_Smbox.

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.
This is always the case if R is a field, and S is not the zero ring.

Since ker f contains the multiplicative identity only when S is the zero ring, it turns out that the kernel is generally not a subring of R. The kernel is a subrng, and, more precisely, 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). (note that rings need not be unital for the kernel definition).

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:

displaystyle operatorname ker f=(m,m')in Mtimes M:f(m)=f(m')mbox.

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),(for the congruence relation).

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.

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:

displaystyle operatorname ker f=(a,a')in Atimes A:f(a)=f(a')mbox.

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 exactly the diagonal set (a,a) : a∈A.

It is easy to see 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 commutative 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:

displaystyle operatorname ker f=ain A:f(a)=e_Bmbox.

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 linear subspace in the case of vector spaces, normal subgroup in the case of groups, two-sided ideals in the case of rings, and submodule in the case of modules).
It turns out that ker f is not a subalgebra of A, but it is 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 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 b of A are equivalent under the kernel-as-a-congruence if and only if their quotient a/b is an element of the kernel-as-an-ideal.

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

Notes

^ See Dummit & Foote 2004 and Lang 2002.

References

Dummit, David S.; Foote, Richard M. (2004). Abstract Algebra (3rd ed.). Wiley. ISBN 0-471-43334-9..mw-parser-output cite.citationfont-style:inherit.mw-parser-output qquotes:"""""""'""'".mw-parser-output code.cs1-codecolor:inherit;background:inherit;border:inherit;padding:inherit.mw-parser-output .cs1-lock-free abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-lock-subscription abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registrationcolor:#555.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration spanborder-bottom:1px dotted;cursor:help.mw-parser-output .cs1-hidden-errordisplay:none;font-size:100%.mw-parser-output .cs1-visible-errorfont-size:100%.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-formatfont-size:95%.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-leftpadding-left:0.2em.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-rightpadding-right:0.2em

Lang, Serge (2002). Algebra. Graduate Texts in Mathematics. Springer. ISBN 0-387-95385-X.

[1] See Dummit & Foote 2004 and Lang 2002.

搜尋此網誌

Odtnhj

Kernel (algebra)

Contents