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.
Existence theorem for complex semisimple Lie algebras
Statement
Assume the Axiom of Choice. For every reduced crystallographic root system there are a finite-dimensional complex semisimple Lie algebra , a Cartan subalgebra of , and an isomorphism from onto the resulting root system. If is nonempty and irreducible, may be taken simple. For the empty root system, may be taken to be the zero Lie algebra.
Facts & Assumptions
Given: A reduced crystallographic root system .
AC is assumed and is used through the Serre presentation theorem (The Axiom of Choice).
The irreducible components are reduced crystallographic root systems with pairwise orthogonal spans whose sum is the ambient space; the decomposition is unique (Unique irreducible decomposition).
A regular vector determines a positive system and its simple roots; those simple roots form a basis, and every root has integral coordinates of one sign in that basis (Positive systems and simple roots, Simple roots form a signed integral basis).
For a finite-type Cartan matrix the Serre algebra is finite-dimensional and semisimple, with Cartan matrix and root system . If is the Cartan matrix of an irreducible component of a reduced crystallographic root system, then is simple (Serre presentation theorem).
Two based reduced crystallographic root systems with the same Cartan matrix are isomorphic by the linear map that matches their ordered bases (The Cartan matrix determines a based root system).
The zero Lie algebra is semisimple but not simple (Simple, semisimple, and reductive Lie algebras).
Proof
If , then its ambient space is zero because spans it. Taking gives the empty root system and a semisimple algebra by [L5], proving the empty case. Henceforth suppose .
Choose a regular vector and the resulting base by [L2]. By [L1], write . The restriction of the regular vector to is regular for , and positivity is tested componentwise, so is the disjoint union of the bases . Let be the Cartan matrix of ; the Cartan matrix of is the block diagonal matrix .
For each , [L3] gives a finite-dimensional semisimple Serre algebra with based root system having Cartan matrix . By [L4], the base-matching map is a root-system isomorphism . Since is the Cartan matrix of the irreducible component , [L3] also makes simple.
Put and take the direct sum of the Cartan subalgebras supplied by [L3]. Brackets between distinct summands vanish, so the roots of are exactly the roots of the summands, extended by zero on the other Cartan summands; hence its root system is the orthogonal disjoint union . The disjoint union of the maps from step 1.3 is therefore an isomorphism from onto this root system. The direct sum is finite-dimensional and semisimple, and if is irreducible then and is simple.
Depends on
Used by
Dependency tree · two levels
27 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 II (standard reference, not scraped)