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.
Finite type kac moody algebras recover the dg semisimple algebras
Statement
For a finite-type GCM over , is finite-dimensional and is a direct sum of nonabelian simple Lie algebras, one for each indecomposable component (thus semisimple). Its simple-root/coroot matrix is , with rows indexing coroots. Intrinsically it is the universal Lie algebra on its minimal Cartan and Chevalley generators subject to the Cartan relations and both Serre families. No external Dynkin classification or separately constructed finite-type model is assumed.
Facts & Assumptions
Given: A finite-type GCM, possibly decomposable.
The full Cartan–Serre presentation and separate half presentations hold. (Serre presentation of a kac moody algebra).
Each finite block is invertible and symmetrizable. (Finite affine indefinite trichotomy for indecomposable gcms).
Finite-type algebras are finite-dimensional with all roots real. (Finite-type Kac–Moody roots descend to simple roots).
Each nonsingular indecomposable component is nonabelian simple. (Nonsingular indecomposable Kac–Moody algebras are simple).
Proof
Let be the connected components of the nonzero-entry graph, giving diagonal blocks . By F2 each is symmetrizable and invertible, so is too and its Cartan is precisely the span of the . F3 proves finite dimension for and for each block. F4 makes each nonabelian simple.
For indices in different components, the positive and negative Serre exponents are one, so F1 gives . The mixed relations give , and the Cartan pairings give zero brackets of each component Cartan with generators of another. The Cartans commute. Jacobi then makes the whole subalgebras generated by different components commute. Map every generator of to its component generator in ; all relations of F1 hold there. Conversely the component generator maps satisfy their own presentations and their images commute, giving a homomorphism from the direct sum back to . Both composites fix every generator, so both are identities.
The direct sum in step 2.1 consists of the simple algebras from step 1.1, proving the stated meaning of semisimple. Its root decomposition is the original one, with positive roots in the nonnegative span of the independent simple roots and with simple root spaces nonzero; F3 identifies all roots by Weyl descent. The relation fixes the row/coroot convention. Finally F1 says precisely that every assignment of these generators in a complex Lie algebra satisfying these relations extends uniquely to a homomorphism; this is the intrinsic universal presentation claimed.
Sources
Source comparison: Kleshchev, Propositions 1.4.3, 1.4.8(i), 4.3.2, pp.17–20 and 63–64; local inverse generator maps.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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.