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.
Every solvable group is abelian
Statement
False. Every solvable group is abelian.
Facts & Assumptions
Given: The symmetric group .
A group is solvable when its derived series reaches (The derived series, solvable groups, and derived length).
and ( for , and for ).
Refutation
By [L1], the derived series reaches , so is solvable by [F1].
The transpositions and do not commute, since while .
Thus the solvable group is nonabelian, refuting the statement.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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
- J. S. Milne, Group Theory, Chapter 6 (standard reference, not scraped)
- K. Conrad, Subgroup Series I (standard reference, not scraped)
- K. Igusa, Notes on Jordan-Hölder, section 5 (standard reference, not scraped)