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.
Twisted loop algebra from a diagram automorphism
Definition
Let be an automorphism of the finite simple induced by a Dynkin-diagram permutation of its fixed simple generators, of finite order . Fix a primitive th root of unity . Write , with indices modulo . The polynomial has distinct roots, so its annihilation of gives .
In the loop realization of Degree derivation and full untwisted affine algebra, define The twisted loop algebra is the fixed subalgebra Its central/full extensions here mean the fixed subalgebras and in that same normalization.
For well-definedness, preserves the normalized Killing form: conjugation intertwines the finite adjoint operators, preserving their product traces, and hence also the fixed scalar normalization. Thus the loop part of each bracket is preserved. A nonzero central coefficient has , so its scalar factor under is ; the central term is preserved as well. The degree action is preserved since does not change . Therefore is a Lie automorphism, with inverse obtained from and . If two elements are fixed, so is their bracket. Finally the degree- fixed condition is exactly , proving the displayed description. Brackets satisfy directly by applying .
For this is the untwisted construction. All mode sums are finite; some eigenspaces may be zero. This defines the fixed-loop objects, without classifying twisted affine diagrams or changing the central/degree scaling convention.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
2 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, Section 8.2 (standard reference, not scraped)
- Perrin, Introduction to Kac-Moody Groups and Lie Algebras, Definition 14.1.2 and Proposition 14.1.3 (standard reference, not scraped)