How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Socles and the Onan Scott Landscape
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Blocks Primitivity and Multiple Transitivity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Frattini Subgroups and the Burnside Basis Theorem
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Semidirect Products, Automorphism Groups and Split Extensions
- Sylow's Theorems, p-Groups and Nilpotent Groups
- The Fundamental Theorem of Finite Abelian Groups
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
This page develops the socle-level structure of finite primitive groups. Distinct minimal normal subgroups centralize one another, finite minimal normal subgroups are characteristically simple, and the socle admits a direct-product decomposition. In a faithful primitive action each minimal normal subgroup is transitive; two distinct ones are regular, so there are at most two.
A unique abelian minimal normal subgroup gives affine type. The separate local proposition proves that a finite 2-transitive group is affine or almost simple. The five-type and eight-type terminology is compared without an exhaustiveness claim for arbitrary primitive groups. The final remark gives a terminating finite enumeration of minimal normal subgroups and the socle, using the proved transitivity theorem as a structural check. The source-specific false statement identifies two explicit Schreier invocations in the cited LPS proof; it makes no claim that CFSG is necessary for every proof of the classification.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Minimal normal subgroups and the socle of a finite group
Definition
Let be a finite group.
A nontrivial normal subgroup is a minimal normal subgroup of if the only normal subgroups of contained in are and itself.
The socle of is the subgroup
that is, the subgroup generated in the sense of The subgroup generated by a subset, the cyclic subgroup , and cyclic groups by all minimal normal subgroups of .
Distinct minimal normal subgroups centralize one another
Statement
Let be a finite group, and let be distinct minimal normal subgroups. Then every element of commutes with every element of . Equivalently, .
Facts & Assumptions
Given: A finite group and distinct minimal normal subgroups .
Using the convention of Commutators and the commutator subgroup , put
Because and are normal in , the subgroup is normal in and is contained in both and .
Proof
By [A1], the subgroup is a normal subgroup of contained in . Since is minimal normal, either or .
The same argument with shows that either or . Because , the subgroup cannot equal both and .
Therefore . By [L1], every commutator is trivial, so for all and .
Minimal normal subgroups of finite groups are characteristically simple
Statement
Every minimal normal subgroup of a finite group is characteristically simple.
Facts & Assumptions
Given: A finite group and a minimal normal subgroup .
If is characteristic in a normal subgroup , then is normal in (If is characteristic in and is normal in , then is normal in ).
A finite group is characteristically simple exactly when it has no proper nontrivial characteristic subgroup.
Proof
Let be a characteristic subgroup of . By [L1], the subgroup is normal in . Since and is minimal normal in , either or .
Thus has no proper nontrivial characteristic subgroup, so [A1] shows that is characteristically simple.
Finite characteristically simple groups are direct products of isomorphic simple groups
Statement
Let be a nontrivial finite characteristically simple group. Then there is a finite simple group and an integer such that
In particular, is an internal direct product of pairwise isomorphic simple normal subgroups.
Facts & Assumptions
Given: A nontrivial finite characteristically simple group .
Every nontrivial finite group has a minimal normal subgroup.
If is a minimal normal subgroup of a finite characteristically simple group , then every automorphic image of is again a minimal normal subgroup, distinct images centralize one another, and the subgroup generated by all such images is characteristic in .
Normal subgroups form an internal direct product when they generate the ambient group and for every (Internal direct products of finitely many normal subgroups).
Proof
By [A1], choose a minimal normal subgroup .
Let be an irredundant family of automorphic images of that generates the subgroup generated by all automorphic images. By [A2], the subgroup is characteristic in , so because is characteristically simple and .
Fix and put . The intersection is normal in : both factors are normal, and the intersection is preserved by conjugation. Minimality of makes this intersection either or . The latter would put inside the subgroup generated by the other images, contradicting irredundancy. Hence for every . Together with step 2.1, [A2], and [L1], this makes an internal direct product.
Let . Since the other direct factors centralize , conjugation by them fixes , while conjugation by preserves by normality. Step 3.1 says these factors generate , so . Minimality of gives or ; thus is simple. All are automorphic images of , so they are pairwise isomorphic to one finite simple group . Therefore .
The socle is characteristic and decomposes as a direct product of minimal normal subgroups
Statement
Let be a finite group. Then is a characteristic subgroup of . Moreover, for some integer there are pairwise distinct minimal normal subgroups such that
Here the case means the empty direct product, namely the trivial group.
Facts & Assumptions
Given: A finite group .
Distinct minimal normal subgroups of centralize one another (Distinct minimal normal subgroups centralize one another).
Every nontrivial finite characteristically simple group is a direct product of isomorphic simple groups (Finite characteristically simple groups are direct products of isomorphic simple groups).
Every minimal normal subgroup of a finite group is characteristically simple (Minimal normal subgroups of finite groups are characteristically simple).
Automorphisms of permute its minimal normal subgroups.
Proof
By [A1], the subgroup generated by all minimal normal subgroups of is stable under every automorphism of . By definition this subgroup is , so is characteristic in .
Let be a maximal family of pairwise distinct minimal normal subgroups of chosen so that none is contained in the product of the preceding ones; when , this family is empty. For , [L1] shows that centralizes , and minimality gives because the intersection is a normal subgroup of contained in but was chosen outside the preceding product. Hence is an internal direct product, with the case giving the trivial group.
The product is generated by minimal normal subgroups, so it lies in . Conversely, if is any minimal normal subgroup of not contained in , then adjoining would contradict maximality of the chosen family; therefore every minimal normal subgroup of lies in the displayed product. Thus . By [L3], each nontrivial factor is characteristically simple, and [L2] then makes it a direct product of isomorphic simple groups.
Minimal normal subgroups of faithful primitive groups are transitive
Statement
Let be finite, faithful, and primitive, and let be a minimal normal subgroup. Then acts transitively on .
Facts & Assumptions
Given: A finite faithful primitive action of on and a minimal normal subgroup .
In a primitive action, every normal subgroup is either transitive or contained in the kernel (Normal subgroups of a primitive action are transitive or lie in the kernel).
A faithful action has trivial kernel.
Proof
By [L1], the normal subgroup is either transitive or contained in the kernel of the action.
The action is faithful, so [A1] gives trivial kernel. Because is a minimal normal subgroup, it is nontrivial, so the kernel-contained alternative from step 1.1 is impossible. Hence is transitive.
Two distinct minimal normal subgroups of a primitive group are regular
Statement
Let be finite, faithful, and primitive, and let be distinct minimal normal subgroups. Then both and act regularly on .
Facts & Assumptions
Given: A finite faithful primitive action of on and distinct minimal normal subgroups .
Distinct minimal normal subgroups centralize one another (Distinct minimal normal subgroups centralize one another).
Every minimal normal subgroup of a finite faithful primitive group is transitive (Minimal normal subgroups of faithful primitive groups are transitive).
Proof
By [L2], both and are transitive on . By [L1], every element of commutes with every element of .
Fix , and let . For any , choose with ; then . Hence every element of fixes every point of , so faithfulness gives .
The subgroup is transitive with trivial point stabilizer, so it is regular. By symmetry the same argument applies to .
A finite primitive group has at most two minimal normal subgroups
Statement
Let be finite and primitive. Then has at most two minimal normal subgroups.
Facts & Assumptions
Given: A finite primitive permutation group .
Any two distinct minimal normal subgroups of are regular (Two distinct minimal normal subgroups of a primitive group are regular).
Distinct minimal normal subgroups centralize one another (Distinct minimal normal subgroups centralize one another).
A regular permutation group has exactly one element sending a chosen point to a chosen point.
Proof
Suppose that are three distinct minimal normal subgroups of . By [L1], each pair among them is regular. In particular, and are both regular.
Fix . Because is regular, the map identifies with the set , and because is regular there is for each a unique element with by [A1].
Applying [L2] to the pair shows that centralizes . Hence every element of acts on the identified copy of by right translation. But already has that property by step 2.1, and the right-regular subgroup centralizing the left-regular action of is unique. Therefore , contradicting distinctness. So no third minimal normal subgroup exists.
A unique abelian minimal normal subgroup gives affine type
Statement
Let be a finite faithful primitive group, and suppose that is its unique minimal normal subgroup and that is abelian. Then:
- is regular on ;
- is elementary abelian, so for some prime ;
- for every , the point stabilizer acts faithfully and irreducibly on the vector space .
In the O'Nan-Scott language, is of affine type.
Facts & Assumptions
Given: A finite faithful primitive group with unique abelian minimal normal subgroup .
Every nontrivial abelian normal subgroup of a faithful primitive action is regular (Abelian normal subgroups of faithful primitive actions are regular).
Every minimal normal subgroup of a finite group is characteristically simple (Minimal normal subgroups of finite groups are characteristically simple).
A finite abelian characteristically simple group is elementary abelian.
An elementary abelian -group is canonically a vector space over (An elementary abelian -group has a canonical -vector-space structure).
Every finite elementary abelian -group has a finite basis over (Finite elementary abelian -groups have bases, basis extension, and a well-defined dimension).
Proof
By [L1], the abelian normal subgroup is regular on .
By [L2], the minimal normal subgroup is characteristically simple; as it is also abelian, [A1] shows that is elementary abelian. Facts [L3] and [L4] therefore identify with for some prime and some .
Fix . Because is regular, every acts on by conjugation and the kernel of this action is . If a nontrivial element of centralized , then it would fix every point with , contradicting faithfulness; so the action is faithful. If were a nontrivial proper -invariant subgroup, then would be normal in , contradicting minimality of . Thus the action is irreducible, and is of affine type.
Almost simple finite groups
Definition
A finite group is almost simple if there is a nonabelian finite simple group such that
The subgroup is then the socle of .
Affine, almost simple, diagonal, product action, and twisted wreath types
Definition
For a finite primitive permutation group , the five coarse O'Nan-Scott types used on this page are:
- Affine type: the socle is the unique minimal normal subgroup, it is abelian and regular, and A unique abelian minimal normal subgroup gives affine type identifies it with a finite vector space.
- Almost simple type: the socle is a nonabelian simple group and the whole group lies between that socle and its full automorphism group in the sense of Almost simple finite groups.
- Diagonal type: the socle is a direct product , with , of isomorphic nonabelian simple groups, and the action is the standard diagonal action on a coset space of a diagonal subgroup.
- Product action type: after identifying with for some , there is a primitive group on of almost simple or diagonal type, with , such that where is the transitive group induced by on the coordinates and the wreath product has its product action. If , its product action is
- Twisted wreath type: is permutation equivalent to the following group on , and this action is primitive. Take a finite nonabelian simple group , a faithful transitive permutation group , , its point stabilizer , and a homomorphism whose image contains . With automorphisms composed as left operators, set Multiplication in is pointwise. Define The twisted wreath product is , with the convention of The external semidirect product , acting on by Its socle is the unique minimal normal subgroup , acting regularly; its degree is . Primitivity is a required condition on these data, not a consequence of transitivity of alone.
The function construction is well defined: specifying values on one representative of each of the cosets determines a unique function, because . Evaluation there identifies the pointwise group with . The maps preserve its defining condition and satisfy , so The semidirect-product multiplication makes a group applies and the displayed permutation formula respects multiplication. These are finite choices.
For the socle assertion, the normal subgroups of are products of its factors: commutating an element of a normal subgroup with one factor isolates that coordinate, and simplicity and the trivial centre of then give the entire factor whenever its projection is nontrivial. The transitive action of on the factors makes minimal normal. If an element centralizes , then is an inner automorphism of and hence fixes every factor. Faithfulness of forces , and then is central in , so . Any distinct minimal normal subgroup would centralize (their commutator lies in their trivial intersection). Therefore no such subgroup exists.
These conventions implement LPS Section 1, type III(c), using left actions. Defining these types does not prove that every finite primitive group belongs to one of them, nor that a proof of that classification avoids CFSG.
Product-action wreath products are primitive under the standard hypotheses
Statement
Let be primitive but not regular, let be transitive with , and let act on in its standard product action. Then this action is primitive.
Facts & Assumptions
Given: A primitive nonregular action of on , a transitive action of on with , and the induced product action of on .
In the standard product action, the base group acts coordinatewise and the top group permutes the coordinates transitively.
In a faithful primitive nonregular action, distinct points have distinct stabilizers. Indeed, equality of point stabilizers is an invariant equivalence relation; primitivity makes its classes singletons unless every stabilizer is trivial, which is the regular case.
Proof
Let be a block containing distinct points and , and choose a coordinate with . By [A2], some moves . Let act as in coordinate and trivially elsewhere. Then fixes , so and the block property gives . Hence are distinct and differ in exactly coordinate .
Fixing the other coordinates, the set of possible entries in coordinate among points of is a block for . It contains the two distinct entries from step 1.1, so primitivity of makes it all of . Thus contains the entire -coordinate fibre through .
The stabilizer in of any point of induces the transitive group on the coordinates: a coordinate permutation can be followed by coordinatewise elements of the transitive group to restore the point. Applying these point-stabilizer elements to the fibre in step 2.1 gives a full fibre in every coordinate. Independent coordinate changes then show that . Hence every block is a singleton or the whole set, so the product action is primitive.
This page uses the coarse five-type O'Nan-Scott convention
Modern accounts often use eight types: HA (affine), HS (holomorph simple), HC (holomorph compound), AS (almost simple), PA (product action), SD (simple diagonal), CD (compound diagonal), and TW (twisted wreath). Relative to the five labels in Affine, almost simple, diagonal, product action, and twisted wreath types, the correspondence with the Liebeck–Praeger–Saxl convention is:
| Five-type branch | Modern types |
|---|---|
| Affine (I) | HA |
| Almost simple (II) | AS |
| Simple diagonal (III(a)) | SD, HS |
| Product action (III(b)) | PA, CD, HC |
| Twisted wreath (III(c)) | TW |
In III(a), the one-minimal-normal-subgroup case is SD and the two-regular-minimal-normal-subgroup case is HS. In III(b), an almost-simple component gives PA; a simple-diagonal component gives CD or HC, according to whether there is one minimal normal subgroup or two. Thus HC and CD belong to the coarse product-action branch, not the simple-diagonal branch. This is a terminology comparison, not a proof that the five branches exhaust all finite primitive groups or a substitute for the twisted-wreath construction.
Finite 2-transitive groups have affine or almost simple socle type
Statement
Every finite -transitive permutation group of degree at least is of affine type or almost simple type. More precisely, it has a unique minimal normal subgroup ; either is elementary abelian and regular, with a faithful irreducible point-stabilizer action, or is nonabelian simple and .
Facts & Assumptions
Given: A finite -transitive permutation group , with .
A doubly transitive action is primitive, and a minimal normal subgroup in a faithful primitive action is transitive (Every doubly transitive action is primitive, Minimal normal subgroups of faithful primitive groups are transitive). The ordered-pair convention is k-transitive and k-homogeneous actions.
A finite primitive group has at most two minimal normal subgroups; distinct ones commute and are regular (A finite primitive group has at most two minimal normal subgroups, Distinct minimal normal subgroups centralize one another, Two distinct minimal normal subgroups of a primitive group are regular).
A minimal normal subgroup of a finite group is characteristically simple (Minimal normal subgroups of finite groups are characteristically simple).
Cauchy's theorem, Sylow existence, and the nontrivial center of a nontrivial finite -group are available (Cauchy's theorem: if a prime divides , then has an element of order , Sylow I: every finite group has a Sylow -subgroup, Every nontrivial finite -group has nontrivial center, in fact divides ).
Finite orbit sizes are stabilizer indices, and subgroup orders divide group orders (Orbit-stabiliser cardinality: whenever either side is finite, and for finite , Lagrange's theorem: for every subgroup of a finite group ).
A unique abelian minimal normal subgroup gives the stated affine structure (A unique abelian minimal normal subgroup gives affine type); the other alternative is Almost simple finite groups.
Proof
Choose a minimal normal subgroup , possible by finiteness. It is transitive by [L1]. If is regular, identify with by . Conjugation by is transitive on , so all nonidentity elements have the same order, necessarily a prime by taking powers. By Cauchy's theorem is a -group; its nontrivial characteristic center equals by [L3]. Thus is elementary abelian. A permutation centralizing a regular group is determined by its value at ; for abelian it is the corresponding translation. A second minimal normal subgroup would therefore lie in by [L2], which is impossible. The affine conclusion follows from [L6].
Assume henceforth that is nonregular. Since , all its orbits on have a common size . Transitivity of gives the same size at every point. Here , for otherwise fixes every point and is trivial.
We establish a finite permutation fact: a faithful transitive group whose nontrivial suborbits all have size is primitive or has trivial two-point stabilizers. Suppose is a block of size , with and . Since preserves , , so . The union of the translates of under is a union both of blocks of size and of suborbits of size ; its size is at most , so equals . Thus the setwise stabilizer has index in .
For every , and both have index , so they agree. In particular this group fixes pointwise. If , then where is the pointwise stabilizer. All two-point stabilizers have order , so both inclusions are equalities. Applying the same argument to the block containing gives . This holds for every block, so their common pointwise stabilizer fixes all points and is trivial. Both within-block and between-block two-point stabilizers are therefore trivial.
If were imprimitive, steps 3.1–4.1 would give trivial two-point stabilizers. Put . Counting the elements fixing exactly one point shows that the set of fixed-point-free elements of has size The set is conjugation invariant under . The number of its elements carrying one point to a different specified point is independent of the ordered pair by -transitivity. Counting these incidences gives , hence . Conjugating the ordered pair to for now shows that are conjugate in .
The action of on the other points is free, so . For each prime , Cauchy's theorem gives an element of order in , necessarily in since . All elements of have the same order, so is a power of a single prime . A Sylow -subgroup of has order , because . All its nonidentity elements are fixed-point-free. Thus is a nontrivial proper -normal subgroup of , contradicting minimality. Hence is primitive.
Suppose is not simple and choose a nontrivial proper minimal normal subgroup of . It is not -normal, so it has a distinct -conjugate . By [L2] for primitive , these are its only two minimal normal subgroups, and they commute and are regular. Thus is -normal, whence ; also . The group is nonabelian: otherwise its permutation centralizer would be , forcing the commuting regular subgroup to equal .
Let . Its index in is two, it contains , and it is transitive. Consequently and . Its normal subgroup has either one orbit or two equal-sized orbits on . Under the regular identification with , these are automorphism orbits on . Thus there are at most two nonidentity element orders in .
If has only one prime divisor, its nontrivial center makes it abelian by [L3] and [L4], contradicting step 7.1. Otherwise Cauchy's theorem shows that there are exactly two prime divisors , and the two equal-sized orbits consist of elements of orders and . No other nonidentity order is possible.
For an element of order , the centralizer has order a power of : if divided its order, Cauchy's theorem would give a commuting element of order , and would have order , an impossibility. By [L5], every -conjugacy class of elements of order has size divisible by . The total number of such elements, , is therefore divisible by , contrary to . This contradiction proves that is simple. It is nonabelian, since a faithful transitive abelian group is regular.
Since is nonregular, [L2] excludes a second minimal normal subgroup of . If its normal centralizer were nontrivial, it would contain a minimal normal subgroup of and thus contain , contrary to nonabelian simplicity. So conjugation embeds in . The subgroup maps to its inner automorphism group, isomorphic to because . This is the almost simple alternative. Together with step 1.1 it proves the claim.
Computing the socle of a finite primitive permutation group
For a finite permutation group given by generators on a finite set, the socle can be computed by a terminating enumeration. First close the generating set under products and inverses; the process stabilizes inside the finite symmetric group and yields the full list of group elements. Enumerate its subsets. A subset is a subgroup exactly when it contains the identity and is closed under products and inverses, and it is normal exactly when conjugation by each group element preserves it. All these tests are finite.
Among the nontrivial normal subgroups retain those having no proper nontrivial normal subgroup of the whole group inside them. These are precisely the minimal normal subgroups of Minimal normal subgroups and the socle of a finite group. Closing their union under products and inverses computes their generated subgroup, which is the socle by that definition. If there are no such subgroups, this closure is the trivial group. This algorithm uses no classification theorem and makes no efficiency claim.
For a faithful primitive action, each retained minimal normal subgroup is transitive by Minimal normal subgroups of faithful primitive groups are transitive. Its orbits can also be computed directly from the finite permutation list. Thus the local structural theorem supplies a concrete consistency condition on the computed normal subgroups and socle. Determining the socle and its orbits provides structural data for further calculations on the given group.
5 · Examples, counterexamples and false statements
FALSE: the socle is always a single simple group
Statement
False claim: for every finite group , the socle is a single simple subgroup.
Facts & Assumptions
Given: A nonabelian finite simple group and the direct product .
Finite characteristically simple groups are direct products of isomorphic simple groups (Finite characteristically simple groups are direct products of isomorphic simple groups).
The socle of a finite group is a direct product of minimal normal subgroups (The socle is characteristic and decomposes as a direct product of minimal normal subgroups).
Refutation
In the group , each factor and is a minimal normal subgroup, and they are distinct.
By [L2], the socle of is the direct product of those minimal normal subgroups, so .
The group is not simple because each factor is a proper nontrivial normal subgroup. Therefore the claim is false.
FALSE: every primitive group has a unique minimal normal subgroup
Statement
False claim: every finite primitive permutation group has a unique minimal normal subgroup.
Facts & Assumptions
Given: A nonabelian finite simple group and the action of on the right cosets of the diagonal subgroup .
Any two distinct minimal normal subgroups of a finite faithful primitive group are regular (Two distinct minimal normal subgroups of a primitive group are regular).
A finite primitive group has at most two minimal normal subgroups (A finite primitive group has at most two minimal normal subgroups).
Refutation
The diagonal subgroup is maximal in : if , an element yields the nontrivial element after multiplication by ; its diagonal conjugates generate by simplicity, and then . Hence the coset action is primitive. Its kernel is the core of . If lies in that core, conjugation by every gives , so because is nonabelian simple. Thus the action is faithful. Its two factors and are distinct minimal normal subgroups.
By [L1], those two minimal normal subgroups are regular. So this primitive action has two distinct minimal normal subgroups, contradicting uniqueness. The corollary [L2] shows that this exceptional size is the largest possible.
FALSE: the O'Nan-Scott theorem is the classification of finite simple groups
Statement
False claim: the O'Nan-Scott theorem is the classification of finite simple groups.
Facts & Assumptions
Given: The names refer to these two classification questions: O'Nan–Scott asks for the socle and action types of finite primitive permutation groups; the classification of finite simple groups asks for the abstract isomorphism types of all finite simple groups. Comparing the questions does not assume the conclusions or proofs of either classification.
A simple group is nontrivial and has no proper nontrivial normal subgroup (Simple groups).
The symmetric group consists of all permutations of a set (The symmetric group : the bijections of a set under composition). A -transitive action moves any ordered pair of distinct points to any other, and is primitive (k-transitive and k-homogeneous actions, Every doubly transitive action is primitive).
Refutation
The natural action of on is -transitive: specifying the images of two distinct points determines a permutation by sending the third point to the remaining point. It is therefore primitive by [L2], and lies in the domain of the O'Nan–Scott classification question.
The subgroup is nontrivial and proper in . Conjugating either -cycle by a permutation merely relabels its three entries, so it gives one of these same two -cycles. Thus is normal and is not simple by [L1]. Consequently the two classification questions have different domains: one includes this action of a nonsimple group, whereas the other classifies simple groups up to abstract isomorphism. Their conclusions also ask for different data, action types versus a list of abstract simple groups. They are not the same theorem.
FALSE: the cited LPS O'Nan-Scott proof uses no CFSG consequence
Statement
False claim: The cited Liebeck–Praeger–Saxl (LPS) proof of the five-type O'Nan–Scott classification uses no consequence of the classification of finite simple groups (CFSG).
Facts & Assumptions
Given: The proof in Liebeck–Praeger–Saxl, On the O'Nan–Scott Theorem for Finite Primitive Permutation Groups (1988), pp. 389–396.
In Case 2(a), on printed p. 394, LPS let be the kernel of the action on the simple direct factors. They say that embeds in a product of outer automorphism groups and is therefore soluble "by the Schreier 'Conjecture'". They then use solubility in the commutator argument proving .
On printed p. 395, in the simple-socle case with trivial socle point stabilizer, LPS again say that is soluble "by the Schreier 'Conjecture'". They use this to choose a minimal normal subgroup of which is elementary abelian, and continue the exclusion argument on printed pp. 395–396.
The Schreier theorem says that the outer automorphism group of every finite nonabelian simple group is soluble. Smith, Applying the Classification of Finite Simple Groups, Theorem 1.5.1 (printed p. 23), identifies it as a consequence of CFSG.
Refutation
The cited LPS proof invokes Schreier explicitly in two branches. In Case 2(a), the invoked solubility is used to prove ; in the simple-socle branch, it supplies the elementary-abelian minimal normal subgroup used in the subsequent argument. These are proof steps, not merely remarks about later refinements.
Schreier is a CFSG consequence. Thus this specific five-type proof does use a CFSG consequence, refuting the stated claim. This establishes neither that CFSG is logically necessary for the theorem nor that another proof could not avoid it.
Sources
- James E. Humphreys, A Course in Group Theory, Chapter 16
- James E. Humphreys, A Course in Group Theory, Corollary 16.12
- James E. Humphreys, A Course in Group Theory, Proposition 16.11
- James E. Humphreys, A Course in Group Theory, Corollary 16.12 and the socle discussion following it
- Leonard H. Soicher, Primitive permutation groups
- J. S. Milne, Group Theory, Chapter 4
- J. S. Milne, Group Theory, Exercise 6.31
- M. W. Liebeck, C. E. Praeger, and J. Saxl, On the O'Nan-Scott Theorem for Finite Primitive Permutation Groups
- M. W. Liebeck, C. E. Praeger and J. Saxl, On the O'Nan-Scott theorem, Section 1
- S. D. Smith, finite simple groups text, Remark 6.1.4, comparison table
- Chris Godsil, Geometry, Sections 29.1–29.2, especially Lemma 29.1.3 and Theorem 29.5.1
- Peter J. Cameron, A note on Burnside's Theorem (elementary correction)
- Computing the socle of a finite primitive permutation group
- Liebeck, Praeger and Saxl, On the O'Nan-Scott theorem for finite primitive permutation groups, Introduction and Section 2
- Liebeck, Praeger and Saxl, On the O'Nan-Scott Theorem for Finite Primitive Permutation Groups, J. Austral. Math. Soc. Ser. A 44 (1988), 389–396
- Stephen D. Smith, Applying the Classification of Finite Simple Groups: A User's Guide, §1.5 and §6.1