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 , put . There is a degreewise nondegenerate bilinear pairing , defined for finite monomials by
For , let denote the weighted-degree subspace, with , and write for the restriction of this pairing to . If a linear map has a fixed degree shift , meaning , its pairing adjoint is the unique degreewise map whose components satisfy for all and . Here ; 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 have degree shift , so their adjoints have source and target . For every integer they satisfy . If , the transpose of has degree shift ; the original map has degree shift . Its transpose is . Explicitly, for and ,
These statements are identities for the explicit oscillator operators; they do not require a vertex-algebra invariant bilinear form.
Statement references
Facts & Assumptions
Given: The polynomial oscillator spaces, and screening coefficients of the generic data, with complex . An operator transpose always uses the indicated reflected charge spaces.
Rank-one Feigin–Fuchs oscillator spaces and long-screening coefficients defines every operator and specifies its finite action on a polynomial.
Proof
On each finite oscillator degree the monomial pairing is diagonal with nonzero diagonal entries, so it is nondegenerate. Multiplication by transposes to : on monomials the only nonzero comparison is between exponents and , when . Differentiation gives the reverse identity. Hence for ; the reflected charge gives . Different oscillator degrees are orthogonal, and satisfies .
Transpose the normally ordered quadratic expression for . For , a term with two nonzero indices becomes the reversed product of the modes with both indices negated. Their new indices sum to , so their commutator is zero by [F1]; reordering them therefore gives exactly the normally ordered quadratic term of index . The terms with one zero index contribute the correction from the reflection of . The transposed improvement term contributes ; the sum of these two corrections is , exactly the improvement term of . For , the explicit diagonal form is , which is its own transpose into the reflected space by step 1.1. This proves the claimed adjoint identity for every .
Put . In the explicit field , 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 . The charge-shift operators have scalar coefficient one. Their zero-mode powers satisfy . Therefore the matrix coefficient identity is 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 on the right is exactly the coefficient of the inverse variable to power in ; taking that coefficient proves the screening transpose identity. For a homogeneous input of oscillator degree , the residue condition in is , where creation adds degree and substitution removes degree . Thus has shift . Its pairing adjoint reverses that shift, taking degree to degree , so its shift is . Since , the shift of is , as required.