ArticleslgStudy

mathematics

O'Nan–Scott theorem

O'Nan–Scott theorem is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand O'Nan–Scott theorem rather than just read about it. In short: 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.

Key takeaways

  • O'Nan–Scott theorem belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect O'Nan–Scott theorem to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of O'Nan–Scott theorem from memory before moving on to harder problems.

Reference excerpt

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. Michael Aschbacher and Scott later gave a corrected version of the statement of the theorem. The theorem states that a maximal subgroup of the symmetric group Sym(Ω), where |Ω| = n, is one of the following:

Sk × Sn−k the stabilizer of a k-set (that is, intransitive) Sa wr Sb with n = ab, the stabilizer of a partition into b parts of size a (that is, imprimitive) primitive (that is, preserves no nontrivial partition) and of one of the following types: AGL(d,p) Sl wr Sk, the stabilizer of the product structure Ω = Δk a group of diagonal type an almost simple group In a survey paper written for the Bulletin of the London Mathematical Society, Peter J. Cameron seems to have been the first to recognize that the real power in the O'Nan–Scott theorem is in the ability to split the finite primitive groups into various types. A complete version of the theorem with a self-contained proof was given by M.W. Liebeck, Cheryl Praeger and Jan Saxl. The theorem is now a standard part of textbooks on permutation groups.

O'Nan–Scott types The eight O'Nan–Scott types of finite primitive permutation groups 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 G0 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(t1,t2) = t1−1tt2. Now M has two minimal normal subgroups N1, N2, 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 α = 1T 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 N1 and N2 as minimal normal subgroups. HC (holomorph of a compound group): Let T be a nonabelian simple group and let N1 ≅ N2 ≅ Tk for some integer k ≥ 2. Let Ω = Tk. Then M = N1 × N2 acts transitively on Ω via x(n1,n2) = n1−1xn2 for all x ∈ Ω, n1 ∈ N1, n2 ∈ N2. As in the HS case, we have M ≅ Tk.Inn(Tk) and any automorphism of Tk also acts on Ω. A primitive group of type HC is a group G such that M ≤ G ≤ Tk.Aut(Tk)and G induces a subgroup of Aut(Tk) = Aut(T)wrSk which acts transitively on the set of k simple direct factors of Tk. Any such G has two minimal normal subgroups, each isomorphic to Tk and regular. A group of type HC preserves a product structure Ω = Δk where Δ = T and G≤ HwrSk where H is a primitive group of type HS on Δ. TW (twisted wreath): Here G has a unique minimal normal subgroup N and N ≅ Tk 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 606 . 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 = Tk 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 {(t1,...,tk−1, 1)| ti ∈ T}to be a set of coset representatives for H in N and so we can identify Ω with Tk−1. Now (s1,...,sk) ∈ N takes the coset with representative (t1,...,tk−1, 1) to the coset H(t1s1,...,tk−1sk−1, sk) = H(sk−1tks1,...,sk−1tk−1sk−1, 1). The group Sk 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 (t1,...,tk−1, 1)to the coset with representative (t1σ,...,tk−1σ, 1). Thus we get a group W = N.(Out(T) × Sk) ≤ Sym(Ω). A primitive group of type SD is a group G ≤ W such that N ◅ G and G induces a primitive subgroup of Sk on the k simple direct factors of N. CD (compound diagonal): Here Ω = Δk and G ≤ HwrSk where H is a primitive group of type SD on Δ with minimal normal subgroup Tl. Moreover, N = Tkl is a minimal normal subgroup of G and G induces a transitive subgroup of Sk. PA (product action): Here Ω = Δk and G ≤ HwrSk where H is a primitive almost simple group on Δ with socle T. Thus G has a product action on Ω. Moreover, N = Tk ◅ G and G induces a transitive subgroup of Sk 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." Praeger later generalized the O’Nan–Scott Theorem to quasiprimitive groups (groups with faithful actions such that the restriction to every nontrivial normal subgroup is transitive).

References

External links "O'Nan–Scott theorem", Encyclopedia of Mathematics, EMS Press, 2001 [1994]

Worked examples

Example 1 — a first encounter with O'Nan–Scott theorem

Start with the simplest possible case. Write down what O'Nan–Scott theorem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to O'Nan–Scott theorem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about O'Nan–Scott theorem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of O'Nan–Scott theorem

In research
O'Nan–Scott theorem appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses O'Nan–Scott theorem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
O'Nan–Scott theorem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Permutation groups, Theorems in group theory, so understanding it makes those chapters shorter.
In everyday life
Look for O'Nan–Scott theorem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “O'Nan–Scott theorem” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study O'Nan–Scott theorem in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what O'Nan–Scott theorem means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain O'Nan–Scott theorem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is O'Nan–Scott theorem in simple terms?

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.

Why does O'Nan–Scott theorem matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study O'Nan–Scott theorem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on O'Nan–Scott theorem.

Tags

  • Permutation groups
  • Theorems in group theory

Keep exploring