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.
A5 as the smallest nonabelian simple group
Example
is the smallest nonabelian finite simple group.
Facts & Assumptions
Given: The alternating group and finite groups of order less than .
is simple for ( is simple for every ).
If with , then and (Sylow III: and when with ). The Sylow subgroups form a single conjugacy class (Sylow II: in a finite group every -subgroup lies in a conjugate of any Sylow -subgroup, and the Sylow -subgroups form a single conjugacy class), and a unique Sylow subgroup is normal (A Sylow -subgroup is normal if and only if it is unique).
A nontrivial finite -group has nontrivial center (Every nontrivial finite -group has nontrivial center, in fact divides ).
Subgroup orders divide group orders (Lagrange's theorem: for every subgroup of a finite group ); is the kernel of sign (The alternating group of even permutations).
Verification
By [L1], is simple. Multiplication by a transposition pairs the even and odd permutations, so . The even permutations and do not commute: whereas . Thus is nonabelian.
Suppose is nonabelian simple and . Its order cannot be or a prime power: in the latter case its nontrivial normal center from [L3] would be all of , making abelian. For every prime divisor of its order, [L2] therefore gives .
The non-prime-power integers between and , apart from , are For each integer in this list, take its largest prime divisor . Inspection of the divisors of shows that is the only divisor congruent to modulo . Thus [L2] gives , excluding every order in the list.
A nontrivial conjugation action of a simple group on its Sylow subgroups is faithful: the kernel is normal and cannot be all of , because the action is transitive. Thus embeds in . The sign of this action is trivial, since a nontrivial homomorphism from nonabelian simple to the group of order two would be injective. Consequently embeds in . For orders , [L2] gives . Since , [L4] rules out ; at order the image would be all of , which is not simple: its identity and three double transpositions form a proper nontrivial subgroup preserved by conjugation. For order , [L2] gives , contradicting an embedding of into , of order .
For order , [L2] and step 1.2 force and . Distinct subgroups of prime order intersect only in the identity by [L4], so these supply distinct nonidentity elements, impossible. For order , the same rules give and . The eight subgroups of order supply distinct nonidentity elements. Every Sylow -subgroup has order , and its seven nonidentity elements must be the seven remaining nonidentity elements of . All Sylow -subgroups would therefore coincide, contradicting .
Steps 1.2–2.2 exclude every order below , while step 1.1 supplies a nonabelian simple group of order . Hence is the smallest nonabelian finite simple group. [step 1.1, step 1.2, step 2.1, step 2.2, step 2.3].
Depends on
- $A_n$ is simple for every $n\ge5$
- Sylow III: $n_p\equiv1\pmod p$ and $n_p\mid m$ when $|G|=p^a m$ with $p\nmid m$
- Sylow II: in a finite group every $p$-subgroup lies in a conjugate of any Sylow $p$-subgroup, and the Sylow $p$-subgroups form a single conjugacy class
- A Sylow $p$-subgroup is normal if and only if it is unique
- Every nontrivial finite $p$-group has nontrivial center, in fact $p$ divides $|Z(P)|$
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- The alternating group $A_n=\ker(\operatorname{sgn})$ of even permutations
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
35 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
- Stephen D. Smith, CFSG—A User’s Manual (standard reference, not scraped)