Nepedia
Back to Discover
Advanced Reader
🔢

Kernel (algebra)

math Maturity 7-9 Next article →

In algebra, the kernel is a fundamental concept used to describe how elements in one structure relate to another. This relationship occurs during a process called a homomorphism. A homomorphism is a function that maps one algebraic structure to another while preserving its underlying patterns.

Group homomorphism ver.2
Group homomorphism ver.2

The kernel specifically identifies which elements from the starting set, known as the domain, are mapped to the identity element of the target set, known as the image. By studying the kernel, mathematicians can measure how much information is lost or compressed during the mapping process.

To understand the mechanism, consider a group homomorphism between two groups, $G$ and $H$. A group is a set with an operation that follows rules like associativity and the existence of an identity element.

Kernel of a morphism
Kernel of a morphism

When we apply a homomorphism, we look for the preimage of the identity element in $H$. This preimage is the subset of $G$ containing every element that $H$ treats as the 'starting point' or zero. If the kernel contains only the identity element of $G$, the mapping is injective. An injective mapping ensures that every unique input results in a unique output. If the kernel is larger, the mapping is not injective, meaning multiple elements are being collapsed into one.

Different algebraic structures utilize the kernel in distinct ways. In group theory, the kernel is always a normal subgroup of the domain. This special status allows mathematicians to create a quotient group, which is a way of 'dividing out' the kernel to simplify the structure.

Illustration of an Exact Sequence of Groups
Illustration of an Exact Sequence of Groups

In ring theory, the rules are slightly different because rings involve two operations: addition and multiplication. A ring homomorphism maps elements such that both operations are preserved. The kernel of a ring homomorphism is the set of elements that map to the additive zero. Unlike groups, the kernel of a ring is not just a subring; it is a two-sided ideal. This means it has a special property regarding multiplication that allows for the construction of a quotient ring.

Vector spaces and modules also rely heavily on the concept of a kernel. In the context of a linear map between vector spaces, the kernel is often called the null space.

Kernel and image of linear map
Kernel and image of linear map

The null space consists of all vectors that the transformation sends to the zero vector. A key principle here is that the kernel is always a linear subspace of the original vector space. This relationship leads to a vital numerical connection: the dimension of the original space equals the dimension of the kernel plus the dimension of the image. This helps mathematicians understand the geometry of transformations.

History and discovery in algebra show how these concepts unify different fields. For example, the study of permutations and symmetry led to the understanding of the alternating group. The alternating group is the kernel of a specific homomorphism that measures the parity of permutations. In more advanced settings, the concept of the kernel has been extended to even broader structures. In these cases, the kernel is described as a congruence relation. This extension allows the idea of 'grouping elements' to apply to mathematical systems that do not follow standard group rules.

There are many surprising examples of kernels in mathematics. Consider a projection map that takes a point in a 2D plane and moves it onto the x-axis.

Projection-on-diagonal
Projection-on-diagonal

In this case, every point sitting on the y-axis is sent to zero, making the y-axis the kernel. Another example involves the determinant of a matrix. The determinant is a map that turns a matrix into a single number. The kernel of this map is the special linear group, which consists of all matrices with a determinant of exactly 1. Even calculus uses this idea; the kernel of a derivative operator consists of all constant functions, because their rate of change is zero.

Ultimately, kernels are essential for defining quotient objects, such as quotient algebras. This process involves grouping the original elements into sets called fibers. Each fiber contains all the points that map to the same destination. The first isomorphism theorem is a powerful tool that connects these ideas. It states that the image of a homomorphism is isomorphic to the quotient of the domain by its kernel. This theorem proves that the kernel contains the essential information needed to understand how a complex structure can be simplified into a smaller, more manageable one.

724 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

🖼️ Images & Media (6)
File:Group homomorphism ver.2.svg
Group homomorphism ver.2.svg
File:Projection-on-diagonal.gif
Projection-on-diagonal.gif
File:Kernel and image of linear map.svg
Kernel and image of linear map.svg
File:Illustration of an Exact Sequence of Groups.svg
Illustration of an Exact Sequence of Groups.svg
File:Kernel of a morphism.svg
Kernel of a morphism.svg
File:Regular category 1.png
Regular category 1.png
More to explore

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.