Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-10
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 A is an indecomposable GCM with detA0, then g(A) is nonabelian and has no nonzero proper Lie ideal. Thus every indecomposable finite-type component is simple. Here an ideal J is a linear subspace with [g,J]J, and “simple” includes nonabelianity.

Facts & Assumptions

Given: An indecomposable nonsingular GCM and a nonzero ideal J of g(A).

[F1]

Every nonzero ideal meets the Cartan. (Kac moody algebra associated to a gcm).

[F2]

Simple vectors and their brackets are nonzero. (Kac moody root spaces are finite dimensional).

[F3]

The minimal Cartan dimension is 2n−rank A. (Minimal realizations exist and are unique up to isomorphism).

[F4]

Indecomposability excludes a nontrivial block partition. (Generalized cartan matrix).

Proof

1.1

By F1 choose 0hJh. F3 and nonsingularity give dimh=n, so the n independent simple roots form a basis of h. Some αi(h)0. The ideal property applied to [h,ei]=αi(h)ei gives eiJ, then [ei,fi]=hi gives hiJ, and [hi,fi]=2fi gives fiJ.

F1F3given
2.1

The finite graph with edges aij0 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, [hi,ej]=aijej gives ejJ, and the same two brackets give hj,fjJ. Induction along finite paths reaches every index. The independent hi span the n-dimensional Cartan, so every defining generator lies in J, and J=g. Finally [ei,fi]=hi0 by F2 and Cartan injectivity; hence the algebra is nonabelian.

F2F3F4step 1.1

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