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, is
The 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 is
The 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 is
Its 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.
Let have dimension over , with a nondegenerate alternating bilinear form . The symplectic group is
It acts freely and transitively on ordered symplectic bases. Choose the first vector in ways, then choose with in ways. Their span is nondegenerate, so choose the remaining symplectic basis in its orthogonal complement. This gives the recurrence
and therefore
For the permutation module with even, put and
It is invariant under coordinate permutations and has codimension one. The dot product restricted to is alternating because . Since the ambient dot product is nondegenerate, . Evenness of ensures , so
Here the word symplectic must be understood as an alternating form before quotienting: a form with a nonzero radical is degenerate. The nondegenerate symplectic form is induced on , of dimension .
Now put . Coordinate permutations preserve the induced form and give a homomorphism . To see it is faithful for , suppose a permutation acts trivially on . For every pair of distinct indices,
The two weight-two vectors could differ by only if the complement of a two-element set also had size two. For that is impossible. Thus preserves every two-element set, and hence fixes every index: intersect two such sets with one common element. Therefore
For , both groups have order , and the injection is onto. This proves
The lower bound matters: for the action on the quotient has the Klein four-group as group homomorphism kernel. The construction is the deleted permutation module in characteristic two.
The special linear group over a finite field consists of the determinant-one invertible matrices over . Counting an ordered basis gives
The determinant map is onto , so
A transvection has the form , where , the linear functional is nonzero and . It has determinant one, fixes the hyperplane pointwise, and its displacement has image the line . In particular for is an elementary transvection when .
Row addition is multiplication by such a matrix. Gaussian elimination reduces a determinant-one matrix to diagonal form using row additions and determinant-one pivot exchanges. The latter, and all remaining diagonal factors, are themselves products of transvections: within two coordinates,
A diagonal matrix with product of entries one is a product of these two-coordinate diagonal matrices. Thus transvections generate . This generation statement actually holds for every and every finite field; the exclusions in the question are needed for the subsequent simplicity assertion.
Commuting with all elementary matrices forces the group center to consist of scalar matrices with , so its order is . The projective quotient acts faithfully on the one-dimensional subspaces. Its action is two-transitive: send an ordered pair of independent representative vectors to any other pair and adjust the determinant by rescaling a representative without changing its line. Therefore it is primitive.
The Iwasawa simplicity lemma says that in a faithful primitive action, if a point stabilizer has an abelian normal subgroup whose conjugates generate the group, every nontrivial normal subgroup contains the derived subgroup. In particular a nontrivial perfect group satisfying these conditions is simple. No proof of the lemma is required here.
For the point , the subgroup
is abelian, is normal in the line stabilizer, and its conjugates contain all transvections. Its image in the projective quotient has the same properties. Perfectness follows explicitly from elementary commutators. If , choose a third index to obtain
If , choose with and set . Then
Every upper transvection is a commutator, and conjugation gives the lower ones. The group and its projective quotient are perfect. Iwasawa's simplicity lemma now proves
The order of is . Its faithful projective-line action has degree five, so its image is an index-two subgroup of , necessarily . Thus .
For the order is . We construct a faithful degree-five action. In take
They satisfy and . Their quaternion subgroup projects to a Sylow 2-subgroup . Its projective centralizer is : a lift of a centralizing element conjugates each of to itself or its negative. In the matrix basis , those four sign choices each leave a one-dimensional space, and determinant one leaves just its two quaternion representatives. The matrix
has order three and cyclically permutes the three nonidentity elements of . The normalizer quotient embeds in and has order dividing both and , so it has order exactly three. Hence and there are five Sylow 2-subgroups. Their conjugation action is nontrivial and transitive, and simplicity makes it faithful. Its image again has order in , proving
Finally,
In characteristic two an involutory matrix has form with . Its Jordan blocks have size at most two. A projective involution in has a unique involutory lift to : its square is central, and squaring is an automorphism of the scalar center of order three, allowing a unique scalar adjustment. The nonidentity Jordan form in dimension three is only . This GL-class remains a single SL-class, since the centralizer contains of every determinant . Thus has one involution class.
In there are two forms, and , so there are two involution classes. More concretely, the first group's single class has elements, counting image line, kernel plane through it and nonzero map between the quotient and image. The rank-one class in dimension four over has elements; the rank-two class has . Isomorphisms preserve conjugacy classes, so
For with , Sylow theorems assert existence of a subgroup of order , containment of every p-subgroup in one, conjugacy of all these Sylow subgroups, and
A group of order has and , so its Sylow 5-subgroup is unique. In it is generated by a five-cycle and has one fixed point. Its normalizer preserves that point and, on the other five points identified with , is the affine group . Every automorphism of the cyclic translation group is realized by a multiplier. Thus , forcing
Inside there are Sylow 5-subgroups. Conjugation gives a transitive action on them and a homomorphism into . Its group homomorphism kernel is a normal subgroup of , whose only possibilities are . The latter two would leave an image of order at most two, incompatible with transitivity on six points. Hence it is faithful. Denote the resulting transitive copy of by .
The action of on the six cosets of is also faithful: its group homomorphism kernel cannot contain the simple subgroup , since an image of order at most two is not transitive of degree six, and a normal subgroup disjoint from centralizes and is trivial. It therefore gives an automorphism carrying to a natural point stabilizer. This automorphism is outer, because conjugation cannot carry a transitive subgroup to an intransitive one.
There are precisely two classes of copies of in . A faithful intransitive copy must have an orbit of length five: all partitions of six into smaller orbits embed it in groups of order below . Thus it is a natural point stabilizer. A transitive copy is a degree-six coset action of an abstract , with an order- stabilizer. Every order- subgroup of is a Sylow-five normalizer, so these stabilizers are conjugate and the degree-six actions are permutation-equivalent. Hence all transitive copies form one class. The outer automorphism constructed above swaps these two classes; it cannot preserve the point-stabilizer class, since any automorphism preserving that class induces a relabeling of its six members, and equivariance of their faithful conjugation action then makes the automorphism inner.
Identify with its inner automorphism group inside . Every Sylow 5-subgroup of is contained in , since that normal subgroup has index two. There are of them. Consequently
To prove maximality, first classify the proper overgroups of in . The affine multiplier in of order four is a four-cycle and is odd. Within , a proper overgroup larger than could only have order , but the index-two subgroup is and cannot contain that odd element. Thus is maximal in . A nontransitive overgroup of must fix its unique fixed point, so is if it is larger than . A transitive overgroup has ; this point stabilizer is either or . In the latter case , and in the former , making it a transitive copy of .
There is exactly one such transitive copy containing . There are six conjugates of : applying the preceding overgroup argument to its own Sylow-five normalizer shows that is maximal, and is not normal. Each contains six Sylow 5-subgroups. Counting pairs of a conjugate copy and a Sylow subgroup gives , with the same number through every one of the 36 Sylow subgroups of . Thus each Sylow subgroup, and hence its normalizer , is contained in exactly one transitive copy. In particular the only proper strict overgroups of are its natural and this .
The subgroup has an outer element, because it has twice the order of . Such an element normalizes and swaps the unique overgroups . If , then is normalized by , so it cannot be just or just . It is therefore or . In the latter case . In the former normalizes and hence its unique Sylow 5-subgroup , giving . Therefore

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact