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.

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.

Depends on

Used by

Dependency tree · two levels

10 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