Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

59 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources