Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 2 4 d Solution Created 2026-10-03 Updated 2026-10-14
Replace by a symplectic vector space of dimension , and elementary row operations by symplectic transvectionsThe cross terms in cancel, and , so these maps preserve . Their inverses are .
They generate by the following symplectic basis elimination. If , a single transvection with direction and parameter sends to . If and , choose with both and nonzero: the union of two proper hyperplanes does not exhaust a vector space, even over . Two transvections then suffice. Thus one can make a form-preserving linear map fix the first basis vector . Next align its partner , while keeping fixed. Two partners have difference in , so the preceding single-transvection construction uses a direction in whenever their mutual pairing is nonzero. If it is zero, the intermediate partner , , has nonzero pairing with both. All these transvections fix . Once both are fixed, recurse on their nondegenerate symplectic orthogonal complement. This proves generation over every field.
Use the action on the points of projective space, whose kernel is the scalar center . For this is the case. For the action is primitive, although it is generally not two-transitive. The stabilizer of a line has two orbits on other lines: those orthogonal to and those not orthogonal to . This follows by extending a hyperbolic pair, or an independent isotropic pair, to a symplectic basis. A block containing and a second line contains the entire corresponding orbit of the stabilizer of . The stabilizer of then supplies a line of the other type: choose a vector orthogonal to one of and not to the other. Nondegeneracy and independence guarantee such a vector, also in dimension four. Hence the block contains both orbits and is the whole set.
The transvections along form an abelian normal subgroup of its stabilizer; their conjugates generate the group. Thus the Iwasawa simplicity lemma applies as soon as perfectness is established. For , every transvection lies in an embedded acting on a hyperbolic plane, and 4(c) proves that embedded group perfect.
For the remaining fields, the perfectness of finite symplectic groups has a short direct proof. Over with , all parameter-one transvections have the same class in the abelianization, and . In an isotropic plane with basis , the four directions give commuting transvections whose product is : their rank-one terms add to zero, sinceover . Thus , giving . Parameter-two transvections are inverses, so all generators vanish in the abelianization. Over with , use the seven nonzero vectors of an isotropic three-space. Their commuting transvections multiply to , since each diagonal coordinate of occurs four times and each off-diagonal coordinate twice. Their common abelianized class satisfies , and again the group is perfect.
Consequently the projective symplectic group is simple, with the necessary exceptionsThe first two are the linear exceptions; the last is , proved in 6(c). The word “projective” matters: the unquotiented symplectic group may have the nontrivial scalar center .
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 1 3 Solution Created 2026-10-03 Updated 2026-10-14
Choose a minimal nontrivial normal subgroup of itself. Every conjugate for is also a minimal normal subgroup of , since is normal in . Distinct such subgroups intersect trivially: their intersection is normal in and minimality forces either equality or trivial intersection. Moreover , so distinct ones commute.
Choose a maximal family of these conjugates whose product is direct. For any further conjugate , its intersection with is normal in and is either all of 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 . The product of all conjugates is consequently , which is nontrivial and normal in . Minimality of as a -normal subgroup gives .
Any normal subgroup of a factor is normal in : the other direct factors commute with it, and normalizes it. Minimality of as a -normal subgroup makes it simple. All factors are isomorphic because they are conjugate to . 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 be a maximal proper subgroup of a nonabelian simple group . It is nontrivial, since has nontrivial proper cyclic subgroups. Choose a minimal normal subgroup of . Then . This normalizer cannot be , since that would make normal in . Maximality givesFor each of the two groups in this question, the allowed absence of proper nonabelian simple subgroups makes the factors of such a cyclic of prime order. Hence it suffices to examine normalizers of nontrivial elementary abelian subgroups.
In , 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 the centralizer in isthe Klein four-group fixing point five. Thus an elementary abelian -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 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 , of order six. An order-five subgroup acts regularly on all five points. Label the points by , with the subgroup acting by translations. Its normalizer in is the twenty affine maps . The translations are even, whereas multiplication by a generator of is a four-cycle and is odd. Exactly half these maps are even, so the normalizer in 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 . But an index-two subgroup of 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 , choosing independent columns gives . If is an involution, write . Field characteristic two gives , and in dimension three forces its nonzero rank to be one. Thus , with nonzero vector , nonzero linear functional and . This transvection fixes the plane and has image line . Every flag consisting of an incident line and plane occurs, giving involutions, all conjugate. Its centralizer, and hence the normalizer of its cyclic subgroup, is the flag stabilizer of order . It lies in both the line and plane stabilizers of order , so cannot be maximal.
For the elementary abelian subgroups in GL3 over F2, consider commuting transvections , . Their rank-one parts satisfyIf are independent, equality forces both sides zero; thus vanish on and are the same nonzero functional. If , 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 : if its image were different, its functional would have to equal each of the two independent functionals occurring in . Dually, the same holds for . Thus these exhaust the elementary abelian -subgroups of rank at least two. The normalizer of is the line stabilizer and the normalizer of is the plane stabilizer, each of order . 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 : it has a fixed line and an invariant complementary irreducible plane. Its normalizer preserves both and is the full on that plane, of order six, since the order-three subgroup is normal in . This normalizer lies in the corresponding line and plane stabilizers, so is not maximal.
An order-seven element is irreducible. Over the finite field one has , and both cubic factors are irreducible because neither has a root in . Its minimal polynomial divides this square-free product and cannot be just , 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 and the element with multiplication by a generator of . Its centralizer consists of the seven nonzero multiplication maps. A normalizer induces an -automorphism of this field, so it sends to , or . All three possibilities occur via the field automorphisms . Therefore the normalizer of the Singer cycle has order , 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 does not divide . Thus
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 7 3 iii Solution Created 2026-10-03 Updated 2026-10-14
Write for . For these are transvections, and for they are the identity. Left multiplication by adds times row to row . We show that these elementary transvection matrices generate the special linear group.
Apply Gaussian elimination using only row additions. If a pivot is zero, invertibility ensures some lower entry in its column is nonzero; adding that row produces a nonzero pivot without interchanging or scaling rows. Clear entries below each pivot, and then above pivots in reverse order. This reduces any invertible matrix to a diagonal matrix , with all , preserving determinant throughout. For a determinant-one matrix, .
A two-coordinate diagonal block is itself a product of elementary transvection matrices. On those two coordinates putThis formula is valid in characteristic two as well. For , multiply the diagonal blocks with entries on coordinates for . Their product is , because its last entry is . Thus and the original matrix lie in the subgroup generated by transvections. Conversely every transvection has determinant one by part ii. HenceFor , both the special linear group and the subgroup generated by the degenerate identity transvection are trivial. The argument also establishes transvections generate the special linear group over any field.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 7 3 ii Solution Created 2026-10-03 Updated 2026-10-14
For a nonidentity transvection , take and choose with . Complete to a basis of using . Then is a basis of , and the matrix of the transvection is : it sends to and fixes the other basis vectors. Consequently all nonidentity transvections form one conjugacy class in . This matrix has determinant one, and conjugation preserves determinant, soFor , let be any GL-conjugator carrying one transvection to another. In an adapted basis for the first, the matrix centralizes it and has determinant . Set . Then gives the same conjugation as . This proves the stronger transvection conjugacy over a finite field resultThe extra coordinate is essential to this determinant adjustment; no such claim is required in dimension two.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 7 3 i Solution Created 2026-10-03 Updated 2026-10-14
A nonidentity transvection is a linear automorphism with and . Equivalently, it fixes a hyperplane pointwise and its displacement has image in a line lying in that hyperplane. The notation allows the identity as a degenerate transvection; use that convention here, with also allowed.
For a nonidentity transvection, choose spanning the image of . There is a unique nonzero linear functional such that . Since , we have , so . Conversely, this condition makes and gives inverse . The identity is represented by and any . ThusWhen , the two displacement maps have zero product, givingFor clarity use left actions of linear maps. Applying , then , then givesWith the alternative conjugation notation , the answer is . In either convention the transformed direction lies in the kernel of the transformed functional.