Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 21 6 a Solution Created 2026-10-03 Updated 2026-10-14
A useful form of the Ehrenfeucht-Mostowski theorem says that, for an infinite first-order structure and any total order , there is a model of generated as a Skolem hull by distinct order indiscernibles . Every order automorphism of extends uniquely to an automorphism of the specified Skolem expansion of that hull. The model can be obtained inside an elementary extension of a Skolem expansion of ; the generated hull itself need not contain .
Choose a Skolem expansion by iteratively adjoining witness functions: for each existential formula in the current language choose a function returning a witness whenever one exists, with an arbitrary value otherwise. Repeat for countably many rounds. Every formula in the final language uses finitely many symbols, so has a witness function from a later round. Thus the expansion is Skolemized for its own formulas, as required for elementarity of its hull. Add constants for to the complete theory of , require them to be distinct, and impose the schemefor every formula in the Skolem language. If an elementary extension of is desired, also add its elementary diagram with separate names for its elements.
Every finite part of this theory is satisfiable. Choose infinitely many distinct elements of . For each of the finitely many arities in that fragment, color increasing index tuples by the finite vector of truth values of the formulas occurring. Repeated applications of the infinite Ramsey theorem give an infinite subset on which all these vectors are constant. Interpret the finitely many in increasing-index order from that subset. This satisfies the finite indiscernibility requirements and distinctness, while the elementary diagram is satisfied by the named original structure. The compactness theorem gives a structure satisfying the whole theory.
Let be the closure of the under the Skolem functions, including nullary ones. It is elementary in : whenever an existential formula with parameters from is true in , its Skolem witness lies in . This is the Tarski-Vaught test, whose proof is induction on formulas, using precisely this witness property for the existential step. Hence the reduct of is a model of .
For an order automorphism , defineThis is well-defined. If two terms denote the same element, write their equality as a formula on the combined increasing tuple of their indices; indiscernibility preserves that formula after transport by . The same argument preserves every relation and function. Applying gives the inverse, so is an automorphism. Since all elements are terms in the generators, it is the unique automorphism of this Skolem expansion extending . This proves the theorem.
One may require the indiscernibles to lie in any specified infinite sequence of the starting structure, or to satisfy additional finite-tuple properties holding along that sequence: the same finite satisfiability proof chooses its homogeneous subsequence there. This strengthened form is what the rank-domain construction of NFU uses. Uniqueness is asserted in the Skolem expansion, not for all automorphisms of its reduct.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 2 2 a Solution Created 2026-10-03 Updated 2026-10-14
A Frobenius group is a finite transitive group action on more than one point in which a nonidentity element fixes at most one point and a point stabilizer is nontrivial. Equivalently it has a nontrivial proper subgroup with for every . The Frobenius complement is such a point stabilizer .
The Frobenius kernel is the identity together with all fixed-point-free elements in this action, equivalentlyThe Frobenius kernel theorem asserts that this set is a normal subgroup, acts regularly on the points, and gives . In particular for .
Brauer's permutation lemma states that an automorphism of a finite group fixes equally many conjugacy classes and irreducible characters. More generally a group of automorphisms has equal permutation characters on those two sets. Indeed, the character table is invertible and intertwines the two permutation matrices: simultaneous permutation of rows and columns preserves character evaluation. Similar matrices have equal traces, and a permutation-matrix trace counts its fixed points. The fixed objects on the group side are classes, not individual elements.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 4 1 Solution Created 2026-10-03 Updated 2026-10-14
Here is Witt's lemma with the hypotheses appropriate to the classical groups. Let be finite-dimensional with a nonsingular alternating bilinear form, a nonsingular symmetric bilinear form in characteristic different from two, or a nonsingular Hermitian form with nontrivial involution. Every isometry of a space with a form between vector subspaces extends to a form-preserving automorphism of . For quadratic forms, the same statement holds in every characteristic when the polar bilinear form of a quadratic form is nonsingular and the isometry of a space with a form preserves the quadratic form itself. The restricted forms on may be degenerate. We prove these versions, including the characteristic-two quadratic case needed later.
For an alternating bilinear form , split the restricted space as , where and is nonsingular. Choose a symplectic basis for and a basis of . The nondegenerate form on supplies vectors in with . Adding linear combinations of the to the makes : for each pair one may cancel its pairing by adding an appropriate multiple of to , without disturbing the dual pairings or previously treated pairs. This uses no division by two. Thus together with the pairs is nonsingular and its orthogonal complement for a sesquilinear form has a symplectic basis.
Apply the same construction to , choosing partners there. The two completed bases have identical alternating Gram matrices and equal remaining dimensions. The linear map matching these bases preserves and agrees with on . This proves the alternating version over an arbitrary field, including characteristic two.
For a quadratic form , define its polar bilinear form of a quadratic form by . Its symmetrypreserves . The zero-dimensional case is immediate. Induct on : choose and a hyperplane . Extending first reduces to . Put , , . If , completes the extension. Otherwise . The hyperplanes , are proper because .
For with , set . Thenand fixes and sends to . If no such exists and , the identityforces . The complement of two hyperplanes spans : adding a multiple of any outside vector avoids at most two forbidden scalars. Hence , so , forcing , contrary to .
Over , choose outside both hyperplanes. In the remaining case , and . The explicit maphas , preserves by cancellation of its two cross terms, fixes and sends to . This closes the induction. The characteristic-independent symmetry argument and its binary exceptional step are also treated in Casselman's quadratic-form notes and Elman, Karpenko and Merkurjev, section 8.
In odd characteristic a symmetric bilinear form is recovered by the polarization identity for , so the quadratic proof also proves its extension theorem. For completeness, the Hermitian form case has a similarly explicit induction. Take linear in the first variable, with conjugation . For anisotropic vectors for a form with equal value , let and . When , the rank-one mapsends to and preserves , since and the extra coefficient in isWhen , insert with , , and use two such maps. Such a scalar exists for a nontrivial involution: with works. If the source vector subspace contains an anisotropic vector for a form, align it this way and induct in its nonsingular orthogonal complement for a sesquilinear form.
If instead every source vector is isotropic, the Hermitian polarization identity makes its whole restricted form zero. Choose in its basis and a partner pairing to one with and to zero with the remaining source basis. Make by replacing by , where . The trace map is onto the fixed field: in odd characteristic divide by two; in characteristic two scale a nonzero trace. Choose . The orthogonal vectors and have nonzero values and its negative, so the preceding rank-one construction aligns this entire hyperbolic pair with its target pair. The remaining source basis lies in the pair's orthogonal complement for a sesquilinear form; induction finishes the Hermitian proof.
The hypotheses matter. For example, the identity-matrix symmetric bilinear form on has canonical vector characterized by , so every isometry of a space with a form fixes . The one-dimensional map preserves the restricted bilinear form but cannot extend. Thus “all symmetric forms in characteristic two” is not a correct replacement for the quadratic or alternating versions proved above.
Past exam of the mathematics course of the University of Cambridge 2004 ia Paper 3 1D Solution Created 2026-09-24 Updated 2026-10-14
For a subgroup of a finite group , Lagrange's theorem states . Thus a subgroup's order, and in particular the order of a group element, divides .
For , if every element had order one or two, the order of a finite group of exponent two would make a power of two, a contradiction. Hence an element has order five or ten. In the latter case is the cyclic group . Otherwise choose of order five. Its cyclic subgroup has index two and is therefore a normal subgroup.
In the noncyclic case an element outside has order two: its order divides ten, it cannot have order ten, and an element of order five has trivial image in the order-two quotient group . Every element of is then or . Conjugation by restricts to an automorphism of , say . Since , , so or modulo five.
For , the generators commute and has order ten, yielding the cyclic case. For , these are the relations of the dihedral group of the pentagon. The classification of groups of order ten is therefore exactly and , where the subscript on denotes its order. They are not isomorphic because one is Abelian and the other is not.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 1 4 Solution Created 2026-10-03 Updated 2026-10-14
For , the Weyl algebra is generated by with and the other generator commutators zero. Iterating the differential Ore extension construction gives the ordered basis . In the Bernstein filtration, both kinds of generator have degree one, andLeading symbols show that is a noncommutative domain. The Hilbert basis theorem and homogeneous-generator lifting by decreasing degree make it both left and right Noetherian.
It is also a simple ring. In a nonzero two-sided ideal, choose a nonzero element and a monomial of maximal total degree with nonzero coefficient . Applying eliminates every lower-degree term and every different term of that maximal degree. The result is the nonzero scalar . Thus the ideal contains . Here the scalar extraction by iterated Weyl commutators uses characteristic zero. Despite simplicity, has no nonzero finite-dimensional modules: in such a representation would have trace , impossible over . Its interesting module theory is necessarily infinite-dimensional.
For a finitely generated left module , choose a finite-dimensional generating subspace and set . This is a good filtration of a module. Its associated graded module is finite over the graded polynomial ring, so its cumulative Hilbert function is eventually a polynomial,with positive integer multiplicity . These are the Bernstein growth dimension of a Weyl algebra module and its multiplicity of a filtered module. Two good filtrations bound each other after fixed shifts: lift finite homogeneous generators in one filtration, bound their degrees in the other, and use compatibility with ; then reverse the roles. The growth degree and leading coefficient therefore do not depend on the good filtration of a module. The degree is also the Gelfand–Kirillov dimension of a module and the dimension of the characteristic variety of a Weyl algebra module, the support of . Since is a quotient of a finite sum of copies of , .
The essential lower bound is the Bernstein inequality for Weyl algebra modules:Here is a full proof. Multiplication gives a linear map . Prove it injective by induction on . At a scalar killing must vanish. If kills , then for every generator , its commutator kills : both and are zero for . Induction gives for all generators. In the ordered basis, differentiates the exponents and differentiates the exponents with a minus sign. Vanishing of all these commutators in characteristic zero forces to be a scalar. It then vanishes because it kills . This proves the faithful finite-step action of a Weyl algebra and henceComparison of degrees gives , proving the inequality. Equally, without invoking eventual polynomiality, this estimate directly bounds the Gelfand–Kirillov dimension of a module below by . Right modules satisfy the same inequality through the filtration-preserving isomorphism , , .
A nonzero finitely generated module with is a holonomic Weyl algebra module; the zero module is conventionally included. This minimal-growth class is stable under submodules, quotient modules and extensions. For , take the induced and quotient filtrations. Their graded sequence is exact; Noetherianity of makes the induced filtrations good. Thus the Hilbert functions add andif both nonzero terms have the top dimension, their multiplicities add. For a holonomic Weyl algebra module, every nonzero subquotient has dimension , by the upper bound inherited from and Bernstein's lower bound. Each nonzero factor in a strict chain therefore consumes positive integral multiplicity. This proves the multiplicity bounds the length of a holonomic Weyl module:In particular a holonomic module is both Noetherian and Artinian and has finite length, although its vector-space dimension is infinite. This distinction separates finite-dimensional representation theory from finite-length Weyl module theory.
The polynomial module , with acting by multiplication and by differentiation, is generated by . Its consists of polynomials of degree at most , with dimension , so and . It is simple: differentiating a maximal-degree monomial of a nonzero polynomial isolates a nonzero constant, and multiplication by polynomials then generates the whole module. A second basic example is the delta moduleUsing the reverse ordered basis , its vector space is ; acts by multiplication and by negative differentiation. The same argument proves simplicity and holonomicity. These two examples are exchanged by the automorphism , . Free modules, in contrast, have growth dimension and are not holonomic. Thus the central organizing invariants are good filtration of a module, growth dimension, characteristic support and multiplicity, with Bernstein's estimate explaining why dimension is the natural smallest nonzero size.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 1 5 Solution Created 2026-10-03 Updated 2026-10-14
Specify a commutative ground ring and a unital associative -algebra . For an -bimodule , the Hochschild cochain complex hasand coboundaryThe bimodule identities and associativity cancel the terms of in pairs. The Hochschild cohomology is ; the paper's uses the regular bimodule as coefficients.
Over a field, the bar resolution of an associative algebra explains its homological meaning. Put . The degree- bar term is , with the outer factors supplying the action, boundary obtained by multiplying adjacent factors with alternating signs, and augmentation multiplication . Inserting at the left gives a -linear contracting homotopy, proving exactness. The terms are free -modules after choosing a -basis for the inner tensor factors. Applying gives precisely the displayed cochain complex and thereforeThis ground-ring qualification in Hochschild cohomology matters for an arbitrary ring: one can take , but the bar terms need not be projective over . The ordinary cochain complex then computes relative Hochschild cohomology; the absolute Ext identification needs, for example, projective over . Likewise the extension classification below applies to ground-ring-linearly split extensions. For algebras over a field these qualifications are automatic.
In degree zero, , so . In degree one the cocycle equation isexactly the Leibniz rule for a derivation of an algebra. The coboundaries are the inner derivations . Thus the First Hochschild cohomology as outer derivations isIts significance is infinitesimal automorphisms modulo inner ones. Over the dual numbers , the map is multiplicative precisely when satisfies the Leibniz rule. Conjugation by gives , an inner derivation with the opposite sign convention. The quotient therefore measures infinitesimal symmetry not arising from conjugation.
Degree two controls extensions and changes of multiplication. A -linear split square-zero extension of an algebra with prescribed kernel bimodule can be written as . Choose a unital section and let be the difference between its product and its value on . ThenComputing both parenthesizations of a triple gives the associativity conditionnamely . A unital product has , so one uses the normalized Hochschild cochain complex. Changing section by gives . Conversely the displayed product for any normalized two-cocycle constructs such an extension, and a section change gives the corresponding extension isomorphism. This proves that second Hochschild cohomology classifies split square-zero extensions:The zero class is the split algebra extension with no extra product term. With , this gives one meaning of the requested .
For a first-order associative deformation, retain the underlying -module and put . Expanding modulo gives exactly . A coordinate change transports the product to , whose first-order coefficient is . HenceThis classification is of infinitesimal deformations, not a guarantee that all classes extend to every order. For modulo , the next associativity equation isSubstitution of shows the right-hand side is a three-cocycle. Its class in is the second-order obstruction to an associative deformation. It must vanish for a second-order extension to exist. At higher orders the same expansion gives further obstruction cocycles. If , every first nonzero coefficient of a formal associative deformation is a coboundary and can be removed by a coordinate change. Repeating this order by order gives formal rigidity from vanishing second Hochschild cohomology, with the transformations converging in the -adic topology. Vanishing of instead removes these extension obstructions; these are distinct roles.
Examples make the two low degrees concrete. For over a field, inner derivations vanish and every derivation is , determined by its value on . The bimodule resolutionis exact: the middle tensor ring is the polynomial integral domain , multiplication identifies its quotient by , and multiplication by is injective. Applying bimodule Hom gives zero differential. Consequently the Hochschild cohomology of a polynomial algebra in one variable isThis algebra has many infinitesimal automorphisms, while its ordinary associative multiplication is formally rigid.
For in characteristic zero, the bilinear map is a two-cocycle: substitution in and the two product rules cancel its four terms. It is not a coboundary, because every on a commutative algebra is symmetric in its two inputs, whereas . This class integrates to the Weyl deformation of a polynomial algebra in two variables, with . The differential Ore extension construction supplies the ordered basis over , so the -adic completion has the fixed underlying module . Its first multiplication correction is exactly this . This displays a genuinely noncommutative formal associative deformation detected by .
Finally, the Hochschild cup product descends to the graded cohomology algebra, and the Gerstenhaber bracket organizes the interaction of derivations and formal associative deformation cocycles. The calculations above explain why the first two positive degrees are especially useful: measures outer infinitesimal symmetries, while measures split extensions and infinitesimal associative structures, with degree three detecting the first obstruction to continuing them.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 2 1 a Solution Created 2026-10-03 Updated 2026-10-14
The Frattini subgroup is the intersection of the maximal subgroups of , with . A useful equivalent property isIndeed, a proper subgroup lies in a maximal subgroup, which also contains . The Frattini subgroup is a characteristic subgroup, since automorphisms permute the maximal subgroups.
The Fitting subgroup is the largest nilpotent normal subgroup. To prove its existence, first form the p-core : the product of all normal p-subgroups. For two such subgroups, their product is normal and has order , a power of . There are only finitely many subgroups, so exists. For distinct primes ,Thus the product of the p-cores is a nilpotent normal subgroup, a direct product of groups of its Sylow subgroups. Conversely, a finite nilpotent normal subgroup has unique Sylow subgroups, each a characteristic subgroup of . Each is normal in and lies in the corresponding p-core. Consequently the required largest subgroup exists, and
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 2 3 a Solution Created 2026-10-03 Updated 2026-10-14
Since the two-transitive group action is primitive, the orbits of any nontrivial normal subgroup form only the single block . Thus is transitive. If is regular, identify with by . Then , , and conjugation by gives automorphisms of . The two-transitive group action makes these automorphisms transitive on . All nonidentity elements therefore have the same order, which must be a prime : a suitable power of an element of composite order would have a smaller nontrivial order. Cauchy's theorem for finite groups now shows .
The center of a group of prime-power order is nontrivial and is a characteristic subgroup. The transitive conjugation action on nonidentity elements therefore forces . Hence is an elementary abelian group, which we identify with the additive vector space . Conjugation by is linear on this vector space. It is faithful: an element fixing and centralizing fixes every , hence is the identity permutation. ConsequentlyHere the general affine group acts by translations followed by invertible linear maps.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 2 5 a Solution Created 2026-10-03 Updated 2026-10-14
For , make a module over the polynomial ring by . The structure theorem for finitely generated modules over a principal ideal domain and primary decomposition giveHere ranges over monic polynomials that are irreducible polynomials, and is excluded because is invertible. Associate the integer partition having parts equal to . It has finite support and satisfies . Two matrices are conjugate exactly when their R-modules are isomorphic, so this gives a bijective parameterization of conjugacy classes.
The centralizer is the R-module automorphism group. Homomorphisms between distinct primary components vanish: coprimeness of their annihilating polynomials makes each such map zero. Fix one of degree , put , and write . A map is determined by an image killed by , so its space has dimension over . Consequently the endomorphism algebra haswhere is the conjugate partition.
Its semisimple quotient is : reduce the maps between the equal-length summands modulo and discard the maps between unequal lengths. Composition through a different length acquires a factor of when it returns to the original length, so these reductions define an algebra homomorphism. It is onto, and its kernel is nilpotent. One can see the latter directly by expanding a sufficiently long product into paths through the finitely many possible summand lengths: repeated returns through unequal lengths or equal-length kernel factors accumulate powers of , while a strictly monotone path has bounded length. Eventually every path vanishes in every summand.
An element is invertible exactly when its image in that quotient is invertible, since a nilpotent error is inverted by a finite geometric series. The fraction of units is therefore . Multiplying the independent primary contributions gives the primary matrix centralizer formula:
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 1 2 Solution Created 2026-10-03 Updated 2026-10-14
First prove Simplicity of alternating groups. The -cycles generate : express an even permutation as an even number of transpositions and pair them. A pair sharing a point is a -cycle, an identical pair cancels, and a disjoint pair can be written . All -cycles are conjugate in when : a conjugator in can have its parity corrected by a transposition on two points outside the target triple, without changing its effect on that triple.
Let and choose . Some -cycle does not commute with . Indeed, commuting with every -cycle would preserve every triple setwise; intersecting all triples containing a given point forces that point to be fixed, so would make . The nonidentity group commutator is supported on at most six points. Its possible nontrivial even cycle types are a -cycle, a double transposition, a -cycle, two disjoint -cycles, or a -cycle times a transposition. Each yields a -cycle in by explicit group commutators:
For , use with a fifth point ; conjugation reverses , so the group commutator is . For , use : the group commutator is . The same calculation works for . For , use ; its conjugate is , and the product is a -cycle, reducing to the preceding case. Thus contains a -cycle, hence the whole conjugacy class of -cycles, and hence all of . ThereforeFor the exceptional automorphism, a duad is an unordered pair of six points, a syntheme is a partition into three duads, and a pentad is a set of five synthemes covering every duad once. There are fifteen synthemes. To count pentads, fix , where bars separate duads. A syntheme disjoint from it in duads is one of eight; the union of the two matchings is a six-cycle, so the stabilizer of the fixed syntheme is transitive on these eight choices. For the choice , the remaining compatible synthemes are , , and . The last shares a duad with each of the first three and cannot belong to a completion; the first three form the unique completion. Thus each of the eight choices has a unique completion through the fixed syntheme. Each completion contains four of them, so exactly two pentads contain a fixed syntheme, and there are pentads in total.
Here is the complete list, which also defines concrete labels for the induced action:Relabelling points gives a group homomorphism on these pentads. Direct substitution in the table givesThe restriction to is nontrivial, hence faithful by the simplicity just proved. Therefore the full kernel has order at most two. An order-two normal subgroup would be central, whereas has trivial centre: an element centralizing every transposition fixes every unordered pair and consequently every point. The kernel is trivial, and equal orders make an automorphism. It preserves , because that is the unique index-two subgroup of : any nontrivial group homomorphism to sends every conjugate transposition to the nonidentity element, and is therefore the sign map. Its restriction is the pentad construction of the exceptional alternating-group automorphism. It maps a -cycle to two disjoint -cycles, while conjugation in preserves cycle type. Hence this automorphism of is not induced by any element of .
For the other degrees, recover the points from -cycles. An element of order three has type . Its centralizer in has order . That centralizer contains an odd permutation: either swap two fixed points, or, when , swap two three-cycles by three transpositions. ThusFor , only is possible. For , the value is strictly largest. For equality first occurs at , and the ratio increases strictly with . For , already at one has : it holds at , and the inductive ratio is . Increasing again increases the ratio. Consequently every automorphism preserves the set of -cycles when .
Each cyclic subgroup generated by a -cycle corresponds to its three-point support. Two distinct such subgroups commute exactly when the supports are disjoint. If they meet in one point, products of their nonidentity generators have order five. If they meet in two points, those products have order two or three. These intrinsic tests recover adjacency in the Johnson graph , so the automorphism acts on its vertices.
We can reconstruct the underlying points without an additional group-theoretic bound. The maximal cliques of a Johnson graph in are the triples containing a fixed pair, and the four triples contained in a fixed four-set. To verify the classification, take adjacent triples and with . Any common adjacent triple either contains or lies in . A triple of the first kind outside that four-set is not adjacent to a triple of the second kind omitting a point of , so a clique cannot mix the two alternatives. Extending a clique therefore gives exactly one of the two listed families.
For , , their sizes distinguish the pair-containing cliques. Their intersections reconstruct the pair graph : two such cliques intersect precisely when their defining pairs meet in one point. In this graph the maximal cliques are stars of pairs through a point and triangles of three pairs within a triple. These sizes are different for , so its automorphisms permute the stars and hence the points. Every pair is the intersection of its two point stars, and every triple is determined by its three pairs. Thus the original graph action comes from some .
Undo conjugation by . The remaining group automorphism fixes each cyclic -subgroup, so it fixes or inverts each generator. For adjacent supports, inverting exactly one generator changes the order of their product between two and three; inverting both preserves that order. Hence the two inversion choices must agree. The triple-support graph is connected, since one can replace differing points one at a time, so the choice is uniform. Inverting every -cycle is impossible: take , , whose product is the -cycle . Then , whereas the group homomorphism property would give ; these are unequal because do not commute. Therefore fixes every -cycle and is the identity. Conversely, conjugation by acts faithfully on , since centralizing all -cycles fixes every triple and every point. The automorphisms of alternating groups from triple supports are exactly
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