In abstract algebra, a group isomorphism is a function between two groups that sets up a bijection 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.
Definition and notation Given two groups ( G , ∗ ) {\displaystyle (G,*)} and ( H , ⊙ ) , {\displaystyle (H,\odot ),} a group isomorphism from ( G , ∗ ) {\displaystyle (G,*)} to ( H , ⊙ ) {\displaystyle (H,\odot )} is a bijective group homomorphism from G {\displaystyle G} to H . {\displaystyle H.} Spelled out, this means that a group isomorphism is a bijective function f : G → H {\displaystyle f:G\to H} such that for all u {\displaystyle u} and v {\displaystyle v} in G {\displaystyle G} it holds that
f ( u ∗ v ) = f ( u ) ⊙ f ( v ) . {\displaystyle f(u*v)=f(u)\odot f(v).}
The two groups ( G , ∗ ) {\displaystyle (G,*)} and ( H , ⊙ ) {\displaystyle (H,\odot )} are isomorphic if there exists an isomorphism from one to the other. This is written
( G , ∗ ) ≅ ( H , ⊙ ) . {\displaystyle (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 ≅ H . {\displaystyle G\cong H.}
Sometimes one can even simply write G = H . {\displaystyle 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 , ∗ ) , {\displaystyle (G,*),} a set H , {\displaystyle H,} and a bijection f : G → H , {\displaystyle f:G\to H,} we can make H {\displaystyle H} a group ( H , ⊙ ) {\displaystyle (H,\odot )} by defining
f ( u ) ⊙ f ( v ) = f ( u ∗ v ) . {\displaystyle f(u)\odot f(v)=f(u*v).}
If H = G {\displaystyle H=G} and ⊙ = ∗ {\displaystyle \odot =*} then the bijection is an automorphism (q.v.). Intuitively, group theorists view two isomorphic groups as follows: For every element g {\displaystyle g} of a group G , {\displaystyle G,} there exists an element h {\displaystyle h} of H {\displaystyle H} such that h {\displaystyle h} "behaves in the same way" as g {\displaystyle g} (operates with other elements of the group in the same way as g {\displaystyle g} ). For instance, if g {\displaystyle g} generates G , {\displaystyle G,} then so does h . {\displaystyle h.} This implies, in particular, that G {\displaystyle G} and H {\displaystyle 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 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 numbers under addition, ( R , + ) {\displaystyle (\mathbb {R} ,+)} , is isomorphic to the group of positive real numbers under multiplication ( R + , × ) {\displaystyle (\mathbb {R} ^{+},\times )} :
… excerpt ends here. Continue reading the full article.
