Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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 g induced by a Dynkin-diagram permutation of its fixed simple generators, of finite order r1. Fix a primitive rth root of unity ζC. Write gj={x:σ(x)=ζjx}, with indices modulo r. The polynomial Xr1 has distinct roots, so its annihilation of σ gives g=jmodrgj.

In the loop realization of Degree derivation and full untwisted affine algebra, define τ(xtm)=ζmσ(x)tm,τ(c)=c,τ(d)=d. The twisted loop algebra is the fixed subalgebra L(g,σ)=mZgmmodrtm. Its central/full extensions here mean the fixed subalgebras L(g,σ)Cc and L(g,σ)CcCd 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 m+n=0, so its scalar factor under τ is ζmn=1; the central term is preserved as well. The degree action is preserved since τ does not change m. Therefore τ is a Lie automorphism, with inverse obtained from σ1 and ζm. If two elements are fixed, so is their bracket. Finally the degree-m fixed condition is exactly σ(x)=ζmx, proving the displayed description. Brackets satisfy [gj,gk]gj+k directly by applying σ.

For r=1 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