A group homomorphism is a map preserving the group operation: . It also preserves the identity element and inverse elements. In an additive group, the same requirement reads . A group homomorphism preserves a way of combining inputs, even when several inputs have the same output.
Reduction modulo three from to is a group homomorphism: reducing a sum agrees with adding the reduced residues. For example, modulo six, and both sides reduce to one modulo three; the outputs and also add to one modulo three. This map is surjective but not injective, since zero and three both map to zero.
The sign of a permutation gives another example, from the symmetric group to the multiplicative group . A product of two odd permutations is even, matching . Its group kernel is , the alternating group of even permutations. This shows how a group homomorphism can retain a useful feature while forgetting other details.
Let be a finite group and a surjective group homomorphism. Choose a preimage of . Since , the order of a group element divides ; write . Then has order , because holds exactly when , or equivalently . This proves existence of an element of order in . It need not be a preimage of : for the quotient map , both preimages of the nonidentity target element have order , while the order- element of the source maps to zero. Thus the assertion concerns element-order existence, not splitting of the quotient map.
A group antihomomorphism between groups reverses multiplication: . Inversion is an example. An antihomomorphism is a group homomorphism when the multiplication in the target is replaced by its reverse. In a nonabelian target the reversal matters: the group homomorphism and antihomomorphism identities generally differ.
Suppose the cubing map is a group homomorphism. Expanding and cancelling gives . Alsoso commutes with every cube. For , therefore, and . Multiplying the latter identity on the left by yields ; cancelling gives . Thus the image of a group homomorphism is an abelian group.
A group homomorphism between abelian groups, conventionally written additively. Its kernel and image are subgroups, and the additive formula implies preservation of zero, negation and every integer multiple. Maps on Mordell-Weil groups induced by isogenies of elliptic curves and by good reduction are examples.
A covering homomorphism is a surjective group homomorphism between topological groups whose underlying map is a covering map. Its group kernel is the discrete fibre above the identity element. Group translations identify every other fibre with a coset of that group kernel.
For example, the group homomorphism , , is a covering map from the additive real numbers to the circle group, with group kernel . Small open arcs lift to disjoint intervals, while adding an integer moves between the sheets. A surjective group homomorphism alone need not be a covering map; the local-sheet condition is additional topological information.
A group homomorphism from to the additive cyclic group is determined by the image of , subject to . Conversely every such gives a well-defined map . If , the condition is equivalent to dividing . There are exactly such residues modulo , proving the formula. More generally, homomorphisms from to any group correspond to target elements whose order of a group element divides .
The kernel of a group homomorphism is the group version of a kernel. For , it isIt is a normal subgroup of the domain: for in the group kernel, . The group kernel describes inputs whose effect disappears after mapping. For reduction modulo three from , it is ; for the sign of a permutation on , it is . A group homomorphism is injective exactly when its group kernel contains only the identity element.
For a group homomorphism , two inputs give the same output exactly when . Consequently the fibre over an output is the left coset . These cosets identify precisely the inputs indistinguishable to , which is the mechanism behind the first isomorphism theorem.
Articles by others on the same topic
Like isomorphism, but does not have to be one-to-one: multiple different inputs can have the same output.
This brings us to the key intuition about group homomorphisms: they are a way to split out a larger group into smaller groups that retains a subset of the original structure.
As shown by the fundamental theorem on homomorphisms, each group homomorphism is fully characterized by a normal subgroup of the domain.