Alphabeta Math
Session-authored (Fable 5 assisted)
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.

15 results · all verified · 8 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Socles and the Onan Scott Landscape

1 · Prerequisites

2 · Summary

This page isolates the socle-level structure behind finite primitive groups. The local development proves the elementary minimal-normal-subgroup facts that make the type language honest, and then records the five-type O'Nan-Scott landscape in the same convention used by the batch sources. The page is meant to explain how primitive groups reduce to their socles, not to reproduce the later CFSG-driven case analysis.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-27Open item page →

Minimal normal subgroups and the socle of a finite group

Definition

Let G be a finite group.

A nontrivial normal subgroup NG is a minimal normal subgroup of G if the only normal subgroups of G contained in N are 1 and N itself.

The socle of G is the subgroup

soc(G):=N:NG is a minimal normal subgroup,

that is, the subgroup generated in the sense of The subgroup S generated by a subset, the cyclic subgroup g, and cyclic groups by all minimal normal subgroups of G.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-27Open item page →

Distinct minimal normal subgroups centralize one another

Statement

Let G be a finite group, and let M,NG be distinct minimal normal subgroups. Then every element of M commutes with every element of N. Equivalently, [M,N]=1.

Facts & Assumptions

Given: A finite group G and distinct minimal normal subgroups M,NG.

[L1]

Using the convention of Commutators [g,h]=ghg1h1 and the commutator subgroup [G,G], put [M,N]:=[m,n]=mnm1n1:mM, nN.

[A1]

Because M and N are normal in G, the subgroup [M,N] is normal in G and is contained in both M and N.

Proof

technique · direct
1.1

By [A1], the subgroup [M,N] is a normal subgroup of G contained in M. Since M is minimal normal, either [M,N]=1 or [M,N]=M.

givenA1
2.1

The same argument with N shows that either [M,N]=1 or [M,N]=N. Because MN, the subgroup [M,N] cannot equal both M and N.

givenA1step 1.1
3.1

Therefore [M,N]=1. By [L1], every commutator [m,n] is trivial, so mn=nm for all mM and nN.

L1step 2.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

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 G and a minimal normal subgroup MG.

[L1]

If K is characteristic in a normal subgroup MG, then K is normal in G (If K is characteristic in N and N is normal in G, then K is normal in G).

[A1]

A finite group is characteristically simple exactly when it has no proper nontrivial characteristic subgroup.

Proof

technique · direct
1.1

Let K be a characteristic subgroup of M. By [L1], the subgroup K is normal in G. Since KM and M is minimal normal in G, either K=1 or K=M.

givenL1
2.1

Thus M has no proper nontrivial characteristic subgroup, so [A1] shows that M is characteristically simple.

A1step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

Finite characteristically simple groups are direct products of isomorphic simple groups

Statement

Let G be a nontrivial finite characteristically simple group. Then there is a finite simple group T and an integer r1 such that

GTr.

In particular, G is an internal direct product of pairwise isomorphic simple normal subgroups.

Facts & Assumptions

Given: A nontrivial finite characteristically simple group G.

[A1]

Every nontrivial finite group has a minimal normal subgroup.

[A2]

If N is a minimal normal subgroup of a finite characteristically simple group G, then every automorphic image of N is again a minimal normal subgroup, distinct images centralize one another, and the subgroup generated by all such images is characteristic in G.

[L1]

Normal subgroups N1,,Nr form an internal direct product when they generate the ambient group and NiNj:ji=1 for every i (Internal direct products of finitely many normal subgroups).

Proof

technique · direct
1.1

By [A1], choose a minimal normal subgroup NG.

A1choose
2.1

Let N1,,Nr be an irredundant family of automorphic images of N that generates the subgroup H generated by all automorphic images. By [A2], the subgroup H is characteristic in G, so H=G because G is characteristically simple and N1.

A2step 1.1choose
3.1

Fix i and put Pi=Nj:ji. The intersection NiPi is normal in G: both factors are normal, and the intersection is preserved by conjugation. Minimality of Ni makes this intersection either 1 or Ni. The latter would put Ni inside the subgroup generated by the other images, contradicting irredundancy. Hence NiPi=1 for every i. Together with step 2.1, [A2], and [L1], this makes G=N1××Nr an internal direct product.

L1A2step 2.1algebra
4.1

Let KNi. Since the other direct factors centralize Ni, conjugation by them fixes K, while conjugation by Ni preserves K by normality. Step 3.1 says these factors generate G, so KG. Minimality of Ni gives K=1 or K=Ni; thus Ni is simple. All Ni are automorphic images of N, so they are pairwise isomorphic to one finite simple group T. Therefore GTr.

step 2.1step 3.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

The socle is characteristic and decomposes as a direct product of minimal normal subgroups

Statement

Let G be a finite group. Then soc(G) is a characteristic subgroup of G. Moreover, for some integer r0 there are pairwise distinct minimal normal subgroups N1,,NrG such that

soc(G)=N1××Nr.

Here the case r=0 means the empty direct product, namely the trivial group.

Facts & Assumptions

Given: A finite group G.

[L1]

Distinct minimal normal subgroups of G centralize one another (Distinct minimal normal subgroups centralize one another).

[L2]

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).

[L3]

Every minimal normal subgroup of a finite group is characteristically simple (Minimal normal subgroups of finite groups are characteristically simple).

[A1]

Automorphisms of G permute its minimal normal subgroups.

Proof

technique · direct
1.1

By [A1], the subgroup generated by all minimal normal subgroups of G is stable under every automorphism of G. By definition this subgroup is soc(G), so soc(G) is characteristic in G.

givenA1
1.2

Let N1,,Nr be a maximal family of pairwise distinct minimal normal subgroups of G chosen so that none is contained in the product of the preceding ones; when G=1, this family is empty. For i1, [L1] shows that Ni centralizes N1Ni1, and minimality gives Ni(N1Ni1)=1 because the intersection is a normal subgroup of G contained in Ni but Ni was chosen outside the preceding product. Hence N1Nr is an internal direct product, with the case r=0 giving the trivial group.

L1choose
2.1

The product N1Nr is generated by minimal normal subgroups, so it lies in soc(G). Conversely, if M is any minimal normal subgroup of G not contained in N1Nr, then adjoining M would contradict maximality of the chosen family; therefore every minimal normal subgroup of G lies in the displayed product. Thus soc(G)=N1××Nr. By [L3], each nontrivial factor Ni is characteristically simple, and [L2] then makes it a direct product of isomorphic simple groups.

step 1.2L2L3
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

Minimal normal subgroups of faithful primitive groups are transitive

Statement

Let GSym(Ω) be finite, faithful, and primitive, and let NG be a minimal normal subgroup. Then N acts transitively on Ω.

Facts & Assumptions

Given: A finite faithful primitive action of G on Ω and a minimal normal subgroup NG.

[L1]

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).

[A1]

A faithful action has trivial kernel.

Proof

technique · direct
1.1

By [L1], the normal subgroup N is either transitive or contained in the kernel of the action.

givenL1
2.1

The action is faithful, so [A1] gives trivial kernel. Because N is a minimal normal subgroup, it is nontrivial, so the kernel-contained alternative from step 1.1 is impossible. Hence N is transitive.

A1step 1.1
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-27Open item page →

Two distinct minimal normal subgroups of a primitive group are regular

Statement

Let GSym(Ω) be finite, faithful, and primitive, and let M,NG be distinct minimal normal subgroups. Then both M and N act regularly on Ω.

Facts & Assumptions

Given: A finite faithful primitive action of G on Ω and distinct minimal normal subgroups M,NG.

[L1]

Distinct minimal normal subgroups centralize one another (Distinct minimal normal subgroups centralize one another).

[L2]

Every minimal normal subgroup of a finite faithful primitive group is transitive (Minimal normal subgroups of faithful primitive groups are transitive).

Proof

technique · direct
1.1

By [L2], both M and N are transitive on Ω. By [L1], every element of M commutes with every element of N.

L1L2
2.1

Fix αΩ, and let mMα. For any βΩ, choose nN with nα=β; then mβ=mnα=nmα=nα=β. Hence every element of Mα fixes every point of Ω, so faithfulness gives Mα=1.

step 1.1choosealgebra
3.1

The subgroup M is transitive with trivial point stabilizer, so it is regular. By symmetry the same argument applies to N.

step 2.1
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

A finite primitive group has at most two minimal normal subgroups

Statement

Let GSym(Ω) be finite and primitive. Then G has at most two minimal normal subgroups.

Facts & Assumptions

Given: A finite primitive permutation group GSym(Ω).

[L1]

Any two distinct minimal normal subgroups of G are regular (Two distinct minimal normal subgroups of a primitive group are regular).

[L2]

Distinct minimal normal subgroups centralize one another (Distinct minimal normal subgroups centralize one another).

[A1]

A regular permutation group has exactly one element sending a chosen point to a chosen point.

Proof

technique · direct
1.1

Suppose that M1,M2,M3 are three distinct minimal normal subgroups of G. By [L1], each pair among them is regular. In particular, M1 and M2 are both regular.

givenL1
2.1

Fix αΩ. Because M1 is regular, the map mmα identifies M1 with the set Ω, and because M2 is regular there is for each βΩ a unique element n(β)M2 with n(β)α=β by [A1].

A1step 1.1choose
3.1

Applying [L2] to the pair (M1,M3) shows that M3 centralizes M1. Hence every element of M3 acts on the identified copy of M1 by right translation. But M2 already has that property by step 2.1, and the right-regular subgroup centralizing the left-regular action of M1 is unique. Therefore M3=M2, contradicting distinctness. So no third minimal normal subgroup exists.

L2step 2.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

A unique abelian minimal normal subgroup gives affine type

Statement

Let GSym(Ω) be a finite faithful primitive group, and suppose that VG is its unique minimal normal subgroup and that V is abelian. Then:

  1. V is regular on Ω;
  2. V is elementary abelian, so V(Fp)d for some prime p;
  3. for every αΩ, the point stabilizer Gα acts faithfully and irreducibly on the vector space V.

In the O'Nan-Scott language, G is of affine type.

Facts & Assumptions

Given: A finite faithful primitive group GSym(Ω) with unique abelian minimal normal subgroup V.

[L1]

Every nontrivial abelian normal subgroup of a faithful primitive action is regular (Abelian normal subgroups of faithful primitive actions are regular).

[L2]

Every minimal normal subgroup of a finite group is characteristically simple (Minimal normal subgroups of finite groups are characteristically simple).

[A1]

A finite abelian characteristically simple group is elementary abelian.

[L3]

An elementary abelian p-group is canonically a vector space over Fp (An elementary abelian p-group has a canonical Fp-vector-space structure).

[L4]

Every finite elementary abelian p-group has a finite basis over Fp (Finite elementary abelian p-groups have bases, basis extension, and a well-defined dimension).

Proof

technique · direct
1.1

By [L1], the abelian normal subgroup V is regular on Ω.

givenL1
1.2

By [L2], the minimal normal subgroup V is characteristically simple; as it is also abelian, [A1] shows that V is elementary abelian. Facts [L3] and [L4] therefore identify V with (Fp)d for some prime p and some d1.

L2L3L4A1
2.1

Fix αΩ. Because V is regular, every gGα acts on V by conjugation and the kernel of this action is GαCG(V). If a nontrivial element of Gα centralized V, then it would fix every point vα with vV, contradicting faithfulness; so the action is faithful. If W<V were a nontrivial proper Gα-invariant subgroup, then W would be normal in VGα=G, contradicting minimality of V. Thus the action is irreducible, and G is of affine type.

step 1.1step 1.2algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

Almost simple finite groups

Definition

A finite group G is almost simple if there is a nonabelian finite simple group T such that

TGAut(T).

The subgroup T is then the socle of G.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-27Open item page →

Affine, almost simple, diagonal, product action, and twisted wreath types

Definition

For a finite primitive permutation group GSym(Ω), 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 Tk, with k2, 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 2, there is a primitive group H on Δ of almost simple or diagonal type, with N=Soc(H), such that N=Soc(G)GHK, where KS is the transitive group induced by G on the coordinates and the wreath product has its product action. If (h1,,h;k)HK, its product action is (δ1,,δ)(δk1(1)hk1(1),,δk1()hk1()).
  • Twisted wreath type: the socle is again regular and nonabelian, but the regular action is built from a twisted wreath product rather than from an abelian vector-space action.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

Product-action wreath products are primitive under the standard hypotheses

Statement

Let HSym(Δ) be primitive but not regular, let KS be transitive with 2, and let HK act on Δ in its standard product action. Then this action is primitive.

Facts & Assumptions

Given: A primitive nonregular action of H on Δ, a transitive action of K on {1,,} with 2, and the induced product action of HK on Δ.

[A1]

In the standard product action, the base group H acts coordinatewise and the top group K permutes the coordinates transitively.

[A2]

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

technique · direct
1.1

Let BΔ be a block containing distinct points x and y, and choose a coordinate i with xiyi. By [A2], some hHxi moves yi. Let aH act as h in coordinate i and trivially elsewhere. Then a fixes x, so aBB and the block property gives aB=B. Hence y,ayB are distinct and differ in exactly coordinate i.

A2choosealgebra
2.1

Fixing the other coordinates, the set of possible entries in coordinate i among points of B is a block for H. It contains the two distinct entries from step 1.1, so primitivity of H makes it all of Δ. Thus B contains the entire i-coordinate fibre through y.

step 1.1algebra
3.1

The stabilizer in HK of any point of Δ induces the transitive group K on the coordinates: a coordinate permutation can be followed by coordinatewise elements of the transitive group H 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 B=Δ. Hence every block is a singleton or the whole set, so the product action is primitive.

A1step 2.1algebra
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

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 coarse five labels on this page, the broad diagonal branch is resolved into HS, HC, SD, and CD; the other four labels correspond to HA, AS, PA, and TW. This page keeps the older coarse convention because that is the resolution of the accessible survey source and is sufficient for the rest of this batch.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

The O'Nan-Scott classification of finite primitive groups

Statement

Every finite primitive permutation group of degree at least 2 belongs to exactly one of the five coarse O'Nan-Scott types used on this page: affine, almost simple, diagonal, product action, or twisted wreath.

Facts & Assumptions

Given: A finite primitive permutation group GSym(Ω) of degree at least 2.

[A1]

In a primitive action of degree at least 2, every nontrivial normal subgroup is transitive and the socle is a direct product of one or two minimal normal subgroups.

[A2]

The finite O'Nan-Scott analysis organizes exactly those socle patterns into the five coarse families used on this page.

[L1]

The local items on this page define those five types and explain their socle data (Affine, almost simple, diagonal, product action, and twisted wreath types).

Proof

technique · direct
1.1

Because the action has degree at least 2, it is nontrivial. The socle analysis [A1] therefore applies to G and reduces the action to the structure of one or two minimal normal subgroups.

givenA1
2.1

The source theorem [A2] says that those socle configurations fall into exactly five families, and [L1] records the names and defining data of those families in the convention used here. Hence G belongs to exactly one of the five listed types.

A2L1step 1.1
RemarkRemark: Literature-sourcedProof: Not supplied sources checked 2026-08-27 not proved hereOpen item page →
Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

CFSG enters later refinements of the O'Nan-Scott reduction

The O'Nan-Scott theorem classifies finite primitive permutation groups by the structure of their socles and actions. Later refinements, especially the detailed analysis of the almost simple and related families, bring in the classification of finite simple groups.

This page records that boundary but does not prove it here. The local argument stops at the structural reduction given by The O'Nan-Scott classification of finite primitive groups.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-27Open item page →

Finite 2-transitive groups have affine or almost simple socle type

Statement

Every finite 2-transitive permutation group of degree at least 2 is of affine type or almost simple type.

Facts & Assumptions

Given: A finite 2-transitive permutation group GSym(Ω) of degree at least 2.

[L1]

Every doubly transitive action is primitive (Every doubly transitive action is primitive).

[A1]

In the finite O'Nan-Scott classification, the diagonal, product-action, and twisted-wreath types do not occur for 2-transitive groups.

Proof

technique · direct
1.1

By [L1], the 2-transitive action of G is primitive, so the O'Nan-Scott classification applies to it.

givenL1
2.1

The source fact [A1] removes the diagonal, product-action, and twisted-wreath branches from the primitive classification. Therefore the only remaining possibilities are affine type and almost simple type.

A1step 1.1
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

The O'Nan-Scott theorem reduces finite primitive-group questions to socle types

The practical value of the O'Nan-Scott theorem is reduction. Once a finite primitive permutation group is assigned a socle type, many structural and algorithmic questions can be handled case by case inside the affine, almost-simple, diagonal, product-action, or twisted-wreath branches instead of starting from an arbitrary primitive action.

5 · Examples, counterexamples and false statements

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-08-27Open item page →

FALSE: the socle is always a single simple group

Statement

False claim: for every finite group G, the socle soc(G) is a single simple subgroup.

Facts & Assumptions

Given: A nonabelian finite simple group T and the direct product G=T×T.

[L1]

Finite characteristically simple groups are direct products of isomorphic simple groups (Finite characteristically simple groups are direct products of isomorphic simple groups).

[L2]

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

technique · direct
1.1

In the group G=T×T, each factor T×1 and 1×T is a minimal normal subgroup, and they are distinct.

given
2.1

By [L2], the socle of G is the direct product of those minimal normal subgroups, so soc(G)=T×T.

L2step 1.1
3.1

The group T×T is not simple because each factor is a proper nontrivial normal subgroup. Therefore the claim is false.

L1step 2.1
False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-08-27Open item page →

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 T and the action of T×T on the right cosets of the diagonal subgroup Δ(T)={(t,t):tT}.

[L1]

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).

[L2]

A finite primitive group has at most two minimal normal subgroups (A finite primitive group has at most two minimal normal subgroups).

Refutation

technique · direct
1.1

The diagonal subgroup is maximal in T×T: if Δ(T)<L, an element (a,b)LΔ(T) yields the nontrivial element (1,ba1)L after multiplication by (a1,a1); its diagonal conjugates generate 1×T by simplicity, and then L=T×T. Hence the coset action is primitive. Its kernel is the core of Δ(T). If (t,t) lies in that core, conjugation by every (x,1) gives (xtx1,t)Δ(T), so tZ(T)=1 because T is nonabelian simple. Thus the action is faithful. Its two factors T×1 and 1×T are distinct minimal normal subgroups.

givenchoosealgebra
2.1

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.

L1L2step 1.1
False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27 rests on unproved material (inherited)Open item page →

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 finite O'Nan-Scott theorem and the classification of finite simple groups are distinct named results.

[L1]

The O'Nan-Scott theorem classifies finite primitive permutation groups of degree at least 2 by socle type (The O'Nan-Scott classification of finite primitive groups).

[A1]

Later refinements involving finite simple groups lie beyond the structural O'Nan-Scott reduction.

Refutation

technique · direct
1.1

By [L1], the O'Nan-Scott theorem concerns primitive permutation actions, not the class of all finite simple groups.

L1
2.1

The sourced boundary fact [A1] separates the structural reduction from the later theory of finite simple groups. Therefore the two theorems serve different purposes, and the claim is false.

A1step 1.1
False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27 rests on unproved material (inherited)Open item page →

FALSE: the O'Nan-Scott theorem requires the classification of finite simple groups

Statement

False claim: the O'Nan-Scott theorem itself requires the classification of finite simple groups.

Facts & Assumptions

Given: The structural O'Nan-Scott theorem and its later applications.

[L1]

The O'Nan-Scott theorem gives a structural classification of finite primitive groups of degree at least 2 (The O'Nan-Scott classification of finite primitive groups).

[A1]

The classification of finite simple groups enters later refinements rather than the structural reduction itself.

Refutation

technique · direct
1.1

The theorem [L1] is already a completed structural classification of finite primitive permutation groups.

L1
2.1

The sourced boundary fact [A1] states that CFSG is used later, not in the theorem itself. So the claim is false.

A1step 1.1

Sources