B2.5 Homomorphisms
Definition 2.5.1 (Homomorphism). A homomorphism
Proposition 2.5.2 (Basic properties of homomorphisms). Let
. for all . for all and .- If
, then . - If
, then .
Proof. (a)
(b)
(c) For
(d) The set
(e) The set
Note. The homomorphism condition can be expressed as a commutative diagram: the two paths
Definition 2.5.3 (Types of homomorphisms). Let
is a monomorphism (or embedding) if it is injective. is an epimorphism if it is surjective. is an isomorphism if it is bijective.- An isomorphism
is called an automorphism of . The set of all automorphisms of is denoted .
Proposition 2.5.4 (Composites and inverses). Let
is a homomorphism, and if and are isomorphisms, so is .- If
is an isomorphism, then so is its inverse . is a group under composition; it is a subgroup of .
Proof. (a)
(b)
(c)
2.5.1 Kernel and Image
Definition 2.5.5 (Kernel and image). Let
Proposition 2.5.6 (Properties of the kernel and image). Let
is a subgroup of , and is a subgroup of .- For
, if and only if . is injective if and only if . is surjective if and only if .- If
is injective, then is an isomorphism ; so is isomorphic to the subgroup of .
Proof. (a)
(b)
(c) If
(d) This is the definition of surjectivity.
(e) The map
Example 2.5.7 (Important(ish) homomorphisms).
- Inclusion: if
, the inclusion map is an injective homomorphism. - Reduction mod
: , where is the remainder of on division by . Both and are the remainder of , so is a homomorphism. It is surjective, with kernel . - Reduction from
to : if , then , sending to its remainder mod , is a surjective homomorphism, because differs from by or , a multiple of . Example: last two digits last digit, . - Powers of an element: for
, the map , , is a homomorphism, since . By Proposition 2.4.11, its image is the cyclic subgroup . - Determinant: the determinant of Section 5.4,
, is a homomorphism, since (Theorem 5.4.7). Its kernel is . - Exponential:
, , is an isomorphism, with inverse . - Complex exponential:
, , is a surjective homomorphism from to with kernel . Restricted to , it gives an isomorphism : every equals for exactly one , and since differs from by an integer and , we have .
2.5.2 Isomorphisms and Invariants
Definition 2.5.8 (Isomorphic groups). Groups
What properties are preserved by isomorphisms? These are called invariants.
Proposition 2.5.9 (Isomorphism invariants). If
(same order); is abelian iff is abelian; is cyclic iff is cyclic;- for each
, and have the same number of elements of order ; - for each
, and have the same number of subgroups of order .
Proof. Let
(a)
(b) If
(c) If
(d) For
(e) By Proposition 2.5.2,
Example 2.5.10 (Non-isomorphic groups of the same order).
has an element of order 4 (namely, 1); has no element of order 4, since for every (all non-identity elements have order 2).
So they are not isomorphic. In Question 2.6.10 we show that these are the only groups of order 4 up to isomorphism.
Example 2.5.11 (All groups of order 2 are isomorphic). If
Similarly, sending a symmetry of the triangle to the permutation of the vertices it induces is an isomorphism
Question 2.5.12.
- Find
. - Prove that “is isomorphic to” is an equivalence relation on groups.
Show solution
(a) An automorphism
(b) Reflexive: