Example 11.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
Example 11.2.
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
Example 11.3.
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.
(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,
Example 11.8.
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 which is impossible. Consequently, the only possible homomorphism from to is the one mapping all elements to zero.
Example 11.9.
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