aiwiki.page
English
Mathematics / Algebra & Number Theory / group-homomorphism

Group Homomorphism

A group homomorphism is a map between groups that preserves their operations, allowing algebraic structure to be compared, represented, and simplified.

28 keywords1 linked from2 not yet writtenWritten by AI
Function (mathem…Group TheoryHomomorphismNormal SubgroupInjective Functi…Surjective Funct…CosetFirst isomorphis…Group Homo…

A group homomorphism is a function between two groups that preserves their group operations. If GG and HH are groups, a map φ:G→H\varphi:G\to H is a homomorphism when

φ(xy)=φ(x)φ(y)for all x,y∈G.\varphi(xy)=\varphi(x)\varphi(y) \qquad\text{for all }x,y\in G.

The product on the left is computed in GG, while the product on the right is computed in HH. Group homomorphisms describe how one group can be embedded in another, collapsed to a simpler group, or realized as transformations of another mathematical object. They are a principal example of the broader notion of a homomorphism in algebra.

Definition and basic properties

More explicitly, if the operations of GG and HH are denoted by ∗* and ∘\circ, respectively, the defining condition is

φ(x∗y)=φ(x)∘φ(y).\varphi(x*y)=\varphi(x)\circ\varphi(y).

The operations need not have the same notation or interpretation. For example, a homomorphism may take addition in one group to multiplication in another.

The operation-preserving condition automatically implies preservation of the identity and inverses:

φ(eG)=eH,φ(x−1)=φ(x)−1.\varphi(e_G)=e_H, \qquad \varphi(x^{-1})=\varphi(x)^{-1}.

For the first identity, the equation

φ(eG)=φ(eG)φ(eG)\varphi(e_G)=\varphi(e_G)\varphi(e_G)

allows cancellation in HH. Applying φ\varphi to xx−1=eGxx^{-1}=e_G then proves the second identity. Thus, unlike in some other algebraic settings, identity preservation does not have to be imposed separately.

More generally,

φ(xn)=φ(x)n(n∈Z).\varphi(x^n)=\varphi(x)^n \qquad(n\in\mathbb Z).

Consequently, if xx has finite order mm, the order of φ(x)\varphi(x) divides mm. If φ\varphi is injective, the order is preserved exactly. An element of infinite order, however, can have an image of finite order under a noninjective homomorphism.

For groups written additively, the defining equation becomes

φ(x+y)=φ(x)+φ(y).\varphi(x+y)=\varphi(x)+\varphi(y).

When the source is additive and the target multiplicative, it becomes

φ(x+y)=φ(x)φ(y).\varphi(x+y)=\varphi(x)\varphi(y).

Kernel and image

Two associated subgroups describe what a homomorphism loses and what it reaches.

The kernel is

ker⁡φ={g∈G:φ(g)=eH}.\ker\varphi=\{g\in G:\varphi(g)=e_H\}.

It consists of all elements sent to the identity. It is a normal subgroup of GG: if k∈ker⁡φk\in\ker\varphi and g∈Gg\in G, then

φ(gkg−1)=φ(g)eHφ(g)−1=eH.\varphi(gkg^{-1}) =\varphi(g)e_H\varphi(g)^{-1} =e_H.

The image is

im⁡φ={φ(g):g∈G}.\operatorname{im}\varphi =\{\varphi(g):g\in G\}.

It is a subgroup of HH, though it need not be normal in HH.

These constructions characterize injectivity and surjectivity:

  • φ\varphi is injective if and only if ker⁡φ={eG}\ker\varphi=\{e_G\}.
  • φ\varphi is surjective if and only if im⁡φ=H\operatorname{im}\varphi=H.

The kernel also determines precisely when two elements have the same image:

φ(x)=φ(y)⟺x−1y∈ker⁡φ.\varphi(x)=\varphi(y) \quad\Longleftrightarrow\quad x^{-1}y\in\ker\varphi.

Every nonempty fiber is therefore a coset of the kernel. If φ(x)=h\varphi(x)=h, then

φ−1({h})=xker⁡φ.\varphi^{-1}(\{h\})=x\ker\varphi.

In particular, when GG is finite,

∣G∣=∣ker⁡φ∣ ∣im⁡φ∣.|G|=|\ker\varphi|\,|\operatorname{im}\varphi|.

Images of subgroups are subgroups, and inverse images of subgroups are subgroups. Inverse images also preserve normality: if NN is normal in HH, then φ−1(N)\varphi^{-1}(N) is normal in GG.

Quotient groups and the first isomorphism theorem

For a normal subgroup NN of GG, the quotient group G/NG/N has cosets as its elements and multiplication

(gN)(hN)=ghN.(gN)(hN)=ghN.

The canonical projection

π:G→G/N,π(g)=gN\pi:G\to G/N,\qquad \pi(g)=gN

is a surjective homomorphism with kernel NN. Thus every normal subgroup occurs as the kernel of a group homomorphism.

The first isomorphism theorem states that every homomorphism φ:G→H\varphi:G\to H induces an isomorphism

G/ker⁡φ≅im⁡φ.G/\ker\varphi\cong\operatorname{im}\varphi.

The induced map is

gker⁡φ⟼φ(g).g\ker\varphi\longmapsto\varphi(g).

It is well-defined because two representatives belong to the same coset exactly when they have the same image.

Accordingly, every group homomorphism factors as

G→ π G/ker⁡φ→ ≅ im⁡φ↪H.G \xrightarrow{\ \pi\ } G/\ker\varphi \xrightarrow{\ \cong\ } \operatorname{im}\varphi \hookrightarrow H.

This separates the map into a quotient, an isomorphism, and an inclusion.

More generally, if NN is normal in GG, a homomorphism φ:G→H\varphi:G\to H factors through G/NG/N if and only if N⊆ker⁡φN\subseteq\ker\varphi. In that case there is a unique homomorphism

φ‾:G/N→H\overline{\varphi}:G/N\to H

such that φ=φ‾∘π\varphi=\overline{\varphi}\circ\pi. This is the universal property of the quotient group.

Examples

Reduction modulo an integer

For a positive integer nn, reduction modulo nn gives a homomorphism of additive groups:

φ:Z→Z/nZ,φ(k)=[k].\varphi:\mathbb Z\to\mathbb Z/n\mathbb Z, \qquad \varphi(k)=[k].

Its kernel is nZn\mathbb Z, and it is surjective. This connects modular arithmetic with the quotient construction.

Every homomorphism from the additive group Z\mathbb Z to a group HH is determined by the image of 11. For any h∈Hh\in H, the formula

φ(k)=hk\varphi(k)=h^k

defines such a homomorphism. A homomorphism from Z/nZ\mathbb Z/n\mathbb Z to HH is similarly determined by an element hh satisfying hn=eHh^n=e_H.

Exponential maps

The ordinary exponential function defines an isomorphism

exp⁡:(R,+)→(R>0,×),\exp:(\mathbb R,+)\to(\mathbb R_{>0},\times),

because ex+y=exeye^{x+y}=e^xe^y, and every positive real number has a unique real logarithm.

A related homomorphism is

φ:(R,+)→S1,φ(t)=e2πit,\varphi:(\mathbb R,+)\to S^1, \qquad \varphi(t)=e^{2\pi it},

where S1S^1 is the group of complex numbers of absolute value 11 under multiplication. It is surjective with kernel Z\mathbb Z, giving

R/Z≅S1.\mathbb R/\mathbb Z\cong S^1.

Determinants

For a field FF, let GL⁡n(F)\operatorname{GL}_n(F) be the group of invertible n×nn\times n matrices. The determinant defines a homomorphism

det⁡:GL⁡n(F)→F×,\det:\operatorname{GL}_n(F)\to F^\times,

since

det⁡(AB)=det⁡(A)det⁡(B).\det(AB)=\det(A)\det(B).

Here F×F^\times denotes the multiplicative group of nonzero field elements. The kernel is the special linear group

SL⁡n(F)={A∈GL⁡n(F):det⁡A=1}.\operatorname{SL}_n(F) =\{A\in\operatorname{GL}_n(F):\det A=1\}.

For n≥1n\geq1, the determinant map is surjective.

The sign of a permutation

The sign map on the symmetric group is a homomorphism

sgn⁡:Sn→{1,−1},\operatorname{sgn}:S_n\to\{1,-1\},

where the target operation is multiplication. Its kernel is the alternating group AnA_n, consisting of even permutations. For n≥2n\geq2, it is surjective and gives

Sn/An≅{1,−1}.S_n/A_n\cong\{1,-1\}.

Important types

A group homomorphism is called:

  • A monomorphism if it is injective.
  • An epimorphism if it is surjective.
  • An isomorphism if it is bijective.
  • An endomorphism if its domain and codomain are the same group.
  • An automorphism if it is an isomorphism from a group to itself.

The inverse function of a bijective group homomorphism is automatically a homomorphism. Thus an isomorphism preserves the complete group structure in both directions.

For each g∈Gg\in G, conjugation defines an automorphism

cg:G→G,cg(x)=gxg−1,c_g:G\to G,\qquad c_g(x)=gxg^{-1},

called an inner automorphism.

The trivial map G→HG\to H, sending every element to eHe_H, is always a homomorphism. By contrast, inversion g↦g−1g\mapsto g^{-1} is a homomorphism from GG to itself exactly when GG is abelian, because

(xy)−1=y−1x−1.(xy)^{-1}=y^{-1}x^{-1}.

Composition and categorical structure

If φ:G→H\varphi:G\to H and ψ:H→K\psi:H\to K are homomorphisms, their composition is a homomorphism:

(ψ∘φ)(xy)=(ψ∘φ)(x)(ψ∘φ)(y).(\psi\circ\varphi)(xy) =(\psi\circ\varphi)(x)(\psi\circ\varphi)(y).

Identity maps are also homomorphisms. Groups together with their homomorphisms therefore form the category Grp\mathbf{Grp} in category theory.

The set of homomorphisms G→HG\to H is denoted by Hom⁡(G,H)\operatorname{Hom}(G,H). When HH is an abelian group, pointwise multiplication gives this set an abelian group structure:

(φψ)(g)=φ(g)ψ(g).(\varphi\psi)(g)=\varphi(g)\psi(g).

For a nonabelian target, the pointwise product of homomorphisms need not be a homomorphism.

Applications and additional structure

A group action of GG on a set XX is equivalently a homomorphism

G→Sym⁡(X),G\to\operatorname{Sym}(X),

where Sym⁡(X)\operatorname{Sym}(X) is the group of all permutations of XX. Its kernel consists of the elements acting trivially on every point. An action is faithful precisely when this homomorphism is injective.

In representation theory, a linear representation is a homomorphism

ρ:G→GL⁡(V),\rho:G\to\operatorname{GL}(V),

where GL⁡(V)\operatorname{GL}(V) is the group of invertible linear transformations of a vector space VV. This expresses abstract group operations through linear transformations.

Every linear map is a homomorphism between the underlying additive groups of its vector spaces. The converse is not generally true: a group homomorphism preserves addition but need not preserve scalar multiplication.

In algebraic topology, a basepoint-preserving continuous map induces a homomorphism between fundamental groups. Such induced maps translate questions about spaces and continuous maps into questions about groups.

Additional structure requires additional conditions. A homomorphism between topological groups is not necessarily continuous; a continuous group homomorphism must satisfy both requirements. For Lie groups, smooth homomorphisms also interact with the associated Lie algebras. An abstract group isomorphism alone therefore does not guarantee an isomorphism of topological or smooth structures.