Math 2.0

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 GG be a finite primitive permutation group on a set Ω\Omega. Let NN be the socle of GG, the subgroup generated by all minimal normal subgroups of GG. Then N≅TkN \cong T^k for a simple group TT and an integer k≥1k \ge 1, and GG is of one of the following five types.

  1. Affine type: NN is an elementary abelian group of order pdp^d for a prime pp, and NN acts regularly on Ω\Omega. Then Ω\Omega can be identified with 𝔽pd\F_p^d so that G=N⋊G0G = N \rtimes G_0, where NN is the group of translations and G0≤GLd(𝔽p)G_0 \le \mathrm{GL}_d(\F_p) acts irreducibly on 𝔽pd\F_p^d.
  2. Almost simple type: N=TN = T is nonabelian, and T≤G≤Aut⁡(T)T \le G \le \Aut(T).
  3. Diagonal type: TT is nonabelian and k≥2k \ge 2. The stabiliser in NN of a point is a diagonal subgroup {(α1(t),…,αk(t)):t∈T}\set{(\alpha_1(t), \dots, \alpha_k(t)) : t \in T}, where the αi\alpha_i are automorphisms of TT. Then ∣Ω∣=∣T∣k−1\abs{\Omega} = \abs{T}^{k-1}.
  4. Product type: there are an integer ℓ≥2\ell \ge 2 and a primitive group HH on a set Δ\Delta, of almost simple or diagonal type, with these properties. One has Ω=Δℓ\Omega = \Delta^\ell and G≤H≀SℓG \le H \wr S_\ell in its product action on Δℓ\Delta^\ell. The socle is N=soc⁡(H)ℓN = \operatorname{soc}(H)^\ell.
  5. Twisted wreath type: TT is nonabelian and NN acts regularly on Ω\Omega; then ∣Ω∣=∣T∣k\abs{\Omega} = \abs{T}^k.

Remarks

The proof studies the minimal normal subgroups of GG. Each one is transitive by primitivity, and it is a direct power TmT^m of a simple group. There are at most two minimal normal subgroups, and the type is read off from how a point stabiliser meets NN and how GG permutes the kk factors of NN.

Examples: the symmetric group SnS_n on n≥5n \ge 5 points is of almost simple type with socle AnA_n. The group of maps x↦ax+bx \mapsto ax + b with a≠0a \ne 0 on 𝔽p\F_p is of affine type with socle the translations. For m≥5m \ge 5, the wreath product Sm≀S2S_m \wr S_2 acting on pairs (i,j)(i, j) with 1≤i,j≤m1 \le i, j \le m 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 TkT^k of one simple group, and the five types describe how GG acts around it. The affine type is linear algebra over 𝔽p\F_p. 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Automorphism group concept
  2. General linear group object
  3. Normal subgroup concept
  4. Primitive permutation group concept
  5. Simple group concept
  6. Stabiliser concept
  7. Wreath product concept
  8. O'Nan–Scott theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/O'Nan–Scott_theorem
About this page
TagZ4WVANZPK4
URIm2://Z4WVANZPK4
Kindstatement, theorem
WritingW0 stub
MSC20B15
StatusThis copy of the site has no build data. Run m2 status Z4WVANZPK4.
AboutPrimitive permutation group
UsesPrimitive permutation group, Normal subgroup, Simple group, Automorphism group, Wreath product, Stabiliser, General linear group
Same as
Changed2 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.