HOME

TheInfoList



OR:

In
abstract algebra In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are set (mathematics), sets with specific operation (mathematics), operations acting on their elements. Algebraic structur ...
, a group isomorphism is a function between two groups that sets up a
bijection In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equival ...
between the elements of the groups in a way that respects the given group operations. If there exists an
isomorphism In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between the ...
between two groups, then the groups are called isomorphic. From the standpoint of
group theory In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ( ...
, isomorphic groups have the same properties and need not be distinguished.


Definition and notation

Given two groups (G, *) and (H, \odot), a ''group isomorphism'' from (G, *) to (H, \odot) is a
bijective In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equival ...
group homomorphism In mathematics, given two groups, (''G'',∗) and (''H'', ·), a group homomorphism from (''G'',∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that : h(u*v) = h(u) \cdot h(v) whe ...
from G to H. Spelled out, this means that a group isomorphism is a bijective function f : G \to H such that for all u and v in G it holds that f(u * v) = f(u) \odot f(v). The two groups (G, *) and (H, \odot) are isomorphic if there exists an isomorphism from one to the other. This is written (G, *) \cong (H, \odot). Often shorter and simpler notations can be used. When the relevant group operations are understood, they are omitted and one writes G \cong H. 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
subgroup In group theory, a branch of mathematics, a subset of a group G is a subgroup of G if the members of that subset form a group with respect to the group operation in G. Formally, given a group (mathematics), group under a binary operation  ...
s of the same group. See also the examples. Conversely, given a group (G, *), a set H, and a
bijection In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equival ...
f : G \to H, we can make H a group (H, \odot) by defining f(u) \odot f(v) = f(u * v). If H = G and \odot = * then the bijection is an
automorphism In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all 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 In mathematics, the concept of an inverse element generalises the concepts of opposite () and reciprocal () of numbers. Given an operation denoted here , and an identity element denoted , if , one says that is a left inverse of , and that ...
group homomorphism (the inverse function of a bijective group homomorphism is also a group homomorphism).


Examples

In this section some notable examples of isomorphic groups are listed. * The group of all
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
s under addition, (\R, +), is isomorphic to the group of positive real numbers under multiplication (\R^+, \times): *:(\R, +) \cong (\R^+, \times) via the isomorphism f(x) = e^x. * The group \Z of
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
s (with addition) is a subgroup of \R, and the factor group \R/\Z is isomorphic to the group S^1 of
complex number In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the for ...
s of
absolute value In mathematics, the absolute value or modulus of a real number x, is the non-negative value without regard to its sign. Namely, , x, =x if x is a positive number, and , x, =-x if x is negative (in which case negating x makes -x positive), ...
1 (under multiplication): *:\R/\Z \cong S^1 * The
Klein four-group In mathematics, the Klein four-group is an abelian group with four elements, in which each element is Involution (mathematics), self-inverse (composing it with itself produces the identity) and in which composing any two of the three non-identi ...
is isomorphic to the direct product of two copies of \Z_2 = \Z/2\Z, and can therefore be written \Z_2 \times \Z_2. Another notation is \operatorname_2, because it is a
dihedral group In mathematics, a dihedral group is the group (mathematics), group of symmetry, symmetries of a regular polygon, which includes rotational symmetry, rotations and reflection symmetry, reflections. Dihedral groups are among the simplest example ...
. * Generalizing this, for all odd n, \operatorname_ is isomorphic to the direct product of \operatorname_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 In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing one element from e ...
, but the proof does not indicate how to construct a concrete isomorphism. Examples: * The group (\R, +) is isomorphic to the group (\Complex, +) of all complex numbers under addition. * The group (\Complex^*, \cdot) of non-zero complex numbers with multiplication as the operation is isomorphic to the group S^1 mentioned above.


Properties

The kernel of an isomorphism from (G, *) to (H, \odot) is always , where eG is the identity of the group (G, *) If (G, *) and (H, \odot) are isomorphic, then G is abelian if and only if H is abelian. If f is an isomorphism from (G, *) to (H, \odot), then for any a \in G, the order of a equals the order of f(a). If (G, *) and (H, \odot) are isomorphic, then (G, *) is a locally finite group if and only if (H, \odot) is locally finite. The number of distinct groups (up to isomorphism) of order n is given by
sequence In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is cal ...
A000001 in the 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

All cyclic groups of a given order are isomorphic to (\Z_n, +_n), where +_n denotes addition
modulo In computing and mathematics, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, the latter being called the '' modulus'' of the operation. Given two positive numbers and , mo ...
n. Let G be a cyclic group and n be the order of G. Letting x be a generator of G, G is then equal to \langle x \rangle = \left\. We will show that G \cong (\Z_n, +_n). Define \varphi : G \to \Z_n = \, so that \varphi(x^a) = a. Clearly, \varphi is bijective. Then \varphi(x^a \cdot x^b) = \varphi(x^) = a + b = \varphi(x^a) +_n \varphi(x^b), which proves that G \cong (\Z_n, +_n).


Consequences

From the definition, it follows that any isomorphism f : G \to H will map the identity element of G to the identity element of H, f(e_G) = e_H, that it will map inverses to inverses, f(u^) = f(u)^ \quad \text u \in G, and more generally, nth powers to nth powers, f(u^n)= f(u)^n \quad \text u \in G, and that the inverse map f^ : H \to G is also a group isomorphism. The relation "being isomorphic" is 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

An isomorphism from a group (G, *) to itself is called an
automorphism In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphism ...
of the group. Thus it is a bijection f : G \to G such that f(u) * f(v) = f(u * v). The
image An image or picture is a visual representation. An image can be Two-dimensional space, two-dimensional, such as a drawing, painting, or photograph, or Three-dimensional space, three-dimensional, such as a carving or sculpture. Images may be di ...
under an automorphism of a
conjugacy class In mathematics, especially group theory, two elements a and b of a group are conjugate if there is an element g in the group such that b = gag^. This is an equivalence relation whose equivalence classes are called conjugacy classes. In other ...
is always a conjugacy class (the same or another). The composition of two automorphisms is again an automorphism, and with this operation the set of all automorphisms of a group G, denoted by \operatorname(G), itself forms 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 inverses this is the trivial automorphism, e.g. in the
Klein four-group In mathematics, the Klein four-group is an abelian group with four elements, in which each element is Involution (mathematics), self-inverse (composing it with itself produces the identity) and in which composing any two of the three non-identi ...
. For that group all
permutation In mathematics, a permutation of a set can mean one of two different things: * an arrangement of its members in a sequence or linear order, or * the act or process of changing the linear order of an ordered set. An example of the first mean ...
s of the three non-identity elements are automorphisms, so the automorphism group is isomorphic to S_3 (which itself is isomorphic to \operatorname_3). In \Z_p for a
prime number A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime ...
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_ 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 \equiv 1 \pmod 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 \oplus \Z_2 \oplus \Z_2 = \operatorname_2 \oplus \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 element corresponds to (1,1,0). For (0,0,1) we can choose from 4, which determines the rest. Thus we have 7 \times 6 \times 4 = 168 automorphisms. They correspond to those of the Fano plane, of which the 7 points correspond to the 7 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 non-trivial automorphisms are outer automorphisms. Non-abelian groups have a non-trivial inner automorphism group, and possibly also outer automorphisms.


See also

* Group isomorphism problem *


References

* {{reflist Group theory Morphisms