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.
Facts & Assumptions
Given: A finite -transitive permutation group of degree at least .
Every doubly transitive action is primitive (Every doubly transitive action is primitive).
In the finite O'Nan-Scott classification, the diagonal, product-action, and twisted-wreath types do not occur for -transitive groups.
Proof
By [L1], the -transitive action of is primitive, so the O'Nan-Scott classification applies to it.
The source fact [A1] removes the diagonal, product-action, and twisted-wreath branches from the primitive classification. Therefore the only remaining possibilities are affine type and almost simple type.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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)