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.
FALSE: every primitive group has a unique minimal normal subgroup
Statement
False claim: every finite primitive permutation group has a unique minimal normal subgroup.
Facts & Assumptions
Given: A nonabelian finite simple group and the action of on the right cosets of the diagonal subgroup .
Any two distinct minimal normal subgroups of a finite faithful primitive group are regular (Two distinct minimal normal subgroups of a primitive group are regular).
A finite primitive group has at most two minimal normal subgroups (A finite primitive group has at most two minimal normal subgroups).
Refutation
The diagonal subgroup is maximal in : if , an element yields the nontrivial element after multiplication by ; its diagonal conjugates generate by simplicity, and then . Hence the coset action is primitive. Its kernel is the core of . If lies in that core, conjugation by every gives , so because is nonabelian simple. Thus the action is faithful. Its two factors and are distinct minimal normal subgroups.
By [L1], those two minimal normal subgroups are regular. So this primitive action has two distinct minimal normal subgroups, contradicting uniqueness. The corollary [L2] shows that this exceptional size is the largest possible.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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)