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.
Nilpotent groups, and in particular finite -groups, are solvable
Statement
Every nilpotent group is solvable. Consequently every finite -group is solvable.
Facts & Assumptions
Given: A nilpotent group .
Nilpotence is equivalent to for some (Nilpotence via central series, the upper central series, and the lower central series).
Every finite -group is nilpotent (Every finite -group is nilpotent).
Proof
For every subgroup , one has .
Induction on gives : equality holds at , and step 1.1 sends the inclusion at to .
Choose with using [L1]. Step 2.1 gives , so is solvable by [F1].
A finite -group is nilpotent by [L2], so step 3.1 applies.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 57 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click 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)