Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Universal property and pbw character of kac moody verma modules

Statement

For a finite generalized Cartan matrix over C and any λh, the module MA(λ) represents a specified highest vector of weight λ: for every g(A)-module V and vector vV with hv=λ(h)v and n+v=0, there is exactly one module map MA(λ)V sending 11 to v. The image is U(g)v.

The Verma module belongs to O, is nonzero, and has formal character

chMA(λ)=eλαΔ+(1eα)dimgα.

Here the character is the coefficient function assigning dimMμ to the symbol eμ, and the product means coefficientwise multiplication of geometric series. Each coefficient involves finitely many terms; no analytic convergence is asserted.

Facts & Assumptions

Given: The finite GCM, its minimal realization and λ.

[F1]

The Verma module is the Borel-induced tensor quotient, with the negative-then-Borel PBW decomposition (Kac moody verma module).

[F2]

Ordered PBW monomials are independent, and canonical homogeneous bases of the countably presented root spaces are available without AC (PBW for countably presented Kac Moody Lie algebras).

[F3]

Roots have one sign and each root space is finite dimensional (Kac moody root spaces are finite dimensional).

[F4]

Category O means finite-dimensional weight spaces in finitely many downward cones (Kac moody category o).

[F5]

The sign-changing involution descends to g(A) (Kac moody algebra associated to a gcm).

Proof

1.1

Define uccuv. For aU(b) the defining highest-vector relations give av equal to the action of a on Cλ times v. Hence the tensor relation uac=uac is respected, and the map is g-linear. The vector 11 generates the induced module, so its image determines the map uniquely; its image is precisely U(g)v. This includes v=0.

F1given
1.2

By F1 and F2, MA(λ) has basis all ordered monomials in a homogeneous basis of n applied to 11, including the empty monomial. A monomial of negative degree β has weight λβ. The sign-changing involution in F5 sends gα isomorphically onto gα: it sends h to h, so applying it to [h,x]=α(h)x reverses the weight. Thus their dimensions agree.

F1F2F3F5given
2.1

Fix β=ibiαiQ+. Only negative basis vectors whose opposite root has coordinates between 0 and the bi can occur in a monomial of degree β. There are finitely many such integer tuples and finitely many basis vectors at each by F3. Each has positive height, so its exponent is at most ibi. Consequently only finitely many monomials have that degree. For β=0 only the empty monomial occurs, giving top coefficient one. Weights outside λQ+ have coefficient zero. This proves nonzero and O membership by F4.

F3F4step 1.2
3.1

For each individual negative basis vector of degree α, counting its possible exponent contributes m0emα=(1eα)1 as a formal geometric series. For any fixed β, step 2.1 reduces their product to finitely many factors and finitely many exponent choices. The ordered PBW basis makes each such choice exactly one basis monomial; multiplying by eλ therefore gives its actual weight multiplicity. There are dimgα factors at each root by 1.2, proving the displayed formula. Empty root sets give the empty product 1; no choice is required beyond the fixed homogeneous-basis construction in F2.

F2step 1.2step 2.1

Depends on

Used by

Dependency tree · two levels

9 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