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.
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.
Depends on
Used by
- A transitive imprimitive action can have a nontransitive minimal normal subgroup Counterexample
- A primitive product-action wreath product Example
- A simple diagonal action Example
- The natural action of AGL(1,p) is affine type Example
- The natural action of Aₙ is almost simple type Example
- Product-action wreath products are primitive under the standard hypotheses Lemma
- This page uses the coarse five-type O'Nan-Scott convention Remark
Dependency tree · two levels
20 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
- Leonard H. Soicher, Primitive permutation groups (standard reference, not scraped)
- M. W. Liebeck, C. E. Praeger, and J. Saxl, On the O'Nan-Scott Theorem for Finite Primitive Permutation Groups (standard reference, not scraped)