Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 7 3 iv Solution Created 2026-10-03 Updated 2026-10-14
Use the group commutator convention . If , choose distinct . Multiplying elementary matrices, using 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 , proving it is a perfect group.
It remains to handle and . The polynomial has at most two roots, whereas has more than two elements, so choose with . For , direct conjugation givesBoth coefficients are nonzero. As varies, these group commutators give every upper and lower elementary transvection, which generate . 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: has a nontrivial sign quotient. Also maps onto , which has the nontrivial abelian quotient . For the latter identification, the faithful projective action has degree four and image of order 12, hence the index-two subgroup of . Neither exceptional group is perfect.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 2 1 Solution Created 2026-10-03 Updated 2026-10-14
A composition series is a subnormal chain whose nontrivial successive quotients are simple. The Jordan–Hölder theorem asserts that any two composition series of a finite group have the same length and the same multiset of simple factors, up to isomorphism. Existence follows by successively choosing maximal proper normal subgroups until the identity is reached.
For uniqueness, induct on the group order. Let be the penultimate terms of two series. If , apply induction to that subgroup and add the common top factor. If , their normality and maximality give . Put . The isomorphism theorems giveBoth are simple. Take any composition series of . Appending to it gives a series for , so induction identifies the factors of the original series inside with the factors of together with . Similarly the factors inside are those of together with . Adding the respective top factors produces the same multiset in both cases. This proves uniqueness, including multiplicities and length.
A normal subgroup of order two is central because its automorphism group is trivial. By Jordan–Hölder, a composition series through leaves the simple quotient . The image of in this quotient is central and hence trivial, since is nonabelian simple. ThusThe symmetric group has trivial group center: conjugation of each transposition by a central permutation must preserve its two-element support, forcing the permutation to fix every point. Since its Jordan–Hölder factors are and , a normal subgroup of order two would equal that trivial group center, a contradiction.
Identify and put in . Its three maximal normal subgroups areThey are the three kernels of nonzero maps from the abelianization to . There is no quotient : a central must map trivially, while has no quotient . The latter follows from its normal subgroups , which can themselves be obtained by intersecting with the simple subgroup and using its trivial centralizer. The complete list of composition series isWithin the two direct factors are the only maximal normal subgroups; within each of the only such subgroup is its copy of . Hence there are exactly four series.
For , put , , andAgain these are exactly the maximal normal subgroups: they are the three cyclic quotient kernels, and there is no simple quotient of the whole product. All series aretogether withTo verify exhaustiveness, has maximal normal subgroups and , and has and . A quotient of a direct product can receive a nontrivial image from only one simple factor, since the images commute and has trivial group center. The remaining maximal-normal possibility is . Its derived subgroup is , because both alternating factors are perfect. A hypothetical quotient would project one alternating factor isomorphically and kill the other, but conjugation by an odd diagonal element induces an outer automorphism on that surviving factor, impossible inside . Odd conjugation is outer because otherwise an odd permutation times an even one would centralize ; a permutation commuting with every three-cycle fixes every three-element support and is the identity. Thus is the only maximal normal subgroup of . Finally the only maximal normal subgroups of are : normal subgroups of a product of two centerless simple groups are products of the factors, as follows by commutating with each factor. This proves exactly eight series and the classification of composition chains in products with S5.
For , commuting with both elementary upper and lower transvections forces a central matrix to be scalar. A scalar has determinant , soIf , characteristic five makes diagonalizable with eigenvalues in . Determinant one rules out one of each, so the unique nonidentity involution is . An index-two subgroup would have order and, by the Cauchy theorem for groups, contain that involution and hence the group center. Its image in would have index two. The simplicity and identification are established by the independent matrix argument in Solution 4; a simple group has no proper index-two subgroup. Therefore has no subgroup of index two.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 2 4 Solution Created 2026-10-03 Updated 2026-10-14
The special linear group over a finite field consists of the determinant-one invertible matrices over . Counting an ordered basis givesThe determinant map is onto , soA transvection has the form , where , the linear functional is nonzero and . It has determinant one, fixes the hyperplane pointwise, and its displacement has image the line . In particular for is an elementary transvection when .
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 . This generation statement actually holds for every 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 with , so its order is . 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 , 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 , choose a third index to obtainIf , choose with and set . 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 is . Its faithful projective-line action has degree five, so its image is an index-two subgroup of , necessarily . Thus .
For the order is . We construct a faithful degree-five action. In takeThey satisfy and . Their quaternion subgroup projects to a Sylow 2-subgroup . Its projective centralizer is : a lift of a centralizing element conjugates each of to itself or its negative. In the matrix basis , 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 . The normalizer quotient embeds in and has order dividing both and , so it has order exactly three. Hence and there are five Sylow 2-subgroups. Their conjugation action is nontrivial and transitive, and simplicity makes it faithful. Its image again has order in , proving
Finally,In characteristic two an involutory matrix has form with . Its Jordan blocks have size at most two. A projective involution in has a unique involutory lift to : 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 . This GL-class remains a single SL-class, since the centralizer contains of every determinant . Thus has one involution class.
In there are two forms, and , so there are two involution classes. More concretely, the first group's single class has elements, counting image line, kernel plane through it and nonzero map between the quotient and image. The rank-one class in dimension four over has elements; the rank-two class has . Isomorphisms preserve conjugacy classes, so
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 2 6 Solution Created 2026-10-03 Updated 2026-10-14
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 , degree , and with irreducible. In almost-simple type AS the group socle is one nonabelian simple group and ; a maximal subgroup not containing specifies the primitive coset action.
In simple-diagonal type SD the group socle is , , and its intersection with a point stabilizer is a full diagonal copy of . The degree is , 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 , so the degree is and the group socle is a corresponding power of .
Types HS and HC have two regular minimal normal subgroups, each isomorphic respectively to or to with . Their socle consists of the left and right regular groups; the degrees are and . Finally TW, twisted-wreath type, has a unique regular nonabelian minimal normal subgroup and a point stabilizer acting through a twisted permutation of its factors. This has degree ; primitivity imposes restrictive conditions, in particular . 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 there are first two elementary families. An intransitive maximal subgroup is the stabilizer of an unordered distinguished subset, with ; replacing the subset by its complement gives the same class. When , this subgroup sits properly inside the stabilizer of the two equal blocks. A transitive imprimitive maximal subgroup is a full block-system stabilizer , with , , in its imprimitive action.
The alternating group 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 ; full diagonal groups have degree and socle ; full product-action wreath groups have degree . 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 -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 . 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 . Even the tempting product-action on points is contained in this affine group: identify each four-point coordinate with . Alternatively, each base transposition repeats four times and coordinate exchange makes six transpositions, both even. Thus none is an additional maximum of . There are eleven conjugacy classes in the displayed list.
In degree sixty the complete list isThe notation denotes the full diagonal normalizer, not just . It is generated on the set by , an outer automorphism induced by odd conjugation in , and . Its order isIts two alternating factors form the group socle. The point stabilizer intersects them in the diagonal , of index sixty. Odd conjugation by a transposition of fixes its six commuting elements in , hence makes 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 .
The almost-simple maximum has order and its usual two-transitive projective-line action. Multiplication by a primitive element of makes one 58-cycle and fixes zero and infinity, so it too contains odd permutations. The simple subgroup 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 . The almost-simple primitive possibilities, besides the natural alternating/symmetric groups, have socle . Their full normalizer is the displayed . These degree-specific classification facts supply the exhaustive primitive part of the list. Altogether there are forty-two conjugacy classes of maximal subgroups of : twenty-nine intransitive, ten imprimitive, the alternating group, and two further primitive classes.
Perfectness of the special linear group 2026-10-14
For dimension at least three, for distinct , with . In dimension two over a field with more than three elements, choose with and commute an elementary matrix with . In both cases all generating transvections lie in the commutator subgroup, so the special linear group over a finite field is perfect outside and .
// Target: algebra.bigb
A linear transformation fixing every one-dimensional subspace is scalar. Fixing the coordinate lines makes it diagonal, and fixing the lines spanned by makes all diagonal entries equal. Within determinant-one matrices the scalar satisfies . Conversely scalars fix all projective points. Commutation with all elementary transvections shows these scalars are exactly the center of the special linear group, so its projective quotient acts faithfully.
Stable elementary subgroup 2026-10-14
The subgroup generated by elementary transvections in finite matrix sizes, with identity stabilization. A third distinct index expresses each transvection as a commutator; stable block identities show that this subgroup is normal and that its quotient in the stable general linear group is abelian. Thus it is precisely the commutator subgroup.
Transvection conjugacy over a finite field 2026-10-14
Every nonidentity transvection has an adapted basis in which it is . Thus all such maps are conjugate in the general linear group. In dimension at least three, a scaling of a third basis vector centralizes this matrix and has arbitrary nonzero determinant; adjusting a conjugator by this scaling proves conjugacy in the special linear group as well.
// Target: algebra.bigb