Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Generalized casimir on restricted kac moody modules

Definition

Assume A is symmetrizable and fix the invariant form and ν:hh of Invariant bilinear form for a symmetrizable kac moody algebra. A module V is restricted if, for every vV, gαv=0 for all but finitely many positive roots α. Fix ρh with ρ(hi)=1. For dual Cartan bases (ua),(ua) and opposite-root dual bases (xα,s),(yα,s), with x positive and y negative, define on V the operator Ω=2ν1(ρ)+auaua+2α>0,syα,sxα,s.

Products mean successive actions, as in The universal enveloping algebra as a tensor quotient. Root spaces are finite-dimensional by Kac moody root spaces are finite dimensional, and restrictedness makes the last sum finite on each vector. The tensor syα,sxα,s is independent of the dual bases: it corresponds to the identity map of gα under its perfect pairing with gα. The Cartan tensor has the same property. Thus Ω is well-defined as an operator; it is not asserted to be an infinite element of U(g). Independence of hi permits extension of their prescribed ρ-values over a finite basis, and (ρ,αi)=di=(αi,αi)/2.

Sources

Source comparison: Kleshchev, Definition 2.3.3 and equations (2.18)–(2.20), pp.33–34.

Depends on

Used by

Dependency tree · two levels

7 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