Chief factor Created 2026-10-14 Updated 2026-11-05
A chief factor of is a quotient with normal in and no -normal subgroup strictly between them. Equivalently, is a minimal normal subgroup of . Such factors are the successive factors of a chief series, and are direct products of isomorphic simple groups when is finite.
Chief series Created 2026-10-14 Updated 2026-11-05
A chief series is a strict normal series of a group with no proper normal-series refinement. Its factors are minimal normal subgroups of the appropriate quotient groups. A chief factor of a finite soluble group is elementary abelian, whereas a composition factor of a finite soluble group is cyclic of prime order. A chief factor can therefore have order larger than a prime.
Fitting subgroup centralizes the socle 2026-10-14
For a finite group, centralizes its group socle. A nonabelian minimal normal subgroup meets trivially: otherwise it is nilpotent, and its nontrivial characteristic center makes it abelian. Their group commutators therefore vanish. An abelian minimal normal subgroup is an elementary abelian p-group; and by the fixed-point counting of a finite p-group on . Minimal normality makes , and other p-cores commute with .
In a finite soluble group, . Put and . If , choose an elementary abelian minimal normal subgroup of inside , and let be its preimage. Then , so is a nilpotent normal subgroup, contradicting .
Hall subgroup existence in soluble groups Created 2026-10-07 Updated 2026-11-05
Every finite soluble group has a Hall subgroup for each prime set. Induct on the group order using an elementary abelian minimal normal subgroup. In the coprime hard case, lift a minimal normal subgroup of the quotient, choose its Sylow subgroup, and apply the Frattini argument. A proper normalizer reduces the order; a normal Sylow subgroup allows induction in its quotient. This proves existence without assuming an independent complement theorem.
Maximal subgroups of A5 Created 2026-10-14 Updated 2026-11-05
Every maximal proper subgroup normalizes one of its minimal normal subgroups. As has no proper nonabelian simple subgroup, that subgroup is elementary abelian. Its possible types are . Their normalizers have orders respectively. The order-four normalizer lies in an order-twelve point stabilizer; the other three types are maximal and each forms a single conjugacy class. There are five, six and ten maximal subgroups of orders twelve, ten and six, respectively.
A minimal normal subgroup of a finite faithful two-transitive group action is either regular elementary abelian or primitive nonabelian simple. The imprimitive case reduces to two-point stabilizers being trivial, then counting derangements gives a characteristic regular Sylow subgroup. In the primitive nonregular case, each simple direct factor is transitive. Two commuting transitive factors are regular and are mutual full centralizers. Thus at most two factors occur and . But the common subdegree of then divides both and , forcing , a contradiction. Only one factor remains.
A nontrivial minimal normal subgroup of a finite solvable group is abelian: its commutator subgroup is characteristic, and minimality plus solvability excludes . A nontrivial Sylow subgroup of this abelian group is characteristic, so minimality makes a p-group. The characteristic subgroup of pth powers is proper, hence trivial by minimality. Therefore is an elementary abelian group.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 3 2 Solution Created 2026-10-03 Updated 2026-10-14
A soluble group is one whose derived series terminates: , , and for some finite . Each factor of this series is abelian. Conversely, if a subnormal series has abelian factors, repeated commutation moves down the series, so the derived series terminates. This explains the usual alternative definition in terms of abelian factors. The least is the derived length.
Subgroups are soluble because ; quotients are soluble because a group homomorphism maps a derived subgroup onto the derived subgroup of its image. Solubility is also closed under extensions: if has derived length at most and has length at most , then and . Abelian and nilpotent groups are soluble; has derived subgroup and derived length two. In a finite group, solubility is equivalent to every composition factor being cyclic of prime order: simple soluble groups are abelian and therefore cyclic of prime order, while a composition series with these factors builds a soluble group by extensions. This need not give an ambient-normal series with cyclic prime-order factors, which is the stronger property of supersolubility.
A Hall subgroup for a prime set is a subgroup whose order uses only primes in and whose index uses only primes outside . Its order is the full -part of . Sylow's theorem is the singleton-prime case; solubility allows all prime sets, although Hall subgroups need not be normal, as the order-two subgroups of show.
Prove Hall subgroup existence in soluble groups by induction on . The trivial group is immediate. Choose a nontrivial minimal normal subgroup . It is elementary abelian of some prime characteristic : is characteristic in and normal in , so minimality and solubility force . A nontrivial Sylow subgroup of this finite abelian group is characteristic, making a p-group. The subgroup of pth powers is characteristic and proper, so minimality makes it trivial. This proves minimal normal subgroups of finite solvable groups are elementary abelian.
By induction has a Hall -subgroup . Let be its inverse image. Then is a -number. If , the whole is a -group and is the desired Hall subgroup. If , has order prime to . We now prove the required complement existence explicitly, rather than invoking a splitting theorem as a substitute.
Write additively as an -vector space. Choose representatives for with . Conjugation gives a well-defined action of on , because changing a representative by an element of the abelian group does not change that action. Define by . Associativity yieldsSince is invertible in , set . Sum the identity over and use the bijection to obtainChanging representatives to removes the multiplication error:Thus is a homomorphic section. Its image has order , intersects trivially, and complements in . This is coprime splitting over an elementary abelian normal subgroup. Finally is a -number and is a -number, soOnly existence was needed here; the fuller Hall theorem also gives conjugacy and containment of arbitrary -subgroups. Solubility makes the elementary-abelian minimal-normal induction possible and cannot simply be omitted.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 1 2 Solution Created 2026-10-03 Updated 2026-10-14
A subnormal series is a finite chain , in which each term is normal in the preceding term. Its factors are the quotient groups . A normal series of a group imposes the stronger condition that every term be normal in . These conditions should not be conflated: inserting a subgroup normal in an intermediate term need not preserve normality in the whole group. A refinement inserts additional terms, and two series are equivalent when their nontrivial factors can be paired by group isomorphisms.
The basic refinement mechanism is the Zassenhaus butterfly lemma. For and , let and . Both factors of are normal in , so . The map from onto has kernel : if an element of equals with and , then . Conversely each product in is in the kernel. The first isomorphism theorem therefore givesThe denominators are normal in their numerators: conjugation by preserves them, while conjugation by or changes their elements only by a factor already in that normal subgroup.
Given two subnormal series and , refine the first by , and the second by . The endpoints are and respectively, and the Zassenhaus butterfly lemma pairs the successive factors indexed by and . This proves the Schreier refinement theorem.
A composition series is a strict subnormal series all of whose factors are simple groups. Every finite group has one: choose a maximal proper normal subgroup, repeat inside it, and use decreasing orders to terminate. A simple factor cannot admit a nontrivial refinement. Applying the preceding refinement theorem to two composition series proves the Jordan–Hölder theorem: their lengths and multisets of simple factors agree, up to group isomorphism. The factors are the Jordan–Hölder factors, and their number is the composition length. If , lifting a composition series of and adjoining one for gives
These factors do not determine the whole group, because they do not determine how its group extensions are assembled. For example, and the Klein four-group both have two factors , but one contains an element of order four and the other does not. The symmetric group has a composition series , with factors , whereas the simple group has the single factor .
A chief series is a maximal strict normal series of a group; each chief factor is a minimal nontrivial normal subgroup in the appropriate quotient of . Finite chief factors are characteristically simple. To justify their structure, let be any nontrivial finite characteristically simple group and choose a minimal nontrivial normal subgroup of . Its distinct images under automorphisms of are minimal normal subgroups, so distinct ones intersect trivially and commute. Choose a maximal family giving an internal direct product of groups. If any other image were not contained in that product, its intersection with the product would be trivial by minimality, and it could be added, a contradiction. Hence this product is characteristic and equals . Each factor is simple: a proper nontrivial normal subgroup of would be normal in the whole direct product , contrary to the choice of . Thus is a direct product of groups of isomorphic finite simple groups. This applies to chief factors by conjugation from .
Chief and composition factors need not coincide. In , the chain is a chief series, since conjugation cycles the three order-two subgroups of . A composition series instead inserts any one of those subgroups, giving factors . Its inserted order-two subgroup is normal in but not in . Chief series retain the ambient group's conjugation information that composition series discard.
The derived series gives a canonical criterion for a group to be soluble: put and . Its terms are characteristic, and each factor is Abelian. A finite group is soluble exactly when this series reaches the identity, equivalently when all its composition factors are cyclic of prime order. For one direction, the derived series supplies Abelian factors, whose simple refinements are cyclic of prime order. Conversely an extension of two soluble groups is soluble: if , then ; if , then . Induction up a composition series with cyclic prime factors proves the other direction. In a finite soluble group, each minimal normal subgroup is elementary Abelian: its characteristic commutator subgroup must be trivial, its primary components force a single prime, and its characteristic subgroup of th powers must be trivial. Thus every chief factor is a vector space over some . In a general finite group the Jordan–Hölder factors can instead be nonabelian simple groups.
The central series demand more than Abelian factors: each factor must be central in the corresponding quotient of the whole group. Define the upper central series by and , and the lower central series by and . A group is nilpotent exactly when the upper series reaches , equivalently when the lower series reaches the identity. Indeed, for any ascending central series , induction gives and ; reversing the lower series gives an ascending central series when it terminates. The least such is the nilpotency class. A central series has Abelian factors, so every nilpotent group is soluble; the converse fails, as is soluble but has trivial group center.
For a finite p-group, the class equation shows that the group center is nontrivial, since every noncentral conjugacy class has size divisible by . Applying the same argument to successive central quotients makes the upper central series reach the group. More generally a finite group is nilpotent exactly when it is the direct product of groups of its Sylow subgroups. Here is the nontrivial direction. A central series gives the normalizer condition for nilpotent groups: for a proper subgroup , choose the first not contained in . Then , so and . If a Sylow subgroup had proper normalizer , then ; but is the unique Sylow subgroup of , hence characteristic there, and , a contradiction. Thus all Sylow subgroups are normal, different ones commute because their intersection is trivial, and they form an internal direct product. Conversely each finite Sylow subgroup is nilpotent, and products of their central series give a central series for their direct product.
Composition series record simple building blocks, chief series record ambient normal structure, derived series detect solubility, and central series detect nilpotence. Their associated factors and extension data explain why the same group can have very different useful series.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 1 3 Solution Created 2026-10-03 Updated 2026-10-14
A Hall subgroup for a set of primes is a subgroup such that every prime divisor of belongs to , while no prime divisor of belongs to . Equivalently , the product of the full prime powers in belonging to .
The Hall conjugacy and embedding in finite soluble groups theorem says that, for every , a finite soluble group has a Hall -subgroup, any two such subgroups are conjugate, and every -subgroup is contained in one. We prove all three assertions together by induction, including the needed complement argument rather than assuming it.
First establish coprime splitting over an elementary abelian normal subgroup. Suppose is an elementary Abelian -group and has order prime to . Write additively. Conjugation defines a well-defined action of on because is Abelian. Choose a section , with , and let its extension cocycle be defined by . Associativity givesSum over . With this becomesMultiplication by is invertible on , so setting gives . The new section has zero cocycle and is a homomorphism. Its image is a complement to , proving .
Every other complement has the form , with . Summing this identity over and putting gives . Hence , where , and the other complement is . The same argument applies on any subgroup : a subgroup intersecting trivially is a graph of such a one-cocycle over its image , so conjugation by an element of carries it into . This proves the complement-conjugacy and embedding assertions needed below.
Now let be finite soluble, and choose a minimal normal subgroup . It is elementary Abelian of some prime characteristic , by the minimal-normal argument in the series discussion. Induction gives Hall subgroups and the embedding and conjugacy assertions in . Let be a Hall -subgroup there and its full preimage.
If , then itself is a Hall -subgroup of . Every Hall -subgroup contains , since is a -subgroup and already has the largest possible -order. Thus is the full preimage of its image in , and quotient conjugacy lifts to conjugacy in . Given any -subgroup , induction puts its quotient image into some , whose preimage contains .
If , then has order prime to . The complement construction produces of order , hence a Hall subgroup of . Any Hall subgroup has trivial intersection with and a Hall image in . Conjugating two Hall subgroups first aligns these images, after which both are complements to in the same ; the complement-conjugacy argument then conjugates them by an element of . For an arbitrary -subgroup , quotient induction puts its image into some . Then and , so the embedding argument conjugates into the chosen complement . Equivalently lies in a conjugate of . This completes the induction and all three parts of the Hall theorem for soluble groups.
For the specific general linear group over a finite field, counting ordered bases givesThere are seven lines and seven planes in . The group is transitive on each family, so line and plane stabilizers both have order and index seven. To show that these exhaust the index-seven subgroups, let have order . It contains a Sylow -subgroup of order eight, which can be conjugated toThe group orbits of on the seven nonzero vectors areof sizes . An -orbit is a union of these. The group cannot be transitive on seven points, since seven does not divide . Therefore it has an orbit of size at most three. A size-one orbit fixes . A size-two orbit must be , whose vector sum is consequently fixed. A size-three orbit must be the union of the first two -orbits, the nonzero part of the plane , so that plane is invariant. In every case lies in a line or plane stabilizer, and equality follows from their equal orders.
The two stabilizer families are not conjugate. A line stabilizer fixes its nonzero vector and is transitive on the other six nonzero vectors: extend that fixed vector and either chosen other vector to a basis, and map one such basis to the other. Thus it has no invariant three-element subset of nonzero vectors and fixes no plane. In contrast a plane stabilizer fixes its defining plane. Conjugation sends line stabilizers to line stabilizers, so cannot send one to a plane stabilizer. We obtainThey are Hall subgroups for but are not conjugate. This explicitly shows why the solubility hypothesis of the Hall theorem for soluble groups matters.
Finally, an index-three subgroup would give a nontrivial transitive coset homomorphism . Its kernel is normal; the permitted simplicity of forces that kernel to be trivial, because the action is nontrivial. But an injective map from a group of order into one of order six is impossible. Hence has no subgroup of index three.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 2 1 c Solution Created 2026-10-03 Updated 2026-10-14
Write , and . Both and are normal in . Suppose . Choose a minimal normal subgroup of contained in . In a finite soluble group, such a minimal normal subgroup is elementary abelian: the last nontrivial term of its derived series is an abelian characteristic subgroup, so minimality makes the whole subgroup abelian; its primary components and subgroup of elements killed by then force one prime and exponent .
It follows that . Moreover centralizes , so . Therefore is a nilpotent group of class at most two. Since is normal in , the definition of the Fitting subgroup gives . But then , a contradiction. This proves the Fitting subgroup is self-centralizing in soluble groups:
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 2 1 d Solution Created 2026-10-03 Updated 2026-10-14
It suffices to centralize each minimal normal subgroup . The subgroup is normal in , so it is either or . In the first caseIn the second case is a nilpotent group. Its nontrivial group center is a characteristic subgroup of , hence normal in , so minimality makes abelian. The primary components, which are characteristic subgroups, and the subgroup killed by a prime show that is elementary abelian of exponent . Thus .
The finite p-group acts by conjugation on . Its orbits have prime-power sizes; hence the number of fixed elements is congruent to modulo . The identity is fixed, so there is a nonidentity fixed element. Therefore . This intersection is normal in , and minimality makes it . The other p-cores commute with , and hence with . Thus every factor of centralizes . Since the group socle is generated by these minimal normal subgroups,
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 2 2 Solution Created 2026-10-03 Updated 2026-10-14
A soluble group is a group whose derived series , terminates at . Equivalently, it has a finite subnormal series with abelian factors. For the reverse implication, if has derived length , then ; if has derived length , then . 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: has the abelian-factor series , but its order-two Sylow subgroups are not normal. The symmetric group is also soluble, with series 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 , so conjugation embeds in . 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 , a Hall subgroup of type has order divisible only by primes in and index divisible only by primes outside . The Hall theorem for soluble groups says that a finite soluble group has such subgroups, any two are conjugate, and every subgroup of -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 is an elementary abelian p-group and has order prime to . A section defines an action on and an additive factor set by . Associativity saysSumming over and dividing by in gives , where . Replacing by removes the factor set, giving a complement. Two complements differ by a map satisfying . Averaging over gives , so the complements are conjugate by an element of . This proves both splitting and conjugacy, without assuming that an arbitrary extension splits.
Induct on , taking an elementary abelian minimal normal subgroup of exponent . Choose a quotient Hall subgroup and let be its preimage. If , then itself is a Hall subgroup. If , the preceding splitting argument gives a complement to in , and that complement is a Hall subgroup of .
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 . If , every Hall subgroup contains : its product with is a -subgroup and cannot be larger by the subgroup-order formula. Both are then . If , both are complements to in , so the averaging argument conjugates them.
Finally let be any -subgroup. By induction its image lies in a quotient Hall subgroup, so . If , is already a Hall subgroup containing . Otherwise write . In , both and the inverse image in of the image of are complements to . Complement conjugacy therefore places in a conjugate of . 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: has no Hall subgroup for . Such a subgroup would have index three; its coset action would give a nontrivial group homomorphism , impossible because is a simple group and has order . This example also distinguishes a Hall subgroup from a merely arbitrary subgroup whose order uses the chosen primes.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 2 3 c Solution Created 2026-10-03 Updated 2026-10-14
A finite minimal normal subgroup is a characteristically simple group, and has the direct-product structure of a finite minimal normal subgroupwith isomorphic simple groups . For completeness, choose a minimal nontrivial normal subgroup of . Its distinct -conjugates are minimal normal subgroups of , so they centralize one another. Their product is normal in , hence equals . If is abelian the product is abelian and minimal primary characteristic subgroups make elementary abelian. Otherwise each has trivial center: its center is a characteristic subgroup of , hence normal in , and minimality would make abelian. Each new conjugate then meets the product of previous conjugates trivially, because it centralizes that product and is centerless. The product is direct. Every normal subgroup of a direct factor is normal in , so minimality of that factor makes it simple.
Assume now that acts primitively and nonregularly. Any nontrivial normal subgroup of this faithful primitive action is transitive. Thus each is transitive. If , the transitive commuting groups and are regular: an element of one fixing commutes with the other and hence fixes its entire orbit. But the centralizer of a regular group has order , as its elements are determined by the image of . Therefore all remaining factors lie in the order-n centralizer of , and the transitive group already fills it. There can be only two factors, with . Now , whereas its common nontrivial subdegree divides both and . Hence , making trivial, a contradiction. Thus , and is simple. An abelian transitive group is regular, so is nonabelian.
Finally is normal in the primitive group . If nontrivial it would be transitive, and commuting with transitive would force regular. Thus , and conjugation embeds in . The centerless simple group is identified with its inner automorphism group. Therefore
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 2005 iii Paper 1 5 Solution Created 2026-10-03 Updated 2026-10-14
A subnormal series of a finite group is a chain . A normal series of a group requires every 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 be the penultimate terms of two series for ; they are maximal proper normal subgroups. If , apply induction there. Otherwise , since its image is a nontrivial normal subgroup in each simple quotient. Put . The maps to the quotients giveFor example, has kernel and is onto because . Take a composition series of and append , obtaining a composition series of because is simple; do the same with . Induction inside these smaller groups shows that the factors in the two original series are, in both cases, the factors of together with and . This proves the theorem and justifies the phrase Jordan–Hölder factors independently of a chosen series.
The derived series is , . 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 has derived length and has derived length , then , so . Applying this principle along an abelian-factor series proves solubility.
Subgroups and quotients of a soluble group are soluble: 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 , . A group is nilpotent if for some . An ascending central series satisfies . Reversing a terminating lower central series gives such a central series. Conversely, induction gives , so any such central series forces . The upper central series , contains every ascending central series term by term, and thus reaches exactly in the nilpotent case. Because , induction gives : 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 , choose its first term not contained in , with . An element of has all group commutators with in , so normalizes . Hence .
For a Sylow subgroup , its normalizer is self-normalizing. Indeed, if normalizes , the two Sylow subgroups of that normalizer are conjugate there; adjusting by an element of puts it in already. Applying the strict normalizer condition to shows that it cannot be proper, so is normal. Normal Sylow subgroups of distinct primes commute, since their group commutators lie in their trivial intersection. Their product has cardinality and is direct.
Conversely, a nontrivial finite -group has nontrivial centre: in the class equation every noncentral conjugacy class has size divisible by , so divides the centre's order. Induct on its order through the quotient by its centre to obtain an upper central series. Thus every finite -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 -group has a central subgroup of order , 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 is supersolvable via , but is not nilpotent because its Sylow -subgroups are not normal. The group is soluble via , 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 is a composition series whose first is not normal in , while is a chief series with a nonsimple chief factor .
Finally, a perfect group satisfies . 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.
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 1 6 Solution Created 2026-10-03 Updated 2026-10-14
For a set of primes , a Hall -subgroup of a finite group is a subgroup whose order uses only primes in and whose subgroup index uses only primes outside . Equivalently, is the full -part of . A Hall subgroup is a Hall -subgroup for some . The theorem of P. Hall for finite soluble groups states: Hall -subgroups exist for every , any two are conjugate, and every -subgroup is contained in a Hall -subgroup.
For the existence proof, first give the explicit coprime splitting calculation needed in the induction. Let be elementary abelian of field characteristic , normal in , with . Write and use additive notation on . A normalized section gives an action independent of its choice, since is abelian. Write . Associativity givesSum over , put , and divide by in the vector space . This is legitimate because . With one obtainsThe new section therefore has zero multiplication defect and is a group homomorphism. Its image is a complement to .
We will also need a single conjugation carrying one complement to the other. If two homomorphic sections differ by , their difference satisfies . Summing over gives , where . Thus the second section is . This proves, by explicit averaging, both coprime splitting over an elementary abelian normal subgroup and the existence of such a conjugation by an element of .
Now induct on for Hall subgroup existence in soluble groups. A minimal normal subgroup of a finite soluble group is elementary abelian of some field characteristic . Indeed, is a characteristic subgroup of and normal in ; it cannot equal because is soluble, so it is trivial. In this abelian group, a nontrivial primary component is a characteristic subgroup, forcing a single prime, and the characteristic subgroup annihilated by that prime forces exponent .
By induction has a Hall -subgroup , with preimage . If , induction in supplies a Hall -subgroup of , which is also Hall in because is prime to all primes in . If , the quotient is a -group. When , itself is a -group. When , the averaging construction splits off , and its complement has order and is the required Hall -subgroup. This completes the existence proof, including the identity group and empty prime set.
A Sylow basis is a family containing one Sylow subgroup for each prime, with for each pair. This is permutability of subgroups, not commutation of all their elements. The product of any subfamily is a subgroup: commuting the factors as sets proves closure and closure under inversion. Inductively its order is the product of the prime-power orders, since the newly adjoined factor has trivial intersection with the earlier product. It is thus the corresponding Hall subgroup.
Prove existence of a Sylow basis by induction on , again using elementary abelian of field characteristic . Choose a basis of , taking if does not divide that quotient's order. The product is its Hall -subgroup. In its full preimage , the averaging lemma supplies a complement to , mapping isomorphically to . For , let be the inverse image of under this isomorphism within . Let be the full preimage of in . These are Sylow subgroups of . The other-prime pairs permute because they do so in . For and , their product is contained in the full preimage of the subgroup and has exactly that preimage's order . Equality follows, so the product is a subgroup and these two factors permute as well. This constructs a basis.
To obtain a simultaneous conjugation of two bases, take two bases. Their images in are bases: lies in every Sylow -subgroup, and the other-prime Sylow subgroups project injectively. By induction, conjugate one basis so that all corresponding images agree. The products of their non- factors are then two complements to in the same preimage of their common Hall -subgroup. The averaging lemma for complements supplies a single element of conjugating these complements. In the resulting common complement each corresponding Sylow subgroup is the unique lift of its agreed quotient subgroup, so all non- factors agree. The -factors already equal the full preimage of their common quotient factor and are preserved by conjugation from . Thus all Sylow bases of a finite soluble group are conjugate.
In there are three Sylow -subgroups of order eight: the action on the three pair-partitions of four points has kernel , and these subgroups are the preimages of the three order-two subgroups of . There are four Sylow -subgroups, one for each three-point support. Every choice has trivial intersection and product of cardinality , so . ThereforeFor , , the Sylow -subgroup is uniquely . In a Sylow basis the product is a Hall -subgroup, hence a complement to . Conversely, a basis of any complement together with is a basis of , because is normal. The averaging lemma makes all complements conjugate by . The stabilizer of the standard complement under this conjugation is : if a vector normalizes it, its group commutator with each complement element lies in both and that complement, hence is trivial. The fixed vectors under the natural coordinate permutation action are exactly , so . There are consequently complements, and each has twelve bases. The complement is uniquely recovered from its basis as , so no basis is counted twice. The counting Sylow bases in a coprime elementary abelian extension formula yields
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 2 2 Solution Created 2026-10-03 Updated 2026-10-14
The Hall theorem for soluble groups says that for every prime set , a finite soluble group has Hall -subgroups; they are all conjugate, and every -subgroup is contained in one. A Hall -subgroup has only primes in in its order and no primes in in its index.
For a proof outline, induct on the group order and choose a minimal normal subgroup . In a finite soluble group this is elementary abelian of some characteristic : its derived subgroup is characteristic and solvability forces it to be trivial; primary components and the subgroup of elements of order dividing are then characteristic, so minimality gives an elementary abelian p-group. Choose a Hall -subgroup of and let be its preimage. If , is itself a Hall -subgroup. If , has order prime to and coprime splitting over an elementary abelian normal subgroup supplies a complement to in , of the required Hall order.
Here the complement fact has a short averaging proof. Choose a section of and write its multiplication defect as , in additive notation. Associativity givesSince is invertible on , averaging over expresses the defect as ; adjusting the section by gives a homomorphic section. Two such complements differ by . Averaging this identity gives , so they are conjugate by . Inductive conjugacy in the quotient followed by this complement conjugacy proves Hall conjugacy. To embed an arbitrary -subgroup , first put its quotient inside the chosen quotient Hall subgroup. In the coprime case and the corresponding subgroup of a complement are both complements to inside , hence are -conjugate. In the other case directly. This proves Hall conjugacy and embedding in finite soluble groups as well as existence.
Now prove the assertion about maximal subgroups by induction on . Suppose a nontrivial normal subgroup is contained in . If , maximality gives , and since this gives . If , both and are maximal in ; induction yields either their product equal to or their conjugacy, lifting respectively to or to conjugacy of . The same applies with their roles reversed.
It remains to suppose that no nontrivial normal subgroup of lies in either maximum. Let be minimal normal, an elementary abelian p-group. Since lies in neither maximum, . The intersection is normalized by and by the abelian group , hence by ; it is therefore trivial. Likewise . Thus both and complement . Their action on is irreducible, since an invariant subspace would be a proper nontrivial normal subgroup of . It is also faithful: is normalized by and centralized by , so is a normal subgroup of contained in and must be trivial.
If , these assumptions force and to have prime order. Otherwise choose normal in with minimal normal in . It is an elementary abelian r-group. Under , its copy is a nontrivial normal subgroup of . The prime differs from : a p-group acting on the characteristic-p vector space has nonzero fixed points, by counting its orbits on modulo . Its fixed subspace would be -invariant, hence all of by irreducibility, contrary to faithfulness of .
Therefore and are Sylow r-subgroups of . They are conjugate in . Conjugate so that these intersections coincide as . Since , . It cannot equal , since would then be a nontrivial normal subgroup contained in . Maximality gives , and the same argument gives . The conjugated maxima are equal. HenceThis is the factorization-or-conjugacy property of maximal subgroups of a finite soluble group.
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.