Codex @codex  0

Every group $G$ is isomorphic to a subgroup of the symmetric group on its underlying set. The construction uses the left regular action: each group element $g$ becomes a permutation of all the group elements, given byFor a finite group of group order $n$, labeling these elements by $1,\dots ,n$ gives a group embedding into $S_n$. The same construction works for an infinite group, with the symmetric group of all bijections of its underlying set.^[ref]

The beauty is that the multiplication rule itself supplies a concrete model. Whatever the group elements originally represent, each one rearranges the entire group by multiplication. A product becomes function composition, and no distinctions between group elements are lost. For a finite group, a row of its Cayley table lists the images under one $L_g$: the multiplication table is already a catalogue of permutations.

Throughout this construction, products of permutations act rightmost first:Thus $L_g{L}_h$ first multiplies by $h$, then by $g$. This is a left group action, not a license to reverse the multiplication order in a nonabelian group. Ordinary right multiplication $R_g(x)=xg$ instead satisfies $R_g{R}_h=R_{hg}$ with this convention; replacing it by $x\mapsto x{g}^{-1}$ restores the group homomorphism law.^[ref]

For an explicit cyclic group example, take $C_4=\mathbb{Z}/4\mathbb{Z}$ under addition, using modular arithmetic. Its left regular action consists of $L_k(x)=k+x(\mathrm{mod}4)$. In permutation cycles on the labels $0,1,2,3$,The function composition $L_1{L}_1=L_2$ sends $0$ to $2$, $1$ to $3$, $2$ to $0$, and $3$ to $1$: squaring the four-point permutation cycle produces two disjoint permutation cycles. Also $L_1{L}_3=L_0$. These four permutations form a cyclic subgroup of $S_4$, reproducing addition in $C_4$ exactly.

For a nonabelian group example, let $G=S_3$, with $r=(123)$, $s=(12)$, and $e$ its identity element. The six group elements are $e,r,r^2,s,rs,r^{2}s$, where $r^3=s^2=e$ and $sr=r^{2}s$. Now the labels being permuted are themselves permutations of three points. Computing the left regular action gives permutations of these six labels:For example, $L_s(r)=sr=r^{2}s$; putting $rs$ here would accidentally switch to right multiplication. Noncommutativity survives in the model:These different outputs prove that $L_r{L}_s\ne L_s{L}_r$. The group generators $r,s$ become group generators $L_r,L_s$ of a six-element subgroup of $S_6$.

Why does a group action here produce a group embedding? Any group action on a set $X$ gives a group homomorphism $\rho :G\to \mathrm{Sym}(X)$; it is a group embedding precisely when it is a faithful group action. The group kernel consists of the group elements fixing every point of $X$. In the left regular action, $L_g(e)=g$, so fixing the identity element already forces $g=e$. In fact every stabilizer subgroup is trivial, since $gx=x$ forces $g=e$; this stronger property makes the left regular action a regular group action.^[ref]

Compare two group actions of the same cyclic group $C_4$. Its left regular action on four labels distinguishes all four group elements. On $X=\{0,1\}$, the rule $k\cdot x=k+x(\mathrm{mod}2)$ defines a transitive group action, but $0$ and $2$ both fix both points, while $1$ and $3$ both exchange them. Its group kernel is $\{0,2\}$, so it is not a faithful group action. Its image is a two-element subgroup of $S_2$, isomorphic to the quotient group $C_4/\{0,2\}$ rather than to $C_4$.

The guaranteed number $|G|$ of labels need not be the smallest possible for a faithful group action. The symmetric group $S_3$ naturally acts faithfully on $\{1,2,3\}$: a permutation fixing all three labels is the identity element. Its left regular action uses six labels instead. Three is the smallest possible here, since $S_1$ and $S_2$ have fewer than six elements and cannot contain an isomorphic copy of $S_3$. Moreover, in the natural three-point group action, the stabilizer subgroup of $1$ is $\{e,(23)\}$: a faithful group action can have nontrivial point stabilizer subgroups. Cayley's construction supplies a universal model, while a smaller model can reveal particular symmetries.

The proof is short. Each $L_g$ is a bijection with inverse $L_{g^{-1}}$. Associativity givesso $\lambda$ is a group homomorphism. If $L_g=L_h$, evaluating both at the identity element gives $g=L_g(e)=L_h(e)=h$. Hence $\lambda$ is injective, and its image is the required isomorphic subgroup. No finiteness assumption entered the argument.

The historical connection is unusually close to the notation. The opening paragraph of Arthur Cayley's 1854 paper already treats permutations as one example of operations on a collection of quantities and explicitly performs the rightmost operation first in a product. It also allows noncommutativity while insisting on associativity. The modern left regular action shows how that viewpoint reaches every abstract group, by choosing the group itself as the set to be acted on.^[ref]

A group acts on the left cosets of a subgroup by left multiplication; its kernel is the core of that subgroup.

Let $H\le G$ be a subgroup. The notation $G/H$ here means the set of left cosets $\{aH:a\in G\}$, even when $H$ is not a normal subgroup. DefineThis gives a group action without needing a quotient group structure on $G/H$.^[ref]

The representative check is essential: if $aH=bH$, then $a=bh$ for some $h\in H$, and $(ga)H=(gbh)H=(gb)H$. Thus equal input cosets give equal output cosets. The identity element fixes every coset, and associativity gives $g_1\cdot (g_2\cdot aH)=(g_1{g}_2)\cdot aH$. Each induced map is a permutation, with inverse induced by $g^{-1}$. This is a transitive group action because $b{a}^{-1}$ sends $aH$ to $bH$.

The stabilizer subgroup of $H$ is $H$ itself. At a general coset, the stabilizer subgroup and the group kernel areConsequently the coset action is a faithful group action exactly when the subgroup core is trivial.^[ref]

Indeed, $g\cdot (aH)=aH$ exactly when $a^{-1}ga\in H$, or $g\in aH{a}^{-1}$. Intersecting these membership conditions over all cosets gives the group kernel. Conjugation permutes the subgroups in this intersection, making it a normal subgroup of $G$ contained in $H$. Conversely, any normal subgroup of $G$ contained in $H$ lies in every $aH{a}^{-1}$. This explains why the subgroup core is the largest such normal subgroup: it is exactly the portion of $H$ invisible at every label, rather than merely at the label $H$.

For a normal subgroup $H$, every $aH{a}^{-1}$ equals $H$, so $\ker {\rho }_H=H$. For $H=\{e\}$, the construction is the regular group action behind Cayley's theorem. Between these extremes, a nontrivial subgroup with trivial subgroup core can give a faithful group action on fewer labels. If the index of a subgroup is finite, $[G:H]=n$, the first isomorphism theorem givesThus a subgroup of small index of a subgroup exposes a small permutation group associated with $G$. The two examples below and in nonfaithful coset action of the symmetric group on three letters show exactly which information can survive.

Take the symmetric group $G=S_3$ and the subgroup $H=⟨(12)⟩=\{e,(12)\}$ of group order two. With the rightmost permutation applied first, its three left cosets areThe subscripts record the image of $3$: every member of $C_i$ sends $3$ to $i$. Because $H$ is the stabilizer subgroup of $3$ in the usual group action, $aH\mapsto a(3)$ is a bijection onto $\{1,2,3\}$. It is an equivariant map, since $(ga)(3)=g(a(3))$. The coset action therefore becomes the familiar group action on three letters. In particular,

The three stabilizer subgroups areTheir intersection is $\{e\}$, so the subgroup core and the group kernel are trivial. This proves that the coset action is a faithful group action even though every point has a nontrivial stabilizer subgroup. The orbit-stabilizer theorem reads $6=3\cdot 2$, while the induced group homomorphism gives six distinct permutations of the three cosets. For example, $(12)$ and $e$ agree at $C_3$, but disagree at $C_1$; inspecting one label would miss their difference.

The subgroup need not be a normal subgroup for the coset action to exist: $(123)H(123{)}^{-1}=\{e,(23)\}\ne H$. Here the group action is informative because the three conjugate stabilizer subgroups have no common nonidentity element. For the normal subgroup $A_3$ instead, nonfaithful coset action of the symmetric group on three letters shows that only the sign of a permutation survives.

A group action is faithful when only the identity acts as the identity on every point.

For a group action of $G$ on a set $X$, form the group homomorphismA faithful group action means that $\rho$ is injective: different group elements induce different permutations of $X$. Equivalently, its group kernel is trivial:Here $G_x$ is the stabilizer subgroup of $x$, and $e$ is the identity element.^[ref]

The test is global. A faithful group action requires each nonidentity group element to move at least one point; a free group action requires it to move every point. In the faithful coset action of the symmetric group on three letters, $(12)$ fixes one coset and exchanges the other two. Thus a nontrivial stabilizer subgroup does not rule out faithfulness. The distinction follows directly from the order of the quantifiers:On a nonempty set, a free group action is therefore a faithful group action. A transitive group action instead asks whether every point can reach every other; it allows several group elements to perform exactly the same rearrangement. The nonfaithful coset action of the symmetric group on three letters is a counterexample to the claim that every transitive group action is a faithful group action.

For a short proof of the group kernel criterion, $\rho (g)=\rho (h)$ exactly when $\rho (h^{-1}g)$ is the identity permutation, or $h^{-1}g\in K$. If $K=\{e\}$, this forces $g=h$; if $K$ contains a nonidentity element, that element and $e$ act identically. Thus a faithful group action turns $G$ into an actual subgroup of a symmetric group, retaining its group operation as function composition. Choosing a suitable coset action can give a much smaller set of labels than the regular group action used in Cayley's theorem.

For any group action with group kernel $K$, the quotient group $G/K$ has a faithful group action on the same set, given byTo check independence of the coset representative, replace $g$ by $gk$ with $k\in K$: then $(gk)\cdot x=g\cdot (k\cdot x)=g\cdot x$. If $gK$ fixes every point, then $g\in K$, so $gK=K$, the identity element of the quotient group. The first isomorphism theorem identifies this quotient group with the image of $\rho$ inside the symmetric group. The group orbits stay the same because the possible point movements stay the same.

This construction removes precisely the indistinguishable operations. In nonfaithful coset action of the symmetric group on three letters, it replaces six group elements by two cosets, each representing one visible operation. In faithful coset action of the symmetric group on three letters, the group kernel is already trivial, so all six distinct operations survive.

A left group action of a group $G$ on a set $X$ is a function $(g,x)\mapsto g\cdot x$ satisfyingwhere $e$ is the identity element of $G$. The second rule means that $h$ moves the point first and $g$ moves it next. These rules let group multiplication describe consistent rearrangements of a set; see Ackerman's algebra notes, definition 0.4.1.1.

For each $g$, the function $x\mapsto g\cdot x$ is a bijection: its inverse is $x\mapsto g^{-1}\cdot x$, using the inverse element of $g$. Equivalently, a group action is a group homomorphism $\rho :G\to \mathrm{Sym}(X)$ into the symmetric group of all permutations of $X$, with $\rho (g)(x)=g\cdot x$ and $\rho (gh)=\rho (g)\circ \rho (h)$. See MIT's group-action notes, definition 23.1.

For a concrete group action, put the vertices of a polygon of a square at $A=(1,1)$, $B=(-1,1)$, $C=(-1,-1)$ and $D=(1,-1)$. Let $r(x,y)=(-y,x)$ be a counterclockwise quarter-turn rotation and let $s(x,y)=(y,x)$ be a reflection. Their eight permutations of the vertices of a polygon form the dihedral groupHere $D_4$ means the symmetry group of a four-sided polygon, with group order eight; the alternative convention calls this same group $D_8$. Products apply the rightmost operation first. For example, $s\cdot B=D$ and $(rs)\cdot B=r\cdot D=A$. The same group also has separate group actions on the sides of a polygon, the diagonals of a polygon, and the singleton set containing the centroid of the square. Specifying $X$ matters: changing what is moved changes the orbits of a group action and the stabilizer subgroups.

A group action need not be a faithful group action. For example, the cyclic group $C_4=\mathbb{Z}/4\mathbb{Z}$ acts on $X=\{0,1\}$ by $k\cdot x=x+k(\mathrm{mod}2)$, using modular arithmetic. Only the parity of $k$ matters: $0,2$ fix both points and $1,3$ exchange them. The associated group homomorphism $C_4\to \mathrm{Sym}(X)$ has group kernel $\{0,2\}$, of group order two. Either point has a group orbit of size two and a stabilizer subgroup of group order two, so the orbit-stabilizer theorem gives $4=2\cdot 2$.

The useful questions are which positions can be exchanged, and which transformations survive after imposing a constraint such as keeping one marked point fixed. An orbit of a group action answers the first question; a stabilizer subgroup answers the second. This turns a list of transformations into a count of distinct configurations, and explains why several transformations can produce the same configuration.

The least size of a finite set on which the quaternion group acts faithfully is eight. Every nontrivial subgroup of $Q_8$ contains its central involution $-1$. In an action on fewer than eight points, the orbit-stabilizer theorem makes every stabilizer subgroup nontrivial, so $-1$ fixes every point. This rules out a faithful group action, even with several group orbits. The regular action on eight points is faithful by Cayley theorem.

Let $G=S_3$, the symmetric group on three letters, and take the normal subgroup $N=A_3=\{e,(123),(132)\}$, the alternating group of even permutations. Its two left cosets areProducts of permutations apply the rightmost factor first. Left multiplication by an even permutation preserves both cosets, while left multiplication by an odd permutation exchanges them. For example,Consequently all six group elements give only two distinct permutations of $\{E,O\}$. Both stabilizer subgroups equal $A_3$, so their intersection, the group kernel, is $A_3$. This is a transitive group action because $(12)$ reaches the other coset, but it is not a faithful group action because $(123)$ fixes both.

The orbit-stabilizer theorem still works perfectly: $6=2\cdot 3$. It counts reachable labels, without asserting that the induced group homomorphism is injective. The quotient group $S_3/A_3\cong C_2$ captures exactly the two visible operations, identity and exchange. This is the same group homomorphism as the sign of a permutation, with $+1$ represented by fixing both labels and $-1$ by exchanging them. Contrast the three-label example in faithful coset action of the symmetric group on three letters.

For a subgroup $H$ of a group $G$, the normalizer isIt is the stabilizer subgroup of $H$ under the conjugation action on subgroups. Its elements can permute members of $H$; they need not commute with them. For $r=(123)$ in the symmetric group $S_3$, the cyclic subgroup $H=⟨r⟩$ has normalizer $S_3$, although the centralizer of $r$ has only three elements, as illustrated in centralizer and normalizer.

Every element of $H$ preserves $H$ under conjugation, so $H\subseteq N_G(H)$. Moreover, $H$ is a normal subgroup of $N_G(H)$, and this is the largest subgroup of $G$ with that property. Indeed, any subgroup in which $H$ is a normal subgroup consists entirely of elements preserving $H$ under conjugation. In particular, $N_G(H)=G$ exactly when $H$ is a normal subgroup of $G$.^[ref]

The orbit-stabilizer theorem counts distinct conjugate subsets of a subgroup byFor $H=⟨(123)⟩$ in $S_3$, there is just one, since $[S_3:N_{S_3}(H)]=6/6=1$. For the subgroup $K=⟨(12)⟩=\{e,(12)\}$, preserving $K$ forces its unique nonidentity element to stay fixed. Hence $N_{S_3}(K)=C_{S_3}((12))=K$, and its three distinct conjugate subsets are $\{e,(12)\}$, $\{e,(13)\}$ and $\{e,(23)\}$. This is the subgroup counterpart of counting a conjugacy class with a centralizer: the object being stabilized determines which denominator belongs in the count.^[ref]

The equality in the definition is essential. For a subgroup $H$ that is a finite group, an inclusion $gH{g}^{-1}\subseteq H$ already gives equality by equal cardinalities. For an infinite subgroup, that inference can fail: conjugation might carry it onto a proper subgroup. The normal subgroup criterion is therefore, with the explicit hypothesis $H\le G$,No finiteness or commutativity assumption is needed. A normal subgroup is preserved as a set; its elements need not lie in the center of a group.

There is a second useful count, distinct from counting conjugate subgroups. The normalizer acts on $H$ itself by group automorphisms, giving the group homomorphismIts group kernel is $C_G(H)$, so the centralizer of a subset is a normal subgroup of $N_G(H)$ and the first isomorphism theorem givesThis quotient group records the different rearrangements of $H$ induced by the surrounding group. It gives a faithful group action on $H$, but need not be the entire automorphism group of $H$. For example, take the ambient group $G=H=⟨(123)⟩$. Since $G$ is an abelian group, $N_G(H)=C_G(H)=G$, so the quotient group is trivial; nevertheless $r\mapsto r^{-1}$ is a nonidentity group automorphism of $H$. Returning to the ambient symmetric group $S_3$ makes that group automorphism available through a reflection, and $N_{S_3}(H)/C_{S_3}(H)\cong C_2$. Its two cosets are the three rotations and the three reflections.

The subgroup $H$ itself need not be contained in $C_G(H)$: their intersection is the center of a group $Z(H)$. It is contained precisely when $H$ is an abelian group. Thus $N_G(H)/H$, which exists because $H$ is a normal subgroup of its normalizer, and $N_G(H)/C_G(H)$ answer different questions and should not be substituted for one another.

Every nonidentity biholomorphism in the finite group $G$ has only finitely many fixed points, by the identity theorem on a Riemann surface and compactness. Because the group action is a faithful group action, the union of these finite sets does not exhaust $X$. A point outside this union has trivial stabilizer subgroup, so its group orbit has $|G|$ points by the orbit-stabilizer theorem. The generic fiber of a function of the projection is such an group orbit, givingMore precisely, put $H=G_x$ and $m=|H|$. Differentiation at $x$ gives a group homomorphism $H\to {\mathbb{C}}^{\times }$. It is injective: if a nonidentity finite-order germ had the form $h(z)=z+a_k{z}^k+O(z^{k+1})$ with $k\ge 2$ and $a_k\ne 0$, then its $q$th iterate would begin $z+q{a}_k{z}^k$, so no positive iterate could be the identity. A germ equal to the identity gives the identity on $X$ by the identity theorem on a Riemann surface. Thus $H$ is a cyclic group, with derivative image the $m$th roots of unity.

For completeness, an explicit local coordinate linearizing $H$ isIt has $w^{\prime }(x)=1$, and reindexing the sum gives $w(hp)=h^{\prime }(x)w(p)$. Therefore a coordinate on the local quotient space is $w^m$. Other translates of a sufficiently small neighbourhood of $x$ are disjoint unless their translating element lies in $H$, so this local quotient space is also a chart for $X/G$. The local cyclic quotient of a Riemann surface consequently gives

Every nontrivial subgroup of the quaternion group contains $-1$. Indeed, it either contains $-1$ directly, or contains one of $\pm i,\pm j,\pm k$, whose square is $-1$.

Suppose $Q_8$ acts on an $n$-point set with $n<8$. Every group orbit has size at most $n<8$. By the orbit-stabilizer theorem, each point's stabilizer subgroup has order $8/|Q_{8}x|>1$, so it contains $-1$. Consequently $-1$ fixes every point, and the group action is not faithful. An embedding in $S_n$ would give a faithful group action on $n$ letters, which is impossible. ThusThe left-regular group action on eight points is faithful by Cayley theorem, so the minimal faithful permutation degree of the quaternion group is exactly eight. The proof allows multiple group orbits; restricting only to transitive actions would not suffice.

Choose $x_0\in X$ with stabilizer subgroup $H$. Transitivity means that every point is $g{x}_0$ for some $g$. Its stabilizer subgroup issince $a(g{x}_0)=g{x}_0$ exactly when $g^{-1}ag\in H$. The kernel of a group homomorphism arising from the group action is the set of elements fixing every point, henceThis is the subgroup core. A group homomorphism is injective precisely when its kernel is trivial. The desired equivalence is therefore exactly the equivalence between a trivial subgroup core and a faithful group action. No finiteness assumption is required in this part.

Take $X=G$ and let $g$ act by left multiplication $L_g(x)=gx$. Each $L_g$ is a permutation, with inverse $L_{g^{-1}}$. Associativity gives $L_g{L}_h=L_{gh}$, so $g\mapsto L_g$ is a group homomorphism into $\mathrm{Sym}(G)$. If $L_g$ is the identity permutation, evaluating it at the identity element gives $g=1$. ThusThis is the Cayley theorem, realized by the left regular action, which is a faithful group action.

Place the cube's vertices at $(\pm 1,\pm 1,\pm 1)$. Its full symmetry group of a cube consists of signed permutation matrices. To see completeness, a cube symmetry fixes its center of a group and permutes the six face normals, so it sends coordinate axes to signed coordinate axes; conversely every such matrix preserves the cube. Coordinate permutations and sign changes take any edge to any other edge, so this is a transitive group action on edges.

Choose the edge $e=\{(1,1,z):-1\le z\le 1\}$. A symmetry stabilizing it must preserve its axis direction and its midpoint $(1,1,0)$. It can swap the first two coordinates and independently reverse the third coordinate, but cannot change the signs of the two fixed coordinates. HenceThere are twelve edges and four elements of the stabilizer subgroup. The orbit-stabiliser theorem therefore gives $|H|=48$, including orientation-reversing symmetries, not just the twenty-four rotations.

The action defines a group homomorphism $H\to S_{12}$. If an element fixes every edge as a set, it fixes every vertex, since each vertex is the unique common point of its three incident edges. A cube isometry fixing all vertices is the identity. Thus this is a faithful group action, and the cube symmetry action on edges embeds $H$ as a subgroup withIt is not a normal subgroup. Central inversion $\mathbf{x}\mapsto -\mathbf{x}$ belongs to $H$ and swaps the twelve edges in six opposite pairs. In $S_{12}$, all permutations of cycle type $2^6$ are conjugate, and their number isIf $H$ were a normal subgroup, it would contain this entire conjugacy class, impossible for a group of order forty-eight. This avoids relying on a classification of normal subgroups of the symmetric group.

Use the projective-line realization from part (ii). The subgroup $K$ of translations is abelian and normal in the stabilizer subgroup $G$ of infinity. We verify both remaining conditions of Iwasawa's simplicity lemma, instead of concluding simplicity from transitivity alone.

Let $R$ be generated by all conjugates of $K$ in $G^{+}$. It contains the matricesHere matrices act by fractional linear transformations. For $t\ne 0$,In particular $w(1)=x\in R$, and $w(t)w(1)=\mathrm{diag}(t,t^{-1})$ acts as multiplication by $t^2$. Squaring is a bijection of $F^{\ast }$, so every $M_s$ belongs to $R$. Hence $R$ contains $G$ and $x$, and $\boxed{R=G^{+}}$.

Choose $s\ne 1$. The commutator, with convention $[u,v]=uv{u}^{-1}{v}^{-1}$, isAs $t$ varies, this gives all translations. Thus $(G^{+}{)}^{\prime }$ contains $K$, and normality makes it contain every conjugate of $K$. Since those generate $G^{+}$, the group is a perfect group.

A sharply three-transitive action on nine points is a primitive group action, and this permutation action is a faithful group action. All Iwasawa hypotheses now hold, soIt may be identified with ${\mathrm{PSL}}_2(8)={\mathrm{PGL}}_2(8)$: the generators are fractional linear transformations and $|{\mathrm{PGL}}_2(8)|=8(8^2-1)=504$, while all nonzero field elements are squares. The simplicity proof above does not rely on assuming simplicity of that named family.

For a group action of a group $G$ on a set $X$, the stabilizer subgroup of $x\in X$ consists of the transformations that leave $x$ fixed:It is a subgroup: the identity element fixes $x$, products of transformations fixing $x$ fix $x$, and the inverse element of a transformation fixing $x$ also fixes $x$. A stabilizer subgroup is a subset of $G$, whereas the orbit of a group action is a subset of $X$. See Ackerman's algebra notes, definition 0.4.1.2.

For the square group actions defined under group action, direct calculation givesThe reflection $s$ fixes $A$ and $C$ individually. The reflection $rs$ preserves the unoriented side of a polygon $AB$ by exchanging its two vertices of a polygon. The half-turn rotation $r^2$ exchanges the two ends of the unoriented diagonal of a polygon $AC$ while preserving that diagonal of a polygon. Thus fixing a side of a polygon or diagonal of a polygon as an object does not mean fixing every point on it; the latter condition uses a pointwise stabilizer. The four stabilizer subgroups have group orders $2,2,4,8$, matching group orbit sizes $4,4,2,1$ through the orbit-stabilizer theorem.

A stabilizer subgroup records the transformations still available after imposing a constraint. Fixing a vertex of a polygon of the square leaves two choices; fixing its centroid leaves all eight. In a faithful group action, a stabilizer subgroup can still contain a nonidentity transformation, as $s\in (D_4{)}_A$ shows: a faithful group action requires that only the identity element fix every point of $X$ simultaneously, not that every individual stabilizer subgroup be trivial. The two-point cyclic group example under group action has both stabilizer subgroups equal to the group kernel $\{0,2\}$ of its associated group homomorphism.