View source for Homomorphism of groups

{{basicdef}}

''[[Homomorphism]] redirect here. For the more general definition of homomorphism, refer [[homomorphism of universal algebras]]''

<section begin=beginner/>
==Definition==

===Textbook definition (with symbols)===

Let <math>G</math> and <math>H</math> be [[group]]s. Then a map <math>\varphi: G \to H</math> is termed a '''homomorphism''' of groups if <math>\varphi</math> satisfies the following condition:

<math>\varphi(ab) = \varphi(a) \varphi(b)</math> for all <math>a, b</math> in <math>G</math>

===Universal algebraic definition (with symbols)===

Let <math>G</math> and <math>H</math> be [[group]]s. Then a map <math>\varphi:G \to H</math> is termed a '''homomorphism''' of groups if <math>\varphi</math> satisfies ''all'' the following conditions:

* <math>\varphi(ab) = \varphi(a) \varphi(b)</math> for all <math>a, b</math> in <math>G</math>
* <math>\varphi(e) = e</math>
* <math>\varphi(a^{-1}) = (\varphi(a))^{-1}</math>

===Equivalence of definitions===

{{proofat|[[Equivalence of definitions of homomorphism of groups]]}}

The textbook definition and universal algebraic definition of homomorphism of groups are equivalent. In other words, for a map between groups to be a homomorphism of groups, it suffices to check that it preserves the binary operation.

==Facts==

===Composition===

If <math>\alpha: G \to H</math> and <math>\beta: H \to K</math> are homomorphisms, then the composite mapping <math>\beta.\alpha</math> is a homomorphism from <math>G</math> to <math>K</math>. This follows directly from either definition.

===Inverse===

If a homomorphism is bijective, then its set-theoretic inverse map is also a homomorphism.

==Related terms==

===Endomorphism===

{{further|[[endomorphism]]}}

An [[endomorphism]] of a [[group]] is a homomorphism from the group to itself. Note that every group always has the following two endomorphisms:

* The trivial endomorphism that sends every element of the group to the identity element
* The identity map that sends every element to itself

The endomorphisms of a group form a [[monoid]], termed the [[endomorphism monoid]], under composition.

===Isomorphism===

{{further|[[isomorphism of groups]]}}

An isomorphism of groups is a bijective homomorphism from one to the other. Equivalently it is a homomorphism for which an inverse map exists, which is also a homomorphism.

If there exists an isomorphism between two groups, they are termed [[isomorphic groups]]. Isomorphic groups are equivalent with respect to all group-theoretic constructions. In fact, the isomorphism gives the equivalence.

===Automorphism===

{{further|[[automorphism of a group]]}}

An [[automorphism of a group]] is an isomorphism of the group with itself. Equivalently, it is a bijective endomorphism from the group to itself.

Note that every injective endomorphism may not be an automorphism. Similarly, any surjective endomorphism may not be an automorphism.

Automorphisms of groups can be viewed as symmetries of the group structure. The collection of automorphisms of a group forms a group under composition and this is termed the [[automorphism group]] of the given group.
<section end=beginner/>
<section begin=revisit/>
==Kernel and image==

===Kernel===

The '''kernel''' of a homomorphism is defined as the set of elements that get mapped to the identity element in the image. It is a basic result of group theory that a subgroup of a group can be realized as the kernel of a homomorphism of a groups if and only if it is a [[normal subgroup]] {{proofat|[[Normal subgroup equals kernel of homomorphism]]}}

===Image===
The '''image''' of a homomorphism is the set of elements that occur as images of elements. It turns out that the image of any homomorphism is a subgroup of the group on the right. More generally, in fact, the image of any subgroup of a group on the left is a subgroup of the group on the right.{{proofat|[[Homomorphic image of subgroup is subgroup]]}}

Further, it is also true that the '''inverse image''' of any subgroup of the group on the right is a subgroup of the group on the left.{{proofat|[[Inverse image of subgroup is subgroup]]}}

==Other facts==

===Expressibility as composite of surjective and injective homomorphism===

Given any homomorphism <math>\varphi:G \to H</math> of groups, suppose <math>K = \varphi(G)</math>. Then, we can view <math>\varphi</math> as the composite of a surjective homomorphism (viz a [[quotient map]]) from <math>G</math> to <math>K</math> and an injective homomorphism (viz a subgroup inclusion) from <math>K</math> to <math>H</math>. Moreover, this expression (as composite of a surjective and injective homomorphism) is essentially unique.

===Commutes with arbitrary words===

{{further|[[homomorphism commutes with word maps]]}}

Suppose <math>w</math> is a [[word]] in the letters <math>x_1,x_2,\dots,x_n</math> (these are just formal symbols). Suppose <math>\varphi:G \to H</math> is a homomorphism of groups. Then, <math>\varphi</math> commutes with <math>w</math>, i.e.:

<math>\varphi(w(g_1,g_2,\dots,g_n)) = w(\varphi(g_1),\varphi(g_2),\dots,\varphi(g_n)) \ \forall \ g_1,g_2,\dots,g_n \in G</math>

where the <math>w</math> on the left is the [[word map]] in <math>G</math> (i.e., it evaluates the word for a tuple of values of the letters in <math>G</math> and the <math>w</math> on the right is the word map in <math>H</math>.

===Specification on a generating set===

To specify a homomorphism from one group to another, it suffices to specify the values that the homomorphism takes on a [[generating set of a group|generating set]] for the group.

This is because the value that the homomorphism takes on any [[word]] in terms of certain elements is determines by the values taken on those elements.

Some easy corollaries:

* If a homomorphism of a group is known on two subgroups of the group, then it is also known on the subgroup generated by them.
<section end=revisit/>