Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-11-04 (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.

PBW basis and grades of Virasoro Verma modules

Statement

For the induced Virasoro module M(c,h), and every integer N≥0, the vectors

L−λ1⋯L−λkvh,λ1≥⋯≥λk≥1,∑iλi=N,

form a basis of grade h+N. The empty partition gives vh at N=0. More precisely, the map U(n−)→M(c,h), x↦xvh, is an isomorphism of left U(n−)-modules. Writing p(N) for the number of partitions of N, that grade has dimension p(N).

Facts & Assumptions

Given: The bracket and induced module from Virasoro Verma modules and contravariant forms.

[F1]

Virasoro Verma modules and contravariant forms: M(c,h)=U(Vir)⊗U(b)Cc,h, with Lnvh=0 for n>0, L0vh=hvh, and Cvh=cvh.

[F2]

Virasoro algebra in the Lm convention: the Virasoro bracket is [Lm,Ln]=(m−n)Lm+n+(m3−m)δm+n,0C/12.

[F3]

PBW for countably presented Kac Moody Lie algebras: ordered monomials in a supplied countable ordered basis form a basis of the enveloping algebra.

Proof

1.1F1F2F3algebra

The bracket [F2] shows that n−, h, and n+ from [F1] are subalgebras: same-sign nonzero indices add without a central term, while L0,C preserve each block. Their direct sum is the full Virasoro vector space. Order a basis with every negative mode first, then L0,C, then every positive mode. PBW [F3] gives the unique ordered factorization U(n−)U(h)U(n+).

2.1F1step 1.1algebra

Multiplication therefore identifies U(Vir), as a right U(b)-module, with the direct sum of one copy of U(b) for each ordered negative-mode monomial. Tensoring this free right module with the one-dimensional module Cc,h kills positive modes and evaluates L0,C at h,c, but imposes no relation among the negative monomials. Hence they give a basis of M(c,h).

3.1F1F2step 2.1algebra∎

The relation [L0,L−n]=nL−n shows by induction on the number of factors that a monomial of total index N has eigenvalue h+N. Distinct total indices have distinct eigenvalues; the ordered monomials at fixed total index are indexed exactly by partitions of N. This proves the grade and dimension assertions. At N=0, the only monomial is the empty one and it is the nonzero vector from step 2.1.

Depends on

Dependency tree · 2 levels

Sources