Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Mode translation descends to the affine vacuum module

Statement

For Vk(g) from Universal affine vacuum module, the assignment on g^ D(K)=0,D(xn)=−nxn−1 is a Lie-algebra derivation preserving p=g[t]⊕CK. It induces an operator T on Vk(g) such that T1=0 and [T,xn]=−nxn−1.

Facts & Assumptions

Given: The normalized affine central extension, its current modes, and the induced module at level k.

[F1]

Untwisted affine central extension: [xm,yn]=[x,y]m+n+mδm,−nB(x,y)K, where K is central.

[F2]

Universal affine vacuum module and The affine vacuum character exists at every complex level: Vk(g)=U(g^)⊗U(p)Ck, g[t] acts as zero on Ck, and K acts as k.

Proof

1.1F1algebra

For current modes, D([xm,yn])=−(m+n)[x,y]m+n−1, whereas [D(xm),yn]+[xm,D(yn)]=−(m+n)[x,y]m+n−1−m((m−1)+n)B(x,y)δm+n−1,0K. If the Kronecker factor is nonzero then m+n=1, so its central coefficient m(m+n−1) is zero. Thus the two expressions agree. Brackets with K also satisfy the derivation identity because K is central and D(K)=0. Bilinearity proves that D is a Lie derivation on all finite sums.

2.1F1step 1.1algebra

If n≥1, then D(xn)=−nxn−1∈g[t], while D(x0)=0 and D(K)=0. Hence D(p)⊆p. Extend D to the tensor algebra by the Leibniz rule. It preserves the ideal generated by uv−vu−[u,v], since its derivative is a sum of the same defining relations with u or v replaced by D(u) or D(v). Therefore it descends to a derivation DU of U(g^).

3.1F2step 2.1algebra∎

Define T(u⊗1)=DU(u)⊗1. This respects the induced-module relation ua⊗1=u⊗a1 for a∈U(p): the Leibniz rule gives the same DU(u)a term on both sides, and the remaining term uDU(a)⊗1 equals u⊗DU(a)1=0 because D(p)⊆p and the vacuum character kills g[t] and D(K)=0. Thus T is well-defined. Since DU(1)=0, T1=0, and for every current mode the defining derivation action gives [T,xn]=D(xn)=−nxn−1.

Depends on

Used by

Dependency tree · two levels

8 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