Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-11-05 (gpt-6.1-sol)
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.

Algebraic graded dual of an admissible VOA module

Physical scope

Pure mathematics; no physical premises or physical claim.

Statement

Assume the Axiom of Choice. Let V be a conformal vertex algebra of CFT type and W=⨁n≥0W(n) an admissible V-module, with no finite-dimensionality or L(0)-semisimplicity assumption on W(n). Define the algebraic graded dual D(W)=⨁n≥0W(n)∗, where W(n)∗=Hom⁡C(W(n),C), and define its opposite-field action by ⟨YD(a,z)f,w⟩=⟨f,YW(ezL(1)(−z−2)L(0)a,z−1)w⟩. For admissible V-modules W and X and a grading-preserving V-module homomorphism g:W→X, define D(g):D(X)→D(W) gradewise by D(g)(f)=f∘g. Then D(W) is an admissible V-module. The gradewise evaluation map jW:W→D2(W) is an injective V-module map, and D is an exact contravariant functor on admissible modules with grading-preserving morphisms. If every W(n) is finite dimensional, jW is an isomorphism.

Facts & Assumptions

Given: The non-super CFT-type VOA conventions and an admissible module with its specified N-grading.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function. The proof uses AC because full algebraic duals separate vectors and are exact in arbitrary-dimensional vector spaces.

[F1]

Conformal vertex algebra of CFT type: V=⨁r≥0Vr, each Vr is finite dimensional, L(0) is diagonal on states, and L(−1)=T. Thus L(1)ja=0 for j>wt⁡(a).

[F2]

Admissible module for a vertex operator algebra: for homogeneous a∈Vr, a(m)W(n)⊆W(n+r−m−1), with negative grades zero. No finite-dimensionality of W(n) is assumed.

[F3]

Module for an ordinary vertex algebra: the action has vectorwise lower truncation, vacuum, and the full module Jacobi identity.

[F4]

Jacobi and residue calculus from the state-field locality axioms supplies the mode commutator and iterate identities on every module, state-product weights, and translation in the actual ordinary non-super convention.

[F5]

Formal delta substitution identity for module Jacobi supplies the coefficientwise formal delta substitution identity; no analytic convergence is involved.

[F6]

For a vertex operator algebra V and any left V-module W, the opposite fields YWo(a,x):=YW(exL(1)(−x−2)L(0)a,x−1) satisfy the opposite Jacobi identity x0−1δ ⁣(x1−x2x0)YWo(b,x2)YWo(a,x1)−x0−1δ ⁣(x2−x1−x0)YWo(a,x1)YWo(b,x2)=x2−1δ ⁣(x1−x0x2)YWo(Y(a,x0)b,x2). Huang, Lepowsky, and Zhang state this in §2, equation (2.61), and identify the proof with the argument for Frenkel–Huang–Lepowsky, Theorem 5.2.1. This is an identity on W before any dual is taken and imposes no finite-dimensionality condition on its grades.

[F7]

Zorn's lemma gives a basis between any linearly independent set and any spanning set containing it: if L⊆S⊆V with L independent and span⁡(S)=V, there is a basis B of V with L⊆B⊆S: under AC, if L⊆S⊆E is linearly independent and S spans a vector space E, there is a basis B with L⊆B⊆S. In particular, take S=E and either L=∅ or L={w} for w≠0.

Proof

1.1F1F2F3algebra

For homogeneous a∈Vr, write YWo(a,z)=∑m∈Zamoz−m−1. Expanding the finite state exponential in the defining opposite field gives amo=(−1)r∑j=0r(L(1)ja)(2r−j−m−2)Wj!. Each summand shifts W(n) by (r−j)−(2r−j−m−2)−1=m+1−r. Its transpose therefore sends W(n)∗ into W(n+r−m−1)∗, exactly the admissible shift. If this target grade is negative it is zero; for a finite-support vector of D(W), all sufficiently large m have negative target grade. This proves field truncation on D(W). The vacuum coefficient transposes to the identity.

1.2F1F2F3F4F5F6algebra

Since V is a CFT-type conformal vertex algebra by [F1] and W is a left V-module by [F3], [F6] applies to YWo. Pair that opposite Jacobi identity with f∈W(p)∗ and w∈W(q). Every opposite mode on a homogeneous state is a finite sum because L(1)ja=0 for j>wt(a); admissibility [F2] gives the grade shift for each term, so every paired coefficient is defined without a dimension bound on any W(n). The module residue identities [F4] and delta expansion convention [F5] make the resulting pairing coefficientwise formal; no analytic convergence is used. Thus the opposite Jacobi identity can be transposed coefficientwise without any finite-dimensionality assumption on W(n).

2.1F2F3step 1.1step 1.2algebra

Pair the opposite Jacobi identity from step 1.2 with f and transpose each product. Transposition reverses the order of the two operators, so the reversed-order identity becomes the ordinary module Jacobi identity for YD. Every coefficient pairing is finite: each mode has the grade shift of step 1.1 and f has one grade of support. Therefore D(W) is a left V-module, and step 1.1 gives its admissible grading.

3.1A1F1F7step 2.1algebra

Evaluation jW(w)(f)=f(w) on each grade is injective because [F7], with E=W(n), L={w} and S=E, extends every nonzero w∈W(n) to a basis; the coordinate functional equal to 1 on w and 0 on the other basis vectors separates it. Since [L(0),L(1)]=−L(1) and L(0) has integral eigenvalues on V, conjugation gives (−x2)L(0)exL(1)(−x2)−L(0)=e−x−1L(1). Therefore ex−1L(1)(−x2)L(0)exL(1)(−x−2)L(0)=1. Pairing twice gives jW(YW(a,z)w)=YD2(W)(a,z)jW(w), so evaluation is a module map. If each grade is finite dimensional, its gradewise evaluation map is bijective.

4.1A1F2F7step 2.1algebra∎

If g:W→X is a grading-preserving module homomorphism, then gYWo(a,z)=YXo(a,z)g, so its gradewise transpose D(g) is a module homomorphism by the defining pairings. Precomposition gives D(id)=id and D(h∘g)=D(g)∘D(h). A grading-preserving short exact sequence of admissible modules is exact on each grade. For each inclusion U⊂X of vector spaces, apply [F7] first with E=S=U, L=∅, obtaining a basis BU (also for U=0), and then with E=S=X, L=BU, obtaining a basis BX⊇BU. Extending a functional by zero on BX∖BU proves that X∗→U∗ is surjective. Its kernel consists exactly of the functionals factoring through X/U, and precomposition with X↠X/U is injective. Thus algebraic duality is exact, and direct sums of these gradewise exact dual sequences remain exact with arrows reversed. Hence D is an exact contravariant functor.

Depends on

Dependency tree · 2 levels

Sources