Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge 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 modes and their normal ordering

Definition

Let g be a finite-dimensional complex simple Lie algebra as in Loop algebra of a simple Lie algebra, with normalized invariant form B from Untwisted affine central extension. Let ρ be a restricted affine-current module of level k as in Restricted affine-current module, and assume k+h∨≠0 for the number in Dual Coxeter number for the normalized invariant form. Choose any B-dual bases (xa) and (xa) of g. Write Jx(n)=ρ(x⊗tn).

For modes, define :Jxa(r)Jxa(s):={Jxa(r)Jxa(s),r<0,Jxa(s)Jxa(r),r≥0. The Sugawara mode of index m∈Z is Lm=12(k+h∨)∑a∑r∈Z:Jxa(r)Jxa(m−r):. If a compact real form k of Compact real form of a complex semisimple Lie algebra is additionally supplied, put Q=−B∣k; it is positive by the normalized form in Residue two cocycle on a loop algebra. If (Xi) is Q-orthonormal, then (−Xi) is its B-dual, so the same formula reads Lm=−12(k+h∨)∑i∑r∈Z:JXi(r)JXi(m−r):. By Restricted Sugawara quadratic mode sums are well defined, the mode sum is locally finite on every vector and independent of the chosen dual bases. At the critical level k=−h∨ the scalar denominator is zero and this normalized formula is not defined; no operator is asserted there.

Depends on

Used by

Dependency tree · two levels

20 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