Understanding the definition of a homomorphism
This is a definition understanding article -- an article intended to help better understand the definition(s):homomorphism of groups
View other definition understanding articles| View other survey articles about homomorphism of groups
The definition of a homomorphism of groups, while simple and straightforward, can seem confusing and unmotivated to people encountering it for the first time. An isomorphism of groups is a more easily understood concept: a bijection between groups that transforms the multiplication table of one to the multiplication table of the other. A homomorphism, on the other hand, far from identifies one group with the other, and the two groups could have remarkably different structure. So why study homomorphisms?
Homomorphisms as a partial signature
Homomorphisms: injective, surjective and bijective
Injective homomorphisms are subgroups
Given an injective homomorphism , we can identify with its image , which is a subgroup of . Specifically, if we think of , then it is an isomorphism, so can be identified with the subgroup of .
Conversely, any subgroup can be viewed as an injective homomorphism: take the inclusion map.
While it is usually more useful to think of subgroups than of injective homomorphisms, sometimes it helps to view subgroups as injective homomorphisms. One advantage of this is that it intuitively makes it easier to compose with other homomorphisms, as well as helps us generalize to situations where the homomorphism is not necessarily injective. It also helps overcome the trap of thinking of a subgroup merely as a subset.
Surjective homomorphisms are quotient maps
Given a surjective homomorphism with kernel , we can, by the first isomorphism theorem, find a unique map such that if is the quotient map, then . In other words, any surjective homomorphism can be identified with a quotient map, and hence, with a normal subgroup (which determines the quotient map with that as kernel).
It is usually more helpful to think of quotient maps than surjective homomorphisms, but surjective homomorphisms offer some advantages: being able to compose, and escaping the trap of thinking of quotients in terms of normal subgroups and cosets.
Every homomorphism breaks up naturally as a surjective homomorphism followed by an injective homomorphism
Given a homomorphism , we can break up as a composite of two maps: the map , which is just viewed as a map only to its image, and the map , which is an inclusion of the subgroup in the group. Thus , where is surjective and is injective. Moreover, any breakup as a composite is essentially equivalent to this breakup.
Thus, studying arbitrary homomorphisms between abstract groups reduces largely to the study of injective homomorphisms and surjective homomorphisms. Both kinds of homomorphism have special behaviour. A general pointer is as follows:
- For an injective homomorphism (or a subgroup): The group on the right (i.e., the big group) controls, to some extent, the behaviour of the group on the left. There is very little reverse control.
- For a surjective homomorphism (or a quotient map): The group on the left controls, to some extent, the behaviour of the group on the right. There is very little reverse control.
(It's also true that every homomorphism breaks up as an injective homomorphism followed by a surjective homomorphism, but this breakup is not natural, and is not important for understanding structure).
Homomorphisms from a universal algebraic perspective
Most of the facts stated here are of a universal algebra-flavour: they work in the generality of any variety of algebras.
A map is termed a homomorphism of groups if , for all , and for all .
From this, we see that if is a word, then:
For instance, if we have:
Since homomorphisms preserve words, they also preserve equations. So, if we have, for some particular word and some specific choice of :
Then, under the homomorphism :
In particular, this means that solutions to equations in give solutions to equations in .
Don't preserve inequations, unless injective
Intuitively, we can think of a homomorphism as a collapse. Whatever equations hold in for elements of , hold for their images in . However, the situation becomes markedly different when we're looking at inequations. In other words:
Thus, for instance, if we can solve a system of equations for variables in under the constraint that , then we can tkae the images of these solutions to solve the equations in . But it could well happen that the images of the solutions are equal.
As an extreme example, consider the trivial group and the homomorphism sending to . Then, under this homomorphism, all elements of become equal in the image.
There is a special case where the homomorphism preserves both equations and inequations: namely, when it is an injective homomorphism. An injective homomorphism can be viewed as embedding as a subgroup of (the subgroup being its image ).
Don't preserve universal identities, unless surjective
Intuitively, given a homomorphism , the only control we have on using , is on the subgroup of . Elements outside the image of could behave in ways completely uncontrolled by .
Then, also gives a universal identity on . That's because all elements of can be written as for some , and we get:
Equations cannot be pulled back
Suppose is a word, is a homomorphism of groups, and we have a tuple such that, in :
It may not in general be possible to find such that and . There are two obstacles:
- Since is not necessarily surjective, we may not be able to find inverse images of each
- Even if we succeed, all that yields to us is that . In order to use this to conclude that , we need the map to be injective.
Thus, we need the map to be an isomorphism of groups to guarantee being able to pull back equations. Actually, conditions weaker than being an isomorphism suffice. For instance, if is a retraction, i.e., if it is a surjective map with a one-sided inverse injective map, then solutions can always be pulled back, using the injective map. Further information: Retract, Equation-closed subgroup