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.
Engel's theorem
Statement
A finite-dimensional Lie algebra over any field is nilpotent if and only if is a nilpotent endomorphism of for every .
Facts & Assumptions
Given: A finite-dimensional Lie algebra .
Nilpotence is termination of the lower central series (Lower central series and nilpotent Lie algebras).
A nil finite-dimensional representation has a flag lowered by every represented operator (Engel triangularization theorem).
Inner derivations form the adjoint representation, with (Derivations form a Lie algebra and inner derivations an ideal).
Proof
Suppose . For , the vector is a left-nested bracket with copies of , hence lies in by [L1] and [L3]. Thus every is nilpotent. This also covers .
Conversely suppose every is nilpotent. The adjoint representation in [L3] is nil, so [L2] gives with . Induction then gives for , and in particular . Hence is nilpotent by [L1].
Depends on
Used by
- Nilpotent adjoint action yields a central series Corollary
- A nilpotent acting basis suffices for Engel's theorem False statement
- The nilradical is the set of all ad-nilpotent elements False statement
- Cartan's solvability criterion Theorem
- Derived algebra of a solvable linear Lie algebra is nilpotent Theorem
- Existence and characteristicity of the nilradical in characteristic zero Theorem
Dependency tree · two levels
9 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 2.11 (standard reference, not scraped)