Actions

Difference between revisions of "Group homomorphism"

From Online Dictionary of Crystallography

m
m (Style edits to align with printed edition)
Line 5: Line 5:
 
==Homomorphism between groups==
 
==Homomorphism between groups==
  
A '''group homomorphism''' from a [[group]] (''G'', *) to a [[group]] (''H'', #) is a [[mapping]] ''f'' : ''G'' → ''H'' that preserves the composition law, i.e. for all ''u'' and ''v'' in ''G'' one has:
+
A '''group homomorphism''' from a [[group]] (''G'', *) to a [[group]] (''H'', #) is a [[mapping]] ''f'' : ''G'' → ''H'' that preserves the composition law, ''i.e.'' for all ''u'' and ''v'' in ''G'' one has:
 
<div align="center">
 
<div align="center">
 
''f''(''u'' * ''v'') = ''f''(''u'') # ''f''(''v'').
 
''f''(''u'' * ''v'') = ''f''(''u'') # ''f''(''v'').
 
</div>
 
</div>
  
 
+
A homomorphism ''f'' maps the identity element 1<sub>''G''</sub> of ''G'' to the identity element 1<sub>''H''</sub> of ''H'', and it also maps inverses to inverses: ''f''(''u''<sup>&minus;1</sup>) = ''f''(''u'')<sup>&minus;1</sup>.
A homomorphism ''f'' maps the identity element 1<sub>''G''</sub> of ''G'' to the identity element 1<sub>''H''</sub> of ''H'', and it also maps inverses to inverses: ''f''(''u''<sup>-1</sup>) = ''f''(''u'')<sup>-1</sup>.
 
  
  
 
== Kernel and image==
 
== Kernel and image==
  
[[Image:Homomorphism.jpg|thumb|240px|'''Group homomorphism'''. The kernel of the homomorphism, ker( ''f'' ) is the set of elements of ''G'' that are mapped to the identity element of ''H''. The image of the homomorphism, im( ''f'' ), is the set of elements of ''H'' to which at least one element of ''G'' is mapped. im( ''f'' ) is not required to be the whole of ''H'']]
+
[[Image:Homomorphism.jpg|thumb|240px|'''Group homomorphism'''. The kernel of the homomorphism, ker(''f''), is the set of elements of ''G'' that are mapped to the identity element of ''H''. The image of the homomorphism, im(''f''), is the set of elements of ''H'' to which at least one element of ''G'' is mapped. im(''f'') is not required to be the whole of ''H''.]]
  
 
The ''kernel'' of the homomorphism ''f'' is the set of elements of ''G'' that are [[mapping|mapped]] to the identity of ''H'':
 
The ''kernel'' of the homomorphism ''f'' is the set of elements of ''G'' that are [[mapping|mapped]] to the identity of ''H'':
 
<div align="center">
 
<div align="center">
ker( ''f'' ) = { ''u'' in ''G'' : ''f''(''u'') = 1<sub>''H''</sub> }  
+
ker(''f'') = { ''u'' in ''G'' : ''f''(''u'') = 1<sub>''H''</sub> }.
 
</div>
 
</div>
  
 
The ''image'' of the homomorphism ''f'' is the subset of elements of ''H'' to which at least one element of ''G'' is mapped by ''f'':
 
The ''image'' of the homomorphism ''f'' is the subset of elements of ''H'' to which at least one element of ''G'' is mapped by ''f'':
 
<div align="center">
 
<div align="center">
im( ''f'' ) = { ''f''(''u'') : ''u'' in ''G'' }.
+
im(''f'') = { ''f''(''u'') : ''u'' in ''G'' }.
 
</div>
 
</div>
  
Line 33: Line 32:
 
== Types of homomorphisms ==
 
== Types of homomorphisms ==
  
Homomorphisms can be classified according to different criteria, among which the relation between ''G'' and ''H'' and the nature of the mapping.
+
Homomorphisms can be classified according to different criteria, among which are the relation between ''G'' and ''H'' and the nature of the mapping.
  
 
===Surjective, injective and bijective homomorphisms===
 
===Surjective, injective and bijective homomorphisms===
Line 39: Line 38:
 
[[Image:Epimorphism.jpg|thumb|240px|An '''epimorphism''' is a surjective homomorphism, i.e. a homomorphism such that the image is the entire [[Mapping|codomain]]]]
 
[[Image:Epimorphism.jpg|thumb|240px|An '''epimorphism''' is a surjective homomorphism, i.e. a homomorphism such that the image is the entire [[Mapping|codomain]]]]
  
An '''epimorphism''' is a [[mapping|surjective]] homomorphism, that is, a homomorphism which is ''onto'' as a mapping. The image of the homomorphism is the whole of ''H'', i.e. im( ''f'' ) = ''H''
+
An '''epimorphism''' is a [[mapping|surjective]] homomorphism, that is, a homomorphism which is ''onto'' as a mapping. The image of the homomorphism is the whole of ''H'', ''i.e.'' im(''f'') = ''H''.
  
  
[[Image:Monomorphism.jpg|thumb|240px|A '''monomorphism''' is an injective homomorphism, i.e. a homomorphism where different elements of ''G'' are mapped to different elements of ''H'']]
+
[[Image:Monomorphism.jpg|thumb|240px|A '''monomorphism''' is an injective homomorphism, ''i.e.'' a homomorphism where different elements of ''G'' are mapped to different elements of ''H''.]]
 
A '''monomorphism''' is an [[mapping|injective]] homomorphism, that is, a homomorphism which is ''one-to-one'' as a mapping. In this case, ker( ''f'' ) = {1<sub>''G''</sub> }.
 
A '''monomorphism''' is an [[mapping|injective]] homomorphism, that is, a homomorphism which is ''one-to-one'' as a mapping. In this case, ker( ''f'' ) = {1<sub>''G''</sub> }.
  
  
[[Image:Isomorphism.jpg|thumb|240px|An '''isomorphism''' is a bijective homomorphism, i.e. it is a one-to-one correspondence between the elements of ''G'' and those of ''H''. Isomorphic groups (''G'',*) and (''H'',#) differ only in the notation of their elements and binary operations]]
+
[[Image:Isomorphism.jpg|thumb|240px|An '''isomorphism''' is a bijective homomorphism, ''i.e.'' it is a one-to-one correspondence between the elements of ''G'' and those of ''H''. Isomorphic groups (''G'',*) and (''H'',#) differ only in the notation of their elements and binary operations.]]
  
 
If the homomorphism ''f'' is a [[mapping|bijection]], then its inverse is also a group homomorphism, and ''f'' is called an '''[[group isomorphism| isomorphism]]'''; the groups (''G'',*) and (''H'',#) are called ''isomorphic'' and differ only in the notation of their elements (and possibly their binary operations), while they can be regarded as identical for most practical purposes.
 
If the homomorphism ''f'' is a [[mapping|bijection]], then its inverse is also a group homomorphism, and ''f'' is called an '''[[group isomorphism| isomorphism]]'''; the groups (''G'',*) and (''H'',#) are called ''isomorphic'' and differ only in the notation of their elements (and possibly their binary operations), while they can be regarded as identical for most practical purposes.
Line 53: Line 52:
 
===Homomorphisms from a group to itself (G = H)===
 
===Homomorphisms from a group to itself (G = H)===
  
[[Image:Endomorphism.jpg|thumb|240px|An '''endomorphism''' is homomorphism of ''G'' to itself]]
+
[[Image:Endomorphism.jpg|thumb|240px|An '''endomorphism''' is a homomorphism of ''G'' to itself.]]
  
An '''endomorphism''' is a homomorphism of a group to itself: ''f'': ''G'' &rarr; ''G''.
+
An '''endomorphism''' is a homomorphism of a group to itself: ''f'' : ''G'' &rarr; ''G''.
  
 
A [[mapping|bijective]] (invertible) endomorphism (which is hence an [[group isomorphism| isomorphism]]) is called an '''[[automorphism]]'''. The kernel of the automorphism is the identity of ''G'' (1<sub>G</sub>) and the image of the automorphism coincides with ''G''. The set of all automorphisms of a group (''G'',*) forms itself a group, the ''automorphism group'' of ''G'', '''Aut(''G'')'''.  
 
A [[mapping|bijective]] (invertible) endomorphism (which is hence an [[group isomorphism| isomorphism]]) is called an '''[[automorphism]]'''. The kernel of the automorphism is the identity of ''G'' (1<sub>G</sub>) and the image of the automorphism coincides with ''G''. The set of all automorphisms of a group (''G'',*) forms itself a group, the ''automorphism group'' of ''G'', '''Aut(''G'')'''.  
  
 
[[Category:Fundamental crystallography]]
 
[[Category:Fundamental crystallography]]

Revision as of 12:30, 15 May 2017

Homomorphisme de groupes (Fr). Gruppenhomomorphismus (Ge). Homomorfismo de grupos (Sp). Omomorfismo di gruppi (It). 準同形 (Ja).


Homomorphism between groups

A group homomorphism from a group (G, *) to a group (H, #) is a mapping f : GH that preserves the composition law, i.e. for all u and v in G one has:

f(u * v) = f(u) # f(v).

A homomorphism f maps the identity element 1G of G to the identity element 1H of H, and it also maps inverses to inverses: f(u−1) = f(u)−1.


Kernel and image

Group homomorphism. The kernel of the homomorphism, ker(f), is the set of elements of G that are mapped to the identity element of H. The image of the homomorphism, im(f), is the set of elements of H to which at least one element of G is mapped. im(f) is not required to be the whole of H.

The kernel of the homomorphism f is the set of elements of G that are mapped to the identity of H:

ker(f) = { u in G : f(u) = 1H }.

The image of the homomorphism f is the subset of elements of H to which at least one element of G is mapped by f:

im(f) = { f(u) : u in G }.

The kernel is a normal subgroup of G and the image is a subgroup of H.


Types of homomorphisms

Homomorphisms can be classified according to different criteria, among which are the relation between G and H and the nature of the mapping.

Surjective, injective and bijective homomorphisms

An epimorphism is a surjective homomorphism, i.e. a homomorphism such that the image is the entire codomain

An epimorphism is a surjective homomorphism, that is, a homomorphism which is onto as a mapping. The image of the homomorphism is the whole of H, i.e. im(f) = H.


A monomorphism is an injective homomorphism, i.e. a homomorphism where different elements of G are mapped to different elements of H.

A monomorphism is an injective homomorphism, that is, a homomorphism which is one-to-one as a mapping. In this case, ker( f ) = {1G }.


An isomorphism is a bijective homomorphism, i.e. it is a one-to-one correspondence between the elements of G and those of H. Isomorphic groups (G,*) and (H,#) differ only in the notation of their elements and binary operations.

If the homomorphism f is a bijection, then its inverse is also a group homomorphism, and f is called an isomorphism; the groups (G,*) and (H,#) are called isomorphic and differ only in the notation of their elements (and possibly their binary operations), while they can be regarded as identical for most practical purposes.


Homomorphisms from a group to itself (G = H)

An endomorphism is a homomorphism of G to itself.

An endomorphism is a homomorphism of a group to itself: f : GG.

A bijective (invertible) endomorphism (which is hence an isomorphism) is called an automorphism. The kernel of the automorphism is the identity of G (1G) and the image of the automorphism coincides with G. The set of all automorphisms of a group (G,*) forms itself a group, the automorphism group of G, Aut(G).