Commutators, Homomorphisms, Kernels and Structure Maps

Executive summary

Two ideas organise much of later group theory. First, commutators measure how far pairs of elements fail to commute, and the subgroup generated by all commutators captures the non-commutative core of a group. Second, homomorphisms map one group into another while preserving multiplication. Their kernels are normal subgroups, and a surjective homomorphism factors the original group through a quotient by its kernel. These tools let the source move information between groups and prove that properties such as solubility survive appropriate images and quotients.

What this handbook page teaches

Compute and interpret a commutator.
Understand the derived subgroup as the smallest normal subgroup needed to make the quotient commutative.
Verify that a map is a group homomorphism.
Find kernel, image and pre-image of subgroups.
Use the kernel quotient to identify the structure of a surjective image.

Core concepts

group→ normal subgroup→ cosets→ quotient structure

Commutators and the derived subgroup

For elements a,b, a commutator may be written aba^-1b^-1 under the source's convention. It equals the identity exactly when a and b commute. The subgroup generated by all finite products of commutators is the commutant, often called the derived subgroup.

This subgroup is normal. More importantly, the quotient by it is commutative, and any normal subgroup with a commutative quotient must contain it. Thus the derived subgroup is the minimal normal part that must be collapsed to remove all non-commutativity.

Homomorphisms

A homomorphism φ:G→F preserves products: φ(ab)=φ(a)φ(b). It need not be injective or surjective. The preservation rule automatically sends the identity of G to the identity of F and inverses to inverses. Images of subgroups are subgroups, and pre-images of normal subgroups are normal.

Homomorphisms formalise the idea that one structure can be observed through a coarser description. Different elements can have the same image; the kernel records exactly which elements disappear into the identity.

Kernels and quotient factorisation

The kernel ker φ is the set of elements sent to the identity. It is always a normal subgroup. Two elements g1,g2 lie in the same kernel coset exactly when φ(g1)=φ(g2). Therefore the homomorphism cannot distinguish elements within one kernel coset.

If φ is surjective, the quotient G/ker φ is isomorphic to F. The induced map sends each coset to the common image of its members. This quotient-factorisation theorem is one of the main engines of structural reasoning in the source.

Working method

Use the following sequence as a repeatable analysis workflow. The steps are ordered to separate definitions and admissibility checks from structural conclusions, so a result can be audited without relying on intuition or an unverified diagram.

Write the homomorphism rule and verify it for arbitrary products before analysing kernel or image.
Find the kernel by solving φ(g)=e_F. Check that the result agrees with any geometric interpretation.
Partition the domain into kernel cosets. Elements in the same coset must share an image.
If the map is surjective, construct the induced map from kernel cosets to the target and verify it is bijective and multiplication-preserving.
For commutator problems, calculate enough commutators or use known normality and quotient properties to identify the derived subgroup efficiently.
To prove a quotient is commutative, show that every commutator maps to the identity; conversely, use a commutative quotient to force the derived subgroup into its kernel.

From a symmetry action to a quotient

Suppose a group acts on a small set of internal features and each group element therefore induces a permutation of those features. Sending a group element to its induced permutation is a homomorphism because performing two group actions and then observing the features gives the product of the two induced permutations.

The kernel consists of actions that leave every observed feature fixed. If the induced permutations realise every element of the target permutation group, the map is surjective. The quotient by the kernel is then isomorphic to that target group. Instead of constructing a quotient table from scratch, the homomorphism identifies it immediately.

This pattern recurs in branch problems. A complicated permutation group can map onto a simpler group recording only coarse movement between packs of sheets. The kernel records permutations occurring inside each pack. Solubility can then be analysed from the kernel and quotient layers.

Technical reasoning and deeper connections

A homomorphism preserves algebraic structure but can erase information. The kernel quantifies that erasure. This makes it natural that the quotient by the kernel captures precisely the distinctions visible in the image: two elements become the same quotient element exactly when the homomorphism already treats them as the same.

The derived subgroup is closely related to all homomorphisms into commutative groups. Any such homomorphism must kill every commutator, so its kernel contains the derived subgroup. Consequently the quotient by the derived subgroup is the largest commutative quotient in a precise structural sense.

Surjective homomorphisms preserve many 'no more complicated than' properties. If a source group is soluble, a surjective image is soluble. This is later used when an initially formal branch construction has a soluble permutation group and the actual surface is obtained by identifying equal sheets: the actual group is a homomorphic image of the formal one.

When using images and pre-images, direction matters. The image of a normal subgroup under a general non-surjective homomorphism need not be normal in the entire codomain, whereas a pre-image of a normal subgroup is normal in the domain. Surjectivity restores normality of the image in the target.

Quick-reference matrix

Object	Definition	Structural role
Commutator	`aba^-1b^-1`	Measures failure of `a` and `b` to commute.
Derived subgroup	Generated by commutators	Kernel of the universal move toward a commutative quotient.
Homomorphism	`φ(ab)=φ(a)φ(b)`	Preserves multiplication.
Kernel	Elements mapped to identity	Normal subgroup measuring information lost.
Image	Values attained by `φ`	Subgroup of the target.
Kernel quotient	`G/ker φ`	Isomorphic to the image when the target is restricted accordingly.

Common mistakes

Calling any mapping between groups a homomorphism without checking product preservation.
Assuming a homomorphism must be one-to-one.
Using the inverse-map symbol for a homomorphism that is not bijective; pre-image notation is set-theoretic.
Assuming the image of a normal subgroup is always normal in the whole codomain without surjectivity.
Confusing the kernel with the set of elements that are sent to zero when the group is not written additively.
Treating the derived subgroup as the set of individual commutators only; it is the subgroup generated by their finite products.

Verification checklist

Before accepting a solution or proof, confirm each item below. These checks are intentionally practical: they catch the most common category errors, missing hypotheses and structure mismatches.

Homomorphism property is checked first.
Kernel uses the identity element of the target operation.
Kernel normality is established before quotienting.
Surjectivity is stated when using full target isomorphism.
Derived-subgroup claims are tested by commutativity of the quotient.
Images and pre-images are kept directionally distinct.

Frequently asked questions

What does an injective homomorphism tell us?

It embeds the domain as a subgroup of the target, because a trivial kernel prevents distinct elements from collapsing.

Why is a kernel always normal?

If n maps to the identity, then φ(gng^-1)=φ(g)eφ(g)^-1=e, so conjugation stays inside the kernel.

What is the fastest way to identify a quotient?

Often, construct a natural surjective homomorphism whose kernel is the normal subgroup. The quotient is then isomorphic to the image.

How do commutators connect to solubility?

Repeatedly taking the derived subgroup forms the derived series. A group is soluble when this process eventually reaches the identity subgroup.

Source basis: this page is a handbook-style synthesis of the uploaded mathematics source, principally sections 1.12, 1.13. It paraphrases the supplied material and does not reproduce source artwork or long source passages. Historical names, publisher details and personal details have been intentionally omitted.