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 -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.
Depends on
- Almost simple finite groups
- k-transitive and k-homogeneous actions
- Every doubly transitive action is primitive
- Minimal normal subgroups of faithful primitive groups are transitive
- A finite primitive group has at most two minimal normal subgroups
- Two distinct minimal normal subgroups of a primitive group are regular
- Distinct minimal normal subgroups centralize one another
- Minimal normal subgroups of finite groups are characteristically simple
- A unique abelian minimal normal subgroup gives affine type
- Cauchy's theorem: if a prime $p$ divides $|G|$, then $G$ has an element of order $p$
- Sylow I: every finite group has a Sylow $p$-subgroup
- Every nontrivial finite $p$-group has nontrivial center, in fact $p$ divides $|Z(P)|$
- Orbit-stabiliser cardinality: $|G\cdot x|=[G:G_x]$ whenever either side is finite, and $|G|=|G_x|\,|G\cdot x|$ for finite $G$
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
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
- Chris Godsil, Geometry, Sections 29.1–29.2, especially Lemma 29.1.3 and Theorem 29.5.1 (standard reference, not scraped)
- Peter J. Cameron, A note on Burnside's Theorem (elementary correction) (standard reference, not scraped)