Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Locality determines the formal OPE coefficients

Statement

Let A(z),B(w) be mutually local fields on a complex vector space V, with locality order N≥0. Put C(z,w)=[A(z),B(w)] and, for 0≤j<N, define Cj(w)=Res⁡z((z−w)jC(z,w)). Then [A(z),B(w)]=∑j=0N−1Cj(w)∂wjδ(z,w)j!, and the coefficients are unique. We use the formal OPE shorthand A(z)B(w)∼∑j=0N−1Cj(w)(z−w)j+1, to record these coefficients: its precise meaning is the commutator expansion above, equivalently the difference of the prescribed expansions ιz,w(z−w)−j−1 and ιw,z(z−w)−j−1. No analytic convergence is implied. For all integers m,n the modes satisfy [A(m),B(n)]=∑j=0N−1(mj)(Cj)(m+n−j). Here the binomial coefficient is the generalized integer binomial from Formal distributions and fields on a vector space. If N=0, the sums are empty and the commutator is zero.

Facts & Assumptions

Given: The complex vector space, fields A,B, and locality order N.

[F1]

Formal distributions and fields on a vector space: formal distributions are coefficient families; Res⁡z extracts the z−1 coefficient; δ(z,w)=∑r∈Zz−r−1wr; and ιz,w,ιw,z are the two specified binomial expansions.

Proof

1.1F1algebra

Set δ(z,w)=∑r∈Zz−r−1wr. Comparing coefficients gives (z−w)δ=0. Differentiating this identity j times in w gives (z−w)∂wjδ=j∂wj−1δ for j≥1. Also, direct residue extraction gives Res⁡z((z−w)r∂wjδ(z,w)/j!)=1 if r=j and 0 otherwise for r,j≥0: repeated use of the differentiated identity reduces r<j to a positive derivative of Res⁡zδ=1, and r>j to a positive power of (z−w) times δ.

2.1givenF1step 1.1

If N=0, locality says C=0. If N=1, writing C=∑p,qcp,qz−p−1w−q−1, the equation (z−w)C=0 gives cp+1,q=cp,q+1. Hence cp,q depends only on p+q, so C=(Res⁡zC)δ. This is the required expansion for order one.

2.2givenstep 1.1step 2.1algebra

Assume N≥2 and that the expansion is proved for order N−1. Since (z−w)N−1((z−w)C)=0, write (z−w)C=∑j=0N−2dj(w)∂wjδ/j! by induction. The identity in step 1.1 shows that C−∑j=0N−2dj(w)∂wj+1δ(j+1)! is killed by z−w, hence is a multiple d0′(w)δ by step 2.1. This gives a finite delta-derivative expansion for C. Taking residues after multiplying by (z−w)r and using the residue calculation in step 1.1 identifies its rth coefficient as Res⁡z((z−w)rC) and proves uniqueness.

3.1F1step 2.2algebra

The geometric-series identity δ=iz,w(z−w)−1−iw,z(z−w)−1 follows by writing the first expansion in nonnegative powers of w/z and the second in nonnegative powers of z/w. Differentiating j times gives ∂wjδ/j!=iz,w(z−w)−j−1−iw,z(z−w)−j−1. Substitution in step 2.2 yields the stated singular OPE coefficients and fixes both expansion conventions.

4.1F1step 2.1step 2.2algebra∎

Since Res⁡z(zmδ(z,w))=wm, differentiation gives Res⁡z(zm∂wjδ/j!)=(mj)wm−j for every integer m. Apply Res⁡zzmRes⁡wwn to step 2.2. The result is [A(m),B(n)]=∑j=0N−1(mj)(Cj)(m+n−j). The sum is finite; the N=0 case was handled in step 2.1.

Depends on

Used by

Dependency tree · two levels

2 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources