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.
Derived algebra of a solvable linear Lie algebra is nilpotent
Statement
Let be algebraically closed of characteristic zero. If is a finite-dimensional solvable Lie algebra and is finite-dimensional, then every element of is a nilpotent endomorphism of , and the Lie algebra is nilpotent.
Facts & Assumptions
Given: The field, module, and solvable linear Lie algebra in the statement.
A solvable representation under these field hypotheses is simultaneously upper triangularizable (Simultaneous triangularization of solvable representations).
A finite-dimensional Lie algebra is nilpotent when every one of its adjoint endomorphisms is nilpotent (Engel's theorem).
Proof
Suppose first that . By [L1], choose a basis of in which every element of is upper triangular. The diagonal of is zero for upper triangular , so every bracket is strictly upper triangular. Since strictly upper triangular matrices form a linear subspace, every element of , which is a finite linear combination of brackets, is strictly upper triangular and therefore has its th power zero.
Put . It is a finite-dimensional Lie subalgebra of , and step 1.1 says that for each some satisfies . On one has ; the operators and commute, and every term of contains either or . Hence is nilpotent on and therefore on its invariant subspace . Engel's theorem [L2] makes nilpotent. If , then and both conclusions are immediate.
Depends on
Used by
Dependency tree · two levels
8 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
- Milne, Lie Algebras, Corollary 3.8 (standard reference, not scraped)