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.

Jacobi and residue calculus from the state-field locality axioms

Statement

Let V be a complex vector space with a nonzero vacuum 1, a state-field map Y, a translation operator T, and a conformal vector ω. Assume the lower-truncation, vacuum/creation, translation-covariance, and locality axioms in the ordinary non-super state-field convention, with L(−1)=T. Assume also that L(0) is diagonalizable and V=⨁r≥0Vr, each Vr is finite-dimensional, and V0=C1. Then the fields on V obey the ordinary module Jacobi identity, Y(Ta,z)=∂zY(a,z), and homogeneous states satisfy the weight rule below.

For every left V-module M with its lower-truncated action YM, all integers m,n,p, all a,b∈V, and all v∈M, [a(m)M,b(n)M]v=∑j≥0(mj)(a(j)b)(m+n−j)Mv, (a(m)b)(n)Mv=∑j≥0(−1)j(mj)(a(m−j)Mb(n+j)Mv−(−1)mb(m+n−j)Ma(j)Mv). The second sum is finite on each fixed v. If a∈Vr and b∈Vs, then a(p)b∈Vr+s−p−1 whenever it is nonzero.

For a Laurent polynomial P(x,y), the equivalent residue identity is Res⁡yRes⁡ttmP(y+t,y)YM(Y(a,t)b,y)v=Res⁡yRes⁡xP(x,y)(ιx,y(x−y)mYM(a,x)YM(b,y)−ιy,x(x−y)mYM(b,y)YM(a,x))v. Here ιx,y and ιy,x are the two formal binomial expansions in the corresponding variable, and negative powers in P(y+t,y) are expanded in nonnegative powers of t/y. All statements are formal coefficient identities; no analytic convergence is asserted.

Facts & Assumptions

Given: The complex vector spaces, formal fields, vacuum, translation operator, conformal vector, and module action specified in the Statement. Residues and both binomial expansions use the ordinary formal-distribution convention.

[F1]

Vertex algebra in the state–field convention: a state-field map is lower-truncated, satisfies Y(a,z)1=ezTa, is translation-covariant, and has pairwise local fields.

[F2]

Conformal vertex algebra of CFT type: L(−1)=T; L(0) is diagonalizable with nonnegative integral weights, finite-dimensional weight spaces, and V0=C1.

[F3]

Module for an ordinary vertex algebra: a left module is lower-truncated, has vacuum action, and satisfies the full module Jacobi identity.

[F4]

Mutually local creative generators determine a state–field map: mutually local, translation-covariant creative fields with the negative-mode spanning condition determine a unique vertex-algebra state-field map extending those fields.

[F5]

Formal distributions and fields on a vector space: field products use the two specified binomial expansions, and the nth product is the residue of their ordered difference.

Proof

1.1givenF1F4F5algebra

The family S={Y(a,z):a∈V} is a family of fields with the properties in [F1]. The creation identity gives a=Y(a,z)(−1)1, so its negative modes span V; it also makes the state-field map injective, since equality of two fields gives equality of their constant terms on 1. Apply [F4] to this indexed family. The resulting state-field map agrees with Y(a,z) on every state a, so it is exactly the original map. We derive Jacobi from the following local product and residue calculations. If A,B are fields and C=A(n)B is their nth product from [F5], expansion gives C(m)v=∑j≥0(−1)j(nj)(A(n−j)B(m+j)v−(−1)nB(m+n−j)A(j)v). For fixed v both sums are finite by lower truncation. Moreover C is a field: choose J with A(j)v=0 for j≥J, choose b with B(q)v=0 for q≥b, and for each 0≤j<J choose bj with B(q)A(j)v=0 for q≥bj. For all m≥b and m≥bj−n+j, every term vanishes. These are finitely many cutoffs; if J=0, the second family is empty.

2.1F1F5step 1.1algebra

Let A(z),B(x),C(y) be pairwise local fields, and choose a common positive locality order r with r+n>0. Put Dn(x,y)=ιx,y(x−y)nB(x)C(y)−ιy,x(x−y)nC(y)B(x). Use (z−y)4r=(z−y)r∑i=03r(3ri)(z−x)i(x−y)3r−i. If i≤r, then 3r−i+n≥r+1, so the two expansions of (x−y)3r−i+n are the same polynomial and the corresponding summand vanishes by the locality of B,C. If i>r, the factors (z−x)i and (z−y)r permit A to commute past B and C, respectively, in either ordered product. Taking Res⁡x therefore proves (z−y)4r[A(z),(B(n)C)(y)]=0. Differentiating a locality identity and multiplying once more by its variable difference shows that derivatives of local fields remain local. Thus every derivative and every iterated nth product of state fields is local with each state field.

2.2F1F5step 1.1algebra

Suppose A,B are creative and translation-covariant with states a,b, so A(x)1=exTa and B(y)1=eyTb. Translation covariance gives A(x)eyT=eyTA(x−y) by expanding e−yTA(x)eyT in powers of y. In the reversed term defining A(n)B, both ιy,x(x−y)n and A(x)1 have nonnegative powers of x, so its x-residue is zero. In the first term the residue is eyTRes⁡xιx,y(x−y)nA(x−y)b. For any integer d, the coefficient of x−1 in ιx,y(x−y)d is 1 for d=−1 and 0 otherwise. Expanding A(x−y)b therefore selects precisely A(n)b and proves (A(n)B)(y)1=eyTA(n)b. The sum is finite: large positive modes annihilate b, and sufficiently negative modes yield nonnegative powers of x−y. The same calculation gives (∂yY(a,y))1=eyTTa.

3.1F1F5step 1.1step 2.1step 2.2algebra

A field H(z) local with every state field and satisfying H(z)1=0 must vanish. Indeed, locality with Y(c,w) applied to 1 gives (z−w)NH(z)ewTc=0; the expression has only nonnegative powers of w, so setting w=0 gives zNH(z)c=0. Multiplication by zN is injective on formal distributions, hence H(z)c=0 for every c. Apply this to Y(a)(m)Y(b)−Y(a(m)b), whose creative state is zero by step 2.2, to obtain Y(a)(m)Y(b)=Y(a(m)b). Apply it to ∂zY(a,z)−Y(Ta,z), using the same locality and creative-state calculation, to obtain Y(Ta,z)=∂zY(a,z).

4.1F1F5step 3.1algebra

Put δy(x)=x−1δ(y/x). If a formal distribution R(x,y) is killed by (x−y)L, its finite delta expansion is R(x,y)=∑i=0L−1Ci(y)∂yiδy(x)i!,Ci(y)=Res⁡x(x−y)iR(x,y). For L=1, write R=∑q∈Zrq(y)xq. The equation (x−y)R=0 gives rq−1(y)=yrq(y) for every q, so rq(y)=y−q−1r−1(y) and R=δy(x)Res⁡xR. For larger L, apply this case to (x−y)L−1R, subtract its top term, and induct. The coefficient formula follows from Res⁡x(x−y)j∂yiδy(x)=i!δij, which is obtained by differentiating the delta recurrence. Now choose a locality order N for Y(a,x),Y(b,y). For each integer m, set Sm=ιx,y(x−y)mY(a,x)Y(b,y)−ιy,x(x−y)mY(b,y)Y(a,x). For any positive L with m+L≥N, (x−y)LSm=0. The coefficient Ci in its delta expansion is the m+ith product field, hence Y(a(m+i)b,y) by step 3.1. Therefore Sm=∑i≥0Y(a(m+i)b,y)∂yiδy(x)i!. The sum is finite because a(m+i)b=0 once m+i≥N. Taylor expansion of the formal delta gives y−1δ ⁣(x−ty)=∑i≥0ti∂yiδy(x)i!, so the displayed expression is exactly the t-residue of tmy−1δ((x−t)/y)Y(Y(a,t)b,y). The two other t-residues are the two ordered products in Sm. Thus their coefficients agree for every integer m, proving the full Jacobi identity on V.

5.1F3step 4.1algebra

On M, use the supplied module Jacobi identity [F3]; on V, use step 4.1. Multiplying by tmyn and taking residues gives the iterate identity, since ιx,y(x−y)m=∑j≥0(−1)j(mj)xm−jyj,ιy,x(x−y)m=∑j≥0(−1)m+j(mj)ym−jxj. The rightmost modes annihilate each fixed vector for large j, so the sum is finite. Taking the commutator residues gives the commutator identity; its terms vanish for large j because a(j)b=0. Finally write P(x,y) as a finite sum of Laurent monomials xayb. For each integer a, the formal delta substitution is xay−1δ((x−t)/y)=(y+t)ay−1δ((x−t)/y), where (y+t)a=∑j≥0(aj)ya−jtj for negative a as well as nonnegative a. This identity follows coefficientwise from the defining delta series. Multiplying Jacobi by each xayb and taking residues therefore gives the stated Laurent-polynomial residue identity.

6.1F2step 3.1step 5.1algebra∎

The commutator formula in step 5.1, applied to ω(1)=L(0), has only the j=0,1 terms because (1j)=0 for j≥2. If L(0)a=ra, then [L(0),Y(a,z)]=Y(L(0)a,z)+zY(L(−1)a,z)=rY(a,z)+z∂zY(a,z), using L(−1)=T and step 3.1. Comparing the coefficient of z−p−1 gives [L(0),a(p)]=(r−p−1)a(p). Acting on b∈Vs proves the weight rule.

Depends on

Dependency tree · 2 levels

Sources