Alphabeta Math
Pipeline-generated
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.

Affine Lie Algebras and Loop Central Extensions

1 · Prerequisites

2 · Summary

The construction begins with finite Laurent sums and proves the residue identities before introducing a central bracket. Adjoining the degree derivation produces the full affine algebra; its derived algebra omits exactly that derivation. The normalized highest-root vectors identify the affine simple node, and the Cartan–Serre relations then identify the loop construction with the GCM algebra. Explicit translations describe the affine Weyl group, while the weight decomposition gives every real and imaginary root and its multiplicity.

Evaluation modules have zero central action and generally cannot carry the degree derivation. For a trivial finite action every degree operator is possible. The final definition introduces twisted loops as fixed points, with the central and degree scaling inherited from the untwisted construction. All arguments here are algebraic and choice-free. No universal-central-extension theorem or classification of twisted diagrams is asserted.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Loop algebra of a simple Lie algebra

Definition

Let g be a nonzero finite-dimensional complex simple Lie algebra. Here simple means nonabelian with no ideals except 0 and g, using the Lie and ideal conventions of Finite semisimple Lie algebras and the symmetric adjoint action. Put C[t,t1]={mZamtm:amC, finitely many am0}, with multiplication tmtn=tm+n.

The algebraic loop algebra is Lg=gCC[t,t1]. Write xm=xtm and define [xf,yq]=[x,y]fq. This is well-defined on the tensor product because the displayed operation is complex bilinear in each tensor's two entries and respects scalar balancing. On three pure tensors its cyclic Jacobi sum is ([x,[y,z]]+[y,[z,x]]+[z,[x,y]])fqr=0. Antisymmetry follows from that in g and fq=qf. Bilinear and trilinear extension give the identities on all finite sums, including zero. Thus this is a Lie algebra. Only Laurent polynomials occur; no topology or analytic completion is part of the definition.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-13Open item page →

Residue two cocycle on a loop algebra

Definition

Use Loop algebra of a simple Lie algebra. Fix the positive-real rescaling B of the Killing form whose induced form on the real finite-root span makes every long root have square 2. The Killing form is nondegenerate, invariant and symmetric by Engel, the trace criterion, and Killing nondegeneracy, and its restriction gives a positive definite real root form by Finite semisimple Cartan, root and string structure, so this rescaling exists. In particular B([x,y],z)=B(x,[y,z]).

For f=mamtm put f=mmamtm1 and Res(fdt)=a1. Define the residue bilinear form by ω(xf,yq)=B(x,y)Res(fqdt). The formula is balanced and complex bilinear, so extends uniquely to the tensor product. In particular, ω(xm,yn)=mδm,nB(x,y). The Kronecker symbol is one when m=n and zero otherwise. This form is in fact an alternating Lie-algebra two-cocycle. For Laurent polynomials f,q, the residue of (fq) is zero, so Res(fqdt)=Res(fqdt); symmetry of B gives skew-symmetry, and in characteristic zero also ω(a,a)=0. For pure tensors xf,yq,zh, invariance and symmetry of B make the three factors B([x,y],z), B([y,z],x), and B([z,x],y) equal. The cyclic cocycle sum is therefore that common factor times Res(((fq)h+(qh)f+(hf)q)dt)=2Res((fqh)dt)=0. Trilinearity extends the identity to all loop-algebra elements. Thus the terminology “two-cocycle” records a proved property of the defined form, not merely an intended later use.

For any long root α, opposite root vectors normalized by [eα,fα]=α satisfy B(eα,fα)=2(α,α)=1. The equality follows by pairing [eα,fα] with the Cartan and using invariance. A later result identifies the highest root and proves that it is long; no highest-root existence claim is used here.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

The loop residue form is alternating

Statement

For all u,vLg, ω(u,v)=ω(v,u) and ω(u,u)=0.

Facts & Assumptions

Given: A loop algebra over C and its residue form.

[F1]

Residue two cocycle on a loop algebra defines ω(xf,yq)=B(x,y)Res(fqdt) with B symmetric.

Proof

1.1

For any Laurent polynomial a=jajtj, the coefficient of t1 in a=jjajtj1 is 0a0=0. Thus Res(adt)=0, including constant and zero a.

F1algebra
2.1

For pure tensors u=xf, v=yq, symmetry of B and the product rule give ω(u,v)+ω(v,u)=B(x,y)Res((fq)dt)=0.

F1step 1.1algebra
3.1

Expand arbitrary u,v into their finite tensor sums and apply step 2.1 term by term. This proves skewness for all inputs, including empty sums. Setting v=u gives 2ω(u,u)=0; since the field is C, division by 2 gives alternatingness.

step 2.1givenalgebra
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

The loop residue form satisfies the Lie two cocycle identity

Statement

For all u,v,wLg, ω([u,v],w)+ω([v,w],u)+ω([w,u],v)=0.

Facts & Assumptions

Given: The algebraic loop bracket and the residue form.

[F1]

The form in Residue two cocycle on a loop algebra is defined using invariant symmetric B and Laurent differentiation.

Proof

1.1

For x,y,zg, invariance and symmetry give B([x,y],z)=B(x,[y,z])=B([y,z],x), and the cyclic repetition gives B([z,x],y) as the same scalar b.

F1algebra
2.1

For u=xf, v=yq, w=zr, the required cyclic sum is bRes(((fq)r+(qr)f+(rf)q)dt). Expanding the three derivatives gives twice each of fqr,fqr,fqr, so the sum is 2bRes((fqr)dt).

F1step 1.1algebra
3.1

If fqr=jajtj, its derivative has t1 coefficient 0a0=0. Step 2.1 therefore vanishes. Each general input is a finite sum of pure tensors, and the cyclic expression is trilinear; distributing reduces it to these vanishing summands. Empty sums, zero arguments and repeated arguments are included.

step 2.1givenalgebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Untwisted affine central extension

Definition

The untwisted central extension is the vector space Lg=LgCc, with c a new nonzero basis vector, and bracket [u+ac,v+bc]=[u,v]Lg+ω(u,v)c. Here Lg is Loop algebra of a simple Lie algebra, while B and ω are exactly the normalized invariant form and residue cocycle of Residue two cocycle on a loop algebra. Their alternatingness and cocycle identity are proved in The loop residue form is alternating and The loop residue form satisfies the Lie two cocycle identity. Thus c is central, and for xm=xtm, [xm,yn]=[x,y]m+n+mδm,nB(x,y)c. The bracket is bilinear and alternating by the first cited lemma. Its Jacobi sum has loop component zero by loop Jacobi and central component ω([u,v],w)+ω([v,w],u)+ω([w,u],v)=0 by the second lemma. Central inputs give zero directly. Hence this defines a Lie algebra. The projection to Lg is a surjective Lie homomorphism with kernel Cc. The vector-space inclusion of the loop algebra need not preserve its bracket. No universal property of this extension is asserted.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Degree derivation and full untwisted affine algebra

Definition

On Untwisted affine central extension define D(xm)=mxm and D(c)=0, extending linearly. For two modes the loop component of D[xm,yn] is (m+n)[x,y]m+n, the same as that of [Dxm,yn]+[xm,Dyn]. The latter's central coefficient is (m+n)mδm,nB(x,y)=0, while D kills the former's central term. Thus D is a derivation; the cases involving c vanish directly.

The full untwisted affine algebra is g^=LgCd, where d is a new basis vector, with bracket [u+ad,v+bd]=[u,v]+aD(v)bD(u). In particular [d,xm]=mxm, [d,c]=0 and [d,d]=0. Jacobi with no d is the central-extension identity; with one d it is precisely the derivation identity just checked; with two d the terms D2(u) cancel; with three d it is zero. Multilinearity proves Jacobi generally. This is an algebraic semidirect extension; both u and v have finite Laurent support. No AC is needed.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

The derived affine algebra omits only the degree derivation

Statement

For the full untwisted affine algebra of a nonzero finite-dimensional complex simple g, [g^,g^]=LgCc. Consequently g^ is not perfect, and its derived algebra is precisely the one-dimensional central extension of Lg.

Facts & Assumptions

Given: g is nonabelian and simple, and derived subspaces are spans of brackets.

[F1]

The full affine bracket and direct sum are Degree derivation and full untwisted affine algebra.

[F2]

The finite root data of Finite semisimple Cartan, root and string structure include nonzero Cartan and nondegenerate Cartan form for nonzero semisimple g.

Proof

1.1

Jacobi makes [g,g] an ideal. It is nonzero because g is nonabelian, so simplicity gives [g,g]=g. Write any xg as a finite sum j[yj,zj]. For any mZ, j[(yj)m,(zj)0]=xm: the central coefficient is mδm,0=0. Thus every loop mode, including degree zero, lies in the derived algebra, using only brackets within Lg.

F1givenalgebra
1.2

Choose h,hh with B(h,h)=1, possible by F2 and rescaling the nondegenerate form. The Cartan is nonzero since its roots span the dual and a nonzero simple algebra cannot have an empty root decomposition. Then [h1,h1]=c, because [h,h]=0. Hence c also lies in the derived algebra. This uses just two finite-dimensional vector choices, not AC.

F1F2algebra
2.1

Every defining bracket has zero d coordinate. Bilinearity gives [g^,g^]LgCc, while steps 1.1–1.2 give the reverse inclusion. Since d is a separate nonzero basis vector, this subspace is proper. The same two steps also show the central extension itself is perfect.

F1step 1.1step 1.2algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Null root, central coroot, and affine level

Definition

Fix the finite Cartan h supplied by Finite semisimple Cartan, root and string structure. In Degree derivation and full untwisted affine algebra put h^=hCcCd. It is abelian, and its centralizer is itself: commuting with d forces all nonzero modes to vanish, and commuting with h forces the degree-zero finite part into h, by the cited self-centralization result. Extend each finite root α to h^ by α(c)=α(d)=0.

The null root is the unique functional δh^ with δhCc=0 and δ(d)=1. The chosen central generator c is called the affine central coroot in the normalized loop convention. Its identification with the primitive central combination of the affine simple coroots belongs to the presentation comparison.

The level of a weight Λh^ is Λ(c). A module has level k when c acts as kid on the whole module. In particular a module generated by a weight vector v of weight Λ has level Λ(c): centrality gives c(x1xmv)=x1xmcv=Λ(c)x1xmv on every finite word, and these words span. An arbitrary weight module may have several levels, so no single level is asserted for it. The zero module satisfies every scalar-action identity; it does not determine a unique scalar level.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

The affine simple root alpha zero is delta minus the highest root

Statement

The finite root system of a nonzero complex simple g has a unique highest root θ: every root β satisfies θβQ+. This root is long. Normalize (θ,θ)=2 and set α0=δθ, h0=cθ. Together with the finite simple roots and coroots these are minimal realization data for the untwisted affine GCM A^=(αj(hi))0i,j. For normalized opposite root vectors, [fθt,eθt1]=h0.

Facts & Assumptions

Given: A nonzero finite-dimensional complex simple Lie algebra.

[F1]

Finite root spaces, coroots, strings and simple generation are Finite semisimple Cartan, root and string structure.

[F2]

Finite-dimensional simple modules have a unique dominant integral highest weight and support below it by Finite semisimple PBW and highest-weight construction.

[F3]

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.

[F4]

The form normalization and residue mode coefficient are Residue two cocycle on a loop algebra.

[F5]

The extended Cartan, finite-root extensions and δ are Null root, central coroot, and affine level.

[F6]

The matrix axioms are Generalized cartan matrix and the minimal-realization conditions are Realization of a generalized cartan matrix.

Proof

1.1

The adjoint module is simple, since its invariant subspaces are ideals. F2 therefore gives a dominant integral highest weight θ and support in θQ+. Its weights by F1 are 0 and the roots. The top weight cannot be zero: the support contains both a root β and β, whereas neither pair can both lie in Q+ 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 θ=imiαi; since each αiθ, every integer mi1.

F1F2F3algebra
2.1

Every finite root can be moved to a dominant root of the same length: if β(hi)<0, replace β by siβ=ββ(hi)αi. 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 θγ=iniαi with ni0. Dominance of θ,γ then gives (θ,θ)(γ,γ)=ini(αi,θ+γ)0. Hence θ has maximal root length and the normalization in F4 is (θ,θ)=2.

F1F2F3F4step 1.1algebra
3.1

Choose [eθ,fθ]=θ using F1. Invariance gives B(eθ,fθ)=2/(θ,θ)=1 as in F4. Thus the mode bracket gives [fθt,eθt1]=θ+c=h0. The diagonal entry α0(h0) is 2; for i>0, α0(hi)=θ(hi) and αi(h0)=αi(θ). They are nonpositive integers by dominance of θ and crystallographic integrality, and vanish simultaneously since both are positive multiples of (θ,αi). The finite entries already satisfy the GCM axioms.

F1F4F5F6step 2.1algebra
4.1

Put β0=θ and βi=αi for i>0. The matrix of step 3.1 has entries 2(βi,βj)/(βi,βi). Multiplication of row i by (βi,βi)/2 gives the symmetric Gram matrix of these +1 vectors. It is positive semidefinite of rank , since the finite simple roots are a basis. Its kernel is spanned by (1,m1,,m), 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.

F3step 1.1step 3.1algebra
5.1

The h0,h1,,h are independent since only h0 has a nonzero c coordinate; the α0,α1,,α are independent since only α0 is nonzero on d. Also dimh^=+2=2(+1)rankA^. 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 (2222).

F3F5F6step 3.1step 4.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Loop and affine GCM presentations are isomorphic

Statement

Let A^ be the untwisted affine GCM of a finite-dimensional complex simple g, with normalized form and realized Cartan h^. The assignments e0fθt,f0eθt1,h0cθ, and the degree-zero assignments for the finite simple triples, together with the identity on h^, extend uniquely to an isomorphism g(A^)g^.

Facts & Assumptions

Given: The normalized finite simple algebra and the displayed assignments.

[F1]

The highest-root data and affine matrix realization are The affine simple root alpha zero is delta minus the highest root.

[F3]

For symmetrizable GCMs the Cartan and Serre relations present the algebra by Serre presentation of a kac moody algebra.

[F4]

Every nonzero ideal meets the Cartan in Kac moody algebra associated to a gcm.

[F5]

Finite simple generation and all root strings, including normalized rank-one triples, are Finite semisimple Cartan, root and string structure.

Proof

1.1

F1 gives [e0,f0]=h0 in the target. F2 gives the Cartan action with weights α0=δθ and α0, as well as commutativity of the Cartan. The finite simple brackets hold by F5. For i>0, [e0,fi] lies at finite weight θαi and [ei,f0] at θ+αi, both absent by highest-root maximality. Their mode degrees are nonzero, so no central term occurs. Thus every mixed relation [ei,fj]=δijhi holds.

F1F2F5algebra
1.2

The finite positive Serre relations follow from finite root strings. For i>0, fθ is a lowest vector for the ith finite triple, of weight θ(hi)=a^i0, because θαi is absent. Its raising string is killed after 1a^i0 applications of adei. Conversely ei is a highest vector for the θ triple, of weight αi(θ)=a^0i, since θ+αi is absent. Its lowering string is killed after 1a^0i applications of adfθ. If θ=αi, this is the adjoint rank-one string eθ,hθ,fθ,0 of length three. In the loop brackets the relevant positive mode degrees never produce a central term, so these are exactly the two Serre relations involving index zero. Interchanging raising and lowering and replacing every mode degree by its negative proves the negative Serre family by the same strings.

F1F2F5algebra
2.1

The matrix is symmetrizable by F1. Steps 1.1–1.2 and F3 therefore give a unique homomorphism φ:g(A^)g^ with the specified images. It fixes the embedded Cartan, so its kernel meets that Cartan trivially. F4 forces the kernel to be zero.

F1F3F4step 1.1step 1.2algebra
3.1

Its image contains g1 by F5. The set J+={xg:xtimφ} is an ideal in g, since [y1,xt]=[y,x]t. It contains the nonzero fθ, hence is all of g by simplicity. Likewise J={x:xt1imφ} contains eθ and is all of g.

F2F5step 2.1givenalgebra
4.1

Nonabelian simplicity gives [g,g]=g, because the derived algebra is a nonzero ideal. If all positive modes of degree k1 lie in the image, then [xt,ytk1]=[x,y]tk for k2; finite sums of these brackets span the degree-k mode. Induction from step 3.1 gives all positive modes. Bracketing degree 1 with degree (k1) gives all negative modes in the same way. The image already contains c,d through the Cartan. Hence it is the full affine algebra. Combined with step 2.1 this proves the isomorphism. All sums, string calculations and selections at a fixed mode are finite, with no AC.

F2step 2.1step 3.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Affine Weyl group is a coroot lattice semidirect product

Statement

The untwisted affine Weyl group has a normal translation subgroup indexed by the finite coroot lattice Q. Every element is uniquely tγw with γQ, wW0, and tγtη=tγ+η,wtγw1=twγ. With B the normalized invariant form used in the loop realization and ν(γ)=B(γ,) on the finite Cartan, the translation action on the full dual Cartan is tγ(λ)=λ+λ(c)ν(γ)(λ(γ)+12B(γ,γ)λ(c))δ. Thus WaffQW0. The convention sometimes written W0Q denotes the same group, with its second factor normal.

Facts & Assumptions

Given: The full untwisted affine algebra in its normalized loop convention.

[F1]

Its Cartan and simple generators agree with the GCM realization by Loop and affine GCM presentations are isomorphic.

[F2]

The affine root and coroot are α0=δθ, h0=cθ, with θ long and (θ,θ)=2, by The affine simple root alpha zero is delta minus the highest root.

[F3]

Reflections act by siλ=λλ(hi)αi, by Simple reflections and the kac moody weyl group.

[F4]

The normalized invariant form B is fixed by Residue two cocycle on a loop algebra; finite roots, coroots, its positive definite real restriction and simple generation are Finite semisimple Cartan, root and string structure.

[F5]

The finite Weyl group is finite, preserves the root/coroot lattices, and is generated by its simple reflections by Finite Weyl positive roots and simple reflections.

Proof

1.1

Extend the ν in the statement to vanish on c,d. The displayed operators fix δ and preserve λ(c). In a composition the additional cross term in the δ coefficient is B(γ,η)λ(c), so symmetry gives tγtη=tγ+η. Thus t0=1 and tγ is the inverse. If tγ=1, applying it to every level-zero functional gives λ(γ)=0 for all finite λ, hence γ=0.

F1F4algebra
1.2

In the Euclidean coroot system let V be the real span of W0θ. It is nonzero and W0-invariant. For a coroot β not orthogonal to V, some vV has (v,β)0; the reflection formula makes vsβv a nonzero multiple of β, so βV. Thus every coroot belongs to either V or V. If both classes occurred, finite roots would likewise split into two nonempty orthogonal classes. The corresponding root spaces and coroot spans would form commuting ideals: a mixed root sum lies in neither span, so is not a root; mixed Cartan actions vanish; opposite-root brackets lie in their corresponding coroot spans. This contradicts simplicity of g. Consequently V is the entire coroot space.

F4F5algebra
2.1

Finite W0 fixes c,d,δ, preserves B and satisfies wν(γ)=ν(wγ). Substitution proves wtγw1=twγ. Since ν(θ)=θ and B(θ,θ)=2, substitution also gives tθsθ(λ)=λ(λ(c)λ(θ))(δθ)=s0λ. Here sθW0 by F5. Hence tθ and all its finite Weyl conjugates belong to Waff.

F2F3F4F5step 1.1algebra
3.1

Let M be the integer span of W0θ. For any coroot β, step 1.2 supplies an orbit coroot α with (α,β)0. It has minimal coroot length because θ is long. If proportional, reducedness gives β=±αM. Otherwise integrality and strict Cauchy–Schwarz give 0<2(α,β)(β,β)<2αβ2. The integer has absolute value one. Since M is Weyl invariant, αsβα=±βM. Every coroot belongs to M, so M=Q. Steps 1.1 and 2.1 therefore put every tγ, γQ, in Waff.

F2F4F5step 1.1step 2.1step 1.2algebra
4.1

The products tγw form a group by steps 1.1 and 2.1 and lattice preservation. They contain all finite simple reflections and s0=tθsθ, so form all of Waff. Let Λ vanish on h,d and have Λ(c)=1. Finite W0 fixes it, whereas tγΛ=Λ+ν(γ)B(γ,γ)δ/2. Thus tγW0 forces ν(γ)=0, hence γ=0. Trivial intersection gives uniqueness by comparing two products. Zero translation, identity finite factor and rank one are included. Every lattice expression is a finite sum and no AC is used.

F1F4F5step 1.1step 2.1step 3.1algebra
PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-13Open item page →

Roots of an untwisted affine Lie algebra

Statement

The roots of the untwisted affine algebra relative to h^ are α+nδ for finite roots α and nZ, and nδ for nZ{0}. The former are real of multiplicity one, with spaces gαtn; the latter are imaginary of multiplicity =dimh, with spaces htn.

Facts & Assumptions

Given: The normalized untwisted affine algebra.

[F1]

The loop/GCM identification is Loop and affine GCM presentations are isomorphic.

[F2]

The finite root decomposition and dimensions are Finite semisimple Cartan, root and string structure, and the extended root conventions are Null root, central coroot, and affine level.

[F3]

The highest-root bound and δ=α0+θ are The affine simple root alpha zero is delta minus the highest root.

[F4]

Weyl transformations preserve roots and the symmetrized root form by The weyl group preserves roots and root multiplicities. The form is the root-span restriction of Invariant bilinear form for a symmetrizable kac moody algebra.

[F5]

Real roots are the simple-root orbits by Real and imaginary kac moody roots, and the only root multiples of a simple root are its two signs by Real root spaces are one dimensional sl2 roots.

[F6]

The affine Weyl action fixes δ and has the translation description in Affine Weyl group is a coroot lattice semidirect product.

Proof

1.1

For hh, [h,xαtn]=α(h)xαtn, while d acts with eigenvalue n and c acts as zero in the adjoint module. The finite decomposition therefore gives precisely the stated nonzero weights and spaces. Distinct n are distinguished by d, and distinct finite weights by h. The zero-weight space is h^ and is not a root space. Dimensions are one for finite-root modes and for nonzero Cartan modes.

F1F2algebra
2.1

On the root span define (α+nδ,β+mδ)=(α,β) using the positive definite finite-root form. F3's Gram-matrix calculation identifies this with the symmetrized form in F4. Thus δ is in its radical on the root span, every finite-root mode has positive square, and every simple root, including α0, has positive square. The Weyl action preserves this form and fixes δ. Consequently nδ for n0 cannot be the image of a simple root and is imaginary. This says radical on the root span, not on the full dual Cartan form.

F3F4F5F6step 1.1algebra
2.2

Every root in step 1.1 has simple coordinates of one sign. For n>0, α+nδ=nα0+(nθ+α) has nonnegative coordinates: F3 gives θ+αQ+ and θQ+. The negative-n case follows by negation, and n=0 is the finite-root sign rule. Multiples nδ have the same sign as n. In particular, reflecting a positive root not proportional to the reflecting simple root keeps it positive: the reflection changes only that simple coordinate, leaving another positive coordinate unchanged, and its image is a root by F4.

F2F3F4step 1.1algebra
3.1

Let β=i=0biαi be a positive root of positive square. The equality (β,β)=ibi(β,αi)>0 yields an i with (β,αi)>0. Its positive integral coroot pairing is (β,αi)/di, with di=(αi,αi)/2>0. If β is proportional to αi, F5 gives β=αi. Otherwise step 2.2 shows that siβ stays positive and has smaller positive integer height. Repeat this descent; height cannot decrease indefinitely, so it reaches a simple root. Reversing the finite reflection word proves β real. A negative positive-square root is real as well, since its negative is real and simple roots have real negatives. Thus all α+nδ are real. Combined with steps 1.1 and 2.1 this proves the complete list and multiplicities. The proof includes rank one and all integer modes; no choice over an infinite index set occurs.

F4F5step 2.1step 2.2algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Evaluation module at a nonzero loop parameter

Definition

Let aC× and let ρ:gEndC(V) be a finite-dimensional representation. The evaluation module at a for Untwisted affine central extension has action ρa(xf+bc)=f(a)ρ(x). In particular xm acts as amρ(x) and c acts as zero. Evaluation on the loop algebra is a Lie homomorphism because (fq)(a)=f(a)q(a), so [f(a)ρ(x),q(a)ρ(y)]=(fq)(a)ρ([x,y]). The central term is killed by the stipulated zero action of c, establishing the representation identity for the central extension too. This does not mean that the scalar cocycle itself vanishes. Nonzero a is required because t1 must be evaluated and tt1=1. The zero representation and the zero-dimensional module are allowed. No action of the degree derivation is part of this definition.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

Evaluation modules have level zero and do not extend canonically over d

Statement

Every evaluation module has c acting zero. If its finite g-action is nonzero, it has no compatible action of d. If the finite action is zero, every DEnd(V) defines an extension by letting d act as D. In that case D=0 is a natural choice, but the relations do not determine D when V0; for V=0 there is exactly one endomorphism. Thus evaluation gives a module for the derived affine algebra and does not in general extend to the full affine algebra.

Facts & Assumptions

Given: An evaluation module at a0.

[F1]

Modes act as amρ(x) and c acts zero by Evaluation module at a nonzero loop parameter.

[F2]

A full extension must satisfy [d,xm]=mxm by Degree derivation and full untwisted affine algebra.

[F3]

The scalar central-action meaning of level, including the zero-module qualification, is Null root, central coroot, and affine level.

Proof

1.1

F1 gives the zero central action, hence level zero in F3's scalar-action sense. A proposed operator D for d must satisfy [D,ρ(x)]=0 by F2 at mode m=0. At mode m=1 it must satisfy [D,aρ(x)]=aρ(x). The left side is a[D,ρ(x)]=0, so a0 forces ρ(x)=0 for every x. Thus a nonzero finite action cannot extend.

F1F2F3algebra
2.1

Conversely, if ρ=0, all loop and central actions are zero. For every D and every m, both sides of [D,amρ(x)]=mamρ(x) vanish; also [D,0]=0 for c and [D,D]=0 for d. The original loop relations already hold by F1, so this verifies every full-algebra relation. When V0, the operators 0 and idV are distinct compatible actions, proving nonuniqueness. When V=0 its only endomorphism is zero. These computations prove both directions of the exact extension criterion and use no AC.

F1F2step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-13Open item page →

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.

5 · Examples, counterexamples and false statements

None yet.

Sources