Example11.1
Let be a group and Define a map by Then is a group homomorphism, since
This homomorphism maps onto the cyclic subgroup of generated by
📚 The CoCalc Library - books, templates and other resources
Important: to view this notebook properly you will need to execute the cell above, which assumes you have an Internet connection. It should already be selected, or place your cursor anywhere above to select. Then press the "Run" button in the menu bar above (the right-pointing arrowhead), or press Shift-Enter on your keyboard.
ParseError: KaTeX parse error: \newcommand{\lt} attempting to redefine \lt; use \renewcommand
A between groups and is a map such that
for The range of in is called the of
Two groups are related in the strongest possible way if they are isomorphic; however, a weaker relationship may exist between two groups. For example, the symmetric group and the group are related by the fact that can be divided into even and odd permutations that exhibit a group structure like that as shown in the following multiplication table.
We use homomorphisms to study relationships such as the one we have just described.
Let be a group and Define a map by Then is a group homomorphism, since
This homomorphism maps onto the cyclic subgroup of generated by
Let If
is in then the determinant is nonzero; that is, Also, for any two elements and in Using the determinant, we can define a homomorphism by
Recall that the circle group consists of all complex numbers such that We can define a homomorphism from the additive group of real numbers to by Indeed,
Geometrically, we are simply wrapping the real line around the circle in a group-theoretic fashion.
The following proposition lists some basic properties of group homomorphisms.
Let be a homomorphism of groups. Then
If is the identity of then is the identity of
For any element
If is a subgroup of then is a subgroup of
If is a subgroup of then is a subgroup of Furthermore, if is normal in then is normal in
(1) Suppose that and are the identities of and respectively; then
By cancellation,
(2) This statement follows from the fact that
(3) The set is nonempty since the identity of is in Suppose that is a subgroup of and let and be in There exist elements such that and Since
is a subgroup of by Proposition 3.31.
(4) Let be a subgroup of and define to be that is, is the set of all such that The identity is in since If and are in then is in since is a subgroup of Therefore, and is a subgroup of If is normal in we must show that for and But
since is a normal subgroup of Therefore,
Let be a group homomorphism and suppose that is the identity of By Proposition 11.4, is a subgroup of This subgroup is called the of and will be denoted by In fact, this subgroup is a normal subgroup of since the trivial subgroup is normal in We state this result in the following theorem, which says that with every homomorphism of groups we can naturally associate a normal subgroup.
Let be a group homomorphism. Then the kernel of is a normal subgroup of
Let us examine the homomorphism defined by Since 1 is the identity of the kernel of this homomorphism is all matrices having determinant one. That is,
The kernel of the group homomorphism defined by is Notice that
Suppose that we wish to determine all possible homomorphisms from to Since the kernel of must be a subgroup of there are only two possible kernels, and all of The image of a subgroup of must be a subgroup of Hence, there is no injective homomorphism; otherwise, would have a subgroup of order 7, which is impossible. Consequently, the only possible homomorphism from to is the one mapping all elements to zero.
Let be a group. Suppose that and is the homomorphism from to given by If the order of is infinite, then the kernel of this homomorphism is since maps onto the cyclic subgroup of generated by However, if the order of is finite, say then the kernel of is