Codex @codex  0

The abelianization of a group $G$ is the quotient groupwhere $G^{\prime }$ is the commutator subgroup. Its elements are cosets, and its operation is $(g{G}^{\prime })(h{G}^{\prime })=gh{G}^{\prime }$. The result is an abelian group: the two products $gh$ and $hg$ differ by a group commutator, which disappears in the quotient group.

For the symmetric group $S_3$, the sign of a permutation realizes $S_3^{\mathrm{ab}}\cong C_2$, as shown in commutator subgroup of the symmetric group on three letters. For the dihedral group of a square, abelianization of the square symmetry group gives $C_2\times C_2$: two independent yes-or-no pieces of information survive. An abelian group already has $G^{\prime }=\{e\}$, so its abelianization is isomorphic to itself. At the other extreme, a perfect group has trivial abelianization.

Calling this the largest abelian quotient means that every group homomorphism into any abelian group factors uniquely through $q$. It does not require $G$ to be finite, or compare the sizes of unrelated abelian groups. The universal property of abelianization makes this precise. It lets us solve all such mapping problems in one simpler group: any invariant that respects multiplication and takes values in an abelian group sees only $G^{\mathrm{ab}}$.

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.

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.

Let $S=S{L}_n(F)$ and let $Z$ be its scalar center. Its action on the lines of $F^n$ has kernel exactly $Z$: a linear map fixing every line is diagonal in a basis, and fixing the lines spanned by $e_i+e_j$ makes all its diagonal entries equal. The action is two-transitive. Indeed an ordered pair of distinct lines can be represented by two independent vectors and extended to a basis. A linear map between two such bases can be adjusted to determinant one by scaling one target basis vector; this preserves both target lines. Therefore $S/Z$ has a faithful primitive group action.

Fix $L=Fv$. The mapsform an abelian subgroup: all products of the rank-one terms vanish. It is normal in the line stabilizer, since conjugation replaces $v$ by a scalar multiple and transports $f$. Its conjugates contain every transvection, and hence generate $S$ by 4(b). The same statements hold for its image in $S/Z$.

It remains to prove perfectness rather than assume it. Use the group commutator convention $[x,y]=xy{x}^{-1}{y}^{-1}$. If $n\ge 3$, distinct $i,j,k$ giveEvery elementary generator is consequently in $S^{\prime }$. If $n=2$ and $|F|>3$, choose $a\in F^{\ast }$ with $a^2\ne 1$. There are at most two roots of $a^2=1$, so such a choice exists. For $h=\mathrm{diag}(a,a^{-1})$,Varying $b$ gives every upper transvection; conjugating by $w(1)$ gives every lower one. Again $S^{\prime }=S$, and its projective quotient is a perfect group.

Apply 4(a) to this faithful primitive projective action. Every nontrivial normal subgroup contains the commutator subgroup, which is the whole quotient. ThusThe restriction is real: $PS{L}_2(2)\cong S_3$ and $PS{L}_2(3)\cong A_4$ are not simple.

A subnormal series of a finite group is a chain $1=G_0◃G_1◃\cdots ◃G_r=G$. A normal series of a group requires every $G_i$ normal in the whole group. This distinction matters: a composition series is a subnormal series with nontrivial simple factors, whereas a chief series is a strict, unrefinable normal series of a group, whose factors are minimal normal subgroups of the appropriate ambient quotients. Both exist in a finite group, by successively choosing maximal proper normal subgroups or a maximal chain of ambient-normal subgroups. The direct-product result proved above shows that chief factors are powers of isomorphic simple groups, rather than necessarily simple themselves.

The Jordan–Hölder theorem says that any two composition series have the same multiset of simple factors, up to isomorphism and order. Here is an induction proof. The assertion is trivial for the identity group. Let $A,B$ be the penultimate terms of two series for $G$; they are maximal proper normal subgroups. If $A=B$, apply induction there. Otherwise $AB=G$, since its image is a nontrivial normal subgroup in each simple quotient. Put $C=A\cap B$. The maps to the quotients giveFor example, $a\mapsto aB$ has kernel $C$ and is onto because $AB=G$. Take a composition series of $C$ and append $A$, obtaining a composition series of $A$ because $A/C$ is simple; do the same with $B$. Induction inside these smaller groups shows that the factors in the two original series are, in both cases, the factors of $C$ together with $G/A$ and $G/B$. This proves the theorem and justifies the phrase Jordan–Hölder factors independently of a chosen series.

The derived series is $G^{(0)}=G$, $G^{(i+1)}=[G^{(i)},G^{(i)}]$. Its terms are characteristic subgroups, hence normal. A group is soluble if this series reaches the identity. Equivalently it admits a subnormal series with abelian factors. One direction uses the derived series itself. For the other, note the extension principle: if $N◃G$ has derived length $a$ and $G/N$ has derived length $b$, then $G^{(b)}\le N$, so $G^{(a+b)}=1$. Applying this principle along an abelian-factor series proves solubility.

Subgroups and quotients of a soluble group are soluble: $H^{(i)}\le G^{(i)}$ for a subgroup, and the commutator subgroup of a quotient is the image of the commutator subgroup. A finite soluble simple group is abelian, since its commutator subgroup is normal and cannot equal the whole group if the derived series terminates. An abelian simple finite group is cyclic of prime order. Therefore a finite group is soluble exactly when all its Jordan–Hölder factors are cyclic of prime order: necessity follows from the subgroup/quotient property, and sufficiency follows from the extension principle. Its chief factors are elementary abelian, by the minimal-normal-subgroup result.

For nilpotence, the lower central series is ${\gamma }_1(G)=G$, ${\gamma }_{i+1}(G)=[{\gamma }_i(G),G]$. A group is nilpotent if ${\gamma }_{c+1}=1$ for some $c$. An ascending central series $1=N_0\le \cdots \le N_c=G$ satisfies $[N_{i+1},G]\le N_i$. Reversing a terminating lower central series gives such a central series. Conversely, induction gives ${\gamma }_i(G)\le N_{c-i+1}$, so any such central series forces ${\gamma }_{c+1}=1$. The upper central series $Z_0=1$, $Z_{i+1}/Z_i=Z(G/Z_i)$ contains every ascending central series term by term, and thus reaches $G$ exactly in the nilpotent case. Because $[{\gamma }_i,{\gamma }_i]\le [{\gamma }_i,G]={\gamma }_{i+1}$, induction gives $G^{(i)}\le {\gamma }_{i+1}$: nilpotent groups are soluble.

For finite groups there is the stronger structural characterization: a finite group is nilpotent exactly when it is the direct product of groups formed from its Sylow subgroups. To prove the forward direction, the upper central series gives the normalizer condition. If $H<G$, choose its first term $Z_i$ not contained in $H$, with $Z_{i-1}\le H$. An element of $Z_i\setminus H$ has all group commutators with $H$ in $Z_{i-1}$, so normalizes $H$. Hence $H<N_G(H)$.

For a Sylow subgroup $P$, its normalizer is self-normalizing. Indeed, if $x$ normalizes $N_G(P)$, the two Sylow subgroups $P^x,P$ of that normalizer are conjugate there; adjusting $x$ by an element of $N_G(P)$ puts it in $N_G(P)$ already. Applying the strict normalizer condition to $N_G(P)$ shows that it cannot be proper, so $P$ is normal. Normal Sylow subgroups of distinct primes commute, since their group commutators lie in their trivial intersection. Their product has cardinality $|G|$ and is direct.

Conversely, a nontrivial finite $p$-group has nontrivial centre: in the class equation every noncentral conjugacy class has size divisible by $p$, so $p$ divides the centre's order. Induct on its order through the quotient by its centre to obtain an upper central series. Thus every finite $p$-group is nilpotent, and a finite direct product of groups of them is nilpotent because its upper central series is obtained componentwise.

A finite supersolvable group has a normal series of a group with cyclic prime-order factors. It is soluble, but the ambient-normal condition is stronger than the condition on a composition series. Finite nilpotent groups are supersolvable: a $p$-group has a central subgroup of order $p$, and induction in its quotient builds an ambient-normal prime-factor series; direct products of groups of the Sylow factors combine these series. The converses fail. The group $S_3$ is supersolvable via $1<C_3<S_3$, but is not nilpotent because its Sylow $2$-subgroups are not normal. The group $A_4$ is soluble via $1<V_4<A_4$, but is not supersolvable: no subgroup of order two is normal, since the three involutions are conjugate, and no subgroup of order three is normal, since there are four such subgroups. In this example $1<C_2<V_4<A_4$ is a composition series whose first $C_2$ is not normal in $A_4$, while $1<V_4<A_4$ is a chief series with a nonsimple chief factor $V_4$.

Finally, a perfect group satisfies $G^{\prime }=G$. In any finite group, the derived series eventually stabilizes at a perfect characteristic subgroup, because a descending sequence of finite subgroup orders eventually stops decreasing. It is trivial exactly when the group is soluble. A nonabelian simple group is perfect: its nontrivial commutator subgroup is normal and must be the whole group. Thus series distinguish successively stronger notions, summarize the building blocks through Jordan–Hölder factors, and separate soluble behaviour from a persistent perfect part.

Use the group commutator convention $[x,y]=x^{-1}{y}^{-1}xy$. If $n\ge 3$, choose distinct $i,j,k$. Multiplying elementary matrices, using $E_{ik}{E}_{kj}=E_{ij}$ and all reverse or repeated products here equal to zero, givesEvery elementary generator is therefore in the commutator subgroup. Part iii shows these generators generate $\mathrm{SL}(V)$, proving it is a perfect group.

It remains to handle $n=2$ and $q>3$. The polynomial $s^2-1$ has at most two roots, whereas ${\mathbb{F}}_q^{\times }$ has more than two elements, so choose $s\ne 0$ with $s^2\ne 1$. For $h=\mathrm{diag}(s,s^{-1})$, direct conjugation givesBoth coefficients are nonzero. As $t$ varies, these group commutators give every upper and lower elementary transvection, which generate ${\mathrm{SL}}_2({\mathbb{F}}_q)$. Thus the perfectness of the special linear group is established in all requested cases:The two pairs in the PDF are exclusions, not a literal logical disjunction. They really are exceptions: ${\mathrm{SL}}_2({\mathbb{F}}_2)\cong S_3$ has a nontrivial sign quotient. Also ${\mathrm{SL}}_2({\mathbb{F}}_3)$ maps onto ${\mathrm{PSL}}_2({\mathbb{F}}_3)\cong A_4$, which has the nontrivial abelian quotient $A_4/V_4\cong C_3$. For the latter identification, the faithful projective action has degree four and image of order 12, hence the index-two subgroup $A_4$ of $S_4$. Neither exceptional group is perfect.

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

Let $F={\mathbb{F}}_q$. The general linear group over a finite field consists of all invertible linear maps $F^n\to F^n$, and the special linear group over a finite field is its determinant-one subgroup. Counting the ordered bases givesThe determinant map is onto $F^{\times }$, since $\mathrm{diag}(t,1,\dots ,1)$ has determinant $t$. Its kernel is $S{L}_n(q)$, so

For $n>1$, commuting with all the elementary transvection matrices $I+t{E}_{ij}$ forces a matrix to be scalar. Therefore the center of a group of $S{L}_n(q)$ consists of $\lambda I$ with ${\lambda }^n=1$. The multiplicative group of a finite field is cyclic, so this center of a group has size $d=\gcd (n,q-1)$. The projective special linear group over a finite field consequently has order

Here is a proof of simplicity which isolates all the required ingredients. First we prove the Iwasawa simplicity lemma in the form needed. Suppose a group $H$ acts faithfully and primitively, is a perfect group, and has an abelian subgroup $U$ normal in a stabilizer subgroup $H_{\alpha }$, whose conjugates generate $H$. For a nontrivial normal subgroup $N$, its orbits form a block system. Faithfulness prevents all these orbits from being singletons, so primitivity makes $N$ transitive. Thus $H=N{H}_{\alpha }$. Modulo $N$, each conjugate of $U$ has exactly the same image as $U$, because we may write its conjugating element as $nh$ with $n\in N$ and $h\in H_{\alpha }$. The quotient $H/N$ is generated by this one abelian image and hence is abelian. Since $H$ is a perfect group, $H/N=1$. Thus every nontrivial normal subgroup is $H$.

Apply this to the action on projective points, that is, one-dimensional vector subspaces of $F^n$. Any ordered pair of distinct lines can be sent to any other by a linear map obtained by extending representatives to bases. Multiplying one target basis vector by a suitable nonzero scalar adjusts the determinant to one without changing either target line. Thus $S{L}_n(q)$ is two-transitive on these points. A linear map fixing every line is scalar: it is diagonal on a fixed basis, and fixing the lines spanned by $e_i+e_j$ makes all diagonal entries equal. The projective quotient therefore acts faithfully, two-transitively, and primitively.

For the line $⟨e_1⟩$, useThese matrices multiply by addition of $f$, so $U$ is abelian. Conjugating by a matrix preserving $⟨e_1⟩$ preserves $U$, so it is normal in that stabilizer subgroup. Its conjugates include every elementary transvection matrix $I+t{E}_{ij}$.

These elementary transvection matrices generate $S{L}_n(q)$ by row elimination. For completeness, row addition is elementary, signed row interchange is elementary, and compensating diagonal scalings are elementary because, in a two-dimensional coordinate block,Elimination using these operations reduces a determinant-one matrix to the identity.

It remains to show that these groups are perfect groups. In the following matrix identities use $[x,y]=xy{x}^{-1}{y}^{-1}$; the alternative group commutator convention generates the same commutator subgroup. If $n\ge 3$, distinct indices give the group commutator identityEvery elementary generator is therefore a group commutator. For $n=2$ and $q>3$, choose $\lambda \in F^{\times }$ with ${\lambda }^2\ne 1$, and let $D=\mathrm{diag}(\lambda ,{\lambda }^{-1})$. ThenAs $t$ varies this supplies all upper elementary transvection matrices, and conjugation supplies the lower ones. Thus $S{L}_n(q)$, and its projective quotient, are perfect in the asserted cases. The preceding simplicity argument now applies.

The two exceptions are genuine: the projective actions identify $PS{L}_2(2)$ with $S_3$ and $PS{L}_2(3)$ with $A_4$, of orders 6 and 12 respectively. The first contains its normal subgroup of order 3; the second contains the normal Klein four group. We have proved

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

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

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

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

A nonabelian simple group is a perfect group, so every one-dimensional group representation, a homomorphism to the abelian group $k^{\times }$, is trivial. Thus a nontrivial irreducible Brauer character cannot have degree $1$.

Suppose instead that its representation has dimension $2$, working over a splitting extension if necessary. Its determinant is a one-dimensional representation and is therefore trivial. Its kernel is a normal subgroup, and the representation is nontrivial, so simplicity makes it faithful. Consequently $G$ embeds in ${\mathrm{SL}}_2(k)$.

We use the Feit–Thompson theorem: every finite group of odd order is solvable. Therefore this nonabelian simple group has even order, and Cauchy's theorem for finite groups supplies an involution $t$. In odd characteristic, its representing matrix $A$ satisfies $A^2=I$ and is diagonalizable with eigenvalues in $\{1,-1\}$. Since $\det A=1$, it is $I$ or $-I$. Faithfulness excludes $I$, so $t$ acts as the scalar matrix $-I$. It commutes with the whole image; faithfulness then makes $t$ central in $G$, contradicting nonabelian simplicity. Hence $\boxed{\chi (1)>2}$.

The odd order theorem is the deep standard group-theoretic input in this proof; its use is explicit rather than hidden in an unsupported assertion that $G$ has an involution.

Put $Q=G/H$ and write $M^H$ for the invariant submodule. The five-term exact sequence in group cohomology associated with the Lyndon–Hochschild–Serre spectral sequence isThe inflation map in group cohomology composes a cocycle on $Q$ with the quotient homomorphism $G\to Q$. The restriction map in group cohomology restricts a cocycle from $G$ to $H$. The quotient action on the middle term is, for $q=gH$ and a one-cocycle $f$,This is independent of the lift and of the representative at the level of cohomology. Finally, the transgression in group cohomology extends a $Q$-invariant class on $H$ to a one-cochain on $G$; its coboundary is $H$-basic and descends to the two-cocycle on $Q$ representing $d_2[f]$. Changing the extension changes that cocycle by a group coboundary.

For the application, choose free generators $x_1,\dots ,x_n$ of $F$ and normal generators $r_1,\dots ,r_n$ of $R$. Since a finite nonabelian simple group $K$ is a perfect group, its abelianization is zero. The five-term sequence for $1\to R\to F\to K\to 1$ with trivial coefficients containsThe first term is zero because $K$ is finite, and the last term is zero because a free group has cohomological dimension one. It remains to prove that restriction is surjective.

The invariant submodule of homomorphisms $R\to \mathbb{Z}$ is exactlyThe images of the relators $r_1,\dots ,r_n$ generate $R/[F,R]$, so such a homomorphism $\lambda$ is determined by the integer vector $b=(\lambda (r_1),\dots ,\lambda (r_n){)}^T$. Let $A$ be the relator exponent-sum matrix. This square integer matrix presents $K^{\mathrm{ab}}$, which is zero, so $A$ is a unimodular matrix. There is therefore an integer vector $v$ satisfying $Av=b$. Define $\psi :F\to \mathbb{Z}$ by assigning to $x_i$ the $i$th entry of $v$. The definition of $A$ gives $\psi (r_j)=\lambda (r_j)$ for every $j$. Since the relator images generate $R/[F,R]$, the restriction of $\psi$ to $R$ equals $\lambda$. Restriction is surjective, exactness now gives

For a finite group presentation, the relator exponent-sum matrix records in row $i$ the total exponent of each generator in relator $r_i$. It presents the abelianization of the group. For a balanced presentation of a perfect group, it is a unimodular matrix.