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.
Nonsingular indecomposable Kac–Moody algebras are simple
Statement
If is an indecomposable GCM with , then is nonabelian and has no nonzero proper Lie ideal. Thus every indecomposable finite-type component is simple. Here an ideal is a linear subspace with , and “simple” includes nonabelianity.
Facts & Assumptions
Given: An indecomposable nonsingular GCM and a nonzero ideal J of g(A).
Every nonzero ideal meets the Cartan. (Kac moody algebra associated to a gcm).
Simple vectors and their brackets are nonzero. (Kac moody root spaces are finite dimensional).
The minimal Cartan dimension is 2n−rank A. (Minimal realizations exist and are unique up to isomorphism).
Indecomposability excludes a nontrivial block partition. (Generalized cartan matrix).
Proof
By F1 choose . F3 and nonsingularity give , so the independent simple roots form a basis of . Some . The ideal property applied to gives , then gives , and gives .
The finite graph with edges is connected by F4: otherwise its path components supply a zero block partition, using the symmetric zero condition. For an edge from an index already obtained in step 1.1, gives , and the same two brackets give . Induction along finite paths reaches every index. The independent span the -dimensional Cartan, so every defining generator lies in , and . Finally by F2 and Cartan injectivity; hence the algebra is nonabelian.
Sources
Source comparison: Kleshchev, Proposition 1.4.8(i), pp.19–20; direct ideal propagation.
Depends on
Used by
Dependency tree · two levels
7 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
- Kleshchev, Lectures on Infinite Dimensional Lie Algebras — Proposition 1.4.8(i), pp.19–20; direct ideal propagation (standard reference, not scraped)