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 Lie algebras are solvable
Statement
For every Lie algebra and every ,
Consequently every nilpotent Lie algebra is solvable.
Facts & Assumptions
Given: A Lie algebra .
The derived series satisfies (Derived series and solvable Lie algebras).
The lower central series satisfies , and nilpotence means that a lower term vanishes (Lower central series and nilpotent Lie algebras).
Proof
We first prove for all . For this is [L2]. If it holds for and every second index, Jacobi gives .
At , . If , then [L1] and step 1.1 imply . Thus the displayed containment holds for every .
If is nilpotent, choose a given bound with as in [L2]. Taking gives , so descent of the lower series and step 2.1 yield . Hence is solvable by [L1]. This includes and uses only the supplied finite bound.
Depends on
Used by
Dependency tree · two levels
4 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
- Kirillov, An Introduction to Lie Groups and Lie Algebras, §5.4 (standard reference, not scraped)