S. D. V. Stephens

notes / Studies in Algebra and Group Theory / chapter 1: Sets and Groups / From my book

B2.5 Homomorphisms

Definition 2.5.1 (Homomorphism). A homomorphism between groups is a map satisfying

Proposition 2.5.2 (Basic properties of homomorphisms). Let be a homomorphism.

  1. .
  2. for all .
  3. for all and .
  4. If , then .
  5. If , then .

Proof. (a) . Multiply both sides by : .

(b) , and similarly . So is the inverse of .

(c) For : induction, using . For : part (a). For : .

(d) The set is nonempty, since is. For (with ): , since . Apply the subgroup criterion.

(e) The set contains , since . For : (since ), so . Apply the subgroup criterion. ∎

Note. The homomorphism condition can be expressed as a commutative diagram: the two paths and give the same result. It does not matter whether we multiply first or apply first.

Commutative square: φ×φ from G×G to H×H along the top, m_G down the left to G, m_H down the right to H, and φ from G to H along the bottom.

Definition 2.5.3 (Types of homomorphisms). Let be a homomorphism.

  1. is a monomorphism (or embedding) if it is injective.
  2. is an epimorphism if it is surjective.
  3. is an isomorphism if it is bijective.
  4. An isomorphism is called an automorphism of . The set of all automorphisms of is denoted .

Proposition 2.5.4 (Composites and inverses). Let and be homomorphisms.

  1. is a homomorphism, and if and are isomorphisms, so is .
  2. If is an isomorphism, then so is its inverse .
  3. is a group under composition; it is a subgroup of .

Proof. (a) , and a composite of bijections is a bijection.

(b) is a bijection (Proposition 1.5.5). For , let . Then .

(c) contains , and it is closed under composition and inverses by (a) and (b). ∎

2.5.1 Kernel and Image

Definition 2.5.5 (Kernel and image). Let be a homomorphism. The kernel and the image of are

Proposition 2.5.6 (Properties of the kernel and image). Let be a homomorphism.

  1. is a subgroup of , and is a subgroup of .
  2. For , if and only if .
  3. is injective if and only if .
  4. is surjective if and only if .
  5. If is injective, then is an isomorphism ; so is isomorphic to the subgroup of .

Proof. (a) and , so both are subgroups by Proposition 2.5.2(d) and (e).

(b) .

(c) If is injective and , then , so . Conversely, if and , then by (b), so .

(d) This is the definition of surjectivity.

(e) The map , , is a homomorphism, injective because is, and surjective by definition of . ∎

Example 2.5.7 (Important(ish) homomorphisms).

  1. Inclusion: if , the inclusion map is an injective homomorphism.
  2. 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 .
  3. 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, .
  4. Powers of an element: for , the map , , is a homomorphism, since . By Proposition 2.4.11, its image is the cyclic subgroup .
  5. Determinant: the determinant of Section 5.4, , is a homomorphism, since (Theorem 5.4.7). Its kernel is .
  6. Exponential: , , is an isomorphism, with inverse .
  7. 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 and are isomorphic, written , if there exists an isomorphism . Isomorphic groups are “the same” for all group-theoretic purposes: the elements and the law may have different names, but the structure is identical.

What properties are preserved by isomorphisms? These are called invariants.

Proposition 2.5.9 (Isomorphism invariants). If , then:

  1. (same order);
  2. is abelian iff is abelian;
  3. is cyclic iff is cyclic;
  4. for each , and have the same number of elements of order ;
  5. for each , and have the same number of subgroups of order .

Proof. Let be an isomorphism. Since is also an isomorphism (Proposition 2.5.4), for (b) and (c) it suffices to prove one direction.

(a) is a bijection.

(b) If is abelian and , write . Then .

(c) If , then , using Proposition 2.5.2(c).

(d) For and , , which equals if and only if , since is injective. So , and restricts to a bijection from the elements of order in to those in .

(e) By Proposition 2.5.2, sends subgroups of to subgroups of , and sends subgroups of to subgroups of . Since is bijective, and (Proposition 1.5.2), so these are inverse bijections between the subgroups of and those of ; and , since is injective. ∎

Example 2.5.10 (Non-isomorphic groups of the same order). and both have order 4, but:

  • 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 , write with . If , then cancellation would give ; so , and the multiplication table of is Any two groups of order 2 have this table up to renaming, so the bijection matching their identities and their other elements is an isomorphism. For example, , , and are all isomorphic.

Similarly, sending a symmetry of the triangle to the permutation of the vertices it induces is an isomorphism (Example 2.2.13).

Question 2.5.12.

  1. Find .
  2. Prove that “is isomorphic to” is an equivalence relation on groups.
Show solution

(a) An automorphism of is determined by , since by Proposition 2.5.2(c). Its image is , which must be all of , so . Both choices give automorphisms, and . Thus (Example 2.5.11).

(b) Reflexive: is an isomorphism. Symmetric: if is an isomorphism, so is . Transitive: if and are isomorphisms, so is . The last two statements are Proposition 2.5.4.