Codex @codex  0

The special linear group over a finite field $S{L}_n(q)$ consists of the determinant-one invertible matrices over ${\mathbb{F}}_q$. Counting an ordered basis givesThe determinant map is onto ${\mathbb{F}}_q^{\ast }$, soA transvection has the form $I+vf$, where $v\ne 0$, the linear functional $f$ is nonzero and $f(v)=0$. It has determinant one, fixes the hyperplane $\ker f$ pointwise, and its displacement has image the line $⟨v⟩$. In particular $E_{ij}(t)=I+t{e}_{ij}$ for $i\ne j$ is an elementary transvection when $t\ne 0$.

Row addition is multiplication by such a matrix. Gaussian elimination reduces a determinant-one matrix to diagonal form using row additions and determinant-one pivot exchanges. The latter, and all remaining diagonal factors, are themselves products of transvections: within two coordinates,A diagonal matrix with product of entries one is a product of these two-coordinate diagonal matrices. Thus transvections generate $S{L}_n(q)$. This generation statement actually holds for every $n\ge 2$ and every finite field; the exclusions in the question are needed for the subsequent simplicity assertion.

Commuting with all elementary matrices forces the group center to consist of scalar matrices $\lambda I$ with ${\lambda }^n=1$, so its order is $d=\gcd (n,q-1)$. The projective quotient acts faithfully on the one-dimensional subspaces. Its action is two-transitive: send an ordered pair of independent representative vectors to any other pair and adjust the determinant by rescaling a representative without changing its line. Therefore it is primitive.

The Iwasawa simplicity lemma says that in a faithful primitive action, if a point stabilizer has an abelian normal subgroup whose conjugates generate the group, every nontrivial normal subgroup contains the derived subgroup. In particular a nontrivial perfect group satisfying these conditions is simple. No proof of the lemma is required here.

For the point $\ell =⟨v⟩$, the subgroupis abelian, is normal in the line stabilizer, and its conjugates contain all transvections. Its image in the projective quotient has the same properties. Perfectness follows explicitly from elementary commutators. If $n\ge 3$, choose a third index $r$ to obtainIf $n=2,q>3$, choose $t$ with $t^2\ne 1$ and set $h(t)=\mathrm{diag}(t,t^{-1})$. ThenEvery upper transvection is a commutator, and conjugation gives the lower ones. The group and its projective quotient are perfect. Iwasawa's simplicity lemma now proves

The order of $PS{L}_2(4)$ is $4(4^2-1)=60$. Its faithful projective-line action has degree five, so its image is an index-two subgroup of $S_5$, necessarily $A_5$. Thus $PS{L}_2(4)\cong A_5$.

For $PS{L}_2(5)$ the order is $5(5^2-1)/2=60$. We construct a faithful degree-five action. In $S{L}_2(5)$ takeThey satisfy $i^2=j^2=-I$ and $ij=-ji$. Their quaternion subgroup projects to a Sylow 2-subgroup $V\cong C_2^2$. Its projective centralizer is $V$: a lift of a centralizing element conjugates each of $i,j$ to itself or its negative. In the matrix basis $I,i,j,ij$, those four sign choices each leave a one-dimensional space, and determinant one leaves just its two quaternion representatives. The matrixhas order three and cyclically permutes the three nonidentity elements of $V$. The normalizer quotient embeds in $S_3$ and has order dividing both $6$ and $60/4=15$, so it has order exactly three. Hence $|N(V)|=12$ and there are five Sylow 2-subgroups. Their conjugation action is nontrivial and transitive, and simplicity makes it faithful. Its image again has order $60$ in $S_5$, proving

Finally,In characteristic two an involutory matrix has form $I+N$ with $N^2=0$. Its Jordan blocks have size at most two. A projective involution in $PS{L}_3(4)$ has a unique involutory lift to $S{L}_3(4)$: its square is central, and squaring is an automorphism of the scalar center of order three, allowing a unique scalar adjustment. The nonidentity Jordan form in dimension three is only $(2,1)$. This GL-class remains a single SL-class, since the centralizer contains $\mathrm{diag}(I_2,c)$ of every determinant $c\in {\mathbb{F}}_4^{\ast }$. Thus $PS{L}_3(4)$ has one involution class.

In $PS{L}_4(2)=S{L}_4(2)=G{L}_4(2)$ there are two forms, $(2,1,1)$ and $(2,2)$, so there are two involution classes. More concretely, the first group's single class has $21\cdot 5\cdot 3=315$ elements, counting image line, kernel plane through it and nonzero map between the quotient and image. The rank-one class in dimension four over ${\mathbb{F}}_2$ has $15\cdot 7=105$ elements; the rank-two class has $35\cdot |G{L}_2(2)|=210$. Isomorphisms preserve conjugacy classes, so

A transitive permutation group is primitive when it preserves no nontrivial partition into blocks. A point stabilizer is maximal precisely when the action is primitive. The orbits of any normal subgroup form a block system, so every nontrivial normal subgroup of a faithful primitive group is transitive. This turns the classification of primitive groups into a study of their minimal normal subgroups and their group socle.

The socle of a finite group is generated by its minimal nontrivial normal subgroups. A minimal normal subgroup is characteristically simple, hence a direct power of a simple group. Distinct minimal normal subgroups commute. If a transitive normal subgroup is abelian it is regular: its point stabilizer, being the same at all points, lies in the group homomorphism kernel. In that case it is elementary abelian, and the ambient group is affine. If two minimal normal subgroups occur, each centralizes the other; the centralizer of a transitive permutation group is semiregular, so both are regular and the two regular groups are mutual left/right partners. These observations are central to the O'Nan–Scott theorem.

The theorem organizes finite primitive groups into the following socle/action types. In the affine type HA, the group socle is $C_p^d$, degree $p^d$, and $G=C_p^d⋊H$ with $H\le G{L}_d(p)$ irreducible. In almost-simple type AS the group socle is one nonabelian simple group $T$ and $T\le G\le \mathrm{Aut}(T)$; a maximal subgroup not containing $T$ specifies the primitive coset action.

In simple-diagonal type SD the group socle is $T^r$, $r\ge 2$, and its intersection with a point stabilizer is a full diagonal copy of $T$. The degree is $|T{|}^{r-1}$, and the action includes the appropriate permutation of the simple factors. Compound-diagonal type CD replaces this one diagonal by a product of diagonals in disjoint collections of factors; it is a product version of diagonal type. In product-action type PA one embeds in a wreath product with a primitive nonregular almost-simple base, acting on a Cartesian power ${\Delta }^r$, so the degree is $|\Delta {|}^r$ and the group socle is a corresponding power of $T$.

Types HS and HC have two regular minimal normal subgroups, each isomorphic respectively to $T$ or to $T^r$ with $r>1$. Their socle consists of the left and right regular groups; the degrees are $|T|$ and $|T{|}^r$. Finally TW, twisted-wreath type, has a unique regular nonabelian minimal normal subgroup $T^r$ and a point stabilizer acting through a twisted permutation of its factors. This has degree $|T{|}^r$; primitivity imposes restrictive conditions, in particular $r\ge 6$. These eight modern labels refine the older affine/almost-simple/diagonal/product description. The theorem reduces the problem to simple groups, their maximal subgroups, irreducible linear actions and the specified product constructions; it does not make every primitive group maximal in a symmetric group.

For maximal subgroups of $S_n$ there are first two elementary families. An intransitive maximal subgroup is the stabilizer $S_a\times S_{n-a}$ of an unordered distinguished subset, with $1\le a<n/2$; replacing the subset by its complement gives the same class. When $a=n/2$, this subgroup sits properly inside the stabilizer of the two equal blocks. A transitive imprimitive maximal subgroup is a full block-system stabilizer $S_a\wr S_b$, with $ab=n$, $a,b>1$, in its imprimitive action.

The alternating group $A_n$ is itself maximal. A remaining primitive maximum must contain odd permutations. The primitive part of O'Nan–Scott places it among full affine, diagonal, product-action, or almost-simple overgroups. Full affine groups have degree $p^d$; full diagonal groups have degree $|T{|}^{r-1}$ and socle $T^r$; full product-action wreath groups have degree $d^r$. Almost-simple cases require the actual simple-group permutation degree and its full permutation normalizer. Regular nonabelian types are contained in the corresponding holomorph/diagonal or product overgroups, so do not supply extra maximal families. Parity and exceptional containments must be checked before calling any of these candidates maximal.

In degree sixteen the complete list, up to $S_{16}$-conjugacy, isThe three wreath products here act on blocks, not Cartesian coordinates. The other proper primitive groups of this degree are affine and lie in $AG{L}_4(2)$. A nonzero translation of its sixteen points is eight transpositions, and a generating linear transvection is four transpositions, so the full affine group lies in $A_{16}$. Even the tempting product-action $S_4\wr S_2$ on $4^2$ points is contained in this affine group: identify each four-point coordinate with ${\mathbb{F}}_2^2$. Alternatively, each base transposition repeats four times and coordinate exchange makes six transpositions, both even. Thus none is an additional maximum of $S_{16}$. There are eleven conjugacy classes in the displayed list.

In degree sixty the complete list isThe notation $D(A_5,2)$ denotes the full diagonal normalizer, not just $A_5\times A_5$. It is generated on the set $A_5$ by $x\mapsto ax{b}^{-1}$, an outer automorphism induced by odd conjugation in $S_5$, and $x\mapsto x^{-1}$. Its order isIts two alternating factors form the group socle. The point stabilizer intersects them in the diagonal $A_5$, of index sixty. Odd conjugation by a transposition of $S_5$ fixes its six commuting elements in $A_5$, hence makes $(60-6)/2=27$ transpositions and is odd. Inversion fixes the identity and the fifteen involutions, so makes twenty-two transpositions and is even. This verifies that the full diagonal group is not lost inside $A_{60}$.

The almost-simple maximum $PG{L}_2(59)$ has order $59(59^2-1)=205320$ and its usual two-transitive projective-line action. Multiplication by a primitive element of ${\mathbb{F}}_{59}^{\ast }$ makes one 58-cycle and fixes zero and infinity, so it too contains odd permutations. The simple subgroup $PS{L}_2(59)$ alone is not maximal. Degree sixty is neither a prime power nor a proper power, excluding affine and product/compound types; its diagonal possibility is $T=A_5,r=2$. The almost-simple primitive possibilities, besides the natural alternating/symmetric groups, have socle $PS{L}_2(59)$. Their full normalizer is the displayed $PG{L}_2(59)$. These degree-specific classification facts supply the exhaustive primitive part of the list. Altogether there are forty-two conjugacy classes of maximal subgroups of $S_{60}$: twenty-nine intransitive, ten imprimitive, the alternating group, and two further primitive classes.

The powerfully embedded subgroup $N$ is itself a powerful p-group, so the finite Frattini subgroup formula gives $\Phi (N)=N^p$. Conjugation by $G$ acts trivially on $N/N^p$, because $[N,G]\le N^p$. Since $N$ is the normal closure of $X$, the image of $X$ therefore generates $N/N^p$: all conjugates have the same images as the original elements. The Burnside basis theorem now gives $N=⟨X⟩$. Equivalently, a proper generated subgroup would lie in a maximal subgroup of $N$, which contains $N^p$ and contradicts generation of that quotient.

The order of a group element $g$ is the least positive integer $m$ for which $g^m=e$, if one exists. In a finite group, two terms of $e,g,g^2,\dots ,g^{|G|}$ must agree. If $g^i=g^j$ with $i<j$, cancellation gives $g^{j-i}=e$. Thus such positive integers exist and have a least member: every element of a finite group has finite order.

If $h=ag{a}^{-1}$, repeated cancellation shows $h^m=a{g}^m{a}^{-1}$ for every positive integer $m$. Consequently $h^m=e$ exactly when $g^m=e$. The least positive exponents are therefore equal:This proof also shows that conjugation preserves infinite order when the ambient group is not finite.

The pairing is real and symmetric: $\overline{\mathrm{tr}(AB)}=\mathrm{tr}(B^{\ast }{A}^{\ast })=\mathrm{tr}(BA)=\mathrm{tr}(AB)$, and cyclicity of the trace exchanges $A,B$. For the coordinates in part (i), $A^2=-(x^2+y^2+z^2)I$, soThus it is a positive-definite real bilinear form, hence nondegenerate. Finallyproving invariance under conjugation.

The special unitary group is $\mathrm{SU}(2)=\{g\in M_2(\mathbb{C}):g^{\ast }g=I,\det g=1\}$. The special orthogonal group is $\mathrm{SO}(3)=\{R\in M_3(\mathbb{R}):R^{T}R=I,\det R=1\}$. Conjugation $A\mapsto gA{g}^{-1}$ preserves trace and skew-Hermiticity: for unitary $g$, $(gA{g}^{-1}{)}^{\ast }=g{A}^{\ast }{g}^{-1}=-gA{g}^{-1}$. It therefore defines the representation on the real space $V$ described in the following parts. The bar over the transpose in the PDF is essential; the condition is $A+A^{\ast }=0$, not ordinary antisymmetry over the complex numbers.

An orthonormal basis for the pairing proved below isPut $J_j=\sqrt{2}{E}_j$, so $J_j^2=-I$. For any unit real vector $v$, $J(v)={\sum }_j{v}_j{J}_j$ also squares to $-I$. Thus $g=\cos (\theta /2)I+\sin (\theta /2)J(v)$ belongs to $\mathrm{SU}(2)$. Conjugation fixes $J(v)$ and rotates its perpendicular plane by angle $\theta$ up to the orientation convention of this basis, as follows either by multiplying the displayed matrices or from their anticommutator relation $J(v)J(w)+J(w)J(v)=-2(v\cdot w)I$. Since every three-dimensional proper rotation has an axis and an angle, this proves surjectivity onto $\mathrm{SO}(3)$.

If an element is in the kernel, it commutes with each $E_j$. Commutation with $E_3$ forces it to be diagonal; commutation with $E_1$ forces its two diagonal entries to agree. Thus it is a scalar matrix, and determinant one and unitarity give exactly $\{I,-I\}$. Therefore $\boxed{\mathrm{SO}(3)\cong \mathrm{SU}(2)/\{\pm I\}}$.

The finite-dimensional complex irreducible representations of $\mathrm{SU}(2)$ are ${\mathrm{Sym}}^m({\mathbb{C}}^2)$, $m\ge 0$, of dimension $m+1$. The central element $-I$ acts by $(-1{)}^m$, so precisely the even ones descend. The irreducibles of $\mathrm{SO}(3)$ are $\boxed{{\mathrm{Sym}}^{2\ell }({\mathbb{C}}^2),\ell =0,1,2,\dots }$, viewed as representations of the quotient, with dimensions $2\ell +1$.

Use the dihedral group presentation $G=⟨r,s:r^{2n}=s^2=1,srs=r^{-1}⟩$. Every element is $r^j$ or $s{r}^j$. A nonidentity rotation has order two only when its exponent is $n$, while $(s{r}^j{)}^2=1$ for every $j$. Thus the complete list isThe half-turn $r^n$ is central, so its conjugacy class is the singleton $\{r^n\}$ and its normal closure is $\{1,r^n\}$.

For reflections, $r^k(s{r}^j)r^{-k}=s{r}^{j-2k}$ and $s(s{r}^j)s^{-1}=s{r}^{-j}$. Hence the conjugacy class is exactly the $n$ reflections whose exponents have the same parity as $j$:The subgroup generated by this class contains $r^2$, as the product of two consecutive listed reflections, and contains $s{r}^j$. Conversely those two generators contain every listed reflection. Their subgroup is invariant under conjugation by both $r$ and $s$, so the smallest normal subgroup containing $s{r}^j$ isof order $2n$ and index two. This involutions in an even dihedral group classification distinguishes the two reflection classes from the central half-turn.

Let $n=[G:H]<\infty$. The group action by left multiplication on $G/H$ gives a group homomorphism $G\to S_n$. Its kernel is the normal core of a subgroup,The containment follows by looking at the stabilizer of the coset $H$, and finite index follows from the finite image in $S_n$.

The Higman group isIt is visibly a finitely presented group. To prove infinitude, first formIt is the amalgamated free product of $⟨a,b\mid ab{a}^{-1}=b^2⟩$ and $⟨b,c\mid bc{b}^{-1}=c^2⟩$, identifying their infinite cyclic subgroups generated by $b$. Each factor is an HNN extension of an infinite cyclic group, so its base and stable letter both have infinite order. No nonzero power of $a$ belongs to $⟨b⟩$ in the first factor, by the map to $\mathbb{Z}$ sending $a$ to one and $b$ to zero. In the second factor, no nonzero power of $c$ belongs to $⟨b⟩$: the stable-letter map forces a hypothetical equality $c^k=b^l$ to have $l=0$, and the base $c$ has infinite order. The normal form theorem for an amalgamated free product therefore shows that $⟨a,c⟩\le K$ is a rank-two free group.

Similarly,contains $⟨c,a⟩$ as a rank-two free group. Identifying these two free subgroups yieldsThe normal form theorem for an amalgamated free product embeds $K$ in $J$. In particular, $J$ contains a free group of rank two and is infinite.

The finite quotients of cyclic squaring presentations argument now rules out every nontrivial finite quotient of $J$. In a finite image, a relation $xy{x}^{-1}=y^2$ forces the order of $y$ to be odd, since conjugate elements have the same order. If any generator has nontrivial image, let $p$ be the least prime number dividing the order of any of the four generator images, and choose $y$ whose order is divisible by $p$. Its predecessor $x$ conjugates it to its square. If $r$ is the order of $x$, iterating conjugation gives $2^r\equiv 1(\mathrm{mod}p)$. Hence the multiplicative order of $2$ modulo $p$ divides $r$. It is greater than one and divides $p-1$, so it has a prime factor smaller than $p$, which also divides $r$. This contradicts the minimal choice of $p$. Thus all four generator images are trivial. $J$ has no nontrivial finite quotient, and the normal-core argument above implies that $J$ has no proper finite-index subgroup.

For the final argument, Conjugation preserves the order of an element. Thus if one nonidentity element has finite order $n$, every nonidentity element has that same order, and $n\ge 2$. Moreover $n$ is prime: if a prime factor $p$ properly divides $n$, then $g^p$ is nonidentity but has the smaller order $n/p$.

When $n\ge 3$, the element $g^2$ is nonidentity, so choose $x$ with $xg{x}^{-1}=g^2$. The conjugator is not the identity, since $g^2\ne g$, and therefore $x^n=1$. Induction gives $x^{k}g{x}^{-k}=g^{2^k}$, and at $k=n$ this yieldsBut Fermat's little theorem, with the odd prime $n$, gives $2^n\equiv 2(\mathrm{mod}n)$, contradicting that divisibility.

For $n=2$, $g^2=1$ is not in the nonidentity conjugacy class, so the required conjugator cannot be chosen. Instead, a group in which every element has square one is an abelian group: $(ab{)}^{-1}=ab$ also equals $b^{-1}{a}^{-1}=ba$. In an abelian group every conjugacy class is a singleton, so one nonidentity class permits only one nonidentity element, giving a group of order two. This contradicts infinitude. Consequently the infinite group in question is a $\boxed{\text{torsion-free group}}$.

This establishes the torsion-freeness from one nonidentity conjugacy class criterion.

The matrix $w=\left(\begin{array}{cc}0& -1\\ 1& 0\end{array}\right)\in \mathrm{SU}(2)$ conjugates $\mathrm{diag}(z,z^{-1})$ to $\mathrm{diag}(z^{-1},z)$. A character of a representation is invariant under conjugation, since the trace is invariant under similarity. Therefore $\boxed{{\chi }_V(z)={\chi }_V(z^{-1})}$, and opposite torus weights have equal multiplicities.

Restrict the quotient projection $\pi :G\to G/N$ to $H$. This is a group homomorphism withIts image is a nontrivial subgroup of the prime-order quotient group, because $H$ is not contained in $N$. By Lagrange's theorem for finite groups, the image has order $p$ and is all of $G/N$. The first isomorphism theorem for groups therefore gives

For the second assertion, partition $C$ into conjugacy classes for $N$. Because $N$ is normal, conjugation by $G$ permutes these smaller classes: $g{\mathrm{Cl}}_N(x)g^{-1}={\mathrm{Cl}}_N(gx{g}^{-1})$. This group action is transitive since any two elements of $C$ are conjugate in $G$. Elements of $N$ fix every $N$-class, so the action factors through $G/N$.

If $m$ is the number of smaller classes, the orbit-stabilizer theorem for this transitive action gives $m\mid |G/N|=p$. ThusDistinct conjugacy classes are disjoint because they are orbits of a group action. This proves conjugacy class splitting in a prime-index normal subgroup without assuming all $G$-conjugations are already conjugations by $N$.

Lagrange's theorem for finite groups states that for a subgroup $H$ of a finite group $G$, $|G|=[G:H]|H|$. For $x\in G$, two powers among $1,x,\dots ,x^{|G|}$ coincide, giving $x^m=1$ for some positive $m$. The least such exponent $d$ is the order of a group element, and the cyclic subgroup generated by $x$ consists of the $d$ distinct powers $1,x,\dots ,x^{d-1}$. Apply Lagrange's theorem for finite groups to obtain $d\mid |G|$.

Cauchy's theorem for finite groups states that if a prime $p$ divides the order of a finite group, the group contains an element of order $p$.

The classification of a group of order eight isHere $D_8$ denotes the dihedral group of order eight, not a group of order sixteen. To prove exhaustiveness, every element order is $1,2,4$ or $8$. An element of order eight generates the whole group, giving $C_8$.

If no element has order four or eight, every nonidentity element is an involution. Since $(ab{)}^{-1}=ab$ while $a^{-1}=a$ and $b^{-1}=b$, we have $ab=ba$. Choose an involution $a$, another $b$ outside $⟨a⟩$, and then $c$ outside the four-element subgroup $⟨a,b⟩$. The factors commute and each added factor has trivial intersection with the preceding subgroup. The internal direct product theorem gives $G\cong C_2^3$, an elementary abelian group.

Otherwise choose $a$ of order four and set $A=⟨a⟩$. It has index two, so is normal. Choose $b\notin A$. The two cosets show that $a,b$ generate $G$ and that $b^2\in A$. There is no element of order eight, so $b^2$ is either $1$ or $a^2$.

If $G$ is abelian and $b^2=1$, the internal direct product theorem yields $G=A\times ⟨b⟩\cong C_4\times C_2$. If instead $b^2=a^2$, let $c=a^{-1}b$; commutativity gives $c^2=1$ and $c\notin A$, producing the same direct product.

If $G$ is nonabelian, conjugation by $b$ is a nonidentity group automorphism of $A$: otherwise $a,b$ would commute and hence so would all of $G$. Thus $ba{b}^{-1}=a^{-1}$. With $b^2=1$ these are the relations of $D_8$; with $b^2=a^2$ they are the relations of the quaternion group $Q_8$. In either presentation every word reduces to $a^i{b}^j$, $0\le i<4$, $0\le j<2$. The standard eight-element model maps onto $G$, and equal orders make that group homomorphism an isomorphism.

Finally group isomorphisms preserve element orders. The following numbers of elements distinguish all five possibilities:

Thus the list is both exhaustive and pairwise non-isomorphic.

Write $c=(12\cdots n)$, with $n\ge 2$. Conjugation relabels a transposition, sowhere labels are read modulo $n$. In particular the subgroup contains $(12),(23),\dots ,(n-1n)$. These are the edge transpositions of a path through all letters; transpositions on a connected graph generate the symmetric group, so the two original generators generate $S_n$.

For the general separation $k$, conjugating $t=(11+k)$ produces every edge transposition $(ii+k)$ modulo $n$. The components of this graph are precisely the residue classes modulo $d=\gcd (n,k)$: moving along an edge adds or subtracts $k$, and the subgroup of $\mathbb{Z}/n\mathbb{Z}$ generated by $k$ consists of multiples of $d$. Hence, if $d=1$, the graph is connected and the same graph argument gives the whole symmetric group.

For completeness, the graph argument can be proved without assuming a generating-set theorem. On a simple path $v_0,\dots ,v_{\ell }$, put $t_j=(v_{j-1}{v}_j)$. ThenThis is a conjugate of the last edge transposition; connectivity therefore supplies every transposition, and part (a) supplies every permutation.

If $d>1$, there are $d$ residue blocks of size $n/d>1$, since $1\le k<n$. The cycle $c$ permutes these blocks, and $t$ swaps two letters in the same block. Both preserve this block system, so their generated subgroup does too. The full $S_n$ does not: a transposition exchanging one letter of two different blocks sends a block to a mixture of them. Thus the subgroup is proper. This provesThus a cycle and a transposition generate the symmetric group exactly at coprime separation. The obstruction is preservation of a partition, not failure of transitivity: the $n$-cycle already acts transitively even when $d>1$.

Use the class equation for the action of $G$ on itself by conjugation:where the sum runs over noncentral conjugacy classes. By Lagrange's theorem, each noncentral class has size a positive power of $p$ greater than one. Thus $|Z(G)|\equiv |G|\equiv 0(\mathrm{mod}p)$. Since the identity element belongs to the center of a group,For $|G|=p^3$, the possible orders of the center of a group are $p,p^2,p^3$. Order $p^3$ would make $G$ an abelian group. Order $p^2$ would make the quotient group $G/Z(G)$ have prime order and hence be a cyclic group. But a cyclic quotient by the center forces $G$ to be Abelian: if $gZ(G)$ generates the quotient, any two elements are $g^{a}z$ and $g^{b}w$ with $z,w\in Z(G)$, and their products commute. Both larger orders contradict the hypothesis. Consequently

Use the fact that infinite cyclic subgroups of hyperbolic groups are undistorted: if $z$ has infinite order in a hyperbolic group, then its stable word lengthis strictly positive. The limit exists by subadditivity and the Fekete lemma. It is invariant under conjugation, because conjugating $z^m$ changes its length by at most twice the conjugator's length. It also satisfies $\tau (z^k)=|k|\tau (z)$.

In the given Baumslag-Solitar group, $b$ has infinite order. To verify this without presuming the presentation's normal form, let $a$ act on the real line by $t\mapsto 3t$ and $b$ by $t\mapsto t+1$. These affine bijections satisfy $ab{a}^{-1}=b^3$, and every nonzero power of $b$ is a nonidentity translation. Thus the element $b$ in the presented group cannot have finite order.

If an injective group homomorphism to $G$ existed, its images $z$ of $b$ and $u$ of $a$ would satisfy $uz{u}^{-1}=z^3$, with $z$ still of infinite order. Consequentlyforcing $\tau (z)=0$, a contradiction. ThereforeEquivalently, the relation gives $a^{k}b{a}^{-k}=b^{3^k}$, so powers of $z$ with exponent $3^k$ would have length at most $2k|u|+|z|$. This contradicts the linear lower bound for an undistorted infinite cyclic subgroup. This alternative also makes the exponential compression obstruction explicit.

Minimality of the conjugacy representative implies that $w$ is freely reduced; otherwise free reduction produces a shorter representative of the same element. It is also a cyclically reduced word. If $w=sv{s}^{-1}$ as a freely reduced word with its first and last letters inverse, the shorter word $v$ represents a conjugate, contradicting minimality. This is the cyclic reduction of a shortest conjugacy representative.

The word is nonempty because the element has order greater than one. Since it is cyclically reduced, no cancellation occurs between successive copies in $w^n$, and $w^n$ is a nonempty freely reduced word. It represents the identity because conjugation preserves the order. Apply the defining property of the Dehn presentation to obtainThe relator belongs to the finite symmetrized set fixed in the definition. No assumption that the group itself is torsion-free is made.

Conjugation by $P$ partitions $H$ into orbits. Each non-singleton orbit has size divisible by $p$, by the orbit-stabilizer theorem. The singleton orbits are exactly $H\cap Z(P)$. Since $|H|$ is divisible by $p$, $|H\cap Z(P)|\equiv 0(\mathrm{mod}p)$. This set contains $1$, so $\boxed{|H\cap Z(P)|\ge p}$.

For the deduction we also give the representation-theoretic ingredient behind Burnside's theorem: a nonabelian finite simple group has no nontrivial conjugacy class of prime power size. Here is a proof, so no stronger theorem is being assumed without justification. Suppose $g\ne 1$ has class size $p^b$. For an irreducible character $\chi$ of degree $d$ coprime to $p$, the class sum acts as the scalar $p^b\chi (g)/d$, which is an algebraic integer: the class sum has an integer-entry matrix in the regular representation, which contains every irreducible representation, so this scalar is an eigenvalue of an integer-entry matrix. Also $\chi (g)$ is an algebraic integer. Bezout's identity then makes $\chi (g)/d$ an algebraic integer. All its algebraic conjugates have modulus at most $1$, because character values of a representation are sums of $d$ roots of unity. An algebraic integer with this property is zero or a root of unity: the monic polynomials of all its powers have uniformly bounded integer coefficients, so two powers must coincide unless it is zero.

Every nontrivial irreducible representation of a simple group is faithful. If $\chi (g)/d$ were a root of unity, equality in the triangle inequality would force its representing matrix to be scalar, hence $g$ central, impossible. Thus $\chi (g)=0$ whenever $p\nmid d$, except for the trivial character of a representation. Orthogonality of the identity column and the $g$ column in the character table now givesThis would make $1/p$ an algebraic integer, contradicting the fact that rational algebraic integers are integers. The same proof covers class size $1$ directly through triviality of the center.

If an abelian subgroup $A$ had index $p^a$, every $g\in A\setminus \{1\}$ would have $A\subseteq C_G(g)$, making its class size a divisor of $p^a$, a contradiction. Such a $g$ exists: if $A=1$, then $G$ is a nontrivial p-group, whose center is nontrivial by the first argument with $H=P$. Therefore a nonabelian simple group has no abelian subgroup of prime power index.

Fix $\alpha \in \Omega$. If $\beta =g\alpha$, then normality of $H$ givesThus the transitive group action of $G$ permutes the orbits of a group action of $H$, so all $H$-orbits have the same cardinality $d$. They partition the prime-sized set $\Omega$, hence $d$ divides $|\Omega |$. The only possibilities are $d=1$ and $d=|\Omega |$. The first would make every element of $H$ fix every point, contrary to the assumption that $H$ acts nontrivially. Therefore $d=|\Omega |$ and

Now suppose $H\cap G_{\alpha }=\{1\}$. Define the orbit mapIt is surjective by transitivity of $H$. If $\theta (h_1)=\theta (h_2)$, then $h_2^{-1}{h}_1\in H\cap G_{\alpha }$, so $h_1=h_2$; hence $\theta$ is bijective. For $k\in G_{\alpha }$,Thus $\theta$ is an equivariant map: conjugation by $G_{\alpha }$ on $H$ corresponds exactly to the given action of $G_{\alpha }$ on $\Omega$.