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

Reconstruction and uniqueness from creative local generating fields

Statement

Let V be a complex vector space, 1≠0, and T∈End⁡V with T1=0. Let {Ai(z)=∑n∈ZAniz−n−1}i∈I be fields: for each i,v, Aniv=0 for sufficiently large n. Assume pairwise mutual locality with finite exponents, translation covariance [T,Ai(z)]=∂zAi(z), and creativity Ai(z)1∈V[ ⁣[z] ⁣] with constant term ai. Assume the finite words An1i1⋯Anrir1, including the empty word, linearly span V. Then there is a unique vertex algebra (V,1,T,Y) with Y(ai,z)=Ai(z). All its fields lie in the linear span of the identity field and finite iterated nth products of the generating fields. Its state map on that field space is a bijection, and Y(a(n)b,z)=Y(a,z)(n)Y(b,z). The full formal Jacobi identity holds.

More precisely, if A,B,C have locality exponents N,M,K for (A,B),(A,C),(B,C) respectively, then A(n)B=0 for n≥N, and M+K+N−n−1 is a locality exponent for (A(n)B,C) when n<N. These are vectorwise fields; no uniform truncation bound over all vectors is asserted. If additionally V=⨁r≥0Vr, 1∈V0, TVr⊂Vr+1, and each generator has an integral degree di with AniVr⊂Vr+di−n−1, then Y preserves this grading: for homogeneous a∈Vd, a(n)Vr⊂Vr+d−n−1. Finite-dimensionality of the Vr, a conformal vector, unitarity, and simplicity are not conclusions of this lemma.

Facts & Assumptions

[F1]

Fields, ordinary commutators, generalized integer binomial coefficients, the expansions ιx,z(x−z)n and ιz,x(x−z)n, and nth products have the exact conventions of Formal distributions and fields on a vector space. No super signs are used.

[F2]

The target vertex-algebra axioms are precisely truncation, vacuum/creation, translation covariance, and locality in Vertex algebra in the state–field convention. Jacobi will also be proved explicitly, rather than assumed as a reconstruction theorem.

Proof

Given: The fields, vacuum, translation, locality, spanning hypothesis, and, for the last assertion only, grading in the Statement. All residues below are formal coefficient extractions; infinite mode sums are interpreted on one vector at a time.

1.1givenF1algebra

For fields A,B put Dn(z)=A(z)(n)B(z). Direct expansion of the two binomial series gives (Dn)kv=∑j≥0(−1)j(nj)(An−jBk+jv−(−1)nBn+k−jAjv). Both sums are finite: the first by truncation of B on v, the second by truncation of A on v. For sufficiently large k, the whole first sum vanishes, while the second involves only a fixed finite set of j and vanishes by truncation of B on those finitely many vectors Ajv. Thus Dn is a field. If (x−z)N[A(x),B(z)]=0 and n≥N, the expansions of (x−z)n coincide and locality gives Dn=0.

2.1givenF1step 1.1algebra

Here is an explicit locality calculation. Suppose (x−z)N[A(x),B(z)]=(x−w)M[A(x),C(w)]=(z−w)K[B(z),C(w)]=0. For n<N set s=N−n−1≥0. Multiply the residue defining [Dn(z),C(w)] by (z−w)K+M+s and use (z−w)M+s=∑j=0M+s(M+sj)(x−w)M+s−j(−(x−z))j. In a term j≤s, there remain factors (x−w)M and (z−w)K, so C commutes through both A and B and the four commutator terms cancel. In a term j>s, the power n+j≥N is nonnegative, so its two binomial expansions coincide and (x−z)n+j[A(x),B(z)]=0 cancels the same four terms before taking the residue. All outside factors are polynomials, so these manipulations are finite sums. This proves the stated exponent K+M+s.

2.2givenF1step 1.1algebra

Suppose in addition A,B are translation covariant. Apply [T,−] to their residue definition, replace commutators by ∂xA and ∂zB, and move ∂x from A by formal integration by parts. Since ∂x(x−z)n=−∂z(x−z)n in each expansion, this gives [T,Dn(z)]=∂zDn(z). For any translation-covariant field E, the Laurent series E(z)1 satisfies ∂z(E(z)1)=T(E(z)1). It has no negative powers: a least negative power q would have derivative coefficient q[zq]E(z)1 at degree q−1, while the right side has no term there. The coefficient recursion therefore gives E(z)1=ezTE−11. In particular all such fields are creative. For creative A,B, set a=A−11, b=B−11. Formula 1.1 at k=−1 gives (Dn)−11=Anb: every Aj1 with j≥0 and every B−1+j1 with j≥1 vanishes.

2.3F1step 1.1algebra

We prove Jacobi by coefficient extraction, including negative binomial indices. Fix local A,B with exponent N, integers m,n, and Dj=A(j)B. Then Res⁡xxm(ιx,z(x−z)nA(x)B(z)−ιz,x(x−z)nB(z)A(x))=∑i≥0(mi)zm−iDn+i(z). If n≥N both sides vanish. Otherwise set s=N−n−1. In the Laurent polynomial ring C[x±1,z±1], the difference xm−∑i=0s(mi)zm−i(x−z)i is divisible by (x−z)s+1: substitute x=z+h and take its Taylor coefficients through order s; this argument works for negative m because x and z are units. Multiplying this difference by the two nth-product kernels leaves a common Laurent polynomial times (x−z)N[A(x),B(z)], which is zero. The remaining terms give the displayed equality. Its right-hand sum is finite since Dn+i=0 for n+i≥N.

3.1givenstep 1.1step 2.1step 2.2construct

Let U be the complex linear span of the identity field and all finite bracketed nth-product expressions in the generators. Every member is a translation-covariant field by 1.1 and 2.2. Every pair is mutually local: induct on the sum of the numbers of generators/identity symbols in two bracketed expressions; when one is a product, its two factors have smaller total complexity with the other expression, so 2.1 applies; the base is the given generator locality and the identity commutes with every field. Finite linear combinations remain local by taking the maximum of finitely many exponents. Define ϵ(E)=E−11. Formula 2.2 gives ϵ(A(n)B)=Anϵ(B). Repeatedly applying it shows that the image of ϵ contains every spanning word from the Statement, hence is all of V.

4.1givenstep 2.2step 3.1algebra

The state map is injective without a dimension argument. Suppose E∈U has ϵ(E)=0. Then E(z)1=0 by 2.2. If E(z)v=0 and Ai(w) is a generator, locality gives (z−w)LE(z)Ai(w)v=(z−w)LAi(w)E(z)v=0. The left-hand product E(z)Ai(w)v belongs to V((z))((w)): its w powers are bounded below, and every w coefficient is a Laurent series in z. In this iterated-series module multiplication by z−w is invertible, with inverse z−1∑j≥0(w/z)j. Thus E(z)Aniv=0 for every n. Induction on word length and the spanning hypothesis give E(z)=0 on V. Consequently ϵ:U→V is a linear bijection.

5.1F2step 2.2step 3.1step 4.1construct

Define Y(a,z)=ϵ−1(a). The identity field has state 1, so Y(1,z)=id⁡. The generators have states ai, so Y(ai,z)=Ai(z). Truncation, translation covariance, mutual locality, and Y(a,z)1=ezTa follow from 3.1 and 2.2. These are all the axioms in [F2]. Moreover Y(a,z)(n)Y(b,z) lies in U and has state a(n)b by 2.2; injectivity gives the claimed state-product identity. Directly in the residue definition, A(−2)id⁡=∂zA, so this identity also gives Y(Ta,z)=∂zY(a,z).

6.1F1step 1.1step 5.1step 2.3algebra

Write δ(u)=∑r∈Zur. The equality of 2.3 is exactly the result of taking Res⁡x0x0nRes⁡x1x1m in the formal-distribution identity x0−1δ((x1−z)/x0)A(x1)B(z)−x0−1δ((z−x1)/(−x0))B(z)A(x1)=z−1δ((x1−x0)/z)∑jDj(z)x0−j−1. In the first two terms the binomial expansions are respectively in nonnegative powers of z and x1; in the third, (x1−x0)r is expanded in nonnegative powers of x0. Indeed Res⁡x1x1mz−1δ((x1−x0)/z)=(z+x0)m expanded in nonnegative powers of x0, giving exactly the right side of 2.3 after the remaining residue. These moments for every integer m,n determine every coefficient in x1,x0, proving the identity. The subsequent z coefficients are well defined on each vector: they are finite sums by 1.1 and Dj=0 for j≥N. Substituting A=Y(a), B=Y(b) and the state-product identity identifies the right side as z−1δ((x1−x0)/z)Y(Y(a,x0)b,z). This is the full Jacobi identity. Explicitly, its coefficients are ∑i≥0(mi)(a(n+i)b)(m+k−i)=∑i≥0(−1)i(ni)(a(m+n−i)b(k+i)−(−1)nb(n+k−i)a(m+i)) for all integers m,n,k; each side is finite after application to a vector.

6.2givenstep 2.1step 4.1step 5.1algebra

For uniqueness, any other vertex algebra Y′ with the same vacuum, translation and generating fields has every Y′(v) local with the generators and creative with state v. By 2.1 and induction it is local with every field in U. For E=Y′(v)−Y(v), the proof of 4.1 uses only locality with the generators, creativity, translation covariance, and the generating-word spanning condition; it therefore applies to E even before knowing that E∈U. Its state is zero, so E=0. Thus Y′=Y.

7.1givenstep 1.1step 3.1step 4.1step 5.1step 6.1step 6.2algebra∎

Under the additional grading hypotheses, the identity has degree zero. If fields A,B have degrees d,e, respectively, the mode formula in 1.1 shows that (A(n)B)k shifts degree by d+e−n−k−2, so A(n)B has degree d+e−n−1. Every bracketed expression is therefore homogeneous when its generators are homogeneous. Its state has that degree, since the vacuum has degree zero. The span of these homogeneous fields is all U, and the graded bijection ϵ transports their degrees to V. Hence the claimed graded truncation convention holds for every Y(a). No analytic bound or conformal vector has been assumed or deduced. Together with 5.1, 6.1, and 6.2 this proves all assertions.

Depends on

Dependency tree · 2 levels

Sources