HOME

TheInfoList



OR:

In algebra, the kernel of a homomorphism (function that preserves the
structure A structure is an arrangement and organization of interrelated elements in a material object or system, or the object or system so organized. Material structures include man-made objects such as buildings and machines and natural objects such as ...
) is generally the inverse image of 0 (except for groups whose operation is denoted multiplicatively, where the kernel is the inverse image of 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 (or 1) if and only if the homomorphism is
injective In mathematics, an injective function (also known as injection, or one-to-one function) is a function that maps distinct elements of its domain to distinct elements; that is, implies . (Equivalently, implies in the equivalent contrapositiv ...
, 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.See and . 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 In abstract algebra, a normal subgroup (also known as an invariant subgroup or self-conjugate subgroup) is a subgroup that is invariant under conjugation by members of the group of which it is a part. In other words, a subgroup N of the group G i ...
for groups and two-sided ideals for rings. Kernels allow defining
quotient object In category theory, a branch of mathematics, a subobject is, roughly speaking, an object that sits inside another object in the same category. The notion is a generalization of concepts such as subsets from set theory, subgroups from group theory,M ...
s (also called quotient algebras in universal algebra, and cokernels in
category theory Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Nowadays, cate ...
). For many types of algebraic structure, the fundamental theorem on homomorphisms (or first isomorphism theorem) states that
image An image is a visual representation of something. It can be two-dimensional, three-dimensional, or somehow otherwise feed into the visual system to convey information. An image can be an artifact, such as a photograph or other two-dimensiona ...
of a homomorphism is
isomorphic In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word is ...
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 In abstract algebra, a congruence relation (or simply congruence) is an equivalence relation on an algebraic structure (such as a group, ring, or vector space) that is compatible with the structure in the sense that algebraic operations done wi ...
. This article is a survey for some important types of kernels in 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 In mathematics, the image of a function is the set of all output values it may produce. More generally, evaluating a given function f at each element of a given subset A of its domain produces a set, called the "image of A under (or through) ...
of the zero subspace ; that is, the
subset In mathematics, Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are ...
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 , or some variation thereof: : \ker T = \ . 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 In mathematics, and more specifically in linear algebra, a linear subspace, also known as a vector subspaceThe term ''linear subspace'' is sometimes used for referring to flats and affine subspaces. In the case of vector spaces over the reals, li ...
of ''V''. Thus, it makes sense to speak of the
quotient space Quotient space may refer to a quotient set when the sets under consideration are considered as spaces. In particular: *Quotient space (topology), in case of topological spaces * Quotient space (linear algebra), in case of vector spaces *Quotient ...
''V''/(ker ''T''). The first isomorphism theorem for vector spaces states that this quotient space is naturally isomorphic to the
image An image is a visual representation of something. It can be two-dimensional, three-dimensional, or somehow otherwise feed into the visual system to convey information. An image can be an artifact, such as a photograph or other two-dimensiona ...
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 In mathematics, the dimension of a vector space ''V'' is the cardinality (i.e., the number of vectors) of a basis of ''V'' over its base field. p. 44, §2.36 It is sometimes called Hamel dimension (after Georg Hamel) or algebraic dimension to disti ...
and bases have been chosen, then ''T'' can be described by a
matrix Matrix most commonly refers to: * ''The Matrix'' (franchise), an American media franchise ** '' The Matrix'', a 1999 science-fiction action film ** "The Matrix", a fictional setting, a virtual reality environment, within ''The Matrix'' (franchi ...
''M'', and the kernel can be computed by solving the homogeneous
system of linear equations In mathematics, a system of linear equations (or linear system) is a collection of one or more linear equations involving the same variable (math), variables. For example, :\begin 3x+2y-z=1\\ 2x-2y+4z=-2\\ -x+\fracy-z=0 \end is a system of three ...
. 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 operator In mathematics, a differential operator is an operator defined as a function of the differentiation operator. It is helpful, as a matter of notation first, to consider differentiation as an abstract operation that accepts a function and return ...
s. For instance, in order to find all twice- differentiable functions ''f'' from the
real line In elementary mathematics, a number line is a picture of a graduated straight line (geometry), line that serves as visual representation of the real numbers. Every point of a number line is assumed to correspond to a real number, and every real ...
to itself such that :x f''(x) + 3 f'(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 :(Tf)(x) = x f''(x) + 3 f'(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 ; 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 (or a variation). In symbols: : \ker f = \ . 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 . If ''f'' were not injective, then the non-injective elements can form a distinct element of its kernel: there would exist a, b \in G such that a \neq b and f(a) = f(b). Thus f(a)f(b)^ = e_H. ''f'' is a group homomorphism, so inverses and group operations are preserved, giving f\left(ab^\right) = e_H; in other words, ab^ \in \ker f, and ker ''f'' would not be the singleton. Conversely, distinct elements of the kernel violate injectivity directly: if there would exist an element g \neq e_G \in \ker f, then f(g) = f(e_G) = e_H, thus ''f'' would not be injective. is a subgroup of ''G'' and further it is a
normal subgroup In abstract algebra, a normal subgroup (also known as an invariant subgroup or self-conjugate subgroup) is a subgroup that is invariant under conjugation by members of the group of which it is a part. In other words, a subgroup N of the group G i ...
. Thus, there is a corresponding
quotient group A quotient group or factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure (the rest of the structure is "factored" out). For examp ...
. This is isomorphic to ''f''(''G''), the image of ''G'' under ''f'' (which is a subgroup of ''H'' also), by the first isomorphism theorem for groups. In the special case of abelian groups, there is no deviation from the previous section.


Example

Let ''G'' be the cyclic group on 6 elements with modular addition, ''H'' be the cyclic on 2 elements with modular addition, and ''f'' the homomorphism that maps each element ''g'' in ''G'' to the element ''g'' modulo 2 in ''H''. Then , since all these elements are mapped to 0''H''. The quotient group has two elements: and . It is indeed isomorphic to ''H''.


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 , which is, the subset of ''R'' cons