# Group isomorphism

This article needs additional citations for verification. (June 2015) (Learn how and when to remove this template message) |

In abstract algebra, a **group isomorphism** is a function between two groups that sets up a one-to-one correspondence between the elements of the groups in a way that respects the given group operations. If there exists an isomorphism between two groups, then the groups are called **isomorphic**. From the standpoint of group theory, isomorphic groups have the same properties and need not be distinguished.

## Contents

## Definition and notation[edit]

Given two groups (`G`, ∗) and (`H`, ), a *group isomorphism* from (`G`, ∗) to (`H`, ) is a bijective group homomorphism from `G` to `H`. Spelled out, this means that a group isomorphism is a bijective function such that for all `u` and `v` in `G` it holds that

- .

The two groups (`G`, ∗) and (`H`, ) are isomorphic if there exists an isomorphism from one to the other. This is written:

Often shorter and simpler notations can be used; when the relevant group operations are unambiguous they are omitted and one writes:

Sometimes one can even simply write `G` = `H`. Whether such a notation is possible without confusion or ambiguity depends on context. For example, the equals sign is not very suitable when the groups are both subgroups of the same group. See also the examples.

Conversely, given a group (`G`, ∗), a set `H`, and a bijection , we can make `H` a group (`H`, ) by defining

- .

If `H` = `G` and = ∗ then the bijection is an automorphism (*q.v.*).

Intuitively, group theorists view two isomorphic groups as follows: For every element *g* of a group *G*, there exists an element *h* of *H* such that *h* 'behaves in the same way' as *g* (operates with other elements of the group in the same way as *g*). For instance, if *g* generates *G*, then so does *h*; this implies in particular that *G* and *H* are in bijective correspondence. Thus, the definition of an isomorphism is quite natural.

An isomorphism of groups may equivalently be defined as an invertible morphism in the category of groups, where invertible here means has a two-sided inverse.

## Examples[edit]

In this section some notable examples of isomorphic groups are listed.

- The group of all real numbers with addition, (,+), is isomorphic to the group of positive real numbers with multiplication (
^{+},×):

- via the isomorphism
- (see exponential function).

- The group of integers (with addition) is a subgroup of , and the factor group is isomorphic to the group of complex numbers of absolute value 1 (with multiplication):

- The Klein four-group is isomorphic to the direct product of two copies of (see modular arithmetic), and can therefore be written . Another notation is Dih
_{2}, because it is a dihedral group. - Generalizing this, for all odd
*n*, Dih_{2n}is isomorphic with the direct product of Dih_{n}and Z_{2}. - If (
*G*, ∗) is an infinite cyclic group, then (*G*, ∗) is isomorphic to the integers (with the addition operation). From an algebraic point of view, this means that the set of all integers (with the addition operation) is the 'only' infinite cyclic group.

Some groups can be proven to be isomorphic, relying on the axiom of choice, but the proof does not indicate how to construct a concrete isomorphism. Examples:

- The group (, +) is isomorphic to the group (, +) of all complex numbers with addition.
^{[1]} - The group (
^{*}, ·) of non-zero complex numbers with multiplication as operation is isomorphic to the group*S*^{1}mentioned above.

## Properties[edit]

The kernel of an isomorphism from (*G*, ∗) to (*H*, ), is always {e_{G}} where e_{G} is the identity of the group (*G*, ∗)

If (*G*, ∗) is isomorphic to (*H*,), and if *G* is abelian then so is *H*.

If (*G*, ∗) is a group that is isomorphic to (*H*, ) [where *f* is the isomorphism], then if *a* belongs to *G* and has order *n*, then so does *f(a)*.

If (*G*, ∗) is a locally finite group that is isomorphic to (*H*, ), then (*H*, ) is also locally finite.

The number of distinct groups (when isomorphic groups are considered equal) of order is given by sequence A000001 in OEIS. The first few numbers are 0, 1, 1, 1 and 2 meaning that 4 is the lowest order with more than one group.

## Cyclic groups[edit]

All cyclic groups of a given order are isomorphic to .

Let *G* be a cyclic group and *n* be the order of *G*. *G* is then the group generated by .
We will show that

Define

- , so that . Clearly, is bijective.

Then

- , which proves that .

## Consequences[edit]

From the definition, it follows that any isomorphism will map the identity element of `G` to the identity element of `H`,

that it will map inverses to inverses,

and more generally, *n*th powers to *n*th powers,

for all `u` in `G`,
and that the inverse map is also a group isomorphism.

The relation "being isomorphic" satisfies all the axioms of an equivalence relation. If `f` is an isomorphism between two groups `G` and `H`, then everything that is true about `G` that is only related to the group structure can be translated via `f` into a true ditto statement about `H`, and vice versa.

## Automorphisms[edit]

An isomorphism from a group (`G`, ∗) to itself is called an automorphism of this group. Thus it is a bijection such that

- .

An automorphism always maps the identity to itself; the image under an automorphism of a conjugacy class is always a conjugacy class (the same or another). The image of an element has the same order as that element.

The composition of two automorphisms is again an automorphism, and with this operation the set of all automorphisms of a group `G`, denoted by Aut(`G`), forms itself a group, the *automorphism group* of `G`.

For all abelian groups there is at least the automorphism that replaces the group elements by their inverses. However, in groups where all elements are equal to their inverse this is the trivial automorphism, e.g. in the Klein four-group. For that group all permutations of the three non-identity elements are automorphisms, so the automorphism group is isomorphic to `S`_{3} and Dih_{3}.

In Z_{p} for a prime number `p`, one non-identity element can be replaced by any other, with corresponding changes in the other elements. The automorphism group is isomorphic to Z_{p − 1}. For example, for `n` = 7, multiplying all elements of Z_{7} by 3, modulo 7, is an automorphism of order 6 in the automorphism group, because 3^{6} ≡ 1 (modulo 7), while lower powers do not give 1. Thus this automorphism generates Z_{6}. There is one more automorphism with this property: multiplying all elements of Z_{7} by 5, modulo 7. Therefore, these two correspond to the elements 1 and 5 of Z_{6}, in that order or conversely.

The automorphism group of Z_{6} is isomorphic to Z_{2}, because only each of the two elements 1 and 5 generate Z_{6}, so apart from the identity we can only interchange these.

The automorphism group of Z_{2} ⊕ Z_{2} ⊕ Z_{2} = Dih_{2} ⊕ Z_{2} has order 168, as can be found as follows. All 7 non-identity elements play the same role, so we can choose which plays the role of (1,0,0). Any of the remaining 6 can be chosen to play the role of (0,1,0); this determines which corresponds to (1,1,0). For (0,0,1) we can choose from 4, which determines the rest, thus we have 7 × 6 × 4 = 168 automorphisms. They correspond to those of the Fano plane, of which the 7 points correspond to the 7 non-identity elements; the lines connecting three points correspond to the group operation: *a*, *b*, and *c* on one line means *a* + *b* = *c*, *a* + *c* = *b*, and *b* + *c* = *a*. See also general linear group over finite fields.

For abelian groups all automorphisms except the trivial one are called outer automorphisms.

Non-abelian groups have a non-trivial inner automorphism group, and possibly also outer automorphisms.

## See also[edit]

## References[edit]

- Herstein, I. N.,
*Topics in Algebra*, Wiley; 2 edition (June 20, 1975), ISBN 0-471-01090-1.

**^**Ash (1973). "A Consequence of the Axiom of Choice".*Journal of the Australian Mathematical Society*.**19**: 306–308. Retrieved 21 September 2013.