Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Reflected oscillator pairing and transpose of the long screening

Statement

For the rank-one oscillator data and t∈C, put t∗=(p−1)/p−t. There is a degreewise nondegenerate bilinear pairing Ft×Ft∗→C, defined for finite monomials by

⟨∏mxmrmetα,∏mxmsmet∗α⟩=1r=s∏m(−2pm)rmrm!.

For N≥0, let Ft[N] denote the weighted-degree N subspace, with deg⁡xm=m, and write ⟨⋅,⋅⟩t,N for the restriction of this pairing to Ft[N]×Ft∗[N]. If a linear map A:Ft→Fs has a fixed degree shift δ, meaning A(Ft[N])⊆Fs[N+δ], its pairing adjoint is the unique degreewise map whose components AN∗:Fs∗[N+δ]⟶Ft∗[N] satisfy ⟨Au,v⟩s,N+δ=⟨u,AN∗v⟩t,N for all u∈Ft[N] and v∈Fs∗[N+δ]. Here s∗=(p−1)/p−s; the star is defined by this bilinear-pairing identity, not by a Hermitian inner product; the term transpose below means the same pairing adjoint. The modes Lt(n) have degree shift −n, so their adjoints have source and target Ft∗[N−n]→Ft∗[N]. For every integer n they satisfy Lt(n)∗=Lt∗(−n). If 2pt∈Z, the transpose of Qt:Ft→Ft+1 has degree shift 2pt+1; the original map Qt has degree shift −2pt−1. Its transpose is Q(t+1)∗:F(t+1)∗→Ft∗. Explicitly, for u∈Ft and v∈F(t+1)∗,

⟨Qtu,v⟩=⟨u,Q(t+1)∗v⟩.

These statements are identities for the explicit oscillator operators; they do not require a vertex-algebra invariant bilinear form.

Facts & Assumptions

Given: The polynomial oscillator spaces, Lt(n) and screening coefficients Qt of the generic data, with complex p≠0. An operator transpose always uses the indicated reflected charge spaces.

[F1]

Rank-one Feigin–Fuchs oscillator spaces and long-screening coefficients defines every operator and specifies its finite action on a polynomial.

Proof

1.1givenF1algebra

On each finite oscillator degree the monomial pairing is diagonal with nonzero diagonal entries, so it is nondegenerate. Multiplication by xm transposes to −2pm∂xm: on monomials the only nonzero comparison is between exponents rm+1 and rm+1, when (−2pm)rm+1(rm+1)!=(−2pm)(rm+1)(−2pm)rmrm!. Differentiation gives the reverse identity. Hence αm∗=−α−m for m≠0; the reflected charge gives α0∗=2(p−1)−α0. Different oscillator degrees are orthogonal, and h(t)=pt2−(p−1)t satisfies h(t)=h(t∗).

2.1F1step 1.1algebra

Transpose the normally ordered quadratic expression for Lt(n). For n≠0, a term with two nonzero indices becomes the reversed product of the modes with both indices negated. Their new indices sum to −n≠0, so their commutator is zero by [F1]; reordering them therefore gives exactly the normally ordered quadratic term of index −n. The terms with one zero index contribute the correction −(p−1)α−n/p from the reflection of α0. The transposed improvement term contributes (p−1)(n+1)α−n/(2p); the sum of these two corrections is (p−1)(n−1)α−n/(2p), exactly the improvement term of Lt∗(−n). For n=0, the explicit diagonal form is Lt(0)=∑m≥1mxm∂xm+h(t), which is its own transpose into the reflected space by step 1.1. This proves the claimed adjoint identity for every n.

3.1F1step 1.1algebra∎

Put s=(t+1)∗=(p−1)/p−t−1. In the explicit field E1,t(z), the creation exponential transposes to the negative annihilation exponential and the annihilation exponential transposes to the positive creation exponential, by step 1.1. Transpose reverses their order. The resulting expression has precisely the creation-then-annihilation order of E1,s(z−1). The charge-shift operators have scalar coefficient one. Their zero-mode powers satisfy 2pt=−2−2ps. Therefore the matrix coefficient identity is ⟨E1,t(z)u,v⟩=⟨u,z−2E1,s(z−1)v⟩. Each matrix coefficient against fixed polynomials involves only finitely many creation degrees, so transposition and coefficient extraction are algebraic operations on a Laurent polynomial. The coefficient of z−1 on the right is exactly the coefficient of the inverse variable to power −1 in E1,s; taking that coefficient proves the screening transpose identity. For a homogeneous input of oscillator degree N, the residue condition in E1,t is 2pt+c−a=−1, where creation adds degree c and substitution removes degree a. Thus Qt has shift c−a=−2pt−1. Its pairing adjoint reverses that shift, taking degree N−2pt−1 to degree N, so its shift is 2pt+1. Since s=−t−1/p, the shift of Qs is −2ps−1=2pt+1, as required.

Depends on

Dependency tree · 1 level

Sources