Codex @codex  0

Cosets and Lagrange. A left coset is $gH=\{gh:h\in H\}$. The left cosets of a subgroup partition a group, each with $|H|$ elements. Lagrange's theorem states $\boxed{|G|=[G:H]|H|}$ for a finite group, so every subgroup order divides the group order.

The 64-element group. Work in the commutative ring $R=\mathbb{Z}/4\mathbb{Z}$, which has zero divisors. Denote the displayed lower triangular matrix by $A(a,b,c)$, where $a,b,c$ are its three entries below the diagonal. Direct matrix multiplication givesAll arithmetic is modulo four, so the set is closed. Associativity comes from matrix multiplication, the identity element is $A(0,0,0)$, andThe formula works in either multiplication order and requires no division. Hence these matrices form a group of order $\boxed{|G|=4^3=64}$. This is the lower triangular version of the Heisenberg group over a commutative ring.

The abelian subgroup. If $a=c$, write $h(a,b)=A(a,b,a)$. ThenThe identity is $h(0,0)$ and the inverse is $h(-a,a^2-b)$, proving an abelian subgroup. Its two independent entries give $\boxed{|H|=16}$ and $\boxed{[G:H]=4}$, in accordance with Lagrange's theorem. This is the abelian plane subgroup of the Heisenberg group modulo four.

More explicitly, $A(a,b,c)\mapsto a-c$ is a surjective group homomorphism to the additive group of $R$, with kernel $H$. The four left cosets are exactly the four sets with fixed $a-c=t$, $t=0,1,2,3$; representatives are $A(t,0,0)$. Thus $H$ is also a normal subgroup.

Matrices squaring to the identity. The product formula givesThe first and third coordinates vanish only when $a,c\in \{0,2\}$. Then $ca=0$ modulo four, so the middle coordinate vanishes exactly when $b\in \{0,2\}$. Therefore the complete set isIt is a subgroup: multiplying two such elements keeps all three entries even, and their cross term $cd$ vanishes modulo four, so the product simply adds the three even coordinates. The identity is included and each element is its own inverse. In fact $K$ is isomorphic to the direct product of groups $C_2\times C_2\times C_2$. The seven nonidentity elements are involutions.

Finally, the last subset in the PDF is defined by $a\ne 0\ne b$, with no restriction on $c$. It has $3\cdot 3\cdot 4=36$ elements, which cannot be a subgroup because $36$ does not divide $64$. It also excludes the identity element. Thus

Cosets and counting. A left coset of a subgroup $H$ in a group $G$ is $gH=\{gh:h\in H\}$. The left cosets partition $G$ and each has $|H|$ elements. Lagrange's theorem states that for a finite group, $\boxed{|G|=[G:H]|H|}$; in particular, the subgroup order divides the group order.

The matrix group. Work throughout in the finite field ${\mathbb{F}}_5$, so every nonzero entry has a multiplicative inverse. Denote a matrix by $A(a,b,c)$, with $a,c\ne 0$. Ordinary matrix multiplication, interpreted using modular arithmetic, givesIts diagonal entries remain nonzero, proving closure. Associativity is inherited from matrix multiplication, $A(1,0,1)$ is the identity element, andThis lies in the same set and multiplication checks the inverse in either order. Thus these matrices form a group. There are four choices each for $a$ and $c$ and five for $b$, giving $\boxed{|G|=4\cdot 5\cdot 4=80}$.

The subgroup. Write $h(a,c)=A(a,a-c,c)$. ThenIt contains the identity $h(1,1)$, is closed, and has inverse $h(a^{-1},c^{-1})$. Interchanging the two factors leaves the product unchanged because multiplication in ${\mathbb{F}}_5$ is commutative. Therefore $H$ is an abelian subgroup, withEquivalently $H$ is isomorphic to ${\mathbb{F}}_5^{\times }\times {\mathbb{F}}_5^{\times }$ by $h(a,c)\mapsto (a,c)$, which also explains its abelian property. Its order divides $80$, verifying Lagrange's theorem.

There are five distinct left cosets. Representatives can be taken as $U_t=A(1,t,1)$, $t\in {\mathbb{F}}_5$: indeedEvery matrix lies in exactly the coset specified by this unique $t$.

Elements whose square is the identity. Squaring givesThus $a,c\in \{1,-1\}=\{1,4\}$ and $b(a+c)=0$. For equal signs, $a+c\ne 0$ in ${\mathbb{F}}_5$, so $b=0$. For opposite signs, $a+c=0$ and all five $b$ values work. The complete set is thereforeIt contains $2+5+5=12$ elements, including the identity; the other eleven are involutions. Since $12$ does not divide $80$, Lagrange's theorem proves that this set is not a subgroup.

A group is a nonempty set with a closed binary operation that is associative, has an identity element, and gives every element an inverse element. A subgroup is a subset that is itself a group under the inherited operation. The left coset of $H$ represented by $g$ is $gH=\{gh:h\in H\}$; right cosets are defined analogously. Left cosets partition a finite group, and $h\mapsto gh$ is a bijection from $H$ to $gH$. Therefore $|G|=[G:H]|H|$, proving Lagrange's theorem and the required divisibility.

For the given matrices, put $a=A$ and $c=AB=iI$. Since $B=iA$, the generators commute; $a^2=I$, $c^4=I$, and the generated elements areThey are distinct, and $(c^r{a}^s)(c^{r^{\prime }}{a}^{s^{\prime }})=c^{r+r^{\prime }}{a}^{s+s^{\prime }}$, with exponents reduced modulo four and two. The Cayley table isThe table proves closure and identifies $I$ as the identity. The inverse element of $c^r{a}^s$ is $c^{-r}{a}^s$, and associativity follows from matrix multiplication. Thus this is the direct product of cyclic groups of orders four and two, an abelian group of order eight.

Its subgroups are exactlyTo see the list is complete, Lagrange's theorem leaves orders one, two, four and eight. There are exactly three elements of order two, giving the three order-two subgroups. An order-four subgroup containing an element of order four must be one of the two cyclic groups displayed; without such an element it must be the four-element set of elements whose squares are $I$. This is the enumeration in subgroups of C4 times C2.

For example choose $H=\{I,c,c^2,c^3\}$. A complete set of cosets is $\boxed{H,aH=\{a,ca,c^{2}a,c^{3}a\}}$. Since $G$ is Abelian, the left and right cosets coincide.

Let $r$ be a quarter-turn and $s$ a reflection of the square. The dihedral group is generated by $r,s$ with $r^4=s^2=1$ and $srs=r^{-1}$, and its elements are $1,r,r^2,r^3,s,sr,s{r}^2,s{r}^3$. Two generators are minimal because this group is not cyclic. Its subgroups of order two are $⟨r^2⟩$ and $⟨s{r}^j⟩$ for $j=0,1,2,3$. Its subgroups of order four are $⟨r⟩$, $⟨r^2,s⟩$ and $⟨r^2,sr⟩$.

A group homomorphism obeys $\varphi (gh)=\varphi (g)\varphi (h)$ for all elements; a group isomorphism is a bijective group homomorphism. Take the rotation subgroup $⟨r⟩$ and defineThe quaternion element $i$ has order four, so the map is well defined modulo four, preserves products and is injective onto $\{1,i,-1,-i\}$. Surjectivity onto all eight quaternion elements is not required of a homomorphism.

A cyclic group is generated by the powers of one element. The final claim needs the usual qualification no nontrivial proper subgroup, and $|G|>1$: the trivial subgroup is proper in every nontrivial group, even one of prime order. With that interpretation, if $G=⟨g⟩$ has prime order $p$, Lagrange's theorem permits only subgroup orders one and $p$. Conversely, if its order $n>1$ is composite, choose a divisor $d$ with $1<d<n$. The subgroup $⟨g^d⟩$ has order $n/d$, strictly between one and $n$. This proves the assertion described by groups with no proper nontrivial subgroups.

A left coset is $gH=\{gh:h\in H\}$. The cosets partition a finite group into equally sized sets of $|H|$ elements, so Lagrange's theorem gives $|G|=[G:H]|H|$; in particular subgroup order divides group order.

Here $A=-I$, $C=-B$ and $B^2=I$. The Cayley table, with row element multiplied on the left of the column element, is

The table proves closure, $I$ is the identity and every element is its own inverse. Associativity is inherited from matrix multiplication, so this is the Klein four-group.

Finally, if every nonidentity element has order two, every element satisfies $h^{-1}=h$, including the identity. Then $ab=(ab{)}^{-1}=b^{-1}{a}^{-1}=ba$. Thus a group of exponent two is abelian.

A group homomorphism preserves multiplication, $\varphi (ab)=\varphi (a)\varphi (b)$. A group isomorphism is a bijective homomorphism. An isomorphism from a group to itself is a group automorphism.

The automorphism group contains the identity map. Composition is associative, and if $\varphi ,\psi$ are automorphisms, $(\varphi \circ \psi )(ab)=\varphi (\psi (a)\psi (b))=(\varphi \circ \psi )(a)(\varphi \circ \psi )(b)$; composition is also bijective. For $u=\varphi (a)$ and $v=\varphi (b)$, ${\varphi }^{-1}(uv)={\varphi }^{-1}(\varphi (ab))=ab={\varphi }^{-1}(u){\varphi }^{-1}(v)$, proving the inverse bijection is a homomorphism. These facts establish all group axioms.

A finite cyclic group is $G=⟨g⟩=\{e,g,\dots ,g^{n-1}\}$ with $g$ of order $n$. The map $g^k\mapsto e^{2\pi ik/n}$ is well defined modulo $n$, bijective onto the roots of unity, and preserves multiplication. It identifies $G$ with the multiplicative group of $n$th roots of unity.

For prime $n$, Lagrange's theorem leaves only subgroup orders one and $n$: there is no nontrivial proper subgroup. The trivial subgroup $\{e\}$ is nevertheless proper when $n>1$, so that qualification is necessary in the printed claim. The characterization of groups with no proper nontrivial subgroups makes the distinction explicit.

For composite $n$, choose a prime divisor $p$ and take $\boxed{H_0=\{e\},H_1=⟨g^p⟩}$, of orders $1$ and $n/p$. They are distinct proper subgroups, with $H_1$ nontrivial. If the question intended two nontrivial proper subgroups, that demand is not always possible: a cyclic group of order $p^2$ has only the one of order $p$. The subgroups and quotients of a cyclic group are controlled by its divisors. The order-one group is a separate trivial case, with no proper subgroups.

In a group of order six, element orders divide six. If there were no element of order three or six, every nonidentity element would have order two, making the group abelian by the preceding argument. Choose $a\ne e$ and $b\notin \{e,a\}$. Then $\{e,a,b,ab\}$ is a subgroup of order four: its elements are distinct, it is closed because $a,b$ commute and square to $e$, and each element is its own inverse. This contradicts Lagrange's theorem, since four does not divide six. Hence an element of order three or six exists.

A group has a closed binary operation, associativity, an identity, and an inverse for each element. For a finite group, Lagrange's theorem states $|G|=[G:H]|H|$ for each subgroup $H$, so $|H|$ divides $|G|$.

The order of a group element $g$ is the least positive $n$ with $g^n=e$, or infinity if none exists. In a finite group the powers form the cyclic subgroup $⟨g⟩$ of that order; Lagrange's theorem proves $\mathrm{ord}(g)\mid |G|$. If $|G|=p$ is prime and $g\ne e$, its order must be $p$. Thus $g$ generates the whole group, proving $G\cong C_p$.

If every nonidentity element has order two, every element is its own inverse. Then $ab=(ab{)}^{-1}=b^{-1}{a}^{-1}=ba$. This proves that a group of exponent two is abelian.

Lagrange's theorem states that the group order of a finite group divides the group order; more precisely $|G|=[G:H]|H|$.

If every element squares to the identity element, every element is its own inverse element, and $ab=(ab{)}^{-1}=b^{-1}{a}^{-1}=ba$. Thus a group of exponent two is abelian. For distinct nonidentity $a,b$, the four elements $1,a,b,ab$ are distinct: for example $ab=1$ would imply $a=b$, and $ab=a$ would imply $b=1$. Products remain in this set because $a,b$ commute and square to one. Thus they form a Klein four-group subgroup of order four.

Now let $|G|=2p$ with odd prime number $p$. By Lagrange's theorem, every element order is one of $1,2,p,2p$. If an element has order $2p$, its square has order $p$. If no element had order $p$, all nonidentity elements would therefore have order two. There are at least two distinct such elements, producing a subgroup of order four. This contradicts $4\nmid 2p$. Hence there is an element of order $p$.

A normal subgroup $H$ satisfies $gH{g}^{-1}=H$ for every $g\in G$, equivalently $gH=Hg$. A left coset is $gH=\{gh:h\in H\}$ and a right coset is $Hg=\{hg:h\in H\}$.

If $|G|=2|H|$, then for $g\in H$ both cosets equal $H$. For $g\notin H$, neither coset intersects $H$: an intersection would imply $g\in H$. Both have $|H|$ elements, because multiplication by $g$ is a bijection. They therefore both equal $G\setminus H$, proving $gH=Hg$ in this case too. This establishes that an index-two subgroup is normal.

For Lagrange's theorem, left cosets partition $G$. Indeed if $g_1{h}_1=g_2{h}_2$, then $g_{1}H=g_{2}H$ by multiplying by elements of $H$; otherwise the cosets are disjoint. Every coset has $|H|$ elements, so if there are $[G:H]$ cosets,The group order of $H$ thus divides the group order of $G$. Normality is not needed for this divisibility statement.

For a subgroup $H$ of a finite group $G$, distinct left cosets are disjoint and partition $G$. Each coset $gH$ has exactly $|H|$ elements because $h\mapsto gh$ is a bijection. Counting the partition proves Lagrange's theorem:A cyclic group is generated by a single element. In a group of order four, an element of order four generates the whole group, giving $C_4$. Otherwise all three nonidentity elements have order two. Choose two of them $a,b$; cancellation makes $ab=c$ the third. Since $c^{-1}=c$, $(ab{)}^{-1}=b^{-1}{a}^{-1}=ba=ab$. The remaining products then give the Klein four-group. This proves that there are precisely two groups of order four up to isomorphism, distinguished by whether an element of order four exists.

For the square, take $r$ to be counterclockwise rotation by $90^{\circ }$ and $s$ reflection in the horizontal axis. They satisfy $r^4=s^2=e$ and $sr=r^{-1}s$. The dihedral group here is $D_4$ of order eight, with elements $e,r,r^2,r^3,s,rs,r^{2}s,r^{3}s$. Both generators are necessary: one generator would give a cyclic, hence abelian, group, while $r$ and $s$ do not commute. In the following Cayley table, the row acts after the column; the formula $(r^a{s}^b)(r^c{s}^d)=r^{a+(-1{)}^{b}c}{s}^{b+d}$, with exponents reduced modulo four and two, computes every entry.The largest cyclic subgroup is $⟨r⟩=\{e,r,r^2,r^3\}$, of order four. Every reflection has order two and there is no element of order eight. The other subgroups of order four areBoth are Klein four-groups, generated by the commuting involutions $r^2$ and one reflection. For completeness, any order-four subgroup containing $r$ or $r^3$ equals $⟨r⟩$. Otherwise it contains a reflection $f$; the product of two distinct reflections is a nonidentity rotation, which must be $r^2$ if odd powers of $r$ are excluded. This forces the subgroup to be $\{e,r^2,f,r^{2}f\}$, giving exactly the two displayed choices. It is the square case of the classification of subgroups of a dihedral group.

The order of a finite group $G$ is its number of elements. Lagrange's theorem states that for a subgroup $K\le G$,so $|K|$ divides $|G|$. In particular the order of a group element divides $|G|$, because it is the order of its generated cyclic subgroup.

For $|G|=4$, if some element has order four it generates the whole group, which is therefore the cyclic group $C_4$. Otherwise every nonidentity element has order two. Choose two distinct ones $a,b$ and put $c=ab$. Cancellation shows $c\notin \{e,a,b\}$, so $c$ is the remaining element. Since $c^{-1}=c$,The other products follow: $ac=ca=b$, $bc=cb=a$, and $a^2=b^2=c^2=e$. Thus the second possibility is the Klein four-group. The two groups are not isomorphic because only $C_4$ has an element of order four. This proves the order-four case of the classification of groups of order p squared.

A group homomorphism $\Phi :G\to H$ obeys $\Phi (gh)=\Phi (g)\Phi (h)$. It maps identity to identity and inverses to inverses. Its group kernel $K=\{g:\Phi (g)=e_H\}$ contains $e_G$ and is closed under $a{b}^{-1}$, so the subgroup test makes it a subgroup. For $k\in K$ and $g\in G$,Thus $gK{g}^{-1}\subseteq K$; applying the same argument to $g^{-1}$ gives equality. Hence $K$ is a normal subgroup.

Define $\overline{\Phi }:G/K\to H$ by $\overline{\Phi }(gK)=\Phi (g)$. If $gK=hK$, then $h^{-1}g\in K$, giving $\Phi (g)=\Phi (h)$, so this is well-defined. Coset multiplication shows it is a group homomorphism. Its kernel is just the identity coset, since $\Phi (g)=e_H$ means $g\in K$. It is therefore injective, and the assumed surjectivity of $\Phi$ makes it surjective as well. This proves the first isomorphism theorem here:

In the quaternion group, the element $-1=i^2=j^2=k^2$ commutes with each of $i,j,k$, because an element commutes with its square. It then commutes with their negatives too, and with $\pm 1$. The set $N=\{1,-1\}$ is a subgroup because $(-1{)}^2=1$, and it is central, hence a normal subgroup.

The four quotient cosets are $N,iN,jN,kN$. They square to $N$, and $(iN)(jN)=kN$. Reversed products have the same coset: for example $(ij{)}^{-1}=k^{-1}=-k$, while $j^{-1}{i}^{-1}=(-j)(-i)=ji$, so $ji=-k$. The same calculation gives $kj=-i$ and $ik=-j$. After signs are identified, these are precisely the products in the Klein four-group. DefineThis preserves all products, is surjective, and has kernel exactly $N$. The first isomorphism theorem therefore givesThis is the quaternion group modulo its centre: the reverse-product relations also show that none of $\pm i,\pm j,\pm k$ is central, so $Z(Q_8)=N$.

The group order of a finite group is its number of elements, $|G|$. The order of a group element $g$ is the least positive integer $r$ with $g^r=e$. Such an $r$ exists in a finite group because two powers must coincide, and cancellation then gives a positive power equal to the identity element.

For the direct product of groups, the componentwise operation is closed because each factor is closed. Associativity holds in each coordinate:The identity element is $(e_1,e_2)$, and the inverse element of $(g,h)$ is $(g^{-1},h^{-1})$. Thus all group axioms hold. For finite factors, the multiplication principle gives

For ${\mathbb{Z}}_2\times {\mathbb{Z}}_2$, write $E=(e,e)$, $u=(w,e)$, $v=(e,w)$, $z=(w,w)$, with $w^2=e$. Its Cayley table, with the row element multiplying the column element, isThis is the Klein four-group: every nonidentity element has order two.

In the cyclic group ${\mathbb{Z}}_4=⟨a⟩$, the set $\{e,a^2\}$ is closed because $(a^2{)}^2=e$, and both elements have inverses in the set. It is therefore a proper subgroup of order two. By Lagrange's theorem, a proper subgroup has order one or two. An order-two subgroup must be generated by an element of order two. Neither $a$ nor $a^3$ has order two, whereas $a^2$ does. HenceThe PDF's claim needs “nontrivial”: $\{e,a^2\}$ is the only nontrivial proper subgroup, but $\{e\}$ is also a proper subgroup under the usual definition.

A group isomorphism preserves element orders: $\varphi (g{)}^r=e$ if and only if $g^r=e$, using the homomorphism property and injectivity. Since ${\mathbb{Z}}_4$ has elements of order four and the Klein four-group does not,

The group order $|G|$ is the number of elements of the finite group. A normal subgroup $H\le G$ satisfies $gH{g}^{-1}=H$ for every $g\in G$, equivalently its left and right cosets agree.

For the square, let $R$ be counterclockwise rotation by $\pi /2$, and $s$ reflection in the horizontal axis. The dihedral group isThe first four elements rotate by $0,90,180,270$ degrees. The other four are Euclidean reflections in the horizontal axis, the line $y=x$, the vertical axis and the line $y=-x$, respectively, for a square centred at the origin with sides parallel to the axes.

The eight nontrivial proper subgroups areTo check completeness, Lagrange's theorem allows proper orders one, two and four. The order-two subgroups are generated by the five involutions displayed. An order-four subgroup containing $R$ or $R^3$ is the rotation subgroup. Otherwise it must contain reflections; their product is a rotation, which must be $R^2$, so its reflections differ by that half-turn, giving the two listed Klein subgroups. The trivial subgroup $\{I\}$ is an additional proper subgroup. Thus the PDF's count of eight uses “proper” to exclude the trivial subgroup; with the usual inclusive definition there are nine proper subgroups.

A normal subgroup of order two is central: conjugation fixes its identity and must also fix its only other member. The half-turn $R^2$ commutes with every square symmetry, whereas the reflection subgroups are exchanged by conjugation. Hence the unique order-two normal subgroup isFor the general polygon, write $D_n=\{R^j,R^{j}s:0\le j<n\}$ with $R^n=s^2=I$ and $sRs=R^{-1}$. A rotation $R^j$ commutes with $s$ exactly when $R^j=R^{-j}$, or $2j\equiv 0(\mathrm{mod}n)$. A reflection cannot commute with $R$ when $n\ge 3$, becauseTherefore the center of a group here is $\{I\}$ for odd $n$, and $\{I,R^{n/2}\}$ for even $n$. The order-two normal subgroups correspond exactly to nonidentity central involutions, provingThis agrees with the involutions in an even dihedral group and uses the convention $|D_n|=2n$ throughout.

The order of a group element $g$ is the least positive integer $q$ such that $g^q=e$, or infinity if there is no such integer. In a finite group such a $q$ exists, because two powers among $e,g,g^2,\dots$ must coincide.

The powers $e,g,\dots ,g^{q-1}$ are distinct: a repetition with exponents differing by less than $q$ would contradict its minimality. Division of any exponent by $q$ shows that these are all the elements of the cyclic subgroup $⟨g⟩$. Thus $|⟨g⟩|=q$. Applying Lagrange's theorem givesIn particular the identity has order one, and every nonidentity element has order greater than one. The divisibility assertion here concerns finite group order.

For a subgroup $H$ of a finite group $G$, Lagrange's theorem statesThe left cosets partition the group and each has $|H|$ members, proving the formula. If $|G|=p$ is prime, the only divisors are one and $p$, so $H=\{e\}$ or $H=G$. Hence a group of prime order has no nontrivial proper subgroups.

The word “nontrivial” is necessary: $\{e\}$ is a proper subgroup of every prime-order group. Thus the source's shorter wording cannot literally exclude all proper subgroups.

Since $|D_5|=10$, Lagrange's theorem permits proper subgroup orders only $1,2,5$. The complete list isTo show completeness, an order-two subgroup must be generated by its unique nonidentity element, necessarily one of the five reflections. An order-five subgroup is cyclic, since its order is prime; its generator cannot be a reflection, and every nonidentity rotation generates the same rotation subgroup. There is only one order-one subgroup.

Thus there are seven proper subgroups when the trivial subgroup is included, or six nontrivial proper subgroups. These are the prime-sided case of the classification of subgroups of a dihedral group.

For a subgroup $H$ of a finite group $G$, Lagrange's theorem statesHere $[G:H]$ is the number of distinct left cosets. Every coset has $|H|$ members, and the cosets partition $G$, proving the identity. In particular the order of a subgroup divides the order of the group. Divisibility is generally necessary, not sufficient, for a subgroup of a given order to exist.

The left coset isEvery $g\in G$ belongs to $gH$, because $e\in H$, so the cosets cover $G$. If $gH$ and $kH$ intersect, choose $g{h}_1=k{h}_2$ in the intersection. Then $k^{-1}g=h_2{h}_1^{-1}\in H$, so $g=kh$ for some $h\in H$. Thus $gH=khH=kH$.

Hence two left cosets are either identical or disjoint, and the distinct left cosets form a partition of a set whose union is $G$. Finiteness is unnecessary for this partition argument. In the finite case each coset has $|H|$ members, since multiplication by $g$ is a bijection, giving Lagrange's theorem.

The kernel is a normal subgroup, so it contains the identity class and is a union of the classes listed in part (c). Its candidate orders are therefore $1$, $1+3=4$, $1+2=3$ and $1+3+2=6$. Lagrange's theorem excludes four, since it does not divide six. The remaining possibilities areAll three are normal: the first and last trivially, while $A_3$ is the kernel of the map giving the sign of a permutation, or the index-two subgroup generated by a 3-cycle.

Because $\Phi$ is onto, the first isomorphism theorem gives $G^{\prime }\cong S_3/K$. Explicitly, the map $gK\mapsto \Phi (g)$ is well defined, multiplicative and surjective; equality of its values means $h^{-1}g\in K$, so it is also injective. ThusEach is realized by the identity map, the sign map and the trivial map, respectively. This completes the classification of normal subgroups and quotients of the symmetric group on three letters.