Lably
Skip to content

Kernel (algebra)

Elements taken to zero by a homomorphism

  • 16 min read
  • 7 chapters

Related on Lably

Through Algebra, Domain of a function and Function (mathematics)

When the algebraic structures involved have an underlying group structure, the kernel is taken to be the preimage of the group's identity element in the image, that is, it consists of the elements of the domain mapping to the image's identity. For example, the map that sends every integer to its parity (that is, 0 if the number is even, 1 if the number is odd) would be a homomorphism to the integers modulo 2, and its respective kernel would be the even integers which all have 0 as its parity. The kernel of a homomorphism of group-like structures will be a singleton set that only contains the identity 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 some kernels have received a special name, such as normal subgroups for groups and two-sided ideals for rings. 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.

Kernels allow defining quotient objects (also called quotient algebras in universal algebra). 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.

Definition

Group homomorphisms

A group is a set G with a binary operation ⋅ satisfying the following three properties for all a,b,c∈G:

  1. Associative: (a⋅b)⋅c=a⋅(b⋅c)
  2. Identity: There is an e∈G such that e⋅a=a⋅e=a
  3. Inverses: There is an a′∈G for each a∈G such that a⋅a′=a′⋅a=e

A group is also called abelian if it also satisfies a⋅b=b⋅a.

Let G and H be groups. A group homomorphism from G to H is a function f:G→H such that f(ab)=f(a)f(b) for all a,b∈G. (For simplicity, the operation symbol ⋅ is omitted.) Letting eH be 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:

ker⁡f={g∈G:f(g)=eH}.

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

ker⁡f is a subgroup of G and further it is a normal subgroup. Thus, there is a corresponding quotient group G/ker⁡f. 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.

Ring homomorphisms

A ring with identity (or unity) is a set R with two binary operations + and ⋅ satisfying:

  1. R with + is an abelian group with identity 0.
  2. Multiplication ⋅ is associative.
  3. Distributive: a⋅(b+c)=a⋅b+a⋅c and (a+b)⋅c=a⋅c+b⋅c for all a,b,c∈R
  4. Multiplication ⋅ has an identity element 1.

A ring is commutative if the multiplication is commutative, and such a ring is a field when every 0≠a∈R has a multiplicative inverse, that is, some b∈R where ab=1. Let R and S be rings. A ring homomorphism from R to S is a function f:R→S satisfying for all a,b∈R:

  1. f(a+b)=f(a)+f(b)
  2. f(ab)=f(a)f(b)

The kernel of f is the kernel as additive groups. It is the preimage of the zero ideal {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:

ker⁡f={r∈R:f(r)=0S}.

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

Linear maps

Given a field F, a vector space (over F) is an abelian group V (with binary operation + and identity 0) with scalar multiplication from F satisfying for all a,b∈F and α,β∈V:

  1. a(bα)=(ab)α
  2. (a+b)α=aα+bα
  3. a(α+β)=aα+aβ
  4. 1α=α

Let V and W be vector spaces over the field F. A linear map (or linear transformation) from V to W is a function T:V→W satisfying for all α,β∈V and a∈F:

  1. T(α+β)=T(α)+T(β)
  2. T(aα)=aT(α)

If 0W is the zero vector of W, then the kernel of T (or null space) is the preimage of the zero subspace {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 denoted as ker⁡T, or some variation thereof, and is symbolically defined as:

ker⁡T={v∈V:T(v)=0W}.

Since a linear map 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 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.

Module homomorphisms

Let R be a ring. A module over R is defined exactly like a vector space over a field, using the same axioms, except the field is replaced with a ring. In fact, a module over a field is exactly the same as a vector space over a field. Let M and N be R-modules. A module homomorphism from M to N is also a function φ:M→N satisfying the same analogous properties of a linear map. The kernel of φ is defined to be:

ker⁡φ={m∈M|φ(m)=0}

Every kernel is a submodule of the domain module, which means they always contain 0, the additive identity of the module. Kernels of abelian groups can be considered a particular kind of module kernel when the underlying ring is the integers.

Sign in to keep reading

6 more chapters are free with a Lably account.

More in Algebra