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.
Positive and negative nilpotent subalgebras and the Borel
Definition
Assume the Axiom of Choice. Let be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra and root set , and let be a positive system of the root system with base of simple roots (Positive systems and simple roots, The roots form a reduced crystallographic Euclidean root system). Write for the negative roots. Define Then and are called the positive and negative nilpotent subalgebras and the Borel subalgebra attached to . Here the term Borel uses this root-space construction as its defining convention, as in Knapp, Chapter V §7. The definition depends only on the set and not on any enumeration of it, because each sum is the span of a fixed set of subspaces.
These are Lie subalgebras. Let and , . By Brackets of root spaces, , and unless is a root. When is a root, write and with nonnegative integral coefficients, as Simple roots form a signed integral basis permits; then has nonnegative integral coefficients and is nonzero, so by the same theorem it is a positive root. Hence , and is a subalgebra; the same argument with signs reversed gives . Finally and for every root , so and is closed under the bracket (Lie subalgebras, ideals, and center).
The subalgebras are nilpotent. For a positive root put and, for , the span being when no such root exists; by Root-space decomposition we have , and for every positive root because has nonnegative integral coefficients. If and is a root, then by uniqueness of the simple-root coefficients, so . Induction gives for the lower central series (Lower central series and nilpotent Lie algebras). If is empty, then is nilpotent. Otherwise the finite nonempty set has a maximal height , so and hence : the algebra is nilpotent. The negative case is identical, with heights of the positive roots for , since . Thus the terms "positive and negative nilpotent subalgebras" are justified.
Depends on
Used by
- Dominant cyclic highest-weight presentation Definition
- Highest-weight vectors and modules Definition
- Not every weight vector is highest False statement
- Verma modules need not be finite-dimensional False statement
- Every finite-dimensional irreducible module has a highest-weight vector Lemma
- Highest weight modules lie below the top weight Lemma
- The dominant cyclic generator survives Lemma
- Triangular decomposition Theorem
Dependency tree · two levels
34 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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)