Group theory and generalizations Group actions and permutation groups Theorem
O'Nan–Scott theorem
Builds on Primitive permutation groupNormal subgroupSimple groupAutomorphism groupWreath productStabiliserGeneral linear group
Statement
Let be a finite primitive permutation group on a set . Let be the socle of , the subgroup generated by all minimal normal subgroups of . Then for a simple group and an integer , and is of one of the following five types.
- Affine type: is an elementary abelian group of order for a prime , and acts regularly on . Then can be identified with so that , where is the group of translations and acts irreducibly on .
- Almost simple type: is nonabelian, and .
- Diagonal type: is nonabelian and . The stabiliser in of a point is a diagonal subgroup , where the are automorphisms of . Then .
- Product type: there are an integer and a primitive group on a set , of almost simple or diagonal type, with these properties. One has and in its product action on . The socle is .
- Twisted wreath type: is nonabelian and acts regularly on ; then .
Remarks
The proof studies the minimal normal subgroups of . Each one is transitive by primitivity, and it is a direct power of a simple group. There are at most two minimal normal subgroups, and the type is read off from how a point stabiliser meets and how permutes the factors of .
Examples: the symmetric group on points is of almost simple type with socle . The group of maps with on is of affine type with socle the translations. For , the wreath product acting on pairs with is of product type.
Books group the types in different ways, and some versions list eight classes instead of five. The theorem reduces many questions on finite primitive groups to questions on finite simple groups and their automorphism groups.
Going deeper
For a student
The socle of a primitive group is a power of one simple group, and the five types describe how acts around it. The affine type is linear algebra over . The almost simple type is a simple group together with some of its automorphisms. The other three types are built from several copies of a nonabelian simple group. Combined with the classification of finite simple groups, the theorem is a main tool in two problems. One is to find the maximal subgroups of the symmetric and alternating groups, and the other is to bound the orders of primitive groups.
Reading path
To understand this page from the ground up, read these 8 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Automorphism group concept
- General linear group object
- Normal subgroup concept
- Primitive permutation group concept
- Simple group concept
- Stabiliser concept
- Wreath product concept
- O'Nan–Scott theorem statement
Further reading
About this page
| Tag | Z4WVANZPK4 |
|---|---|
| URI | m2://Z4WVANZPK4 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 20B15 |
| Status | This copy of the site has no build data. Run m2 status Z4WVANZPK4. |
| About | Primitive permutation group |
| Uses | Primitive permutation group, Normal subgroup, Simple group, Automorphism group, Wreath product, Stabiliser, General linear group |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.