Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

Kac moody verma module

Definition

For λh let b=hn+ and let Cλ be the one-dimensional b-module with hv=λ(h)v and n+v=0. Define MA(λ)=U(g)U(b)Cλ. Define M~(λ) in the same way for g~ and its positive Borel.

The tensor quotient is The universal enveloping algebra as a tensor quotient. Order a homogeneous negative basis, then a Cartan basis, then a positive basis. PBW for countably presented Kac Moody Lie algebras makes multiplication U(n)U(b)U(g) a vector-space isomorphism and a right U(b)-module isomorphism. Tensoring gives MA(λ)U(n), with 11 corresponding to 1. The same reasoning gives M~(λ)U(n~). Thus the top space has dimension one, and all other weights are λβ for βQ+{0}. At a fixed height there are finitely many monomials: only finitely many root degrees and basis elements of height at most that height can occur, with bounded exponents. Hence MA(λ) belongs to Kac moody category o. The module M~(λ) has the same finite-weight-space and downward-cone properties as a g~-module; no factorization of its action through g(A) is asserted. Mapping u1uv gives the unique module map to any module with a specified highest vector v of weight λ, because the tensor relations hold for that vector.

Sources

Source comparison: Kleshchev, §9.1, pp.116–117; local countable PBW verification.

Depends on

Used by

Dependency tree · two levels

5 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