Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Sugawara current commutators on every restricted module

Statement

Let V be any restricted affine-current module of level k∈C as in Restricted affine-current module, for a finite-dimensional complex simple g with normalized invariant form B. Put q=k+h∨≠0 and use Sugawara modes and their normal ordering. Then for every x∈g and m,n∈Z, [Lm,Jx(n)]=−nJx(m+n). No grading, inner product, irreducibility, or integrability of V is required.

Facts & Assumptions

Given: The restricted module V, the normalized form B, and the noncritical complex level k.

[F1]

Sugawara modes and their normal ordering: Lm=Tm/q, where Tm=12∑a,r:Jea(r)Jea(m−r): in a B-orthonormal basis; the split is r<0 versus r≥0, and these sums are locally finite and basis independent.

[F2]

Untwisted affine central extension: [Jx(u),Jy(v)]=J[x,y](u+v)+ukB(x,y)δu+v,0I.

[F3]

Dual Coxeter number for the normalized invariant form: the adjoint Casimir for B acts by 2h∨I.

[F4]

Residue two cocycle on a loop algebra: B is nondegenerate, symmetric, and invariant.

[F5]

Restricted affine-current module: every sufficiently large positive current mode kills each fixed vector.

Proof

1.1F3F4algebrachoose

Choose a B-orthonormal complex basis (ea). Such a basis exists by finite-dimensional diagonalization: a nonzero symmetric nondegenerate form has a vector of nonzero square (otherwise polarization makes it zero), rescale that vector using a square root in C, and induct on its nondegenerate orthogonal complement. Invariance gives ∑a([x,ea]⊗ea+ea⊗[x,ea])=0: in this basis the matrix of ad⁡(x) is skew-symmetric, since B([x,u],v)=−B(u,[x,v]). Also ∑a[ea,[ea,x]]=2h∨x by [F3]. This choice concerns only g, not an inner product on V.

2.1F1F2F5step 1.1algebra

Fix v∈V and integers m,n. Expand [Jx(n),Tm] by the product rule in the original normal order. All terms are finite on v: for r→+∞ the rightmost current or its commutator has index r or r+n, and for r→−∞ it has index m−r or m−r+n. These kill v beyond a common bound, using [F5] for the finite family ea,[x,ea]. To identify the expansion with the commutator, the original truncated quadratic sum also stabilizes on both v and Jx(n)v by [F1]. Thus a sufficiently large cutoff gives the actual commutator, and all following identities are identities of eventually constant finite sums on v. Each factor contributes nkJx(m+n)/2 from the central term in [F2], by ∑aB(x,ea)ea=x; their sum is nkJx(m+n). This includes coincident indices: the two product-rule contributions are both retained.

3.1F1F2F4F5step 1.1step 2.1algebra

Write p=m+n, Aα,β=∑aJ[x,ea](α)Jea(β) and Dα,β=∑aJea(α)J[x,ea](β) for α+β=p. The noncentral expansion in step 2.1 is ∑α+β=p(aα,βAα,β+bα,βDα,β), with aα,β=12(1α<n+1β≥0),bα,β=12(1α<0+1β≥n). Indeed the first normal-order half r<0 contributes A at α=r+n<n and D at α=r<0; the reversed half r≥0 contributes A at β=r≥0 and D at β=r+n≥n. The invariant tensor of step 1.1 gives Dα,β=−Aα,β. Set fn(j)=1j<n−1j<0. Then a−b=(fn(α)+fn(β))/2. Cancellation leaves a finite sum, since fn is supported on 0≤j<n for n>0, on n≤j<0 with value −1 for n<0, and is zero for n=0. The uncancelled tails before this cancellation are legitimate too: for α sufficiently negative the rightmost index β is sufficiently positive, and for α sufficiently positive both coefficients are zero.

4.1F1F2F3F4step 1.1step 2.1step 3.1algebra∎

Exchange α,β in the term with coefficient fn(β). By the same invariant tensor, Aβ,α=−∑aJea(β)J[x,ea](α). Hence the noncentral part is 12∑α+β=pfn(α)∑a[J[x,ea](α),Jea(β)]. Here B([x,ea],ea)=B(x,[ea,ea])=0, so there is no additional central term. Moreover ∑a[ [x,ea],ea]=∑a[ea,[ea,x]]=2h∨x. As ∑α∈Zfn(α)=n, including n=0 and negative n, [F2] reduces the displayed finite sum to nh∨Jx(p). Together with step 2.1, this gives [Jx(n),Tm]=n(k+h∨)Jx(p). Divide by q≠0 and reverse the commutator to obtain the claim.

Depends on

Used by

Dependency tree · two levels

18 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