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.
The affine simple root alpha zero is delta minus the highest root
Statement
The finite root system of a nonzero complex simple has a unique highest root : every root satisfies . This root is long. Normalize and set , . Together with the finite simple roots and coroots these are minimal realization data for the untwisted affine GCM . For normalized opposite root vectors,
Facts & Assumptions
Given: A nonzero finite-dimensional complex simple Lie algebra.
Finite root spaces, coroots, strings and simple generation are Finite semisimple Cartan, root and string structure.
Finite-dimensional simple modules have a unique dominant integral highest weight and support below it by Finite semisimple PBW and highest-weight construction.
The finite simple roots form a basis, their coordinates have one sign, and the simple coroots form an integral coroot basis by Finite Weyl positive roots and simple reflections.
The form normalization and residue mode coefficient are Residue two cocycle on a loop algebra.
The extended Cartan, finite-root extensions and are Null root, central coroot, and affine level.
The matrix axioms are Generalized cartan matrix and the minimal-realization conditions are Realization of a generalized cartan matrix.
Proof
The adjoint module is simple, since its invariant subspaces are ideals. F2 therefore gives a dominant integral highest weight and support in . Its weights by F1 are and the roots. The top weight cannot be zero: the support contains both a root and , whereas neither pair can both lie in by F3. Thus is a positive root dominating all roots. Any other root with that property dominates and is dominated by it, so equals it by independence of the simple roots. Write ; since each , every integer .
Every finite root can be moved to a dominant root of the same length: if , replace by . This increases its integer height and stays in the finite root set, so iteration terminates with all pairings nonnegative. For that dominant root , step 1.1 gives with . Dominance of then gives Hence has maximal root length and the normalization in F4 is .
Choose using F1. Invariance gives as in F4. Thus the mode bracket gives . The diagonal entry is ; for , and . They are nonpositive integers by dominance of and crystallographic integrality, and vanish simultaneously since both are positive multiples of . The finite entries already satisfy the GCM axioms.
Put and for . The matrix of step 3.1 has entries . Multiplication of row by gives the symmetric Gram matrix of these vectors. It is positive semidefinite of rank , since the finite simple roots are a basis. Its kernel is spanned by , all entries positive. Each proper principal Gram matrix is positive definite: any dependence would extend to a kernel vector with a zero coordinate, impossible. This is the affine, rather than finite, symmetrizable matrix associated with the highest-root extension; it defines the untwisted affine convention here.
The are independent since only has a nonzero coordinate; the are independent since only is nonzero on . Also . Together with step 3.1 these verify every minimal-realization condition. All root selections and height iterations were finite. Rank one is included: the same formulas give .
Depends on
- Residue two cocycle on a loop algebra
- Null root, central coroot, and affine level
- Finite semisimple Cartan, root and string structure
- Finite semisimple PBW and highest-weight construction
- Finite Weyl positive roots and simple reflections
- Generalized cartan matrix
- Realization of a generalized cartan matrix
Used by
- Omitting the central term breaks the affine GCM bracket Counterexample
- The affine A1 simple roots and GCM Example
- Affine denominator separates real and imaginary root factors Proposition
- Affine Weyl group is a coroot lattice semidirect product Proposition
- Roots of an untwisted affine Lie algebra Proposition
- Loop and affine GCM presentations are isomorphic Theorem
Dependency tree · two levels
17 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, Sections 6.3 and 7.2 (standard reference, not scraped)
- Perrin, Introduction to Kac-Moody Groups and Lie Algebras, Sections 12.1-12.2.2 (standard reference, not scraped)