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 restricted roots and nilpotent n algebra
Definition
Assume the Axiom of Choice. Let be a finite-dimensional real semisimple Lie algebra with Cartan decomposition , let be a maximal abelian subspace, and let be the restricted-root system with root spaces (Restricted root and restricted root space, Restricted root space decomposition). An element is regular (for ) if for every ; such elements exist because is finite and a finite union of proper subspaces of the real vector space cannot exhaust it (A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces). A positive system of is a subset for which there is a regular with since for every , such a set satisfies and is cut out on by the linear evaluation functional , . Write for the negative restricted roots.
Fix a positive system and define the direct sum of the restricted-root spaces of the positive restricted roots. By the bracket relation of Restricted root space decomposition, for all restricted roots, and a sum of positive functionals that is a restricted root is again positive for the same ordering; consequently is a Lie subalgebra of . The subalgebra is nilpotent, the sum is a solvable Lie subalgebra with , and is a vector-space direct sum; these three assertions are proved in Iwasawa decomposition on the lie algebra level, where the nilpotency of is derived from the following positive bounds: if is nonempty and is a regular element cutting out , the numbers for have a positive minimum and a finite maximum, so every iterated bracket of sufficiently many elements of vanishes; and if then is trivially nilpotent.
Depends on
Used by
Dependency tree · two levels
17 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., Chapter VI (standard reference, not scraped)