Codex @codex  0

For a finite simple group with a subgroup of index $n\ge 3$, the coset action is nontrivial and its kernel is a normal subgroup, hence trivial. Its sign homomorphism must also be trivial: otherwise simplicity would give an isomorphism to $C_2$, which cannot act transitively on at least three points. Thus the image lies in the alternating group. In particular Lagrange's theorem gives $|G|\mid n!/2$. This can exclude simplicity with very little counting: a group of order $112$ has a subgroup of index seven by Sylow theorems, but $112$ does not divide $7!/2$.

A finitely generated group $G$ has a soluble word problem for a group if and only if there are a simple group $S$ and a finitely presented group $P$ with embeddings $G\hookrightarrow S\hookrightarrow P$. The theorem does not require $S$ itself to be finitely presented. In particular, a finitely generated subgroup of a finitely presented simple group has soluble word problem. The primary statement is Theorem I of An algebraic characterization of groups with soluble word problem.

Every finite group whose order is divisible by at most two distinct primes is a solvable group. A nonabelian simple group must therefore have at least three distinct prime divisors.

For every $\epsilon >0$ there is $\lambda (\epsilon )$ such that every non-abelian finite simple group $G$ and every finite symmetric generating set $S$ containing the identity satisfyThe proof applies the one-scale virtual nilpotence theorem below the diameter and then uses simplicity to eliminate both the bounded-index subgroup and the finite normal subgroup.

The only nontrivial proper normal subgroups of this direct product of groups are its two factors. Indeed a normal subgroup meeting $S\times 1$ nontrivially contains it by the simple group property. Otherwise each of its commutators with $S\times 1$ lies in that trivial intersection. Its first coordinates therefore lie in $Z(S)=1$, so it is contained in $1\times C_p$. Both factors are simple and each quotient by one factor is isomorphic to the other. Hence precisely two composition series occur, one through each factor. This is compatible with the Jordan–Hölder theorem, since the two series have the same simple factors in opposite orders. For $S=A_5,p=2$, the group has order $120$.

Every finite group of odd order is a solvable group. In particular, a nonabelian simple group has even order and therefore has an involution by Cauchy's theorem for finite groups. This is a deep theorem, not an elementary consequence of the Sylow theorems.

A finite nonabelian simple group is a finite group that is a nonabelian group and a simple group. Every such group is a perfect group because its commutator subgroup is a nontrivial normal subgroup.

For distinct primes $p,q$, the Sylow theorems force a proper nontrivial normal subgroup in any group of order $p^{2}q$. If $p>q$, the Sylow $p$-subgroup is unique. If $p<q$ and both Sylow counts were nontrivial, the count congruences force $(p,q)=(2,3)$. In order twelve, four Sylow $3$-subgroups exhaust eight nonidentity elements; only three remain for a Sylow $2$-subgroup, making that subgroup unique. Thus the group is not a simple group.

An infinite residually finite group is not a simple group. For a nonidentity element, residual finiteness supplies a map to a finite group in which it survives. Its kernel is proper and cannot be trivial, since an infinite group cannot inject into a finite group.

A proper normal subgroup maximal among proper normal subgroups. Its quotient is a nontrivial simple group. Maximality among normal subgroups does not imply maximality among all subgroups.

// Target: algebra.bigb

For the preliminary index assertion, the coset action gives a homomorphism $G\to S_n$. Its kernel is a normal subgroup and cannot be all of $G$, because the action is transitive on $n>1$ points. Simplicity makes the kernel trivial. The sign homomorphism of this faithful action must be trivial: otherwise simplicity would identify $G$ with $C_2$, impossible for a transitive action of degree at least three. Thus $G$ embeds in $A_n$, and Lagrange givesA group of order $112=16\cdot 7$ has a Sylow two-subgroup of index seven. If the group were simple, the preceding result would give $112\mid 7!/2=2520$. This fails because $112$ is divisible by $16$ while $2520$ has only three factors of two. Thus there is no simple group of order $112$.

For order $56$, Sylow gives $n_7\in \{1,8\}$. If it is one, the order-seven Sylow is a normal subgroup. Otherwise its eight Sylows of order seven intersect only at the identity, giving $8\cdot 6=48$ nonidentity elements of order seven. Only eight elements remain including the identity. Every Sylow two-subgroup has order eight and consists entirely of these remaining elements. Hence all Sylow two-subgroups coincide and the order-eight subgroup is a normal subgroup. Either case gives a nontrivial proper normal subgroup, so no group of order $56$ is simple.

First prove the primitive three-cycle criterion directly. The useful generation fact is that adding a three-cycle whose support meets a set $S$, with $|S|\ge 3$, to the alternating group $A_S$ generates the alternating group on the enlarged set. If the support is $\{a,b,x\}$ with $a,b\in S$ and $x\notin S$, conjugation by $A_S$ and taking inverses produces every three-cycle with $x$ and two points of $S$. For $|S|\ge 4$ this uses two-transitivity of $A_S$; for $|S|=3$, its cyclic action on pairs together with inversion gives both pair orientations. These cycles, together with the cycles supported inside $S$, are all the three-cycles on $S\cup \{x\}$ and generate $A_{S\cup \{x\}}$. Every even permutation is a product of three-cycles: pair its transpositions, and use $(ab)(bc)=(abc)$ and $(ab)(cd)=(acb)(acd)$, with rightmost factors acting first.

If instead the new support is $\{a,x,y\}$ with just $a\in S$, choose $b\in S\setminus \{a\}$ and conjugate $(axy)$ by an element of $A_S$ carrying $a$ to $b$. This gives $(bxy)$, andThe two-point-overlap case first adjoins $x$; the original cycle then adjoins $y$. This proves connected triple supports generate an alternating group by successively adjoining intersecting supports.

Now take the supports of every conjugate in $G$ of a given three-cycle, and make these triples the edges of a hypergraph on the permutation domain. Its connected components are permuted by $G$, so they form a block system. Since at least one component contains three points, primitivity forces the single component to be the entire domain. Start with one triple and adjoin intersecting triples until all points have been reached. The generation argument shows that the subgroup generated by the conjugate cycles is $A_n$. Hence

To classify the proper maximal subgroups containing a three-cycle, distinguish the three possible types of action. A primitive maximal subgroup contains $A_n$, and thus equals $A_n$, since $[S_n:A_n]=2$. An intransitive maximal subgroup lies in the full stabilizer $S_k\times S_{n-k}$ of one of its orbits, and maximality makes it that full stabilizer. When $k=n-k$, this stabilizer lies properly inside the subgroup that can interchange the two parts, so it is not maximal. Take the smaller part to obtain $1\le k<n/2$. Such an unequal-part stabilizer is maximal: its transpositions connect all points within each part, and any element outside it carries at least one within-part transposition to a cross-part transposition. The resulting connected graph of transpositions generates $S_n$. To see that last assertion, transpositions along a path generate the transposition of its endpoints by successive conjugations. The stabilizer contains a three-cycle exactly when $n-k\ge 3$.

A transitive imprimitive maximal subgroup preserves a nontrivial partition into $b$ blocks of size $a$, with $n=ab$. It equals the full permutation wreath product $S_a\wr S_b$. This full block stabilizer is maximal: any permutation not preserving the partition sends some same-block pair to a different-block pair, giving a cross-block transposition by conjugation. The block stabilizer is transitive on cross-block pairs, so all cross-block transpositions follow; together with its within-block transpositions they generate $S_n$. A three-cycle in this group must act trivially on the blocks, since any nontrivial block permutation moves at least two entire blocks, and a block three-cycle moves $3a$ points. Thus a single three-cycle exists exactly when $a\ge 3$. The full classification, up to conjugation, is thereforeThis is the maximal symmetric-group subgroups containing a three-cycle classification. For $n<3$ there are no such subgroups.

For the first family of counterexamples to extending the criterion to longer cycles, let $G=PS{L}_2(p)$ act on the projective line ${\mathbb{F}}_p\cup \{\infty \}$. The determinant-one matricesact respectively as $x\mapsto x+1$ and $x\mapsto -1/x$. The first fixes infinity and is one $p$-cycle on the finite points. Its translations make the infinity stabilizer transitive on the other points; the second moves infinity, so the full action is two-transitive, hence primitive. The action is faithful after quotienting by scalar matrices. Counting a nonzero first column and the $p$ second columns with determinant one gives $|S{L}_2(p)|=p(p^2-1)$, and the scalar group center has order two. Thussince the ratio on the right to the left is $(p-2)!>1$. Consequently $PS{L}_2(p)$ is the required example for every prime $p>3$.

For the final example take $p=59$, and let the direct product of groups $A_5\times A_5$ act on the sixty elements of $A_5$ byThe action is transitive and the stabilizer of the identity is the diagonal subgroup $\Delta =\{(z,z):z\in A_5\}$. To prove that the diagonal is a maximal subgroup, no classification theorem is needed. If $\Delta <K\le A_5\times A_5$, choose $(x,y)\in K\setminus \Delta$. Multiplying by $(y^{-1},y^{-1})$ gives $(x{y}^{-1},1)\in K$ with $x{y}^{-1}\ne 1$. The subgroup $L=\{z:(z,1)\in K\}$ is normal in $A_5$, by diagonal conjugation, and is nontrivial. Simplicity of $A_5$ gives $L=A_5$, and then $K=A_5\times A_5$. Thus the coset action is primitive. It is also faithful: if $xt{y}^{-1}=t$ for every $t$, then $x=y$ by taking $t=1$, and $x$ is central in the centerless simple group $A_5$, so $x=y=1$. Finally,The prime $59$ is odd, and its primality follows by testing the primes $2,3,5,7$, the only ones below its square root. This is a faithful diagonal primitive permutation group whose order is not divisible by the degree minus one.

A subnormal series is a finite chain $1=G_r⊴G_{r-1}⊴\cdots ⊴G_0=G$, in which each term is normal in the preceding term. Its factors are the quotient groups $G_i/G_{i+1}$. A normal series of a group imposes the stronger condition that every term be normal in $G$. These conditions should not be conflated: inserting a subgroup normal in an intermediate term need not preserve normality in the whole group. A refinement inserts additional terms, and two series are equivalent when their nontrivial factors can be paired by group isomorphisms.

The basic refinement mechanism is the Zassenhaus butterfly lemma. For $A^{\prime }⊴A$ and $B^{\prime }⊴B$, let $C=A\cap B$ and $D=(A^{\prime }\cap B)(A\cap B^{\prime })$. Both factors of $D$ are normal in $C$, so $D⊴C$. The map from $C$ onto $A^{\prime }C/A^{\prime }(A\cap B^{\prime })$ has kernel $D$: if an element of $C$ equals $a^{\prime }{b}^{\prime }$ with $a^{\prime }\in A^{\prime }$ and $b^{\prime }\in A\cap B^{\prime }$, then $a^{\prime }=c{b}^{\prime -1}\in A^{\prime }\cap B$. Conversely each product in $D$ is in the kernel. The first isomorphism theorem therefore givesThe denominators are normal in their numerators: conjugation by $C$ preserves them, while conjugation by $A^{\prime }$ or $B^{\prime }$ changes their elements only by a factor already in that normal subgroup.

Given two subnormal series $(G_i)$ and $(H_j)$, refine the first by $G_{i+1}(G_i\cap H_j)$, and the second by $H_{j+1}(H_j\cap G_i)$. The endpoints are $G_i,G_{i+1}$ and $H_j,H_{j+1}$ respectively, and the Zassenhaus butterfly lemma pairs the successive factors indexed by $(i,j)$ and $(j,i)$. This proves the Schreier refinement theorem.

A composition series is a strict subnormal series all of whose factors are simple groups. Every finite group has one: choose a maximal proper normal subgroup, repeat inside it, and use decreasing orders to terminate. A simple factor cannot admit a nontrivial refinement. Applying the preceding refinement theorem to two composition series proves the Jordan–Hölder theorem: their lengths and multisets of simple factors agree, up to group isomorphism. The factors are the Jordan–Hölder factors, and their number is the composition length. If $N⊴G$, lifting a composition series of $G/N$ and adjoining one for $N$ gives

These factors do not determine the whole group, because they do not determine how its group extensions are assembled. For example, $C_4$ and the Klein four-group both have two factors $C_2$, but one contains an element of order four and the other does not. The symmetric group $S_3$ has a composition series $1<C_3<S_3$, with factors $C_3,C_2$, whereas the simple group $A_5$ has the single factor $A_5$.

A chief series is a maximal strict normal series of a group; each chief factor is a minimal nontrivial normal subgroup in the appropriate quotient of $G$. Finite chief factors are characteristically simple. To justify their structure, let $N$ be any nontrivial finite characteristically simple group and choose a minimal nontrivial normal subgroup $M$ of $N$. Its distinct images under automorphisms of $N$ are minimal normal subgroups, so distinct ones intersect trivially and commute. Choose a maximal family giving an internal direct product of groups. If any other image were not contained in that product, its intersection with the product would be trivial by minimality, and it could be added, a contradiction. Hence this product is characteristic and equals $N$. Each factor $M$ is simple: a proper nontrivial normal subgroup of $M$ would be normal in the whole direct product $N$, contrary to the choice of $M$. Thus $N$ is a direct product of groups of isomorphic finite simple groups. This applies to chief factors by conjugation from $G$.

Chief and composition factors need not coincide. In $A_4$, the chain $1<V_4<A_4$ is a chief series, since conjugation cycles the three order-two subgroups of $V_4$. A composition series instead inserts any one of those subgroups, giving factors $C_2,C_2,C_3$. Its inserted order-two subgroup is normal in $V_4$ but not in $A_4$. Chief series retain the ambient group's conjugation information that composition series discard.

The derived series gives a canonical criterion for a group to be soluble: put $G^{(0)}=G$ and $G^{(i+1)}=[G^{(i)},G^{(i)}]$. Its terms are characteristic, and each factor is Abelian. A finite group is soluble exactly when this series reaches the identity, equivalently when all its composition factors are cyclic of prime order. For one direction, the derived series supplies Abelian factors, whose simple refinements are cyclic of prime order. Conversely an extension of two soluble groups is soluble: if $(G/N{)}^{(r)}=1$, then $G^{(r)}\subseteq N$; if $N^{(s)}=1$, then $G^{(r+s)}=1$. Induction up a composition series with cyclic prime factors proves the other direction. In a finite soluble group, each minimal normal subgroup is elementary Abelian: its characteristic commutator subgroup must be trivial, its primary components force a single prime, and its characteristic subgroup of $p$th powers must be trivial. Thus every chief factor is a vector space over some ${\mathbb{F}}_p$. In a general finite group the Jordan–Hölder factors can instead be nonabelian simple groups.

The central series demand more than Abelian factors: each factor must be central in the corresponding quotient of the whole group. Define the upper central series by $Z_0=1$ and $Z_{i+1}/Z_i=Z(G/Z_i)$, and the lower central series by ${\gamma }_1=G$ and ${\gamma }_{i+1}=[{\gamma }_i,G]$. A group is nilpotent exactly when the upper series reaches $G$, equivalently when the lower series reaches the identity. Indeed, for any ascending central series $1=C_0\le \cdots \le C_c=G$, induction gives $C_i\subseteq Z_i$ and ${\gamma }_{c+1-i}\subseteq C_i$; reversing the lower series gives an ascending central series when it terminates. The least such $c$ is the nilpotency class. A central series has Abelian factors, so every nilpotent group is soluble; the converse fails, as $S_3$ is soluble but has trivial group center.

For a finite p-group, the class equation shows that the group center is nontrivial, since every noncentral conjugacy class has size divisible by $p$. Applying the same argument to successive central quotients makes the upper central series reach the group. More generally a finite group is nilpotent exactly when it is the direct product of groups of its Sylow subgroups. Here is the nontrivial direction. A central series gives the normalizer condition for nilpotent groups: for a proper subgroup $H$, choose the first $Z_i$ not contained in $H$. Then $[Z_i,H]\subseteq Z_{i-1}\subseteq H$, so $Z_i\subseteq N_G(H)$ and $N_G(H)>H$. If a Sylow subgroup $P$ had proper normalizer $N$, then $N_G(N)>N$; but $P$ is the unique Sylow subgroup of $N$, hence characteristic there, and $N_G(N)\subseteq N_G(P)=N$, a contradiction. Thus all Sylow subgroups are normal, different ones commute because their intersection is trivial, and they form an internal direct product. Conversely each finite Sylow subgroup is nilpotent, and products of their central series give a central series for their direct product.

Composition series record simple building blocks, chief series record ambient normal structure, derived series detect solubility, and central series detect nilpotence. Their associated factors and extension data explain why the same group can have very different useful series.

For the transfer homomorphism, choose representatives $T$ of the right cosets $H\backslash G$. For $t\in T$ and $g\in G$, write $tg=h(t,g)t_g$, where $h(t,g)\in H$ and $t_g\in T$. The permutation $t\mapsto t_g$ represents right multiplication on the cosets. DefineThe product has no order ambiguity in the abelianization $H/H^{\prime }$. Replace each representative $t$ by $a_{t}t$, with $a_t\in H$. The new factor is $a_{t}h(t,g)a_{t_g}^{-1}$. In the Abelian quotient, the extra products cancel because $t\mapsto t_g$ permutes $T$. Thus the transfer is independent of the transversal. Moreover,Multiplying and using the same permutation of representatives gives $V(g_1{g}_2)=V(g_1)V(g_2)$. This proves that group transfer is a well-defined group homomorphism.

For the Burnside transfer theorem, let $P\subseteq Z(N_G(P))$ be a Sylow $p$-subgroup. In particular $P$ is Abelian. We first prove the fusion fact that two elements of $P$ which are conjugate in $G$ must be equal. Suppose $u\in P$ and $v=g^{-1}ug\in P$. Both $P$ and $g^{-1}Pg$ centralize $v$, and they are Sylow subgroups of $C_G(v)$: they have the maximal $p$-order possible even in $G$. By Sylow theorems inside this centralizer, choose $h\in C_G(v)$ with $h^{-1}{g}^{-1}Pgh=P$. Thus $gh\in N_G(P)$ andBut $gh$ centralizes $P$ by hypothesis, so $v=u$.

Evaluate transfer to $P$ on $u\in P$. Partition the right cosets of $P$ into cycles under multiplication by $u$. For a cycle of length $r$ beginning at $Pt$, the product of its transfer factors telescopes to $t{u}^r{t}^{-1}\in P$. It is conjugate to $u^r\in P$, so the fusion fact makes it equal to $u^r$. The cycle lengths sum to $m=[G:P]$. Since $P$ is Abelian, all factors commute andThe integer $m$ is prime to $p$, and this power map is an automorphism of the finite Abelian $p$-group $P$: choose an inverse exponent modulo the exponent of $P$. Therefore $V_{G,P}:G\to P$ is surjective. Its kernel $K$ is normal and the first isomorphism theorem givesThus $K$ is the required normal p-complement; it also has trivial intersection with $P$.

Now suppose $P$ is cyclic of order $p^a$, where $p$ is the smallest prime divisor of $|G|$. Conjugation embeds $N_G(P)/C_G(P)$ into $\mathrm{Aut}(P)$, whose order is $p^{a-1}(p-1)$. Since $P\subseteq C_G(P)$ and $P$ is Sylow in $N_G(P)$, the quotient has order prime to $p$. Any remaining prime factor would divide $p-1$ and hence be smaller than $p$, but would also divide $|G|$, an impossibility. Thus $N_G(P)=C_G(P)$ and $P\subseteq Z(N_G(P))$. The Burnside transfer theorem proves that a cyclic Sylow subgroup at the least prime divisor gives a normal complement.

Apply this to a finite nonabelian simple group. If $p^3\nmid |G|$, its Sylow $p$-subgroup has order $p$ or $p^2$. A cyclic Sylow subgroup would give a normal complement; simplicity would then force either a trivial complement and a $p$-group, or an improper complement, neither possible for a nonabelian simple group. Groups of order $p^2$ are Abelian: their nontrivial group center, supplied by the class equation, is either the whole group or has cyclic quotient, which also forces the group Abelian. Thus the only remaining Sylow possibility is $P\cong C_p^2$.

The conjugation quotient $N_G(P)/C_G(P)$ now embeds in $G{L}_2(p)$ and is still prime to $p$. Its possible prime divisors come fromIf $p$ is odd, every prime divisor of $p-1$ is smaller than $p$, and every prime divisor of the even number $p+1$ is at most $(p+1)/2<p$. Since $p$ was the least prime divisor of $|G|$, the quotient must be trivial. Then the Burnside transfer theorem again contradicts simplicity. If $p=2$, the only nontrivial odd divisor of $|G{L}_2(2)|=6$ is three. Trivial conjugation would again give a normal complement, so three must divide $|G|$; the Sylow subgroup has order four. We have proved the least-prime divisibility constraint for a finite simple group:

For infinitely many instances of the latter alternative only, takeThese are simple, as permitted in the question (and also covered by the next solution). For $q=5^{2m+1}$, the group order is $q(q^2-1)/2$. Since $q\equiv 5(\mathrm{mod}8)$, $q-1$ is divisible by four but not eight and $q+1$ by two but not four. Hence the order is divisible by four but not eight. Also $q\not\equiv 0(\mathrm{mod}3)$, so $3\mid q^2-1$. Their smallest prime divisor is two andTheir orders strictly increase with $m$, so they give infinitely many distinct examples.

The isomorphic pair is $A_8\cong PS{L}_4(2)$; $PS{L}_3(4)$ is different. All three have order $20160$, so order alone does not settle the question; explicitly $|PS{L}_3(4)|=(64-1)(64-4)(64-16)/(3\cdot 3)=20160$. We give a concrete realization and an element-order distinction.

On $W={\bigwedge }^2{\mathbb{F}}_2^4$, the Pfaffian isIt is a nonsingular plus-type quadratic form: the three displayed pairs give a hyperbolic decomposition. Change of basis multiplies the Pfaffian by the determinant, which is always one in $G{L}_4(2)$. Hence the exterior-square realization of PSL4 over F2 embeds $G{L}_4(2)$ into $O_6^{+}(2)$. The kernel of a group homomorphism is trivial: an element acting trivially on the exterior square fixes every decomposable two-space, then every one-space as an intersection of two-spaces, and hence is a scalar; over ${\mathbb{F}}_2$ this scalar is one.

For a second model let $E$ be the even-weight vector subspace of ${\mathbb{F}}_2^8$ and quotient by the all-one vector. The dot product descends to a nondegenerate alternating bilinear form on the six-dimensional quotient, andis well defined, since complementing an even subset changes half its weight from $w/2$ to $4-w/2$. It has $(1+70+1)/2=36$ zero vectors, so is plus type. Coordinate permutations give a faithful $S_8$ action: fixing the quotient fixes each weight-two subset, because its complement has weight six, and fixing all two-subsets forces the identity permutation.

From the independently derived symplectic order and quadratic orbit count below,Thus $O_6^{+}(2)\cong S_8$ and the image of $G{L}_4(2)=S{L}_4(2)=PS{L}_4(2)$ is its index-two subgroup $A_8$. The index-two subgroup is unique: a nontrivial group homomorphism $S_8\to C_2$ sends every transposition to the same nonidentity element and is the sign map.

To separate $PS{L}_3(4)$, observe that $A_8$ contains $(12345)(678)$ of order 15. An odd-order projective element of $PS{L}_3(4)$ lifts to a semisimple linear operator, since its order upstairs divides three times an odd order in characteristic two. The possible eigenspace degree patterns are $1+1+1$, $2+1$ and $3$. In the split case all eigenvalues have order dividing three, so the projective element has no order 15. In the $2+1$ case the eigenvalues are $\lambda ,{\lambda }^4,{\lambda }^{-5}$ with $\lambda \in {\mathbb{F}}_{16}^{\times }$; its fifth power is scalar because ${\lambda }^{15}=1$, so its projective order divides five. In the irreducible case the determinant-one torus has order $4^2+4+1=21$ and quotienting its scalar subgroup of order three gives projective order dividing seven. There is therefore no element of order 15 in $PS{L}_3(4)$.

Several small-parameter coincidences connect the finite classical groups to permutation groups. The projective-line action immediately gives $PS{L}_2(2)\cong S_3$, $PS{L}_2(3)\cong A_4$, $PG{L}_2(3)\cong S_4$ and $PS{L}_2(4)\cong A_5$ by faithful actions of degrees three, four and five and their orders. Also $PS{L}_2(5)\cong A_5$: its involutions have Klein-four centralizers, giving five Sylow subgroups; their conjugation action is faithful and embeds its order-60 simple group into $S_5$. Simplicity here can be checked from class sizes $1,15,20,12,12$: no proper nontrivial normal class union has order dividing 60. The same five-subgroup action extends to $PG{L}_2(5)$, with trivial kernel of a group homomorphism and order 120, giving $S_5$. Indeed its kernel intersects $PS{L}_2(5)$ trivially, so centralizes that normal subgroup. Commuting projectively with both upper and lower elementary unipotents forces a representing matrix to be scalar, so this kernel is trivial.

The less immediate coincidence $PS{L}_2(9)\cong A_6$ can be exhibited on the ten unordered triple partitions used in Question 4. Let $a=(123)$, $b=(456)$, $w=(12)(36)$, assign $\infty$ to $123\mid 456$ and $0$ to $126\mid 345$, and label the other partitions by applying $a^x{b}^y$ to the zero partition, with $t=x+iy\in {\mathbb{F}}_9$ and $i^2=-1$. Inspection of these nine partitions givesTranslations and inversion generate $PS{L}_2(9)$: conjugating the upper unitriangular matrices by inversion gives the lower ones, and elementary elimination generates $S{L}_2(9)$. Their projective action has order $9(9^2-1)/2=360$. These partition permutations come from even permutations of six letters, whose partition action is faithful as proved below; hence they fill $A_6$.

Finally, on the even-weight module of ${\mathbb{F}}_2^6$ modulo its all-one vector, coordinate permutations preserve a nondegenerate alternating bilinear form in dimension four and act faithfully, again by the weight-two-subset argument. Both $S_6$ and $S{p}_4(2)$ have order 720, proving $S{p}_4(2)\cong S_6$, with commutator subgroup $A_6$. These examples illustrate both the need to quotient group centers and the low-rank exceptions to general simplicity. They do not make equal orders sufficient for group isomorphism, as the two order-20160 examples already demonstrate.

We prove Simplicity of the alternating group A5 by finding all its conjugacy classes. The alternating group has group order $|A_5|=5!/2=60$. Its even permutations have cycle types $1$, $(abc)$, $(ab)(cd)$ and $(abcde)$. There are $\left(\genfrac{}{}{0ex}{}{5}{3}\right)\cdot 2=20$ three-cycles, $5\cdot 3=15$ products of disjoint transpositions, and $4!=24$ five-cycles.

For a three-cycle, a commuting permutation must rotate its three-element support and may interchange the two fixed points. Its centralizer in $S_5$ has order six, and only the three rotations are even. Thus its conjugacy class in $A_5$ has size $60/3=20$ and contains every three-cycle. The centralizer of $(12)(34)$ in $S_5$ has order eight: one may interchange the two pairs and independently interchange the elements within each pair. It contains the odd element $(12)$, so exactly half of these commuting elements are even. The conjugacy class in $A_5$ consequently has size $60/4=15$. A permutation commuting with a five-cycle is determined by the image of one point and must be a power of that cycle. All five powers are even, so each such conjugacy class has size $60/5=12$. The 24 five-cycles form exactly two classes.

A normal subgroup contains the identity and is a union of whole conjugacy classes. Its possible orders therefore lie inBy Lagrange's theorem, its order must divide 60. Only 1 and 60 in this list do so. Hence $A_5$ has no proper nontrivial normal subgroup and is a simple group.

A soluble group is a group whose derived series $G^{(0)}=G$, $G^{(i+1)}=[G^{(i)},G^{(i)}]$ terminates at $1$. Equivalently, it has a finite subnormal series with abelian factors. For the reverse implication, if $G/N$ has derived length $r$, then $G^{(r)}\le N$; if $N$ has derived length $s$, then $G^{(r+s)}=1$. Iterating this observation through the series proves the equivalence. For a finite group, refining the abelian factors to composition factors says that solubility is equivalent to all composition factors being cyclic of prime order.

Subgroups and quotient groups of soluble groups are soluble, since their derived series lie in, or are images of, the original series. The same calculation proves closure under group extensions. Finite p-groups are nilpotent groups, hence soluble: their nontrivial centers allow induction to construct a central series. Every finite nilpotent group is a direct product of groups of its Sylow subgroups. The converse fails: $S_3$ has the abelian-factor series $1<C_3<S_3$, but its order-two Sylow subgroups are not normal. The symmetric group $S_4$ is also soluble, with series $1<V_4<A_4<S_4$ and abelian factors. A finite soluble group has elementary abelian minimal normal subgroups, by the argument in 1(c). In contrast, a nonabelian simple group is a perfect group and is not soluble.

The Fitting subgroup collects the normal nilpotent structure. For a nontrivial finite soluble group it is nontrivial, since it contains an elementary abelian minimal normal subgroup. Part 1(c) proves $C_G(F)\le F$, so conjugation embeds $G/C_G(F)$ in $\mathrm{Aut}(F)$. This shows why controlling a soluble group through normal abelian or nilpotent layers is effective, even when the whole group is not a nilpotent group.

For a set of primes $\pi$, a Hall subgroup of type $\pi$ has order divisible only by primes in $\pi$ and index divisible only by primes outside $\pi$. The Hall theorem for soluble groups says that a finite soluble group has such subgroups, any two are conjugate, and every subgroup of $\pi$-order is contained in one. These assertions generalize the Sylow theorems, which treat a single prime. Here is a proof of all three assertions.

First we need coprime splitting over an elementary abelian normal subgroup. Suppose $V⊴E$ is an elementary abelian p-group and $Q=E/V$ has order $h$ prime to $p$. A section $s:Q\to E$ defines an action on $V$ and an additive factor set $f(x,y)$ by $s(x)s(y)=f(x,y)s(xy)$. Associativity saysSumming over $z\in Q$ and dividing by $h$ in $V$ gives $f(x,y)=b(x)+xb(y)-b(xy)$, where $b(x)=h^{-1}{\sum }_{z}f(x,z)$. Replacing $s(x)$ by $-b(x)s(x)$ removes the factor set, giving a complement. Two complements differ by a map $d$ satisfying $d(xy)=d(x)+xd(y)$. Averaging over $y$ gives $d(x)=b-xb$, so the complements are conjugate by an element of $V$. This proves both splitting and conjugacy, without assuming that an arbitrary extension splits.

Induct on $|G|$, taking an elementary abelian minimal normal subgroup $V$ of exponent $p$. Choose a quotient Hall subgroup $\bar{H}\le G/V$ and let $K$ be its preimage. If $p\in \pi$, then $K$ itself is a Hall subgroup. If $p\notin \pi$, the preceding splitting argument gives a complement $H$ to $V$ in $K$, and that complement is a Hall subgroup of $G$.

For conjugacy, the images of two Hall subgroups are quotient Hall subgroups, so induction allows them to have the same image and lie in the same $K$. If $p\in \pi$, every Hall subgroup contains $V$: its product with $V$ is a $\pi$-subgroup and cannot be larger by the subgroup-order formula. Both are then $K$. If $p\notin \pi$, both are complements to $V$ in $K$, so the averaging argument conjugates them.

Finally let $U\le G$ be any $\pi$-subgroup. By induction its image lies in a quotient Hall subgroup, so $U\le K$. If $p\in \pi$, $K$ is already a Hall subgroup containing $U$. Otherwise write $K=V⋊H$. In $VU$, both $U$ and the inverse image in $H$ of the image of $U$ are complements to $V$. Complement conjugacy therefore places $U$ in a conjugate of $H$. This proves embedding and completes the induction.

Thus existence, conjugacy and containment all hold for every prime set in a finite soluble group. The solubility hypothesis matters: $A_5$ has no Hall subgroup for $\pi =\{2,5\}$. Such a subgroup would have index three; its coset action would give a nontrivial group homomorphism $A_5\to S_3$, impossible because $A_5$ is a simple group and has order $60$. This example also distinguishes a Hall subgroup from a merely arbitrary subgroup whose order uses the chosen primes.

A finite minimal normal subgroup is a characteristically simple group, and has the direct-product structure of a finite minimal normal subgroupwith isomorphic simple groups $T_i$. For completeness, choose a minimal nontrivial normal subgroup $T$ of $N$. Its distinct $G$-conjugates are minimal normal subgroups of $N$, so they centralize one another. Their product is normal in $G$, hence equals $N$. If $T$ is abelian the product is abelian and minimal primary characteristic subgroups make $N$ elementary abelian. Otherwise each $T$ has trivial center: its center is a characteristic subgroup of $T$, hence normal in $N$, and minimality would make $T$ abelian. Each new conjugate then meets the product of previous conjugates trivially, because it centralizes that product and is centerless. The product is direct. Every normal subgroup of a direct factor is normal in $N$, so minimality of that factor makes it simple.

Assume now that $N$ acts primitively and nonregularly. Any nontrivial normal subgroup of this faithful primitive action is transitive. Thus each $T_i$ is transitive. If $k\ge 2$, the transitive commuting groups $T_1$ and $T_2$ are regular: an element of one fixing $\alpha$ commutes with the other and hence fixes its entire orbit. But the centralizer of a regular group has order $n$, as its elements are determined by the image of $\alpha$. Therefore all remaining factors lie in the order-n centralizer of $T_1$, and the transitive group $T_2$ already fills it. There can be only two factors, with $|N|=n^2$. Now $|N_{\alpha }|=n$, whereas its common nontrivial subdegree $r$ divides both $n$ and $n-1$. Hence $r=1$, making $N_{\alpha }$ trivial, a contradiction. Thus $k=1$, and $N$ is simple. An abelian transitive group is regular, so $N$ is nonabelian.

Finally $C_G(N)$ is normal in the primitive group $G$. If nontrivial it would be transitive, and commuting with transitive $N$ would force $N$ regular. Thus $C_G(N)=1$, and conjugation embeds $G$ in $\mathrm{Aut}(N)$. The centerless simple group $N$ is identified with its inner automorphism group. Therefore

Work with finite groups, as required for these Sylow subgroup counts. Let $P$ act by conjugation on the set of Sylow $p$-subgroups. The stabilizer of $Q$ is $P\cap N_G(Q)$. Since $Q$ is the normal Sylow subgroup of its own normalizer, every $p$-subgroup of that normalizer lies in $Q$. Consequently the stabilizer is exactly $P\cap Q$, and the orbit-stabilizer theorem gives orbit size $[P:P\cap Q]$. The orbit of $P$ has size one. Every other orbit size is a power of $p$ at least $p^a$, hence is divisible by $p^a$. Adding orbit sizes proves the strengthened Sylow congruence from intersections:Now suppose $G$ is simple of order $2^e\cdot 15$. If $e=0$, its Sylow $5$-subgroup is normal because its number divides three and is one modulo five. If $e=1$, an involution in the regular permutation action of $G$ swaps fifteen pairs, so its sign is negative. The sign of a permutation would give a nontrivial group homomorphism $G\to C_2$ with a proper nontrivial normal kernel. Both cases contradict simplicity. Thus $e\ge 2$.

The Sylow theorems make $n_2$ a divisor of fifteen. It is not one, since a nontrivial Sylow subgroup would then be normal. It is not three, since the conjugation action on three Sylow subgroups would give a faithful group homomorphism $G\hookrightarrow S_3$, impossible by order. If $n_2=5$, take a Sylow subgroup $P$ itself: its normalizer has subgroup index five. If $n_2=15$, not all distinct Sylow subgroups can intersect $P$ in subgroup index at least four, since that would give $15\equiv 1(\mathrm{mod}4)$. Choose $Q\ne P$ with $[P:P\cap Q]=2$. Put $R=P\cap Q$, of order $2^{e-1}$. It has subgroup index two in both $P,Q$, so is normal in each. Hence $N_G(R)$ contains both distinct Sylow subgroups and has order greater than $2^e$. It is proper: otherwise $R$ would be a nontrivial proper normal subgroup of $G$. Its order is therefore $2^e\cdot 3$ or $2^e\cdot 5$. The latter would give an index-three subgroup and again an impossible faithful action on three cosets. Thus $[G:N_G(R)]=5$.

In either case we have the requested subgroup of order $2^e$ or $2^{e-1}$ with index-five normalizer. The action on the five cosets of that normalizer is nontrivial and faithful by simplicity. Its image lies in $A_5$, since composing with sign cannot give a nontrivial map from this simple group of order greater than two to $C_2$. Thus $2^e\cdot 15$ divides $60$, forcing $e=2$ and equality of orders. This proves the simple groups with order a power of two times fifteen conclusion:For $S{L}_2(5)$, choose the first column: there are $5^2-1=24$ nonzero choices. For each, determinant one is a nonzero linear equation in the second column and has five solutions. Therefore $|S{L}_2(5)|=120$. A central matrix commuting with $\left(\begin{array}{cc}1& 1\\ 0& 1\end{array}\right)$ has zero lower-left entry and equal diagonal entries; commuting also with $\left(\begin{array}{cc}1& 0\\ 1& 1\end{array}\right)$ makes the upper-right entry zero. It is scalar. Determinant one then givesTo establish the projective special linear group over the field with five elements isomorphism without assuming its simplicity, compute its classes. For determinant-one matrices, the characteristic polynomial is $X^2-tX+1$ with trace $t$. The possibilities over ${\mathbb{F}}_5$ exhaust the group:For trace zero the eigenvalues are $2,3$, so the determinant-one centralizer is the split diagonal torus of order four. For traces $\pm 1$, the discriminant is the nonsquare $2$: the centralizer is the norm-one subgroup of ${\mathbb{F}}_{25}^{\times }$, of order six. In both semisimple cases the determinant map on the full linear centralizer is surjective onto ${\mathbb{F}}_5^{\times }$; consequently each trace type is a single special-linear class. For the noncentral traces $\pm 2$, a Jordan block has full linear centralizer $\left\{\left(\begin{array}{cc}a& b\\ 0& a\end{array}\right):a\ne 0\right\}$ with determinant $a^2$. The determinant image consists of the two squares, so each general-linear class splits into two special-linear classes; the determinant-one centralizer has order $2\cdot 5=10$. These sizes sum to $120$.

Quotienting by $Z$ identifies a matrix with its negative. The trace-zero class gives one projective class of size fifteen; the two traces $\pm 1$ give one class of size twenty; the four noncentral unipotent classes give two classes of size twelve. Their respective projective orders are $2,3,5,5$, by the characteristic polynomials. A normal subgroup is a union of classes containing the identity. The nontrivial proper possible union sizes are $13,16,21,25,28,33,36,40,45,48$, none of which divides $60$. Thus the quotient is simple. Applying the order-$60$ result above givesFinally, if $A^2=I$ over an odd-characteristic field, its minimal polynomial divides the square-free polynomial $(X-1)(X+1)$, so it is diagonalizable with eigenvalues $\pm 1$. In dimension two, determinant one requires both eigenvalues equal. Hence $A=I$ or $A=-I$. This proves the unique involution in SL2 over an odd field assertion: the only element of order two in $S{L}_2(5)$ is $-I$. If an index-two subgroup $H$ existed, it would be normal and have order sixty. By Cauchy theorem it would contain an involution, hence contain $Z$. Then $H/Z$ would be a normal subgroup of order thirty in the simple quotient $PS{L}_2(5)$, a contradiction. Thus $S{L}_2(5)$ has no index-two subgroup.

Choose a minimal nontrivial normal subgroup $L$ of $K$ itself. Every conjugate $L^g$ for $g\in G$ is also a minimal normal subgroup of $K$, since $K$ is normal in $G$. Distinct such subgroups intersect trivially: their intersection is normal in $K$ and minimality forces either equality or trivial intersection. Moreover $[L_i,L_j]\subseteq L_i\cap L_j=1$, so distinct ones commute.

Choose a maximal family of these conjugates whose product $M=L_1\times \cdots \times L_r$ is direct. For any further conjugate $L^g$, its intersection with $M$ is normal in $K$ and is either all of $L^g$ or trivial. In the latter case it commutes with all the existing factors and could be adjoined to the direct product of groups, contrary to maximality. Thus every conjugate is contained in $M$. The product of all conjugates is consequently $M$, which is nontrivial and normal in $G$. Minimality of $K$ as a $G$-normal subgroup gives $M=K$.

Any normal subgroup of a factor $L_i$ is normal in $K$: the other direct factors commute with it, and $L_i$ normalizes it. Minimality of $L_i$ as a $K$-normal subgroup makes it simple. All factors are isomorphic because they are conjugate to $L$. This proves the direct-product structure of a finite minimal normal subgroup:An abelian simple group is cyclic of prime order, so the abelian case is elementary abelian. Now let $H$ be a maximal proper subgroup of a nonabelian simple group $X$. It is nontrivial, since $X$ has nontrivial proper cyclic subgroups. Choose a minimal normal subgroup $K$ of $H$. Then $H\le N_X(K)$. This normalizer cannot be $X$, since that would make $1<K\le H<X$ normal in $X$. Maximality givesFor each of the two groups in this question, the allowed absence of proper nonabelian simple subgroups makes the factors of such a $K$ cyclic of prime order. Hence it suffices to examine normalizers of nontrivial elementary abelian subgroups.

In $A_5$, the possible primes are two, three and five. The Sylow subgroups for the last two primes are cyclic of orders three and five. Every involution is a double transposition; for $(12)(34)$ the centralizer in $A_5$ isthe Klein four-group fixing point five. Thus an elementary abelian $2$-subgroup is cyclic of order two or a Klein four-group. The normalizer of a cyclic order-two subgroup equals its centralizer and has order four, so is contained in a point stabilizer of order twelve. A Klein four-group's common fixed point is intrinsic, and the full point stabilizer $A_4$ normalizes it; its normalizer is therefore exactly that stabilizer.

An order-three subgroup has support a triple. Its normalizer preserves the triple and the remaining pair, and is $(S_3\times S_2)\cap A_5$, of order six. An order-five subgroup acts regularly on all five points. Label the points by ${\mathbb{F}}_5$, with the subgroup acting by translations. Its normalizer in $S_5$ is the twenty affine maps $x\mapsto ax+b$. The translations are even, whereas multiplication by a generator of ${\mathbb{F}}_5^{\times }$ is a four-cycle and is odd. Exactly half these maps are even, so the normalizer in $A_5$ has order ten.

The only candidates for maximal subgroups are thus the normalizers of orders twelve, ten and six. They are all maximal: none can lie in a larger candidate, except potentially an order-six subgroup in an order-twelve $A_4$. But an index-two subgroup of $A_4$ would contain every order-three element; there are eight such elements, plus the identity, already more than six. Hence that containment is impossible. Point stabilizers are conjugate; order-three and order-five subgroup normalizers each form one class by the Sylow theorems. Therefore the maximal subgroups of A5 form preciselyTheir numbers are five, six and ten respectively, since these proper maximal subgroups are self-normalizing in the simple group.

For $X=G{L}_3(2)$, choosing independent columns gives $|X|=(8-1)(8-2)(8-4)=168$. If $t$ is an involution, write $t=I+N$. Field characteristic two gives $N^2=0$, and $\mathrm{im}N\subseteq \ker N$ in dimension three forces its nonzero rank to be one. Thus $t=I+vf$, with nonzero vector $v$, nonzero linear functional $f$ and $f(v)=0$. This transvection fixes the plane $\ker f$ and has image line $⟨v⟩$. Every flag consisting of an incident line and plane occurs, giving $7\cdot 3=21$ involutions, all conjugate. Its centralizer, and hence the normalizer of its cyclic subgroup, is the flag stabilizer of order $168/21=8$. It lies in both the line and plane stabilizers of order $24$, so cannot be maximal.

For the elementary abelian subgroups in GL3 over F2, consider commuting transvections $I+vf$, $I+wh$. Their rank-one parts satisfyIf $v,w$ are independent, equality forces both sides zero; thus $f,h$ vanish on $⟨v,w⟩$ and are the same nonzero functional. If $v=w$, they have a common image line. Consequently the two types of order-four elementary abelian subgroup areNo extra transvection can commute with all elements of $K_L$: if its image were different, its functional would have to equal each of the two independent functionals occurring in $K_L$. Dually, the same holds for $K_W$. Thus these exhaust the elementary abelian $2$-subgroups of rank at least two. The normalizer of $K_L$ is the line stabilizer and the normalizer of $K_W$ is the plane stabilizer, each of order $168/7=24$. They give different conjugacy classes because their common fixed spaces have dimensions one and two. All line stabilizers are conjugate, as are all plane stabilizers.

For an order-three element, its minimal polynomial is $(X-1)(X^2+X+1)$: it has a fixed line and an invariant complementary irreducible plane. Its normalizer preserves both and is the full $G{L}_2(2)$ on that plane, of order six, since the order-three subgroup is normal in $G{L}_2(2)$. This normalizer lies in the corresponding line and plane stabilizers, so is not maximal.

An order-seven element is irreducible. Over the finite field ${\mathbb{F}}_2$ one has $X^7-1=(X-1)(X^3+X+1)(X^3+X^2+1)$, and both cubic factors are irreducible because neither has a root in ${\mathbb{F}}_2$. Its minimal polynomial divides this square-free product and cannot be just $X-1$, since the element is not the identity. It therefore contains a cubic factor; the three-dimensional space forces that irreducible cubic to be the whole minimal polynomial. Identify the space with ${\mathbb{F}}_8$ and the element with multiplication by a generator $\alpha$ of ${\mathbb{F}}_8^{\times }$. Its centralizer consists of the seven nonzero multiplication maps. A normalizer induces an ${\mathbb{F}}_2$-automorphism of this field, so it sends $\alpha$ to $\alpha$, ${\alpha }^2$ or ${\alpha }^4$. All three possibilities occur via the field automorphisms $x\mapsto x^{2^j}$. Therefore the normalizer of the Singer cycle has order $7\cdot 3=21$, and all such normalizers are conjugate by the Sylow theorems.

The maximal-normalizer reduction leaves exactly the two order-twenty-four stabilizer types and the order-twenty-one type. Each is maximal because it cannot be contained in any larger remaining candidate; equal-order subgroups cannot properly contain one another and $21$ does not divide $24$. Thus