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.
Root-space decomposition relative to a Cartan subalgebra
Statement
Let be a complex semisimple Lie algebra and a Cartan subalgebra. For , set
Then there is a finite set such that
and the nonzero summands are exactly the root spaces.
Facts & Assumptions
Given: A complex semisimple Lie algebra and a Cartan subalgebra .
Proof
Because is a Cartan subalgebra of a complex semisimple Lie algebra, the commuting operators for are simultaneously diagonalizable, so decomposes into common eigenspaces for the adjoint action of .
The common eigenspace for the zero functional is the centralizer of , which equals because is self-normalizing. Every other common eigenfunctional is nonzero and contributes a subspace of the displayed form .
Collecting the finitely many nonzero weights gives the finite set , and the simultaneous eigenspace decomposition from step 1.1 becomes the stated direct sum decomposition.
Depends on
Used by
- The regular root-hyperplane arrangement in a Cartan subalgebra Definition
- Central elements lie in the zero-weight subspace of U(g) Lemma
- Brackets of root spaces add their roots Proposition
- Opposite root spaces bracket to the Killing-dual line Proposition
- The centralizer of a Cartan element from its vanishing roots Proposition
- The Killing form pairs only opposite root spaces Proposition
- The quadratic Casimir eigenvalue on a highest-weight module is (λ,λ+2ρ) Proposition
- The root set is a reduced crystallographic root system Theorem
- Triangular decomposition from a chosen positive root system Theorem
Dependency tree · two levels
2 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
- Pavel Etingof, Lie Groups and Lie Algebras I (standard reference, not scraped)