Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

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 dimg(A)=n+Δ<.

Facts & Assumptions

Given: A finite-type GCM with its finite nonempty simple-root family.

[F1]

Finite blocks have positive definite symmetrizations and are invertible. (Finite affine indefinite trichotomy for indecomposable gcms).

[F2]
[F3]

Weyl reflection preserves roots, multiplicities and the symmetrized form. (The weyl group preserves roots and root multiplicities).

[F4]

Roots have one sign and no higher pure simple multiples. (Kac moody root spaces are finite dimensional).

[F5]

Real root spaces have dimension one. (Real root spaces are one dimensional sl2 roots).

Proof

1.1

Choose a positive symmetrizer on each finite block and combine them into D. F1 makes DA blockwise positive definite and therefore positive definite on the full real root span. For a positive root β=miαi, F2 gives 0<(β,β)=imidiβ(hi). Thus some i with mi>0 has the positive integer β(hi)>0.

F1F2given
2.1

If β is not simple, F4 implies there is some ji with mj>0. F3 makes siβ=ββ(hi)αi a root; its unchanged coefficient at j is positive, so F4 forces this root to be positive. Its height has strictly decreased by the positive integer β(hi). Induction on positive height therefore reaches a simple root. Negative roots reduce to this case by sign, and siαi=αi handles the final sign.

F3F4step 1.1
3.1

Put C=maxi2di. By step 2.1 and form invariance, every root has squared length in {2di}i, hence at most C. The positive definite matrix gives a real dual basis vi to the αi under this form by finite elimination. For v0, the nonnegative quadratic (xtv,xtv) at t=(x,v)/(v,v) gives (x,v)2(x,x)(v,v). If β=miαi, then mi2=(β,vi)2C(vi,vi). Each integer coordinate therefore belongs to a fixed finite interval. There are only finitely many such tuples, proving Δ<.

F2F3step 1.1step 2.1
4.1

Every root is real by step 2.1, so F5 gives dimension one. Each finite block is invertible by F1; hence rankA=n and the minimal Cartan has dimension n. Summing the root decomposition of F4 gives dimg=n+Δ, finite by step 3.1.

F1F4F5step 2.1step 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.

Sources