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

Strongly graded contragredient duality for Möbius and conformal modules

Statement

Let A⊆A~ be abelian groups, V a strongly A-graded Möbius or conformal vertex algebra, and W a strongly A~-graded generalized module. There is no CFT-type, globally bounded-weight, real-weight, or uniformly nilpotent hypothesis. Set W′=⨁β,h(W[h](−β))∗,B(x)=exL(1)(−x−2)L(0),⟨YW′(v,x)f,w⟩=⟨f,YW(B(x)v,x−1)w⟩. Give W′ the indicated (A~,C)-grading and set LW′(j)=LW(−j)t for j=−1,0,1. These data define a strongly graded generalized module. Componentwise evaluation W⟶W′′ is an isomorphism preserving both gradings, fields and Möbius operators. Restricted transposition is a contravariant functor on grading-preserving module maps.

Facts & Assumptions

Given: The strong grading means that each (β,h)-component is finite dimensional and each fixed (β,h+Z)-string vanishes sufficiently far below. Every vector is a finite sum of components. State weights are integral. Formal powers of −1 use these integral weights.

[F1]

Strongly graded generalized module in the HLZ setting supplies the three sl2 brackets, translation, the state-field and module-field Möbius commutators, the two gradings and their mode shifts. In particular L(1) is locally nilpotent on a state of fixed auxiliary degree, since it lowers its integer weight in a lower-truncated string.

[F2]

Module for an ordinary vertex algebra supplies module Jacobi, vacuum and lower truncation. No analyticity is part of this input.

Proof

1.1givenF1F2algebra

We first establish opposite-field identities in this exact generality. For v∈V(d)(α), its opposite modes are vno=(−1)d∑r≥0(L(1)rv)2d−r−n−2r!. The sum is finite by F1. Each summand has auxiliary-degree shift α and generalized-weight shift n+1−d. For every fixed w, module truncation shows vnow=0 for all sufficiently negative n. The opposite vacuum is the identity. These statements use neither a global bound on W nor a lower bound uniform in auxiliary degree.

1.2F1algebra

The Möbius brackets on states imply the covariance identities bL(0)Y(u,t)b−L(0)=Y(bL(0)u,bt),eaL(1)Y(u,t)e−aL(1)=Y(ea(1−at)L(1)(1−at)−2L(0)u,t1−at). For the second identity, differentiation in a on each side gives the same formal differential equation, using [L(1),Y(u,t)]=Y(L(1)u,t)+2tY(L(0)u,t)+t2∂tY(u,t); the constant terms agree. Recursion in a proves equality coefficientwise. The first follows by the weight commutator. Combining them, with all powers expanded in nonnegative powers of t, gives B(s)Y(u,t)v=Y(B(s+t)u,−ts(s+t))B(s)v. This calculation uses the state-field Möbius axioms themselves, so it does not import a regular-Jacobi result restricted to CFT-type algebras.

1.3F1F2algebra

The three Lie brackets give L(−1)B=−B(x2L(−1)+2xL(0)+L(1)),L(0)B=B(L(0)+x−1L(1)),L(1)B=−x−2BL(1). Also B′=B(−2x−1L(0)−x−2L(1))=BL(−1)+x−2L(−1)B. The chain rule with module translation proves ∂xYWo(v,x)=YWo(L(−1)v,x). Substituting the three displayed identities in the module Möbius brackets proves [YWo(v,x),LW(−j)]=∑k=0j+1(j+1k)xkYWo(L(j−k)v,x),j=−1,0,1. Finally scaling L(1) across (−x2)L(0) gives B(x−1)B(x)=1. All state exponentials used here are finite by F1.

2.1F1F2step 1.1algebra

Here is the rational-expansion justification of opposite Jacobi. Fix homogeneous u,v,w,f with f∈W′. Module Jacobi makes the scalar product orders and iterate the three expansions of a rational function in t1,t2 with poles only at t1t2(t1−t2)=0. Indeed choose N such that ukv=0 for k≥N. The commutator residue of Jacobi gives equality of the two product expansions after multiplication by (t1−t2)N. In the first expansion truncation on w bounds the negative t2-powers; in the second it bounds the negative t1-powers. The exact generalized-weight shift and the one output weight selected by f fix the sum of the two exponents. Consequently the common multiplied series has both exponents bounded below and is a Laurent polynomial. Multiplying Jacobi by an additional sufficiently large power of t1, taking its t1-residue and using truncation on w permits t1=t2+t0 and gives the iterate expansion of that same rational function. Finite sums handle arbitrary inputs. Auxiliary degrees merely make some coefficients zero; no sum over degrees is introduced.

2.2givenF1step 1.1algebra

Transposition of the mode shift in step 1.1 sends f∈(W′)[h](β) to degree α+β and weight h+d−n−1. The target is dual to W[h+d−n−1](−α−β). As n→+∞ this runs down ONE fixed integer string in ONE fixed auxiliary degree, so strong lower truncation makes it zero. Finite support of f and v gives one common bound. Thus the transpose preserves the restricted direct sum and is a lower-truncated field on it. This is the precise replacement for the unavailable global lower-bound argument.

3.1F2step 1.2step 2.1algebra

Apply step 2.1 to the finite states B(x1)u,B(x2)v and put ti=xi−1. Inversion reverses the order of the radial formal expansions. In the iterate expansion x1=x2+x0, step 1.2 identifies the transformed inner state and the difference t1−t2=−x0/(x1x2). Thus the opposite products in reversed order and YWo(Y(u,x0)v,x2) are precisely the three expansions of one rational function with poles only on x1x2(x1−x2)=0. The formal delta identity for these expansions follows by linearity from the basic delta identity, multiplied by the respective expansions of x1px2q(x1−x2)r, p,q,r∈Z: on delta support replace x1−x2 by x0 and x1 by x2+x0. Every rational function in question is a finite sum of such monomials. The separating restricted functionals therefore prove opposite Jacobi, with reversed operator products, coefficientwise on W.

4.1F1F2step 3.1step 1.3step 2.2algebra

Pair the candidate module axioms against w∈W. Opposite vacuum transposes to vacuum. Transposition reverses the two opposite products in step 3.1, producing ordinary module Jacobi; the expansions are well defined by step 2.2. Translation and the three Möbius brackets transpose from step 1.3. Since transposition reverses a commutator while j↦−j reverses the sl2 bracket, L′(j)=L(−j)t is the required representation. In the conformal case B(x)ω=x−4ω, so all L′(n)=L(−n)t are the conformal-field coefficients. The same two reversals preserve the Virasoro central term.

5.1givenstep 1.3step 4.1algebra

On each finite component the transpose of L(0)−h is nilpotent, so its dual is the generalized-weight-h space. Its dimension and lower truncation in each fixed string agree with those of W(−β). There is no assertion of a nilpotence exponent uniform in all components. This verifies every strong-grading requirement for W′. Finite-dimensional evaluation identifies W[h](β) with the corresponding double dual. Applying the defining action twice and using B(x−1)B(x)=1 proves that evaluation commutes with the fields; L′(j)=L(−j)t proves the same for Möbius operators.

6.1step 4.1step 5.1algebra∎

For a grading-preserving module map g:W→U, restriction of gt maps U′ to W′ because a component maps to that same component. Pairing the field actions and using gYWo=YUog proves that g′ intertwines all fields, and transposing gL(j)=L(j)g proves the Möbius condition. Transposition reverses compositions and preserves identities. Hence it is the asserted contravariant functor, compatible with the evaluation isomorphisms.

Depends on

Dependency tree · 2 levels

Sources