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.
The O'Nan-Scott classification of finite primitive groups (recorded)
Statement
Every finite primitive permutation group of degree at least 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.
Source status
Liebeck–Praeger–Saxl (LPS), printed p. 392, states the five-branch theorem in the convention used here. Its proof on pp. 392–396 is a genuine case analysis, not a consequence merely of the socle split or of the five definitions. The previous local [A2] assumed exactly the theorem to be proved.
In Case 2(a), printed p. 394, LPS uses solvability of outer automorphism groups of finite simple groups (the Schreier theorem) to prove the kernel of the factor action equals the socle ; this is needed to identify the twisted-wreath action. At the end, printed pp. 395–396, it uses Schreier again to exclude a regular simple socle in the almost-simple branch and to complete the product-action branch. The complete local proof of these steps, or an alternative exact five-type proof, is still missing. This item therefore records the cited classification without claiming it is proved here.
Depends on
Used by
Dependency tree · two levels
7 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
- M. W. Liebeck, C. E. Praeger and J. Saxl, On the O'Nan-Scott Theorem for Finite Primitive Permutation Groups, J. Austral. Math. Soc. Ser. A 44 (1988), 389–396 (standard reference, not scraped)
- Leonard H. Soicher, Primitive permutation groups, section 'The O'Nan-Scott theorem' (standard reference, not scraped)