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 roots descend to simple roots
Statement
For a finite-type GCM (all indecomposable blocks finite), every root is Weyl-conjugate to a simple root. There are finitely many roots, every root space is one-dimensional, and .
Facts & Assumptions
Given: A finite-type GCM with its finite nonempty simple-root family.
Finite blocks have positive definite symmetrizations and are invertible. (Finite affine indefinite trichotomy for indecomposable gcms).
The root form has entries d_i a_ij. (Invariant bilinear form for a symmetrizable kac moody algebra).
Weyl reflection preserves roots, multiplicities and the symmetrized form. (The weyl group preserves roots and root multiplicities).
Roots have one sign and no higher pure simple multiples. (Kac moody root spaces are finite dimensional).
Real root spaces have dimension one. (Real root spaces are one dimensional sl2 roots).
Proof
Choose a positive symmetrizer on each finite block and combine them into . F1 makes blockwise positive definite and therefore positive definite on the full real root span. For a positive root , F2 gives . Thus some with has the positive integer .
If is not simple, F4 implies there is some with . F3 makes a root; its unchanged coefficient at is positive, so F4 forces this root to be positive. Its height has strictly decreased by the positive integer . Induction on positive height therefore reaches a simple root. Negative roots reduce to this case by sign, and handles the final sign.
Put . By step 2.1 and form invariance, every root has squared length in , hence at most . The positive definite matrix gives a real dual basis to the under this form by finite elimination. For , the nonnegative quadratic at gives . If , then . Each integer coordinate therefore belongs to a fixed finite interval. There are only finitely many such tuples, proving .
Every root is real by step 2.1, so F5 gives dimension one. Each finite block is invertible by F1; hence and the minimal Cartan has dimension . Summing the root decomposition of F4 gives , finite by step 3.1.
Sources
Source comparison: Kleshchev, Proposition 4.3.2, pp.63–64; local height descent and explicit dual-basis lattice bound.
Depends on
Used by
Dependency tree · two levels
14 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.