Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 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.

Rank-one Feigin–Fuchs oscillator spaces and long-screening coefficients

Definition

Fix p∈C∖{0}. Put P=C[x1,x2,…], where each polynomial involves only finitely many variables, and assign weighted degree deg⁡xm=m. For t∈C, let Ft=Petα be a labelled copy of P; the symbol etα is a label for its constant polynomial, not an analytic exponential. For m≥1, define α−m to be multiplication by xm, αm=2pm ∂xm, and α0=2ptI on Ft. Write P[N] for the subspace of weighted degree N, with P[N]=0 for N<0, and set Dt=∑m≥1mxm∂xm+pt2−(p−1)tI.

For an integer r and a charge t satisfying 2prt∈Z, define the coefficientwise formal map Er,t(z):Ft→Ft+r by Er,t(z)(fetα)=z2prtexp⁡ ⁣(∑m≥1rxmmzm)f(x1−2prz−1,x2−2prz−2,…)e(t+r)α. Here exp⁡ means its formal power-series expansion, and Res⁡z means the coefficient of z−1. The annihilation substitution is finite on each polynomial. For every fixed power of z, only finitely many creation monomials contribute, so every coefficient map is an algebraic linear map; no analytic convergence is asserted.

When 2pt∈Z, define the long-screening coefficient Qt:Ft→Ft+1 by Qt=Res⁡zE1,t(z). Write Qj for a composition along successive charges whenever all of its coefficient maps are defined, and put Q0=I. In particular, if p is an integer and 2pt∈Z, every Qj for j≥0 is defined.

For each n∈Z, define Lt(n)=14p∑m∈Z:αmαn−m:−p−12p(n+1)αn. Normal ordering places every negative-index oscillator to the left of every nonnegative-index oscillator. For fixed n and a fixed polynomial input, the sum is finite: terms with two negative indices have only finitely many possible indices, and a positive-index derivative vanishes once its index exceeds the polynomial's finite support and degree.

Remarks

The explicit operators satisfy [αm,αn]=2pm δm+n,0I: for m>0, [αm,α−m]=2pm[∂xm,xm]=2pmI, while same-sign modes and distinct opposite modes commute. Directly normal ordering at n=0 gives Lt(0)=Dt. The Virasoro relations and the commutation of Qt with the Virasoro modes are not included in this definition; they are proved separately.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources