Alphabeta Math
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.

✓ 14 results · all verified · 5 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 9 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 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

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 N⊴G 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:N⊴G 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,N⊴G 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,N⊴G.

[L1]

Using the convention of Commutators [g,h]=ghg−1h−1 and the commutator subgroup [G,G], put [M,N]:=⟨[m,n]=mnm−1n−1:m∈M, n∈N⟩.

[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.1givenA1

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.

2.1givenA1step 1.1

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

3.1L1step 2.1∎

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

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 M⊴G.

[L1]

If K is characteristic in a normal subgroup M⊴G, 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.1givenL1

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

2.1A1step 1.1∎

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

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 r≥1 such that

G≅Tr.

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 Ni∩⟨Nj:j≠i⟩=1 for every i (Internal direct products of finitely many normal subgroups).

Proof

technique · direct
1.1A1choose

By [A1], choose a minimal normal subgroup N⊴G.

2.1A2step 1.1choose

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 N≠1.

3.1L1A2step 2.1algebra

Fix i and put Pi=⟨Nj:j≠i⟩. The intersection Ni∩Pi 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 Ni∩Pi=1 for every i. Together with step 2.1, [A2], and [L1], this makes G=N1×⋯×Nr an internal direct product.

4.1step 2.1step 3.1algebra∎

Let K⊴Ni. 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 K⊴G. 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 G≅Tr.

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 r≥0 there are pairwise distinct minimal normal subgroups N1,…,Nr⊴G 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.1givenA1

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.

1.2L1choose

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 i≥1, [L1] shows that Ni centralizes N1⋯Ni−1, and minimality gives Ni∩(N1⋯Ni−1)=1 because the intersection is a normal subgroup of G contained in Ni but Ni was chosen outside the preceding product. Hence N1⋯Nr is an internal direct product, with the case r=0 giving the trivial group.

2.1step 1.2L2L3∎

The product N1⋯Nr 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 N1⋯Nr, 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.

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 G≤Sym⁡(Ω) be finite, faithful, and primitive, and let N⊴G 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 N⊴G.

[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.1givenL1

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

2.1A1step 1.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.

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

Two distinct minimal normal subgroups of a primitive group are regular

Statement

Let G≤Sym⁡(Ω) be finite, faithful, and primitive, and let M,N⊴G 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,N⊴G.

[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.1L1L2

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

2.1step 1.1choosealgebra

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

3.1step 2.1∎

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

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 G≤Sym⁡(Ω) be finite and primitive. Then G has at most two minimal normal subgroups.

Facts & Assumptions

Given: A finite primitive permutation group G≤Sym⁡(Ω).

[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.1givenL1

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.

2.1A1step 1.1choose

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

3.1L2step 2.1algebra∎

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.

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

A unique abelian minimal normal subgroup gives affine type

Statement

Let G≤Sym⁡(Ω) be a finite faithful primitive group, and suppose that V⊴G 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 G≤Sym⁡(Ω) 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.1givenL1

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

1.2L2L3L4A1

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 d≥1.

2.1step 1.1step 1.2algebra∎

Fix α∈Ω. Because V is regular, every g∈Gα 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 v∈V, 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.

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

T≤G≤Aut⁡(T).

The subgroup T is then the socle of G.

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-09-09 (gpt-6-astra)Open item page →

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

Definition

For a finite primitive permutation group G≤Sym⁡(Ω), 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 k≥2, 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)≤G≤H≀K, where K≤Sℓ is the transitive group induced by G on the coordinates and the wreath product has its product action. If (h1,…,hℓ;k)∈Hℓ⋊K, its product action is (δ1,…,δℓ)⟼(δk−1(1)hk−1(1),…,δk−1(ℓ)hk−1(ℓ)).
  • Twisted wreath type: G is permutation equivalent to the following group on B, and this action is primitive. Take a finite nonabelian simple group T, a faithful transitive permutation group P≤Sk, k≥2, its point stabilizer Q=P1, and a homomorphism φ:Q→Aut⁡(T) whose image contains Inn⁡(T). With automorphisms composed as left operators, set B={f:P→T:f(xq)=φ(q)−1(f(x)) for every x∈P,q∈Q}. Multiplication in B is pointwise. Define αp(f)(x)=f(p−1x). The twisted wreath product is B⋊αP, with the convention of The external semidirect product N⋊αH, acting on B by (b,p)⋅c=bαp(c). Its socle is the unique minimal normal subgroup B≅Tk, acting regularly; its degree is ∣T∣k. Primitivity is a required condition on these data, not a consequence of transitivity of P alone.

The function construction is well defined: specifying values on one representative of each of the k cosets xQ determines a unique function, because φ(q1q2)−1=φ(q2)−1φ(q1)−1. Evaluation there identifies the pointwise group with Tk. The maps αp preserve its defining condition and satisfy αpαr=αpr, so The semidirect-product multiplication makes N×H a group applies and the displayed permutation formula respects multiplication. These are finite choices.

For the socle assertion, the normal subgroups of Tk 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 T then give the entire factor whenever its projection is nontrivial. The transitive action of P on the factors makes B minimal normal. If an element (b,p) centralizes B, then αp is an inner automorphism of B and hence fixes every factor. Faithfulness of P forces p=1, and then b is central in B, so b=1. Any distinct minimal normal subgroup would centralize B (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.

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 H≤Sym⁡(Δ) be primitive but not regular, let K≤Sℓ be transitive with ℓ≥2, and let H≀K 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 H≀K 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.1A2choosealgebra

Let B⊆Δℓ be a block containing distinct points x and y, and choose a coordinate i with xi≠yi. By [A2], some h∈Hxi moves yi. Let a∈Hℓ act as h in coordinate i and trivially elsewhere. Then a fixes x, so aB∩B≠∅ and the block property gives aB=B. Hence y,ay∈B are distinct and differ in exactly coordinate i.

2.1step 1.1algebra

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.

3.1A1step 2.1algebra∎

The stabilizer in H≀K 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.

RemarkRemark: AI-adaptedProof: Not applicableverified 2026-09-09 (gpt-6-astra)Open 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 five labels in Affine, almost simple, diagonal, product action, and twisted wreath types, the correspondence with the Liebeck–Praeger–Saxl convention is:

Five-type branchModern 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.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)Open 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. More precisely, it has a unique minimal normal subgroup N; either N is elementary abelian and regular, with a faithful irreducible point-stabilizer action, or N is nonabelian simple and N≤G≤Aut⁡(N).

Facts & Assumptions

Given: A finite 2-transitive permutation group G≤Sym⁡(Ω), with n=∣Ω∣≥2.

[L1]

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.

[L3]

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

[L6]

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

technique · direct
1.1givenL1L2L3L4L6algebra

Choose a minimal normal subgroup N≠1, possible by finiteness. It is transitive by [L1]. If N is regular, identify Ω with N by u↦uα. Conjugation by Gα is transitive on N∖{1}, so all nonidentity elements have the same order, necessarily a prime p by taking powers. By Cauchy's theorem N is a p-group; its nontrivial characteristic center equals N by [L3]. Thus N is elementary abelian. A permutation centralizing a regular group is determined by its value at α; for abelian N it is the corresponding translation. A second minimal normal subgroup would therefore lie in N by [L2], which is impossible. The affine conclusion follows from [L6].

2.1step 1.1givenalgebra

Assume henceforth that N is nonregular. Since Nα⊴Gα, all its orbits on Ω∖{α} have a common size m. Transitivity of N gives the same size at every point. Here m>1, for otherwise Nα fixes every point and is trivial.

3.1step 2.1L5algebra

We establish a finite permutation fact: a faithful transitive group U whose nontrivial suborbits all have size m>1 is primitive or has trivial two-point stabilizers. Suppose B is a block of size 1<k<n, with b∈B and i∉B. Since Ub preserves B, m∣(k−1), so gcd⁡(k,m)=1. The union of the translates of B under Ui is a union both of blocks of size k and of suborbits of size m; its size is at most km, so equals km. Thus the setwise stabilizer Ui,B has index m in Ui.

4.1step 3.1L5algebra

For every b∈B, Ui,b≤Ui,B and both have index m, so they agree. In particular this group fixes B pointwise. If b′∈B∖{b}, then Ui,b≤U(B)≤Ub,b′, where U(B) is the pointwise stabilizer. All two-point stabilizers have order ∣U∣/(nm), so both inclusions are equalities. Applying the same argument to the block C containing i gives U(B)=U(C). 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.

5.1step 2.1step 4.1givenalgebra

If N were imprimitive, steps 3.1–4.1 would give trivial two-point stabilizers. Put h=∣Nα∣>1. Counting the elements fixing exactly one point shows that the set D of fixed-point-free elements of N has size ∣D∣=nh−1−n(h−1)=n−1. The set D is conjugation invariant under G. The number a of its elements carrying one point to a different specified point is independent of the ordered pair by 2-transitivity. Counting these incidences gives n(n−1)=an(n−1), hence a=1. Conjugating the ordered pair (α,dα) to (α,eα) for d,e∈D now shows that d,e are conjugate in G.

6.1step 5.1L4L5algebra

The action of Nα on the other points is free, so h∣(n−1). For each prime p∣n, Cauchy's theorem gives an element of order p in N, necessarily in D since p∤h. All elements of D have the same order, so n is a power of a single prime p. A Sylow p-subgroup P of N has order n, because p∤h. All its nonidentity elements are fixed-point-free. Thus P=D∪{1} is a nontrivial proper G-normal subgroup of N, contradicting minimality. Hence N is primitive.

7.1step 6.1L1L2algebra

Suppose N is not simple and choose a nontrivial proper minimal normal subgroup M of N. It is not G-normal, so it has a distinct G-conjugate M′. By [L2] for primitive N, these are its only two minimal normal subgroups, and they commute and are regular. Thus MM′ is G-normal, whence N=MM′; also M∩M′=1. The group M is nonabelian: otherwise its permutation centralizer would be M, forcing the commuting regular subgroup M′ to equal M.

8.1step 7.1L5algebra

Let H=NG(M). Its index in G is two, it contains N, and it is transitive. Consequently G=HGα and [Gα:Hα]=2. Its normal subgroup Hα⊴Gα has either one orbit or two equal-sized orbits on Ω∖{α}. Under the regular identification with M, these are automorphism orbits on M∖{1}. Thus there are at most two nonidentity element orders in M.

9.1step 7.1step 8.1L3L4algebra

If ∣M∣ 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 p,q, and the two equal-sized orbits consist of elements of orders p and q. No other nonidentity order is possible.

10.1step 9.1L4L5algebra

For an element x of order p, the centralizer CM(x) has order a power of p: if q divided its order, Cauchy's theorem would give a commuting element y of order q, and xy would have order pq, an impossibility. By [L5], every M-conjugacy class of elements of order p has size divisible by q. The total number of such elements, (∣M∣−1)/2, is therefore divisible by q, contrary to q∣∣M∣. This contradiction proves that N is simple. It is nonabelian, since a faithful transitive abelian group is regular.

11.1step 1.1step 10.1L2L6algebra∎

Since N is nonregular, [L2] excludes a second minimal normal subgroup of G. If its normal centralizer CG(N) were nontrivial, it would contain a minimal normal subgroup of G and thus contain N, contrary to nonabelian simplicity. So conjugation embeds G in Aut⁡(N). The subgroup N maps to its inner automorphism group, isomorphic to N because Z(N)=1. This is the almost simple alternative. Together with step 1.1 it proves the claim.

RemarkRemark: Literature-sourcedProof: Not applicableOpen item page →

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 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.1given

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

2.1L2step 1.1

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

3.1L1step 2.1∎

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

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):t∈T}.

[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.1givenchoosealgebra

The diagonal subgroup is maximal in T×T: if Δ(T)<L, an element (a,b)∈L∖Δ(T) yields the nontrivial element (1,ba−1)∈L after multiplication by (a−1,a−1); 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 (xtx−1,t)∈Δ(T), so t∈Z(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.

2.1L1L2step 1.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.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)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 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.

[L1]

A simple group is nontrivial and has no proper nontrivial normal subgroup (Simple groups).

[L2]

The symmetric group consists of all permutations of a set (The symmetric group Sym⁡(X): the bijections of a set X under composition). A 2-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

technique · direct
1.1givenL2algebra

The natural action of S3 on {1,2,3} is 2-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.

2.1step 1.1givenL1algebra∎

The subgroup A={1,(123),(132)} is nontrivial and proper in S3. Conjugating either 3-cycle by a permutation merely relabels its three entries, so it gives one of these same two 3-cycles. Thus A is normal and S3 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 statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

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.

[F1]

In Case 2(a), on printed p. 394, LPS let Y be the kernel of the action on the simple direct factors. They say that Yα 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 Y=M.

[F2]

On printed p. 395, in the simple-socle case with trivial socle point stabilizer, LPS again say that Gα is soluble "by the Schreier 'Conjecture'". They use this to choose a minimal normal subgroup Q of Gα which is elementary abelian, and continue the exclusion argument on printed pp. 395–396.

[F3]

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

technique · direct
1.1F1F2

The cited LPS proof invokes Schreier explicitly in two branches. In Case 2(a), the invoked solubility is used to prove Y=M; 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.

2.1F3step 1.1∎

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