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

Opposite fields under formal coordinate inversion

Statement

Let V be a conformal vertex algebra of CFT type and M a grading-restricted generalized V-module. Put A(x)=exL(1)(−x−2)L(0) on V and Yo(v,x)=YM(A(x)v,x−1). This is an upper-truncated field on each vector of M, has vacuum Yo(1,x)=1, and satisfies x0−1δ(x1−x2x0)Yo(v,x2)Yo(u,x1)−x0−1δ(x2−x1−x0)Yo(u,x1)Yo(v,x2)=x2−1δ(x1−x0x2)Yo(Y(u,x0)v,x2). The delta expansions have the same binomial convention as ordinary module Jacobi; the order of the two operators in each product is reversed. Moreover, ddxYo(v,x)=Yo(L(−1)v,x),[Yo(v,x),LM(−j)]=∑k=0j+1(j+1k)xkYo(L(j−k)v,x)(j=−1,0,1). For v∈Vd, writing Yo(v,x)=∑nvnox−n−1 gives vno=(−1)d∑r≥0(L(1)rv)2d−r−n−2Mr!,vnoM[h]⊂M[h+n+1−d]. The sum over r is finite. Finally A(x−1)A(x)=1.

Facts & Assumptions

Given: The module, grading and formal binomial conventions in the statement.

[F1]

Conformal vertex algebra of CFT type supplies [L(i),L(j)]=(i−j)L(i+j) for i,j=−1,0,1, the nonnegative integral grading, and translation L(−1).

[F2]

Module for an ordinary vertex algebra supplies lower truncation, vacuum and module Jacobi. Its residues with the conformal vector give the Virasoro brackets, YM(L(−1)v,t)=∂tYM(v,t), and [LM(j),YM(v,t)]=∑k=0j+1(j+1k)tkYM(L(j−k)v,t) for j=−1,0,1.

[F3]

Grading-restricted generalized module supplies the restricted dual M′=⨁hM[h]∗ as a vector space of separating functionals, before any action on that space is asserted.

[F4]

Jacobi and residue calculus from the state-field locality axioms supplies regular-module Jacobi for the state fields on V, Y(L(−1)u,t)=∂tY(u,t), and its coefficientwise commutator/residue identities under the stated ordinary CFT-type hypotheses. Step 1.2 uses this exact local interface. F2 supplies Jacobi on M; F4 supplies the regular-module identity on V.

Proof

1.1givenF1F2F3algebra

Since L(1) lowers weight, L(1)rv=0 for r>d when v∈Vd. Expanding the finite exponential gives the displayed mode formula. The usual weight commutator [LM(0),amM]=(wt(a)−m−1)amM, obtained by taking the LM(0) residue of module Jacobi, shows that every summand has weight shift n+1−d. It holds on generalized eigenspaces too, since (LM(0)−h−wt(a)+m+1)NamMw=amM(LM(0)−h)Nw. Module truncation makes vnow=0 for sufficiently negative n. The vacuum assertion follows from A(x)1=1.

1.2F1F4algebra

We first establish the required change of coordinates on the algebra V, using the regular-module input F4. Take the conformal-vector commutator residue of its Jacobi identity and then Res⁡zzj+1, for j=0,1. Since L(j)=Res⁡zzj+1Y(ω,z), the binomial expansion gives [L(j),Y(u,t)]=∑i=0j+1(j+1i)tj+1−iY(ω(i)u,t). Here ω(i)=L(i−1) and Y(L(−1)u,t)=∂tY(u,t) by F4. Thus the two state-field brackets are explicitly [L(0),Y(u,t)]=Y(L(0)u,t)+t∂tY(u,t) and [L(1),Y(u,t)]=Y(L(1)u,t)+2tY(L(0)u,t)+t2∂tY(u,t). The L(0) bracket gives bL(0)Y(u,t)b−L(0)=Y(bL(0)u,bt). The L(1) bracket gives eaL(1)Y(u,t)e−aL(1)=Y(ea(1−at)L(1)(1−at)−2L(0)u,t1−at). To check the second identity without an extra covariance assumption, differentiate both sides in a and use [L(1),Y(u,t)]=Y(L(1)u,t)+2tY(L(0)u,t)+t2∂tY(u,t); the chain rule gives the same differential equation and both sides equal Y(u,t) at a=0. Equality follows recursively in powers of a over characteristic zero. All substitutions are in the indicated binomial expansion; local nilpotence makes the state exponential finite. Apply these identities with a=s, b=−s−2 and t=x0, and then put x1=s+x0, expanded in nonnegative powers of x0. They give the exact iterate identity A(s)Y(u,x0)v=Y(A(s+x0)u,−x0s(s+x0))A(s)v. Indeed the transformed coordinate is (−x0/s2)/(1+x0/s) and the transformed state is e(s+x0)L(1)(−(s+x0)−2)L(0)u.

1.3F1F2algebra

Directly from the three sl2 brackets, writing A=A(x), one has L(−1)A=−A(x2L(−1)+2xL(0)+L(1)),L(0)A=A(L(0)+x−1L(1)),L(1)A=−x−2AL(1). For example e−xL(1)L(−1)exL(1)=L(−1)−2xL(0)+x2L(1); the other two follow by the same finite commutator expansion. Differentiation gives A′=A(−2x−1L(0)−x−2L(1))=AL(−1)+x−2L(−1)A. Consequently the chain rule and translation give ∂xYM(Av,x−1)=YM(AL(−1)v,x−1). This proves the derivative identity.

2.1F2F3step 1.1algebra

Here is the formal expansion argument needed to apply that identity to Jacobi. For homogeneous a,b,m,λ with λ∈M′, module Jacobi implies that the two scalar products and the scalar iterate are expansions of one element of C[t1±1,t2±1,(t1−t2)−1]. To see the finiteness assertion, choose N with akb=0 for k≥N. The commutator residue of Jacobi, multiplied by (t1−t2)N, gives equality of the two product expansions. Truncation on m bounds the negative t2 exponents in the first product and the negative t1 exponents in the second. The weight shift in step 1.1 fixes their sum, so the common series after multiplication has both exponents bounded below and hence only finitely many terms. Thus it is a Laurent polynomial. The iterate expansion of that rational function follows by multiplying Jacobi by the same power and taking the t1 residue after t1=t2+t0; choose an additional power of t1 to permit that substitution on m, using truncation. Cancelling these powers in the corresponding Laurent-series fields gives the asserted iterate. General inputs are finite sums of homogeneous ones. Generalized weights cause no change: a mode has its exact generalized-weight shift, and the restricted functional selects that weight.

3.1F2F3step 1.2step 2.1algebra

Apply step 2.1 to every term in the finite states A(x1)u,A(x2)v and substitute ti=xi−1. The resulting rational function G(x1,x2) has poles only at x1=0,x2=0,x1=x2. Its expansion in nonnegative powers of x2/x1 is ⟨λ,Yo(v,x2)Yo(u,x1)m⟩: inversion reverses the radial order. Its other product expansion is the opposite ordering. In the iterate expansion put x1=x2+x0. Step 1.2, with s=x2, identifies its inner state, because t1−t2=−x0/(x1x2), so the iterate is precisely ⟨λ,Yo(Y(u,x0)v,x2)m⟩. These are formal binomial substitutions, not an assertion of analytic convergence.

4.1F3step 3.1algebra

For any rational G with these poles, its two product expansions and its iterate expansion satisfy the displayed delta identity. One can verify this formal distribution rule by linearity on x1px2q(x1−x2)r, p,q,r∈Z: first use the basic identity x0−1δ(x1−x2x0)−x0−1δ(x2−x1−x0)=x2−1δ(x1−x0x2), whose coefficients are the binomial expansions of (x1−x2)k, and then multiply the three terms by their respective expansions of the monomial. On delta support the factors (x1−x2)r and x1p can respectively be replaced by x0r and (x2+x0)p. Negative powers are expanded in the designated second variable, which is exactly the iterate convention. Every rational G is a finite linear combination of these monomials after expanding its polynomial numerator. Apply this rule to step 3.1. The separating functionals in M′ give opposite Jacobi coefficientwise on M.

5.1F1F2step 1.3algebra∎

Substitute the three operator identities of step 1.3 into [Yo(v,x),LM(j)]=−∑k=0j+1(j+1k)x−kYM(L(j−k)Av,x−1). For j=1,0,−1 the state expressions reduce respectively to AL(−1)v, A(L(0)+xL(−1))v, and A(L(1)+2xL(0)+x2L(−1))v. These are exactly the three asserted opposite brackets. Finally scaling gives (−x2)L(0)exL(1)(−x2)−L(0)=e−x−1L(1); hence A(x−1)A(x)=ex−1L(1)e−x−1L(1)=1, because the two integral-weight scaling factors multiply to one.

Local supplier status

The state-field covariance calculation uses the actual local regular-Jacobi supplier F4. The proof is coefficientwise and formal; it asserts no analytic convergence. The independent generic HLZ convergence/coherence obligations remain separate. Source integration alone does not certify native review or gate acceptance.

Depends on

Dependency tree · 2 levels

Sources