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.
Simple, semisimple, and reductive Lie algebras
Definition
Let be a finite-dimensional Lie algebra over a field .
- It is simple if it is nonabelian and its only ideals are and .
- It is semisimple if , as in Semisimple Lie algebras.
- When , it is reductive when and the derived algebra is semisimple, as in Reductive Lie algebras.
The word “nonabelian” in the first clause excludes one-dimensional abelian Lie algebras from being simple. The zero Lie algebra is semisimple under the vanishing-radical convention and, when , is reductive, with both displayed summands zero. These are conventions, not yet the structure theorem that every semisimple algebra is a direct sum of simple ideals.
Depends on
Used by
- Semisimple Hamiltonian actions have a unique equivariant moment map when one exists Corollary
- Levi subalgebras and Levi decompositions Definition
- Standard parabolic and Levi subalgebras from a subset of simple roots Definition
- The one-strand degenerate action on the trivial module has scalar dot Example
- Centerless implies semisimple False statement
- The root-space decomposition classifies real semisimple Lie algebras with no extra data False statement
- Trace forms of faithful representations of semisimple Lie algebras are nondegenerate Lemma
- The adjoint highest weight is the highest root Proposition
- Whitehead's second lemma removes the infinitesimal equivariance obstruction for semisimple actions Proposition
- Cartan-Killing classification of complex simple Lie algebras Theorem
- Cartan's semisimplicity criterion Theorem
- Classification of real semisimple lie algebras Theorem
- Complexification dichotomy for a real simple lie algebra Theorem
- Existence of Cartan subalgebras Theorem
- Existence theorem for complex semisimple Lie algebras Theorem
- Semisimple Lie algebras decompose into simple ideals Theorem
Dependency tree · two levels
7 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, §§4 and 6 (standard reference, not scraped)