O'Nan–Scott theorem

In mathematics, the O'Nan–Scott theorem is one of the most influential theorems of permutation group theory; the classification of finite simple groups is what makes it so useful. Originally the theorem was about maximal subgroups of the symmetric group. It appeared as an appendix to a paper by Leonard Scott written for The Santa Cruz Conference on Finite Groups in 1979, with a footnote that Michael O'Nan had independently proved the same result.

The theorem states that a maximal subgroup of the symmetric group Sym(Ω), where |Ω| = n is one of the following:

1. S_k × S_n−k the stabilizer of a k-set (that is, intransitive)
2. S_a wr S_b with n = ab, the stabilizer of a partition into b parts of size a (that is imprimitive)
3. primitive (that is, preserves no nontrivial partition) and of one of the following types:

• AGL(d,p)
• S_l wr S_k, the stabilizer of the product structure Ω = Δ^k
• a group of diagonal type
• an almost simple group

In their paper, "On the O'Nan Scott Theorem for primitive permutation groups," M.W. Liebeck, Cheryl Praeger and Jan Saxl give a complete self-contained proof of the theorem.^[1] In addition to the proof, they recognized that real power in the O'Nan–Scott theorem is in the ability to split the finite primitive groups into various types.

The eight O'Nan–Scott types are as follows: HA (holomorph of an abelian group): These are the primitive groups which are subgroups of the affine general linear group AGL(d,p), for some prime p and positive integer d ≥ 1. For such a group G to be primitive, it must contain the subgroup of all translations, and the stabilizer G₀ in G of the zero vector must be an irreducible subgroup of GL(d,p). Primitive groups of type HA are characterized by having a unique minimal normal subgroup which is elementary abelian and acts regularly.

HS (holomorph of a simple group): Let T be a finite nonabelian simple group. Then M = T×T acts on Ω = T by t^(t₁,t₂) = t₁⁻¹tt₂. Now M has two minimal normal subgroups N₁, N₂, each isomorphic to T and each acts regularly on Ω, one by right multiplication and one by left multiplication. The action of M is primitive and if we take α = 1_T we have M_α = {(t,t)|t ∈ T}, which includes Inn(T) on Ω. In fact any automorphism of T will act on Ω. A primitive group of type HS is then any group G such that M ≅ T.Inn(T) ≤ G ≤ T.Aut(T). All such groups have N₁ and N₂ as minimal normal subgroups.

HC (holomorph of a compound group): Let T be a nonabelian simple group and let N₁ ≅ N₂ ≅ T^k for some integer k ≥ 2. Let Ω = T^k. Then M = N₁ × N₂ acts transitively on Ω via x^(n₁,n₂) = n₁⁻¹xn₂ for all x ∈ Ω, n₁ ∈ N₁, n₂ ∈ N₂. As in the HS case, we have M ≅ T^k.Inn(T^k) and any automorphism of T^k also acts on Ω. A primitive group of type HC is a group G such that M ≤ G ≤ T^k.Aut(T^k)and G induces a subgroup of Aut(T^k) = Aut(T)wrS_k which acts transitively on the set of k simple direct factors of T^k. Any such G has two minimal normal subgroups, each isomorphic to T^k and regular.

A group of type HC preserves a product structure Ω = Δ^k where Δ = T and G≤ HwrS_k where H is a primitive group of type HS on Δ.

TW (twisted wreath): Here G has a unique minimal normal subgroup N and N ≅ T^k for some finite nonabelian simple group T and N acts regularly on Ω. Such groups can be constructed as twisted wreath products and hence the label TW. The conditions required to get primitivity imply that k≥ 6 so the smallest degree of such a primitive group is 60⁶ .

AS (almost simple): Here G is a group lying between T and Aut(T ), that is, G is an almost simple group and so the name. We are not told anything about what the action is, other than that it is primitive. Analysis of this type requires knowing about the possible primitive actions of almost simple groups, which is equivalent to knowing the maximal subgroups of almost simple groups.

SD (simple diagonal): Let N = T^k for some nonabelian simple group T and integer k ≥ 2 and let H = {(t,...,t)| t ∈ T} ≤ N. Then N acts on the set Ω of right cosets of H in N by right multiplication. We can take {(t₁,...,t_k−1, 1)| t_i ∈ T}to be a set of coset representatives for H in N and so we can identify Ω with T^k−1. Now (s₁,...,s_k) ∈ N takes the coset with representative (t₁,...,t_k−1, 1) to the coset H(t₁s₁,...,t_k−1s_k−1, s_k) = H(s_k⁻¹t_ks₁,...,s_k⁻¹t_k−1s_k−1, 1)The group S_k induces automorphisms of N by permuting the entries and fixes the subgroup H and so acts on the set Ω. Also, note that H acts on Ω by inducing Inn(T) and in fact any automorphism σ of T acts on Ω by taking the coset with representative (t₁,...,t_k−1, 1)to the coset with representative (t₁^σ,...,t_k−1^σ, 1). Thus we get a group W = N.(Out(T) × S_k) ≤ Sym(Ω). A primitive group of type SD is a group G ≤ W such that N ◅ G and G induces a primitive subgroup of S_k on the k simple direct factors of N.

CD (compound diagonal): Here Ω = Δ^k and G ≤ HwrS_k where H is a primitive group of type SD on Δ with minimal normal subgroup T^l. Moreover, N = T^kl is a minimal normal subgroup of G and G induces a transitive subgroup of S_k.

PA (product action): Here Ω = Δ^k and G ≤ HwrS_k where H is a primitive almost simple group on with socle T. Thus G has a product action on Ω. Moreover, N = T^k ◅ G and G induces a transitive subgroup of S_k in its action on the k simple direct factors of N.

Some authors use different divisions of the types. The most common is to include types HS and SD together as a “diagonal type” and types HC, CD and PA together as a “product action type." ^[2] Praeger later generalized the O’Nan–Scott Theorem to quasiprimitive groups in her paper "An O'Nan–Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs". ^[3]

References

1. Liebeck, Martin W.; Cheryl E. Praeger; Jan Saxl (1988). "On the O'Nan Scott Theorem for primitive permutation groups" (PDF). J. Austral. Math. Soc. Retrieved 2013-04-24.
2. Giudici, Michael. "The O’Nan–Scott Theorem". Retrieved 24 April 2013.
3. Praeger, Cheryl E. (1993). "An O'Nan–Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs". Journal of the London Mathematical Society. s2-47: 227–239. doi:10.1112/jlms/s2-47.2.227.

External links

• Hazewinkel, Michiel, ed. (2001), "O'Nan–Scott theorem", Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4